J. Wang and K. Nahrstedt, Hop-by-hop routing algorithms for premium-class traffic in DiffServ  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint-Based Routing in the Internet: Basic Principles and .. - Younis, Fahmy (2003) (1 citation) (Correct)
.... availability Hop by hop Routing and resource reservation [10] Hierarchical Advance reservation [8] pre computation [4] Robustness Source Network graph reduction [43] safety routing [44] Performance Hop by hop Adaptive proportional routing [22] dynamic routing [45] premium class routing [46], ticketbased probing [7] Hierarchical Most Reliable Path (MRP) 21] Multiple traffic classes Hop by hop QoS routing for best effort flows [36] optimal premium class routing [46] Scalability General Topology aggregation [47] Hop by hop Selective Ticket based probing [7] Hierarchical ....
.... [44] Performance Hop by hop Adaptive proportional routing [22] dynamic routing [45] premium class routing [46] ticketbased probing [7] Hierarchical Most Reliable Path (MRP) 21] Multiple traffic classes Hop by hop QoS routing for best effort flows [36] optimal premium class routing [46] Scalability General Topology aggregation [47] Hop by hop Selective Ticket based probing [7] Hierarchical Partitioning QoS requirements [48] PNNI [9] rithms are designed to satisfy bandwidth, delay, jitter, and cost constraints. The time complexity of current proposals is generally ....
[Article contains additional citation context not shown here]
J. Wang and K. Nahrstedt, "Hop-by-Hop Routing Algorithms for Premium-Class Traffic in DiffServ Networks," in Proceedings of the Conference on Computer Communications (IEEE INFOCOM '02), June 2002.
Precomputation for Multi-constrained QoS Routing in High-speed.. - Cui, Xu, Wu (2003) (2 citations) (Correct)
....[1] of which QoS Routing (QoSR) is one of the most pivotal problems [2] The main function of QoSR is to find a feasible path that satisfies multiple constraints for QoS applications. Although QoSR was initially proposed for the IntServ model, it could also be used in the DiffServ model [3] [4], 5] The QoS constraints can be divided into link constraints and path constraints. The link constraint of a path can be converted to the constraint of the bottleneck link in the path, such as bandwidth. It can be easily dealt with in a preprocessing step by pruning all links that do not satisfy ....
J. Wang and K. Nahrstedt. Hop-by-hop routing algorithms for premium-class traffic in riffS cry networks. IEEE INFOCOM'02, 2002.
HCASP: A Hop-Constrained Adaptive Shortest-Path Algorithm for.. - Elsayed (Correct)
No context found.
J. Wang and K. Nahrstedt, Hop-by-hop routing algorithms for premium-class traffic in DiffServ
HCASP: A Hop-Constrained Adaptive Shortest-Path Algorithm for.. - Elsayed (Correct)
No context found.
J. Wang and K. Nahrstedt, Hop-by-hop routing algorithms for premium-class traffic in DiffServ
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