A delay-constrained least-cost path routing protocol and the synthesis method
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Real-time communication services will be one of the most promising future applications in both the B-ISDN and Internet. In addition, real-time traffic usually utilizes a significant amount of resources while traversing the network. Thus there is the need for routing mechanisms which are able to satisfy requirements of both real-time traffic and efficient management of network resources. Firstly we discuss an issue of routing of real-time traffic subject to each end-to-end delay constraint and a path cost. Then, we describe a key concept which is taken into consideration of the requirements simultaneously. Based on the requirements, a delay constrained least-cost path problem is formulated. Since the problem is NP-hard, a heuristic method is proposed to solve the problem. The heuristic method can always find a delay-constrained path between a source node and a destination node, if there is such a path. Based on the heuristic method, an outline of the synthesis method for the delay-constrained least-cost path routing protocol is also presented.Keywords
This publication has 6 references indexed in Scilit:
- A better model for generating test networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the construction of multiphase communication protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A synthesis method for fault-tolerant and flexible multipath routing protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Resource ReSerVation Protocol (RSVP) -- Version 1 Functional SpecificationPublished by RFC Editor ,1997
- RSVP and integrated services in the Internet: a tutorialIEEE Communications Magazine, 1997
- Synthesis of communication protocols: survey and assessmentIEEE Transactions on Computers, 1991