A simulation study of scheduling algorithms for packet switching networks

Download

index.pdf

Date

2003

Author

Babur, Özgür

Metadata

Show full item record

Item Usage Stats

230
views

0
downloads

A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth and protection from ill-behaved resources.

Subject Keywords

Packet switching (Data transmissions), Computer networks

URI

http://etd.lib.metu.edu.tr/upload/2/1219336/index.pdf
https://hdl.handle.net/11511/13842

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A Link delay computation method for the quality of service support in software defined networks Balo, Efe; Güran Schmidt, Ece.; Department of Electrical and Electronics Engineering (2019) Packet switched networks cannot provide tight delay bounds that are required by certain types of applications despite facilitating high throughput. Therefore, delay measurementtechniquesforpacket-switchednetworkshavealwaysgrabbedtheattention of the community to both utilize advantages of packet-switched networks and provide a realistic end to end delay prediction of packets. Software Deﬁned Networking (SDN) isa new paradigmofpacket-switchednetworkingwhichgathersmanagement functionality of network in a logic...
The Development and hardware implementation of a high speed adaptable packet switch fabric Akbaba, Erdem Eyüp; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2013) Routers have to be fast enough to keep pace with increasing traffic data rate because of the increasing need for network bandwidth and processing. The switch fabric component of a router is a combination of hardware and software which moves the incoming packets to the outgoing ports. The access of the input ports to the switch fabric is controlled by a scheduler which affects the overall performance together with the fabric design. In this thesis we investigate two switch fabric and scheduler architectures,...
A comparative study of evolutionary network design Kalkan, Sinan; Şehitoğlu, Onur Tolga; Üçoluk, Göktürk; Department of Computer Engineering (2003) In network design, a communication network is optimized for a given set of parameters like cost, reliability and delay. This study analyzes network design problem using Genetic Algorithms in detail and makes comparison of different approaches and representations. Encoding of a problem is one of the most crucial design choices in Genetic Algorithms. For network design problem, this study compares adjacency matrix representation with list of edges representation. Also, another problem is defining a fair fitne...
Improving performance of network intrusion detection systems through concurrent mechanisms Atakan, Mustafa; Şener, Cevat; Department of Computer Engineering (2003) As the bandwidth of present networks gets larger than the past, the demand of Network Intrusion Detection Systems (NIDS) that function in real time becomes the major requirement for high-speed networks. If these systems are not fast enough to process all network traffic passing, some malicious security violations may take role using this drawback. In order to make that kind of applications schedulable, some concurrency mechanism is introduced to the general flowchart of their algorithm. The principal aim is...
A new scalable service discipline for real-time traffic: The framed-deadline scheduler Schmidt, Şenan Ece (Elsevier BV, 2007-03-26) Qulaity of Service (Qos) support in a scalable and low-complexity fashion is important in high-speed networks carrying real-time traffic. There are service disciplines that can provide end-to-end bandwidth and delay guarantees. However, they are designed to operate with expensive output quenching switches or with combined input-output queuing (CIOQ) switches that require very complicated fabric work with a CIOQ packet switch to provide the same end-to-end QoS guarantees as service disciplines that only work...

Citation Formats

Ö. Babur, “A simulation study of scheduling algorithms for packet switching networks,” M.S. - Master of Science, Middle East Technical University, 2003.