B. Fortz and M. Thorup, Internet Tra#c Engineering by Optimizing OSPF Weights, Proceedings of IEEE Infocom (2000) 519-528. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Difficulty of Some Shortest Path Problems - Hershberger, Suri, Bhosle (2003) (1 citation) (Correct)
....of the replacement paths problem arises when nodes of the path P are removed one at a time. These two problems have equivalent computational complexity. The replacement paths problem is motivated both by routing applications, in which a new route is needed in response to individual link failures [8], and by computational mechanism design, in which the Vickrey Clarke Grove scheme is used to elicit true link costs in a distributed but self interested communication setting, such as the Internet [3, 21] In the VCG payment scheme, the bonus to a link agent e i equals d(s, t; G e i ) d(s, ....
B. Fortz and M. Thorup. Internet tra#c engineering by optimizing OSPF weights. In INFOCOM, pages 519--528, 2000.
RSVP-TE extensions for interdomain LSPs - Pelsser, Bonaventure (2002) (1 citation) (Correct)
....the PLR has a backup path providing protection against SRLG failures on the corresponding path section. TBD Entry ASBR Indicates that this subobject represents a router that is the entry point inside the current AS. The flags Bandwidth protection and Node protection are introduced in draft [PGS 02] In that draft, two objects (FAST REROUTE and DETOUR) a few flags and the MAX PROTECTED BANDWIDTH RRO subobject are introduced. The Local protection available and Local protection in use flags are extended here to Local or segment protection available and Local or segment protection in ....
B. Fortz and M. Thorup. Internet tra#c engineering by optimizing OSPF weights. In INFOCOM
Implications of Traffic Characteristics on Interdomain Traffic.. - Uhlig (2004) Self-citation (Fortz) (Correct)
No context found.
B. Fortz and M. Thorup. Internet tra c engineering by optimizing OSPF weights. In Proc. of IEEE INFOCOM2000.
Internet Traffic Engineering for Partially Uncertain Demands - Mulyana, Zhang, Killat (Correct)
No context found.
B. Fortz and M. Thorup, Internet Tra#c Engineering by Optimizing OSPF Weights, Proceedings of IEEE Infocom (2000) 519-528.
A Multi Path Routing Algorithm for IP Networks.. - Abrahamsson.. (2002) (8 citations) (Correct)
No context found.
B. Fortz and M. Thorup. Internet tra#c engineering by optimizing OSPF weights. In Proceedings IEEE INFOCOM 2000.
On the Difficulty of Some Shortest Path Problems - Hershberger, Suri, Bhosle (2003) (1 citation) (Correct)
No context found.
B. Fortz and M. Thorup. Internet tra#c engineering by optimizing OSPF weights. In INFOCOM, pages 519--528, 2000.
Experimental Analysis of Dynamic All Pairs Shortest.. - Demetrescu.. (2003) (1 citation) (Correct)
No context found.
B. Fortz and M. Thorup. Internet tra#c engineering by optimizing OSPF weights. In Proceedings of the 19th IEEE INFOCOM - The Conference on Computer Communications, pages 519--528, 2000.
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