Sciweavers

1127 search results - page 3 / 226
» New Algorithms for Generalized Network Flows
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 25 days ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
CSCLP
2007
Springer
14 years 1 months ago
Generalizing Global Constraints Based on Network Flows
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
NOMS
2006
IEEE
105views Communications» more  NOMS 2006»
14 years 1 months ago
Adaptive Flow Aggregation - A New Solution for Robust Flow Monitoring under Security Attacks
— Flow-level traffic measurement is required for a wide range of applications including accounting, network planning and security management. A key design challenge is how to gr...
Yan Hu, Dah-Ming Chiu, John C. S. Lui
CCR
2006
136views more  CCR 2006»
13 years 7 months ago
Traffic classification on the fly
The early detection of applications associated with TCP flows is an essential step for network security and traffic engineering. The classic way to identify flows, i.e. looking at...
Laurent Bernaille, Renata Teixeira, Ismael Akodken...
NETWORKING
2004
13 years 8 months ago
A New Method of Primary Routes Selection for Local Restoration
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
Krzysztof Walkowiak