Sciweavers

282 search results - page 29 / 57
» Efficient Route Tracing from a Single Source
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
14 years 1 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
BROADNETS
2004
IEEE
14 years 2 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
ISPAN
1999
IEEE
14 years 2 months ago
Supporting Hierarchy and Heterogeneous Interfaces in Multi-Hop Wireless Ad Hoc Networks
Much progress has been made toward solving the problem of routing packets inside an ad hoc network, but there are presently no complete proposals for connecting ad hoc networks to...
Josh Broch, David A. Maltz, David B. Johnson
ATVA
2006
Springer
99views Hardware» more  ATVA 2006»
14 years 2 months ago
Whodunit? Causal Analysis for Counterexamples
Although the counterexample returned by a model checker can help in reproducing the symptom related to a defect, a significant amount of effort is often required for the programmer...
Chao Wang, Zijiang Yang, Franjo Ivancic, Aarti Gup...
ECUMN
2007
Springer
14 years 4 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...