Sciweavers

118 search results - page 2 / 24
» Strong Lower Bounds for a Survivable Network Design Problem
Sort
View
COCOA
2008
Springer
13 years 6 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 7 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
INFOCOM
2009
IEEE
13 years 11 months ago
Cross-Layer Survivability in WDM-Based Networks
—In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may...
Kyunghan Lee, Eytan Modiano
SPAA
2006
ACM
13 years 11 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
JNCA
2011
137views more  JNCA 2011»
13 years 4 hour ago
Providing survivability against jamming attack for multi-radio multi-channel wireless mesh networks
Built upon a shared wireless medium, wireless mesh network is particularly vulnerable to jamming attacks. The ability to recover from attacks and maintain an acceptable level of s...
Shanshan Jiang, Yuan Xue