10 search results - page 2 / 2 » Statistical Per-Flow Service Bounds in a Network with Aggreg... |
138
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract— We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach on the assumption that a node can be ab...
165
click to vote
IWQOS
2001
Springer
15 years 8 months ago
2001
Springer
Ad-hoc wireless networks consist of mobile nodes interconnected by multi-hop wireless paths. Unlike conventional wireless networks, ad-hoc networks have no fixed network infrastru...
156
click to vote
JSAC
2007
15 years 3 months ago
2007
— This paper presents an analytical approach to determining the maximum number of on/off voice flows that can be supported over a wireless local area network (WLAN), under a qua...
134
click to vote
NSDI
2004
15 years 5 months ago
2004
This paper describes the design, implementation, and experimental evaluation of OverQoS, an overlay-based architecture for enhancing the best-effort service of today's Intern...
165
click to vote
PE
2010
Springer
14 years 10 months ago
2010
Springer
In today's Internet, a large part of the traffic is carried using the TCP transport protocol. Characterization of the variations of TCP traffic is thus a major challenge, bot...