W. Zhao and S. K. Tripathi, Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks, In Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp. 175-182.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....routing. Let n be the hop count of a minimum hop path when the network is idle. A dynamic alternative path is a widest shortest path with no more than n 1 hops. 16] 17] also present various schemes for QoS guarantees in networks with nodes having rate based schedulers like WFQ [18] 19] [21] proposes a scheme based on metric separation. This scheme computes a partial result using the connection independent component of the delay bound and computes the final path based on the connection dependent component. 22] proposes a routing algorithm that uses a modified version of the ....

W. Zhao and S. Tripathi, "Routing guaranteed quality of service connections in integrated services packet networks", In Proc. IEEE ICNP, 1997.

....the shortest widest path scheme as a way of minimizing the call blocking rate. 7] proposed the widest shortest path scheme to extend OSPF for QoS routing. 8] mentions dynamic alternative path routing and also presents schemes for various QoS guarantees in networks with rate based schedulers. [9] proposes a scheme based on metric separation. 10] proposes a routing algorithm that uses a modified version of the Bellman Ford shortest path algorithm. Our Goal: Though these schemes aim at increasing the network performance, it is not known whether any of the schemes really extracts the best ....

W. Zhao and S. Tripathi, "Routing guaranteed quality of service connections in integrated services packet networks", In Proc. IEEE ICNP, 1997.

....An optimal path is here defined as a path with minimum number of hops which still satisfies a set of multiple constraints. In general, optimal routing with multiple metrics is known to be an NPcomplete problem [11] To avoid the complexity of exact, combinatorial solutions, several papers [12, 13, 14] have addressed QoS constrained routing problems using a variety of heuristic strategies. An interesting departure from the current heuristics is offered by [15] where a QoS routing algorithm based on Bellman Ford is proposed. The Multiple Constraints (MC) Bellman Ford algorithm finds optimal ....

W. Zhao and S. K. Tripathi, Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks, Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp. 175-182.

....objective function at a time (i.e. defining a hierarchy of metrics) 8] for a generic multiple metric routing problem. Others have succeeded in reducing the problem complexity to a polynomial degree by assuming a particular scheduling discipline and traffic shaping policy at each router ( 10] [16]) More recently, 5] has designed a QoS routing algorithm based on a variant of the Bellman Ford al This research was supported by Cisco, NASA (NAG2 1249) and NSF (ANI9805436) gorithm. The QoS, Multiple Constraints (MC) Bellman Ford algorithm finds optimal solutions in selected cases and ....

W. Zhao and S. K. Tripathi, Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks, In Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp. 175182.

.... problem reduced from the original problem through mapping unbounded real number metrics of a link to bounded integers[5] By assuming a particular scheduling discipline and traffic shaping policy at each router, sometimes the problem can also be reduced to be solvable in polynomial time[10] [14]. A survey of such algorithms can be found in [4] Though most research work in this area has been in a theoretical setting, there is an effort to extend the current OSPF(Open Shortest Path First) routing protocol to support QoS[1] Most routing approaches can be classified into two categories: ....

W. Zhao and S. K. Tripahi, "Routing guaranteed quality of service connections in integrated services packet networks", in Proceedings ICNP'97, 1997. APPENDIX. A GREEDY DELAY-BOUNDED MIN-COST

....at a time (i.e. defining a hierarchy of metrics) Guerin97a] for a generic multiple metric routing problem. Others have succeeded in reducing the problem complexity to a polynomial degree by assuming a particular scheduling discipline and traffic shaping policy at each router ( Pornavalai97] [Zhao97]) More recently, Cavendish98] has designed a QoS routing algorithm based on a variant of the Bellman Ford algorithm. The QoS, Multiple Constraints (MC) Bellman Ford algorithm finds optimal solutions in selected cases and good approximate solutions otherwise. In this paper, we make use of the MC ....

W. Zhao and S. K. Tripathi, Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks, In Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp. 175-182.

....the NP complete by associating a priority to each constraint. Rampal [26] evaluated the performance of several path selection algorithms under the assumption of three different scheduling algorithms. The IBF algorithm that is used in this paper was first described in [21] Zhao and Tripathi in [37] proposed a similar algorithm, but issues related to selecting efficient paths and resource utilization efficiency are not addressed. Several other studies have presented routing algorithms that are similar to or special cases of ours but in different context. In [27] routing algorithms for ....

W. Zhao and S. Tripathi. Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks. In IEEE International Conference on Network Protocols, Atlanta, Georgia, October 1997.

....the NP complete by associating a priority to each constraint. Rampal [27] evaluated the performance of several path selection algorithms under the assumption of three different scheduling algorithms. The IBF algorithm that is used in this paper was first described in [22] Zhao and Tripathi in [38] proposed a similar algorithm, but is 10 20 30 40 128 160 192 224 256 Traffic Load (MB s) Widest shortest Approx. Widest shortest Shortest delay Approx. Shortest delay Figure 13: Call blocking rate as a function of network load: Switched cluster, 100 video traffic, evenly distributed load, b ....

W. Zhao and S. Tripathi. Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks. In IEEE International Conference on Network Protocols, Atlanta, Georgia, October 1997.

....defining a hierarchy of metrics) Guerin et al. 1997a) for a generic multiple metric routing problem. Others have succeeded in reducing the problem complexity to a polynomial degree by assuming a particular scheduling discipline and traffic shaping policy at each router ( Pornavalai et al. 1997) (Zhao et al. 1997)) Our work somehow lies in between these two approaches, as it makes certain assumptions about the multiple metrics which define the problem, but not about specific router behavior in handling the traffic flow. In considering routing with multiple constraints, it has been noticed that the ....

W. Zhao and S. K. Tripathi (1997) Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks, In Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp.

No context found.

W. Zhao and S. K. Tripathi, Routing Guaranteed Quality of Service Connections in Integrated Services Packet Networks, In Proceedings of International Conference on Network Protocols, Atlanta, Georgia, pp. 175-182.

No context found.

Wei Zhao and Satish K. Tripathi. Routing guaranteed quality of service connections in integrated services packet networks. In Proceedings of 5th IEEE International Conference on Network Protocols, pages 175--182, Atlanta, GA, October 1997. 19

No context found.

Wei Zhao and Satish K. Tripathi. Routing guaranteed quality of service connections in integrated services packet networks. In Proceedings of 5th IEEE International Conference on Network Protocols, pages 175--182, Atlanta, GA, October 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC