Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Software implementations of QoS scheduling algorithms for high speed networks /
Download
index.pdf
Date
2015
Author
Pehlivanlı, Aydın
Metadata
Show full item record
Item Usage Stats
234
views
144
downloads
Cite This
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 with a detailed modeling of the traffic flows, shapers and schedulers. The traffic generators and the schedulers of QueST are verified by comparison to the respective analytical models. The QoS schedulers are data plane components in routers which have to operate at 10s of Gbps rates. Hence, the increasing scheduling complexity with the number of flows is an important problem. This problem can be alleviated by reducing the number of flows by traffic aggregation. The second contribution of this thesis is the evaluation of previously developed Window Based Fair Aggregator (WBFA) in QueST under a large number of case studies to investigate its features and benefits as well as optimal parameter selection.
Subject Keywords
Computer networks.
,
Computer scheduling.
,
Computer algorithms.
,
Computer networks
URI
http://etd.lib.metu.edu.tr/upload/12618384/index.pdf
https://hdl.handle.net/11511/24406
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A new approach for the scalable intrusion detection in high-speed networks
Şahin, Ümit Burak; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2007)
As the networks become faster and faster, the emerging requirement is to improve the performance of the Intrusion Detection and Prevention Systems (IDPS) to keep up with the increased network throughput. In high speed networks, it is very difficult for the IDPS to process all the packets. Since the throughput of IDPS is not improved as fast as the throughput of the switches and routers, it is necessary to develop new detection techniques other than traditional techniques. In this thesis we propose a rule-ba...
Performance evaluation of routing protocols in wireless ad hoc networks with service differentiation
Yılmaz, Semra; Koçyiğit, Altan; Erten, Murat; Department of Information Systems (2003)
An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any fixed network infrastructure or centralized administration. Due to the limitations in the wireless environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. In order to enable communication within the network, a routing protocol is needed to discover routes between nodes. The primary goal of ad hoc network routing pro...
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...
Parallel and pipelined architectures for high speed ip packet forwarding
Erdem, Oğuzhan; Bazlamaçcı, Cüneyt Fehmi; Department of Electrical and Electronics Engineering (2011)
A substantial increase in the number of internet users and the traffic volume bring new challenges for network router design. The current routers need to support higher link data rates and large number of line cards to accommodate the growth of the internet traffic, which necessitate an increase in physical space, power and memory use. Packet forwarding, which is one of the major tasks of a router, has been a performance bottleneck in internet infrastructure. In general, most of the packet forwarding algori...
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
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Pehlivanlı, “Software implementations of QoS scheduling algorithms for high speed networks /,” M.S. - Master of Science, Middle East Technical University, 2015.