Sciweavers

866 search results - page 115 / 174
» On Dynamic Shortest Paths Problems
Sort
View
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 3 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
INFOCOM
2003
IEEE
15 years 3 months ago
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
Frédéric Giroire, Antonio Nucci, Nin...
MMNS
2004
167views Multimedia» more  MMNS 2004»
14 years 11 months ago
Bandwidth Constrained IP Multicast Traffic Engineering Without MPLS Overlay
Existing multicast traffic engineering (TE) solutions tend to use explicit routing through MPLS tunnels. In this paper we shift away from this overlay approach and address the band...
Ning Wang, George Pavlou
INFOCOM
2011
IEEE
14 years 1 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
TC
2008
14 years 9 months ago
The Synonym Lookaside Buffer: A Solution to the Synonym Problem in Virtual Caches
To support dynamic address translation in today's microprocessors, the first-level cache is accessed in parallel with a translation lookaside buffer (TLB). However, this curre...
Xiaogang Qiu, Michel Dubois