The goals of routing for supporting real-time applications involving audio/video traffic should be computing paths (or multicast trees for the case of multiple destinations) that satisfy the given QoS requirements of the applications while managing the network resources efficiently. In the past few years we have proposed a distributed delay-constrained unicast routing algorithm [2] [6], two efficient centralized delay-constrained multicast routing algorithms [4] [7], a genetic algorithm [8] that computes delay-constrained multicast trees additionally with the ability to to make tradeoffs between the multicast tree cost and the inter-destination delay variation or between the tree cost and the end-to-end delay, and a distributed delay-constrained dynamic multicast routing algorithm [2]. Extensive simulation experiments (see the listed papers) have been conducted to evaluate and compare performances of the proposed algorithms and the existing related algorithms.
Supporting real-time applications in high-speed networks requires reservation of resources. Since network resources are limited, efficient routing strategy and admission control are needed. In the past, much effort has been concentrated on circuit-switched complete topology networks (e.g. telecommunication networks) under the assumption that the arrival pattern of call requests can be described by probabilistic models with known parameters. A new routing and admission control algorithm based on the shortest path and the concept of competitive analysis for general topology high-speed networks and for the case where there are no advance knowledge of traffic patterns are proposed in [1] [5]. Simulation results show that the proposed routing and admission control scheme has very good performance regarding call rejection probability and network throughput.
The routing problem in VP-based ATM networks is also addressed in this project [3].
[1] Q. Sun and H. Langendoerfer, Routing for Low Call Blocking in High-Speed General Topology Networks, Computer Networks and ISDN Systems , to appear
[2] Q. Sun and H. Langendoerfer, A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm, in European Workshop on Interactive Distributed Multimedia Systems and Telecommunication Services (IDMS'97) , Lecture Notes in Computer Sciences, Vol. 1309, pp.97-106, Springer-Verlag, 1997
[3] Q. Sun and H. Langendoerfer, Routing Multipoint Connections in VP-based ATM Networks, in proceedings of International Conference on Communication Technology (ICCT'96) , Peking, China, pp.482 - 485, 1996
[4] Q. Sun and H. Langendoerfer, Efficient Multicast Routing for Delay-Sensitive Applications , in proceedings of Second International Workshop on Protocols for Multimedia Systems (PROMS'95) , Salzburg, Austria, pp.452 - 458, 1995
[5] Q. Sun and H. Langendoerfer, Routing in General Topology Broadband Networks, Internal Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Bueltenweg 74/75, 38106 Braunschweig, Germany, August 1996. Abstract
[6] Q. Sun and H. Langendoerfer, A New Distributed Routing Algorithm for Supporting Delay-Sensitive Applications , Internal Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Bueltenweg 74/75, 38106 Braunschweig, Germany, March 1997.
[7] Q. Sun and H. Langendoerfer,
An Efficient Delay-Constrained Multicast Routing Algorithm,
Internal Report,
Institute of Operating Systems and
Computer Networks, TU Braunschweig, Bueltenweg 74/75, 38106
Braunschweig, Germany, Jan. 1997.
Abstract
See
the source code of the proposed algorithm .
[8] Q. Sun and H. Langendoerfer, Computation of Constrained Multicast Trees Using a Genetic Algorithm, Internal Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Bueltenweg 74/75, 38106 Braunschweig, Germany, June 1997. Abstract
TU Braunschweig,
Computer Science,
Operating Systems
and Computer Networks
Participants of this project
sun@ibr.cs.tu-bs.de