Statistical inference based load balanced routing in software defined networks

Download

12625795.pdf

Date

2020-10-14

Author

Kaya, Semih

Metadata

Show full item record

Item Usage Stats

494
views

342
downloads

Networks have been the main method of transferring data for more than forty years. The traffic volumes and sizes of networks have increased considerably in the last two decades. The traditional methods used in the networks to transfer data become inefficient due to this growth. Therefore, network planning and smart delivery methods have gained importance. Accordingly, traffic engineering methods are deployed to meet the faster and more efficient delivery requirements. These methods have been proven beneficial and they are still being used on every level of networking. Recently, software defined networking redefined the architecture of networks and network devices. This new architecture paved the way for more flexible network and traffic management techniques. In this thesis, we propose a new routing method, which minimizes the maximum link utilization in the software-defined networks. The proposed method defines a new cost metric based on statistical inference to distribute load evenly in the network. The method is demonstrated, and its performance is evaluated on virtual software defined network topologies under various artificial network loads. The experiments show that the proposed algorithm achieves the even distribution of traffic and minimizes the maximum link utilization in software defined networks.

Subject Keywords

Software defined networks, Routing, Traffic engineering, Minimization of maximum link utilization, Statistical inference

URI

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

Collections

Graduate School of Informatics, Thesis

Suggestions

OpenMETU
Core

Cooperative Density Estimation in Random Wireless Ad Hoc Networks Onur, Ertan; Niemegeers, Ignas (2012-03-01) Density estimation is crucial for wireless ad hoc networks for adequate capacity planning. Protocols have to adapt their operation to the density since the throughput in an ad hoc network approaches asymptotically to zero as the density increases. A wireless node can estimate the global density by using local information such as the received power from neighbors. In this paper, we propose a cross layer protocol to compute the density estimate. The accuracy of the estimate can be enhanced and its variance ca...
GEOPORTAL: TUBITAK UZAY Satellite Data Processing and Sharing System Teke, Mustafa; Tevrizoglu, Ismail; Oztoprak, Ayse Feray; Demirkesen, Can; Acikgoz, Ibrahim Serdar; Gurbuz, Sevgi Zubeyde; Kupcu, Ramazan; Avenoglu, Bulent (2015-06-19) Over the years, rapidly developing satellite technologies have greatly increased the amount and size of data; e.g. high resolution imagery of 31 cm (e.g. World View 3) and even video. As satellites become increasingly more complex and remote sensing capabilities improve, the demands on faster and more accurate data processing to enable the full potential of data exploitation likewise increases. In this light, TUBITAK UZAY has developed a satellite image processing and sharing platform, dubbed GEOPORTAL, to ...
Hierarchical Coding for Cloud Storage: Topology-Adaptivity, Scalability, and Flexibility Yang, Siyi; Hareedy, Ahmed; Calderbank, Robert; Dolecek, Lara (2022-06-01) In order to accommodate the ever-growing data from various, possibly independent, sources and the dynamic nature of data usage rates in practical applications, modern cloud data storage systems are required to be scalable, flexible, and heterogeneous. The recent rise of the blockchain technology is also moving various information systems towards decentralization to achieve high privacy at low costs. While codes with hierarchical locality have been intensively studied in the context of centralized cloud stor...
Analysis of push-type epidemic data dissemination in fully connected networks ÇAĞLAR, MİNE; Sezer, Ali Devin (2014-07-01) Consider a fully connected network of nodes, some of which have a piece of data to be disseminated to the whole network. We analyze the following push-type epidemic algorithm: in each push round, every node that has the data, i.e., every infected node, randomly chooses c E Z. other nodes in the network and transmits, i.e., pushes, the data to them. We write this round as a random walk whose each step corresponds to a random selection of one of the infected nodes; this gives recursive formulas for the distri...
Mobility and power aware data interest based data replication for mobile ad hoc networks Arslan, Seçil; Bozyiğit, Müslim; Department of Computer Engineering (2007) One of the challenging issues for mobile ad hoc network (MANET) applications is data replication. Unreliable wireless communication, mobility of network participators and limited resource capacities of mobile devices make conventional replication techniques useless for MANETs. Frequent network divisions and unexpected disconnections should be handled. In this thesis work, a novel mobility and power aware, data interest based data replication strategy is presented. Main objective is to improve data accessibi...

Citation Formats

S. Kaya, “Statistical inference based load balanced routing in software defined networks,” M.S. - Master of Science, Middle East Technical University, 2020.