70 search results - page 2 / 14 » A Case for Decomposition of FIFO Networks |
SODA
2003
ACM
13 years 7 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
STOC
2001
ACM
14 years 6 months ago
2001
ACM
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...
FOSSACS
2010
Springer
14 years 16 days ago
2010
Springer
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
PE
2008
Springer
13 years 6 months ago
2008
Springer
By characterizing the worst case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upp...
INFOCOM
2008
IEEE
14 years 13 days ago
2008
IEEE
—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees ar...