Sciweavers

1639 search results - page 31 / 328
» Degree-constrained network flows
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
14 years 2 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
TIFS
2008
136views more  TIFS 2008»
13 years 11 months ago
Distributed Detection of Information Flows
Abstract--Distributed detection of information flows is considered in which traffic sensors at different locations of a network observe transmission epochs. The traffic sensors com...
Ting He, Lang Tong
ANSS
2008
IEEE
14 years 5 months ago
Beyond the Model of Persistent TCP Flows: Open-Loop vs Closed-Loop Arrivals of Non-persistent Flows
It is common for simulation and analytical studies to model Internet traffic as an aggregation of mostly persistent TCP flows. In practice, however, flows follow a heavytailed ...
Ravi S. Prasad, Constantine Dovrolis
CN
2008
126views more  CN 2008»
13 years 11 months ago
Design and evaluation of flow handoff signalling for multihomed mobile nodes in wireless overlay networks
With the increasing deployment of wireless overlay networks, a mobile node with a range of network interfaces can be connected to multiple heterogeneous or homogeneous access netw...
Qi Wang, Robert Atkinson, John Dunlop