Sciweavers

COMCOM
1998

Preferred link based delay-constrained least-cost routing in wide area networks

13 years 3 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
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 t...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt
Added 21 Dec 2010
Updated 21 Dec 2010
Type Journal
Year 1998
Where COMCOM
Authors R. Sriram, Govindarasu Manimaran, C. Siva Ram Murthy
Comments (0)