581 search results - page 70 / 117 » Approximation algorithms for constructing wavelength routing... |
117
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
102
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
117
click to vote
COMSWARE
2007
IEEE
15 years 5 months ago
2007
IEEE
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within a...
INFOCOM
2010
IEEE
14 years 12 months ago
2010
IEEE
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
118
click to vote
JGAA
2006
15 years 1 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...