Pseudo-isochronous Cell Forwarding

Abstract This paper shows how to design a packet switched network, for real-time traffic, such that under full network load: (i) the end-to-end delay bound of a low-rate voice connection is minimized, (ii) the bound on the delay uncertainty or jitter is a fixed network parameter – independent of the network size and the connection rate, and (iii) the required buffer sizes (inside the network) to ensure congestion-free routing is minimized. In addition, this design can be generalized to accommodate either variable bit rate (VBR) traffic with statistical multiplexing or the integration of available bit rate (ABR) traffic 7 , 12 . The isochronous timing information (can be provided by the global positioning system (GPS) [1] ) is used for pacing the packet/cell forwarding inside the network. This means that a cell is forwarded from one switch to another not at a specific time but within a time frame of a relatively long duration as compared with the cell transmission time. This time frame is an independent network parameter, which determines the delay and jitter bounds inside the network. A study of the blocking probability of this approach is presented. (Blocking is defined as the impossibility of allocating bandwidth for a new connection while capacity is still available, but not in the proper time frames.) The study includes both analytical and simulation results, which demonstrate an important trade-off between the blocking probability and the end-to-end delay bound.

[1]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[3]  Yoram Ofek Generating a fault-tolerant global clock using high-speed control signals for the MetaNet architecture , 1994, IEEE Trans. Commun..

[4]  Yoram Ofek The topology, algorithms and analysis of a synchronous optical hypergraph architecture , 1987 .

[5]  Yoram Ofek Integration of voice communication on a synchronous optical hypergraph , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[6]  Yoram Ofek,et al.  Distributed Global Event Synchronization in a Fiber Optic Hypergraph Network , 1987, ICDCS.

[7]  James Roberts Virtual spacing for flexible traffic control , 1994 .

[8]  Kang G. Shin,et al.  Real-time communication in multi-hop networks , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[9]  Moti Yung,et al.  "Time-driven priority" flow control for real-time heterogeneous internetworking , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[11]  Manolis Katevenis,et al.  Fast switching and fair control of congested flow in broadband networks , 1987, IEEE J. Sel. Areas Commun..

[12]  S. Jamaloddin Golestani,et al.  Congestion-free communication in high-speed packet networks , 1991, IEEE Trans. Commun..

[13]  Kang G. Shin,et al.  Real-Time Communication in Multihop Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[14]  Moti Yung,et al.  The integrated MetaNet architecture: a switch-based multimedia LAN for parallel computing and real-time traffic , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.