An Evaluation of Routing and Admission Control Algorithms for Multimedia Tra c in Packet-Switched Networks

Support for real-time multimedia applications is becoming an essential requirement for packetswitched networks. In this work, we investigated how routing and admission control in uence the performance of packet-switched networks. We propose and evaluate the use of routing algorithms which take into account the constraints imposed by the admission control algorithms. Routing algorithms proposed elsewhere in literature are also evaluated. We show that the new algorithms decrease call blocking probability and increase network utilization. The amount of iprovement depends on such factors as the admission control function, the tra c mix, and the QOS constraints. We evaluated two deterministic methods of Call Admission Control: Earliest Due Date and Stop&Go. We studied the e ect of lossy source tra c shaping on routing. The interaction and relative importance of routing, admission control, and tra c shaping was also studied. Technical Areas : Routing and control of congestion, admission and ow control This work was supported by the Air Force O ce of Scienti c Research Under Grant F49620-92-J-0441. Rampal: An Evaluation of Routing & Admission Control : : : 1 Run-time packet scheduling & Flow control Routing & Bandwidth Allocation Call level Admission Control (insuff. bw) Blocked Calls Blocked Calls (CAC rejn) Admitted Calls Incoming Calls Figure 1: Interaction Between Di erent Tra c Management Functions

[1]  D.E. Tolmie.  Gigabit networking , 1992, IEEE LTS.

[2]  D. Towsley,et al.  On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements , 1993, SIGCOMM '93.

[3]  S. Jamaloddin Golestani,et al.  A Framing Strategy for Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[4]  Domenico Ferrari,et al.  A Dynamic Connection Management Scheme for Guaranteed Performance Services in Packet-Switching Integrated Services Networks.† , 1993, INFOCOM 1993.

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Gunnar Karlsson,et al.  Performance models of statistical multiplexing in packet video communications , 1988, IEEE Trans. Commun..

[7]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

[9]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

[11]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[12]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.