Sciweavers

1388 search results - page 117 / 278
» Approximability of Robust Network Design
Sort
View
105
Voted
EOR
2006
57views more  EOR 2006»
15 years 3 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
132
Voted
COR
2007
108views more  COR 2007»
15 years 3 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
104
Voted
COMCOM
2008
62views more  COMCOM 2008»
15 years 3 months ago
Scalable multicasting with network-aware geometric overlay
It is crucial to design an efficient network-aware overlay network to enable multicast service to adjust under the dynamic underlying network conditions and node churn in a scalab...
Eng Keong Lua, Xiaoming Zhou, Jon Crowcroft, Piet ...
155
Voted
BROADNETS
2007
IEEE
15 years 10 months ago
Cross-layer optimization made practical
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
Ajit Warrier, Long Le, Injong Rhee
123
Voted
CCR
2010
156views more  CCR 2010»
15 years 3 months ago
Evolvable network architectures: what can we learn from biology?
There is significant research interest recently to understand the evolution of the current Internet, as well as to design clean-slate Future Internet architectures. Clearly, even ...
Constantine Dovrolis, J. Todd Streelman