Window Based Fair Aggregator for the Scalable Support of QoS Guarantees in the Backbone: An Experimental Performance Study

Date

2016-02-18

Author

Sanli, Mustafa
Pehlivanli, Aydin
Schmidt, Şenan Ece

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

5
views

0
downloads

Cite This

Video and voice traffic currently have the biggest share in the Internet. These applications require end-to-end Quality of Service (QoS) guarantees for each flow. The packet schedulers in the routers play an important role in providing end-to-end QoS support in the Internet. It is important that the implementation of packet schedulers scale with the steady increase in the data rates and the number of flows. In our previous work we proposed Window Based Fair Aggregator (WBFA) to decrease the number of flows. WBFA aggregates the flows preserving their end-to-end delay bounds with a relatively small aggregation delay. In this paper we present a detailed simulation study to demonstrate the features of WBFA and its effect on the performance of fair packet schedulers.

Subject Keywords

Flow aggregation, Fair aggregator, Quality of service

URI

https://hdl.handle.net/11511/55910

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar