1259 search results - page 5 / 252 » On Survivable Access Network Design: Complexity and Algorith... |
DISOPT
2008
13 years 7 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
QOSIP
2005
Springer
14 years 25 days ago
2005
Springer
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
SAGT
2009
Springer
14 years 1 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— The potential of multi-antenna interference cancellation receiver algorithms for increasing the uplink throughput in WLAN systems such as 802.11 is investigated. The me...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— In this paper, we study the survivability problem in hierarchical wireless access networks with dual-homed end users, who are connected to two base stations (BSs), a primary BS...