QoS provisioning and tracking fluid policies in input queueing switches

Authors:
Vahid Tabatabaee;Leonidas Georgiadis;Leandros Tassiulas
Affiliations:
University of Maryland, College Park, MD;Aristotle University, Thessaloniki, Greece;University of Maryland, College Park, MD
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2001

Citing 10
Cited 4

Data networks

Data networks
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Introduction to algorithms

Introduction to algorithms
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
EDD Algorithm Performance Guarantee for Periodic Hard-Real-Time Scheduling in Distributed Systems

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Scheduling real-time messages in packet-switched networks

Scheduling real-time messages in packet-switched networks
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Optimal multiplexing on a single link: delay and buffer requirements

IEEE Transactions on Information Theory

An efficient packet scheduling algorithm with deadline guarantees for input-queued switches

IEEE/ACM Transactions on Networking (TON)
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches

Theoretical Computer Science
MNCM: a critical node matching approach to scheduling for input buffered switches with no speedup

IEEE/ACM Transactions on Networking (TON)
On tracking the behavior of an output-queued switch using an input-queued switch

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of tracking fluid policies by packetized policies is extended to input queueing switches. It is considered that the speedup of the switch is one. One of the interesting applications of the tracking policy in TDMA satellite switches is elaborated. For the special case of 2 × 2 switches, it is shown that a tracking nonanticipative policy always exists. It is found that, in general, nonanticipative policies do not exist for switches with more than two input and output ports. For the general case of N × N switches, a heuristic tracking policy is provided. The heuristic algorithm is based on two notions: port tracking and critical links. These notions can be employed in the derivation of other heuristic tracking policies as well. Simulation results show the usefulness of the heuristic algorithm and the two basic concepts it relies on.