Sciweavers

8 search results - page 1 / 2
» An Agent-Based Best Effort Routing Technique for Load Balanc...
Sort
View
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
13 years 4 months ago
An Agent-Based Best Effort Routing Technique for Load Balancing
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...
Sunilkumar S. Manvi, Pallapa Venkataram
ICDCS
2007
IEEE
13 years 11 months ago
Overlay Node Placement: Analysis, Algorithms and Impact on Applications
Abstract— Overlay routing has emerged as a promising approach to improving performance and reliability of Internet paths. To fully realize the potential of overlay routing under ...
Sabyasachi Roy, Himabindu Pucha, Zheng Zhang, Y. C...
ECUMN
2007
Springer
13 years 10 months ago
Path Computation for Incoming Interface Multipath Routing
— Currently used IP routing protocols calculate and only use a single path between two nodes of a network, or in the best case, only paths with the same cost (with OSPF2 or IS-IS...
Pascal Mérindol, Jean-Jacques Pansiot, St&e...
IMC
2006
ACM
13 years 10 months ago
A measurement-based deployment proposal for IP anycast
Despite its growing use in critical infrastructure services, the performance of IP(v4) Anycast and its interaction with IP routing practices is not well understood. In this paper,...
Hitesh Ballani, Paul Francis, Sylvia Ratnasamy
FOCS
2000
IEEE
13 years 8 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella