Design and implementation of scheduling and switching architectures for high speed networks

Sanlı, Mustafa
Quality of Service (QoS) schedulers are one of the most important components for the end-to-end QoS support in the Internet. The focus of this thesis is the hardware design and implementation of the QoS schedulers, that is scalable for high line speeds and large number of traffic flows. FPGA is the selected hardware platform. Previous work on the hardware design and implementation of QoS schedulers are mostly algorithm specific. In this thesis, a general architecture for the design of the class of Packet Fair Queuing (PFQ) schedulers is proposed. Worst Case Fair Weighted Fair Queuing Plus (WF2Q+) scheduler is implemented and tested in hardware to demonstrate the proposed architecture and design enhancements. The maximum line speed that PFQ algorithms can operate decreases as the number of scheduled flows increases. For this reason, this thesis proposes to aggregate the flows to scale the PFQ architecture to high line speeds. The Window Based Fair Aggregator (WBFA) algorithm that this thesis suggests for flow aggregation provides a tunable trade-off between the efficient use of the available bandwidth and the fairness among the constituent flows. WBFA is also integrated to the hardware PFQ architecture. The QoS support provided by the proposed PFQ architecture and WBFA is measured by conducting hardware experiments on a custom built high speed network testbed which consists of three data processing cards and a backplane. In these experiments, the input traffic is provided by the hardware traffic generator which is designed in the scope of this thesis.


Hardware design and implementation of packet fair queuing algorithms for the quality of service support in the high-speed internet
Sanli, Mustafa; Schmidt, Şenan Ece; Guran, Hasan Cengiz (2012-09-05)
The increasing amount of real-time traffic carried over the Internet requires end-to-end quality of service (QoS) support. To this end, the QoS Schedulers, that are implemented in routers, assign the available bandwidth resources to packet flows according to their respective allocated rates. Packet Fair Queuing (PFQ) schedulers can provide fair service and low end-to-end delay bound to the traffic flows. However, they have higher implementation complexity compared to other algorithms, because of the require...
Multi-layer network design problems in telecommunication
Yüksel Ergün, İnci; Kırca, Ömer; Süral, Haldun; Department of Industrial Engineering (2013)
The telecommunication network design problem is to configure a telecommunication network of major hardware and their links in order to satisfy traffic demands and flows subject to a set of constraints arising from topology, capacity, and technology. Telecommunication network design has been studied in several disciplines and its literature is intricate. In this study, we classify the telecommunication network design problems in the literature from the perspective of operations research and review the networ...
A Flow Aggregation Method for the Scalable and Efficient Quality of Service Support in Next Generation Networks
Sanli, Mustafa; Schmidt, Şenan Ece; Guran, Hasan Cengiz (2013-12-13)
The services in the Next Generation Network (NGN) will be created on demand by the customers and will require end-to-end Quality of Service (QoS) for each flow. A very significant component for the end-to-end QoS support in the Internet is the packet schedulers in the routers. The complexity of the packet scheduling algorithms increases with the number of flows. As a solution, flow aggregation decreases the number of flows processed by the scheduler. The previous work in the literature proves that if the fl...
An accurate evaluation of machine learning algorithms for flow-based P2P traffic detection
Soysal, Murat; Schmidt, Şenan Ece (2007-12-01)
Today, peer-to-peer (P2P) traffic consumes the largest fraction of network bandwidth. The files shared by P2P communications are mostly copyright protected, and there are issues related to Quality of Service (QoS) support and billing of P2P traffic. Hence, scalable and accurate detection of peer-to-peer (P2P) traffic is a significant problem for network service providers. Flow-based detection methods employ characteristics of data flows such as the number of packets per flow to classify P2P and non-P2P traf...
Software implementations of QoS scheduling algorithms for high speed networks /
Pehlivanlı, Aydın; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2015)
The end to end Quality of Service (QoS) support for the dominating multimedia traffic in the contemporary computer networks is achieved by implementing schedulers in the routers and deploying traffic shapers. To this end, realistic modeling and simulation of these components is essential for network performance evaluation. The first contribution of this thesis is the design and implementation of a C++ simulator QueST (Quality of Service simulaTor) for this task. QueST is a modular cycle accurate simulator w...
Citation Formats
M. Sanlı, “Design and implementation of scheduling and switching architectures for high speed networks,” Ph.D. - Doctoral Program, Middle East Technical University, 2011.