Sciweavers

1432 search results - page 4 / 287
» Hardness of robust network design
Sort
View
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
14 years 3 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
CCR
2005
97views more  CCR 2005»
13 years 9 months ago
On the robustness of router-based denial-of-service (DoS) defense systems
This paper focuses on "router-based" defense mechanisms, and whether they can provide effective solutions to network Denialof-Service (DoS) attacks. Router-based defense...
Ying Xu, Roch Guérin
GLOBECOM
2010
IEEE
13 years 7 months ago
Interference-Aware Robust Wireless Mesh Network Design
Interference has been proven to have an effect on the performance in wireless mesh networks (WMN). Using multichannels can improve the performance of WMNs by reducing interference ...
Farah Kandah, Weiyi Zhang, Yashaswi Singh, Juan Li
JNCA
1998
71views more  JNCA 1998»
13 years 9 months ago
An efficient communication scheme for media on-demand services with hard QoS guarantees
The critical issue of multimedia communications is to provide quality of service (QoS) guarantees while system resources are efficiently used. The system utilisation is usually lo...
Guojun Lu, Chester Kang
NETWORKING
2007
13 years 11 months ago
Beyond Proportional Fair: Designing Robust Wireless Schedulers
Abstract. Proportional Fair (PF), a frequently used scheduling algorithm in 3G wireless networks, can unnecessarily starve “well-behaved” users in practice. One of the main cau...
Soshant Bali, Sridhar Machiraju, Hui Zang