58 search results - page 2 / 12 » An analysis on error servers for stochastic network calculus |
INFOCOM
2002
IEEE
13 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...
JPDC
2006
13 years 4 months ago
2006
Virtualization provides a vehicle to manage the available resources and enhance their utilization in network computing. System dynamics requires virtual machines be distributed an...
MMB
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
COMCOM
2008
13 years 5 months ago
2008
In this paper, we consider a variant of an M/M/c/c loss system with fluctuating server capacity. Given a set of primary inputs, such as arrival rate, service rate, and capacity fl...