Sciweavers

16 search results - page 1 / 4
» Burstiness Bounds for Some Burst Reducing Servers
Sort
View
INFOCOM
1993
IEEE
13 years 9 months ago
Burstiness Bounds for Some Burst Reducing Servers
In [18], we propose a framework to study a stream of trafic or message as it is transferred over an ATM connection. A message is modeled as a deierministic fluid flow, and an ATM ...
Steven H. Low, Pravin Varaiya
ICDCS
2009
IEEE
14 years 2 months ago
Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
The growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in resource management and QoS in storage system...
Lanyue Lu, Peter J. Varman, Kshitij Doshi
DATE
2009
IEEE
113views Hardware» more  DATE 2009»
14 years 10 days ago
Priority based forced requeue to reduce worst-case latencies for bursty traffic
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...
Mikael Millberg, Axel Jantsch
CN
2006
80views more  CN 2006»
13 years 5 months ago
Delay bound and packet scale rate guarantee for some expedited forwarding networks
Expedited Forwarding (EF) is a service defined under the Differentiated Services framework. Based on its recently revised definition in IETF RFC 3246, Packet Scale Rate Guarantee ...
Yuming Jiang
TC
2010
13 years 9 days ago
Model-Driven System Capacity Planning under Workload Burstiness
In this paper, we define and study a new class of capacity planning models called MAP queueing networks. MAP queueing networks provide the first analytical methodology to describe ...
Giuliano Casale, Ningfang Mi, Evgenia Smirni