192 search results - page 18 / 39 » The Stretched Network: Properties, Routing, and Performance |
INFOCOM
2006
IEEE
14 years 5 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
IJWIN
2007
13 years 10 months ago
2007
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
JCP
2008
13 years 11 months ago
2008
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop H...
QSHINE
2005
IEEE
14 years 4 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...