Sciweavers

6 search results - page 1 / 2
» Dynamic bottleneck optimization for k-edge and 2-vertex conn...
Sort
View
IPL
2008
59views more  IPL 2008»
13 years 6 months ago
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity
Orestis Telelis, Vassilis Zissimopoulos
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
13 years 10 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
INFOCOM
1999
IEEE
13 years 10 months ago
Scalable Flow Control for Multicast ABR Services
We propose a flow-control scheme for multicast ABR services in ATM networks. At the heart of the proposed scheme is an optimal secondorder rate control algorithm, called the -contr...
Xi Zhang, Kang G. Shin, Debanjan Saha, Dilip D. Ka...
BROADNETS
2007
IEEE
14 years 18 days ago
Resource dimensioning in WDM networks under state-based routing schemes
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
MOBIHOC
2005
ACM
14 years 5 months ago
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels ca...
Jian Tang, Guoliang Xue, Weiyi Zhang