Sciweavers

88 search results - page 4 / 18
» A new approach to dynamic all pairs shortest paths
Sort
View
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
14 years 1 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
FITRAMEN
2008
14 years 11 months ago
A Fair and Dynamic Load-Balancing Mechanism
The current data network scenario makes Traffic Engineering (TE) a very challenging task. The ever growing access rates and new applications running on end-hosts result in more var...
Federico Larroca, Jean-Louis Rougier
FSTTCS
2004
Springer
15 years 2 months ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...
MFCS
2000
Springer
15 years 1 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks
ISCC
2002
IEEE
101views Communications» more  ISCC 2002»
15 years 2 months ago
Partial path protection for WDM networks: end-to-end recovery using local failure information
In this paper, we propose a new protection scheme, which we term partial path protection (PPP), to select endto-end backup paths using local information about network failures. PP...
Hungjen Wang, Eytan Modiano, Muriel Médard