E-DCP, an Extension of the Distributed-Control Polling MAC Protocol (DCP) for Integrated Services

Abstract This paper describes and analyzes a novel MAC protocol named E-DCP which provides additional mechanisms to the already designed DCP MAC protocol in order to support service integration. E-DCP provides two service classes: synchronous and asynchronous. For both classes, a polling algorithm is used to manage the acquisition of transmission rights (reservations). Each time a node observes the start of a new synchronous cycle, it is alloted a certain quota of slots for synchronous traffic transmission and the unused bandwidth is fairly divided among all the nodes for asynchronous traffic. The access scheme for synchronous traffic exhibits certain properties which have been exploited to define a methodology to derive bounds on the quality of service parameters relevant to real time traffic (access delay and packet loss).

[1]  J. O. Limb,et al.  Description of Fasnet — A unidirectional local-area communications network , 1982, The Bell System Technical Journal.

[2]  Marco Conti,et al.  DCP: A Distributed-Control Polling MAC Protocol: Specifications and Comparison with DQDB , 1991, IEEE J. Sel. Areas Commun..

[3]  Mehdi Nassehi,et al.  CRMA: an access scheme for high-speed LANs and MANs , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[4]  Donald F. Towsley,et al.  Approximation Techniques for Computing Packet Loss in Finite-Buffered Voice Multiplexers , 1991, IEEE J. Sel. Areas Commun..

[5]  Marco Conti,et al.  DCP: a fully distributed MAC protocol exploiting the capabilities of polling systems , 1990, [1990] Proceedings. 15th Conference on Local Computer Networks.