Data networks (2nd ed.)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Some routing problems on broadband ISDN
Computer Networks and ISDN Systems - Special issue: Broadband ISDN: standards, switches, and traffic management
Two issues in reservation establishment
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A distributed route-selection scheme for establishing real-time channels
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
A new distributed route selection approach for channel establishment in real-time networks
IEEE/ACM Transactions on Networking (TON)
A scalable multicast protocol with QoS guaranties
Network control and engineering for Qos, security and mobility II
Core selection with end-to-end QoS support
Proceedings of the 2004 ACM symposium on Applied computing
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Game state and event distribution using proxy technology and application layer multicast
Proceedings of the 13th annual ACM international conference on Multimedia
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel multi-objective evolutionary algorithm for shortest path routing problem
International Journal of Communication Networks and Distributed Systems
Expert Systems with Applications: An International Journal
Algorithms and protocols for stateless constrained-based routing
Computer Communications
Algorithms for delay-constrained low-cost multicast tree construction
Computer Communications
Hi-index | 0.25 |
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate, etc.) to be met by the network. To guarantee the real-time delivery of packets satisfying these constraints, a real-time channel (D. Ferrari and D.C. Verma, A scheme for real-time channel establishment in wide-area networks. IEEE JSAC, 8(3), 368-379, 1990) needs to be established before the transmission of packets of a connection can begin. The establishment of such channels requires the development of efficient route selection algorithms that are designed to take into account the QoS constraints. The general problem of determining a least-cost delay-constrained route in a given communication network has been proved to be NP-hard (M.R. Garey and D.S. Johnson, Computers and Intractability: a guide to the theory of NP-completeness, W.H. Freeman, 1979). In this paper, we describe a preferred link approach to distributed delay-constrained least-cost routing in order to establish real-time channels. The approach attempts to combine the benefits of probing and backtracking based algorithms (better adaptiveness and wider search) with the advantages of distance-vector type algorithms (lower setup time). The scheme is flexible in that a variety of heuristics can be employed to order the neighbouring links of any given node. Three heuristics are proposed and their performance is studied through simulation experiments. The simulation results indicate that the proposed heuristics provide better performance than other preferred neighbour methods, in terms of increased call acceptance rate and lower average route cost. The heuristics are also shown to adapt much better to dynamic variations in network and link characteristics.