New methods for shortest path selection for multimedia traffic with two delay constraints

Authors:
A.L Roginsky;K.J Christensen;V Srinivasan
Affiliations:
Networking Division, International Business Machines Corporation, Research Triangle Park, NC 27709, USA;Department of Computer Science and Engineering, University of South Florida, 4202 East Fowler Avenue, ENB 118, Tampa, FL 33620, USA;Networking Division, International Business Machines Corporation, Research Triangle Park, NC 27709, USA
Venue:
Computer Communications
Year:
1999

Citing 7
Cited 0

NBBS path selection framework

IBM Systems Journal
Delay-jitter control in multimedia applications

Multimedia Systems
Distributed advance reservation of real-time connections

Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
A scheme for real-time channel establishment in wide-area networks

IEEE Journal on Selected Areas in Communications
Pure delay effects on speech quality in telecommunications

IEEE Journal on Selected Areas in Communications
Routing subject to quality of service constraints in integrated communication networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.24

Visualization

Abstract

Path selection based on two criteria, propagation delay and maximum delay jitter, is often a requirement in high-speed networks carrying multimedia traffic. Shortest path selection with multiple additive or multiplicative criteria is a NP-complete problem. Simply adding propagation and jitter delay bounds into a single delay criterion is shown to eliminate from consideration a large number of otherwise acceptable path choices. In this paper, four new solutions for polynomial-time, two-criteria path selection are presented. The first solution is a two-pass modified Bellman-Ford algorithm. The other solutions are based on a weighted single-criterion path search and are described via a novel geometric construction of the path selection problem. The new solutions are mathematically proved and their effectiveness demonstrated with a simulation experiment. Applications of the new solutions to ATM PNNI and IP routing are described.