Sciweavers

552 search results - page 10 / 111
» Routing complexity of faulty networks
Sort
View
IPPS
2000
IEEE
13 years 12 months ago
Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routin...
Seungjin Park, Jong-Hoon Youn, Bella Bose
ISCC
2006
IEEE
128views Communications» more  ISCC 2006»
14 years 1 months ago
Adjacent 2-Route Flow Approach for Restorable Dynamic Routing in MPLS Networks
In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable rout...
Krzysztof Walkowiak
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
PERVASIVE
2008
Springer
13 years 7 months ago
Context-aware routing in wireless mesh networks
Wireless mesh networks promise to deliver resilient connectivity among network nodes, allowing data to be relayed seamlessly between mobile clients and infrastructure. Routing is ...
Peizhao Hu, Marius Portmann, Ricky Robinson, Jadwi...
CONEXT
2007
ACM
13 years 11 months ago
Exploring the routing complexity of mobile multicast: a semi-empirical study
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
Matthias Wählisch, Thomas C. Schmidt