![[IMAGE]](switch.gif) |
|
HBBCL Switching and Scheduling Studies
|
Switching and Scheduling Work at Harvard:
The Internet has become an essential part of our modern-day communication
systems and in this light it is witnessing exponential growth. As the amount
of the network traffic increases, quality of service issues is gaining
more importance. Specifically, centralized schedulers are being used to
configure high-speed switches and routers to transfer fixed-size cells
across the input and output ports according to some pre-negotiated fluid
policies subject to QOS requirements. An immediate challenge is to approximate
such policy into a packetized policies.
This motivated us to derive fundamental results on the approximability
of fluid policies by packetized policies. Our effort has been divided into
three main themes:
Buffer size requirements to gaurantee 100% throughput
Without the use of speedup, we have derived universal bounds on the buffer
size that are required to gaurantee 100% throughput using packetized policy
that can approximate any fluid policy without any assumption on statistical
nature of the input traffic.
-
M. Rosenblum, M. X. Goemans and V. Tarokh, "Universal bounds on buffer
size for packetizing fluid policies in input queued, crossbar switches,"
submitted to INFOCOM 2004.
-
M. Rosenblum, C. Caramanis, M. X. Goemans and V. Tarokh, "Universal bounds
on buffer size for packetizing fluid policies in banyan networks," submitted
to INFOCOM 2004.
Speedup and lookahead requirements to guarantee trackability
We study the impact of speedup and lookahead in packetizing fluid policy.
Specifically, we compute speed-up requirements that can gaurantee approximating
packetized policies for arbitrary fluid policies without the need of buffering.
Network Calculus
We derive fundamental mathematical formulations that will be useful in
analysing packetizing policy when there are multiple interconnected switching
and routing elements.
Group Members:
![[IMAGE]](hbbcl.jpg){kind=small}
![[IMAGE]](hshield.gif)