A Link delay computation method for the quality of service support in software defined networks

Download

index.pdf

Date

2019

Author

Balo, Efe

Metadata

Show full item record

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

Item Usage Stats

230
views

95
downloads

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 logically single controller. SDN is thought to eliminate problems of legacy layered architecture by utilizing the control information coming from all network layers. However, in SDN topology, control plane and data plane are separated which implies control packets for network management ﬂow in a different channel than datapath channel. Moreover, the SDN controller has to have a decision metric similar to legacy link-state computation approaches in order to calculate the most efﬁcient route in the topology. All of these indicate that link delay computation in SDN needs new perspectives different than the legacy network to achieve its proper operation. In this thesis, we propose a link delay computation method for SDN topologies. For this purpose, we construct a framework which uses standard OpenFlow messages and computes the switch queuing delay in run-time. In this framework, we model each queue in SDN switches as a G/G/1 queue and measure the ingress trafﬁc with OpenFlow meters. Then, we utilize meter statistics to obtain mean and variance of interarrival times between packets. After ﬁnding the average state of the queues we eventually infer the respective queuing delay from Little’s equation. We demonstrate our method in three cases which are single ﬂow per queue, multiple ﬂows per queue and a test application which uses our delay information to determine the fastest queue of an SDN switch port. Also, we discuss the accuracy and the application limitations of the proposed method.

Subject Keywords

Packet switching (Data transmission)., Keywords: QoS, SDN, delay measurement, OpenFlow.

URI

http://etd.lib.metu.edu.tr/upload/12624239/index.pdf
https://hdl.handle.net/11511/44279

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A simulation study of scheduling algorithms for packet switching networks Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003) 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 ...
Memory organization in pipelined hierarchical search structures for packet classification Rumelili, Çağla Irmak; Bazlamaçcı, Cüneyt Fehmi; Erdem, Oğuzhan; Department of Electrical and Electronics Engineering (2013) Packet classification is a main requirement in routers to manage network security and traffi c. In high speed networks packet classification in line rates has become a major challenge. Our design mainly benefits from a parallel pipelined architecture implemented on field programmable gate arrays (FPGA) to achieve high speed packet processing. The presented solution is based on Hierarchical Hybrid Search Structure (HHSS) [5]. Our work solves the deep pipeline problem of HHSS in a memory e fficient way. This ...
A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels Sridharan, Arun; Koksal, C. Emre; Uysal, Elif (Institute of Electrical and Electronics Engineers (IEEE), 2012-02-01) Information-theoretic broadcast channels (BCs) and multiple-access channels (MACs) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to transmit data simultaneously to a single node, respectively. In this paper, we address the problem of link scheduling in multihop wireless networks containing nodes with BC and MAC capabilities. We first propose an interference model that extends protocol interference models, originally designed for point-to-point channels, to includ...
A longest path problem for evaluating the worst case packet delay of switched ethernet Schmidt, Klaus Verner; Schmidt, Şenan Ece (2010-07-09) In the recent years, the use of real-time Ethernet protocols becomes more and more relevant for time-critical networked industrial applications. In this context, this paper presents a method to compute the worst-case packet delays on switched Ethernet. Based on an evaluation of the packet delays at each switch port and the network topology, we construct a weighted directed graph that allows to find the worst-case end-to-end packet delay by solving a conventional longest-path problem.
A simple and effective mechanism for stored video streaming with TCP transport and server-side adaptive frame discard Gurses, E; Akar, Gözde; Akar, N (Elsevier BV, 2005-07-15) Transmission control protocol (TCP) with its well-established congestion control mechanism is the prevailing transport layer protocol for non-real time data in current Internet Protocol (IP) networks. It would be desirable to transmit any type of multimedia data using TCP in order to take advantage of the extensive operational experience behind TCP in the Internet. However, some features of TCP including retransmissions and variations in throughput and delay, although not catastrophic for non-real time data...

Citation Formats

E. Balo, “A Link delay computation method for the quality of service support in software defined networks,” Thesis (M.S.) -- Graduate School of Natural and Applied Sciences. Electrical and Electronics Engineering., Middle East Technical University, 2019.