Sciweavers

70 search results - page 1 / 14
» A Case for Decomposition of FIFO Networks
Sort
View
INFOCOM
2009
IEEE
13 years 11 months ago
A Case for Decomposition of FIFO Networks
—Recent findings showing that the output of traffic flows at packet switches has similar characteristics as the corresponding input enable a decomposition analysis of a networ...
Florin Ciucu, Jörg Liebeherr
CN
2002
85views more  CN 2002»
13 years 4 months ago
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large ...
Yuming Jiang
IPPS
2006
IEEE
13 years 11 months ago
FIFO scheduling of divisible loads with return messages under the one-port model
This paper deals with scheduling divisible load applications on star networks, in presence of return messages. This work is a follow-on of [6, 7], where the same problem was consi...
Olivier Beaumont, Loris Marchal, Veronika Rehn, Yv...
EMSOFT
2005
Springer
13 years 10 months ago
Distributing synchronous programs using bounded queues
This paper is about the modular compilation and distribution of a sub-class of Simulink programs [9] across networks using bounded FIFO queues. The problem is first addressed mat...
Marco Zennaro, Raja Sengupta
ICNP
2005
IEEE
13 years 10 months ago
CONNET: Self-Controlled Access Links for Delay and Jitter Requirements
Access links are typically the bottleneck between a high bandwidth LAN and a high bandwidth IP network. Without a priori resource provisioning or reservation, this tends to have a...
Mohamed A. El-Gendy, Kang G. Shin, Hosam Fathy