Sciweavers

1639 search results - page 63 / 328
» Degree-constrained network flows
Sort
View
PIMRC
2008
IEEE
15 years 4 months ago
Distributed scheduling with end-to-end compensation in multihop ad hoc networks
Abstract-In this paper, we investigate the problem of providing QoS to end-to-end flows in multihop ad hoc networks with channel errors through packet scheduling. Each flow is asso...
Yijiang Sun, Victor O. K. Li, Ka-Cheong Leung
LCN
2007
IEEE
15 years 4 months ago
Overlay Bandwidth Management: Scheduling and Active Queue Management of Overlay Flows
— Peer-to-peer and mobile networks gained significant attention of both research community and industry. Applying the peer-to-peer paradigm in mobile networks lead to several pr...
Kalman Graffi, Konstantin Pussep, Sebastian Kaune,...
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
15 years 4 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...
LCN
2000
IEEE
15 years 2 months ago
Performance Measurements and Analysis of TCP Flows in a Differentiated Services WAN
Abstract—This paper presents results from performance measurements carried out in a Differentiated Services WAN connecting three major cities in Southern Finland. The target of t...
Jarmo Harju, Yevgeni Koucheryavy, Juha Laine, Samp...
SP
2000
IEEE
15 years 2 months ago
Using Conservation of Flow as a Security Mechanism in Network Protocols
The law of Conservation of Flow, which states that an input must either be absorbed or sent on as an output (possibly with modification), is an attractive tool with which to analy...
John R. Hughes, Tuomas Aura, Matt Bishop