Sciweavers

54 search results - page 2 / 11
» Flow trees for vertex-capacitated networks
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
13 years 7 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
TIT
2008
112views more  TIT 2008»
13 years 4 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar
COMCOM
2006
100views more  COMCOM 2006»
13 years 4 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
COMCOM
2006
283views more  COMCOM 2006»
13 years 4 months ago
Sleep scheduling for wireless sensor networks via network flow model
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost...
Rick W. Ha, Pin-Han Ho, Sherman X. Shen, Junshan Z...
NSDI
2010
13 years 5 months ago
ElasticTree: Saving Energy in Data Center Networks
Networks are a shared resource connecting critical IT infrastructure, and the general practice is to always leave them on. Yet, meaningful energy savings can result from improving...
Brandon Heller, Srinivasan Seetharaman, Priya Maha...