Sciweavers

206 search results - page 8 / 42
» Three Hoppy path problems and ternary paths
Sort
View
SIROCCO
2004
13 years 9 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
SOSP
2003
ACM
14 years 4 months ago
User-level internet path diagnosis
Diagnosing faults in the Internet is arduous and time-consuming, in part because the network is composed of diverse components spread across many administrative domains. We consid...
Ratul Mahajan, Neil T. Spring, David Wetherall, Th...
ICNP
2002
IEEE
14 years 15 days ago
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
The emerging Multi-Protocol Label Switching (MPLS) networks enable network service providers to route bandwidth guaranteed paths between customer sites [3, 2, 8, 5]. This basic La...
Erran L. Li, Milind M. Buddhikot, Chandra Chekuri,...
ICCAD
1999
IEEE
66views Hardware» more  ICCAD 1999»
13 years 12 months ago
Timing-safe false path removal for combinational modules
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
Yuji Kukimoto, Robert K. Brayton
RSA
2000
170views more  RSA 2000»
13 years 7 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski