1639 search results - page 175 / 328 » Degree-constrained network flows |
131
click to vote
SIGCOMM
2010
ACM
15 years 4 months ago
2010
ACM
Ideally, enterprise administrators could specify fine-grain policies that drive how the underlying switches forward, drop, and measure traffic. However, existing techniques for fl...
131
click to vote
DISOPT
2008
15 years 4 months ago
2008
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
147
click to vote
COMCOM
2006
15 years 4 months ago
2006
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 ...
160
click to vote
TWC
2008
15 years 4 months ago
2008
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications...
180
click to vote
CN
2002
15 years 4 months ago
2002
An analytical framework for modeling a network of Random Early Detection (RED) queues with mixed traffic types (e.g. TCP and UDP) is developed. Expressions for the steady state go...