Simulation and analysis of adaptive routing and flow control in wide area communication networks

This thesis presents the development of new simulation and analytic models for the performance analysis of wide area communication networks. The models are used to analyse adaptive routing and flow control in fully connected circuit switched and sparsely connected packet switched networks. In particular the performance of routing algorithms derived from the L(_R-I) linear learning automata model are assessed for both types of network. A novel architecture using the INMOS Transputer is constructed for simulation of both circuit and packet switched networks in a loosely coupled multi- microprocessor environment. The network topology is mapped onto an identically configured array of processing centres to overcome the processing bottleneck of conventional Von Neumann architecture machines. Previous analytic work in circuit switched work is extended to include both asymmetrical networks and adaptive routing policies. In the analysis of packet switched networks analytic models of adaptive routing and flow control are integrated to produce a powerful, integrated environment for performance analysis The work concludes that routing algorithms based on linear learning automata have significant potential in both fully connected circuit switched networks and sparsely connected packet switched networks

A novel self-routing address scheme for all-optical packet-switched networks with arbitrary topologies

Pure all-optical packet-switched networks in which both header processing and packet routing are carried out in the optical domain overcome the bandwidth bottlenecks of optoelectronic conversions and therefore are expected to meet the needs of next generation high speed networks. Due to the limited capabilities of available optical logic devices, realizations of pure all-optical packet-switched networks in the near future will likely employ routing schemes that minimize the complexity of routing control. In this paper, we propose a novel self-routing scheme that identifies the output ports of the nodes in a network instead of the nodes themselves. The proposed address scheme requires single bit processing only and is applicable to small to medium size pure all-optical packet-switched networks with arbitrary topologies. Unlike traditional self-routing schemes, multiple paths between two nodes can be defined. Hierarchical address structure can be used in the proposed routing scheme to shorten the address.published_or_final_versio

Traffic Control in Packet Switched Networks

This thesis examines traffic control options available in two existing routing solutions in packet-switched networks. The first solution is the shortest path hop-by-hop routing deployed with the OSPF or IS-IS routing protocol and the IP forwarding protocol. This is the initially deployed and still the most popular routing solution in the Internet. The second solution is explicit routing implemented with the RSVP-TE or CR-LDP signalling protocol and the MPLS forwarding protocol. This is the latest solution to have become widely deployed in the Internet. The thesis analyses the limitations of the two routing solutions as tools for traffic control and yields new insights that can guide the analysis and design of protocols involved in the process. A set of recommendations for modifications of the existing protocols is provided which would allow for a range of new traffic control approaches to be deployed in packet-switched networks. For future routing solutions which comply with the proposed recommendations two new algorithms are presented in the thesis. They are called the Link Mask Topology (LMT) algorithm, and the Link Cost Topology (LCT) algorithm. The two algorithms define a set of routing topologies and assign network traffic to routes available in these topologies aiming to simultaneously achieve high network throughput and fair resource allocation. While there are similarities in the operation of the two algorithms, their applicability is different as they allocate resources to multiple paths between two network nodes which are available in the defined routing topologies according to a different rule set. The LMT algorithm directs traffic sent between any pair of network nodes to a single route. The LCT algorithm directs traffic sent between a pair of network nodes to a number of routes. The performance of the two proposed algorithms is evaluated in the thesis with calculations comparing them to the shortest path routing algorithm in a number of test cases. The test results demonstrate the potentials of the two proposed algorithms in improving the performance of networks which employ shortest path routing

Optical routing in packet switched networks

Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2001Includes bibliographical references (leaves: 72-75)Text in English; Abstract: Turkish and Englishx, 75 leavesEver-increasing demand for high capacities brought by Internet usage forces designing faster transport networks for carrying information packets. In the last ten years much attention has been focused on transporting packets directly over the optical transport networks. Researches in this area range from simple electronic and optical switching/routing methods to hybrid and more complicated all-optical packet switching systems. However, major bottleneck in all these methods is designing fast, reliable and inexpensive optical routing/switching devices.In this thesis, a method for optical routing usmg fiber Bragg gratings is proposed. In this method, electronic interface is used only for routing information (routing table) update cycle while packet header extraction and switching is done in optical domain. Routing is performed optically by controlling the refractive index change in fiber gratings. Four bits of header (label) information is used for routing packets to three different output routes. The network is simulated and its performance is evaluated by special software of Virtual Photonics

Multipath policy routing in packet switched networks

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e TecnologiaNowadays, the continuous operations of large networks, under multiple ownerships, are of tremendous importance and as a result, routing protocols have gained numerous extensions and accumulated complexity. Policy-based routing can be of signi cance for common networks when the cost of transporting a bit is no longer the biggest pressure point. The best path problem is a generalization of the shortest path problem that suits policy based routing. This means that preferences for the paths depend on semantically rich characteristics, in which two di erent paths may have the same preference. However, current policy-based routing models cannot take full advantage of the multiplicity of connections to a given destination and are single path in nature. Therefore multipath can bring several advantages in policy based routing. Designing multipath routing protocols based on policies seem to be a problem of interest. To model routing problems, algebraic structures and graph theory are used. Through variants of classical methods of linear algebra routing problems can be solved. The objective of this dissertation is to devise a multipath policy-based routing protocol using a simple destination-based hop-by-hop protocol with independent forwarding decisions. Networks featuring these characteristics can be more resilient to failures, provide better tra c distribution and maintain a simple forwarding paradigm. The dissertation concludes with the trade-o 's between the exibility of the proposed solution, the amount of multiple paths that can be used simultaneously and the network restrictions that must be applied

An Efficient Approach for Generalized Load Balancing in Multipath Packet Switched Networks

This paper is a quantitative analysis on packet switched network with a view to generalize load balancing and determination of appropriate routing algorithm in multipath environment. Several routing algorithms have been introduced for routing of packets from source to destination. Some of them route packets accurately with increased workload and some of them drastically cut down the workload. A few of them can find out a minimum workload deviation for both UDP and TCP packets. We simulated these approaches in a well defined simulator, analyzed and evaluated their performance. After expanding our analysis with varying weights and number of paths we found that the recently proposed routing algorithm Mixed Weighted Fair Routing (MWFR) outperforms the existing routing algorithms by reducing the routing and network overhead and saving the scarce bandwidth as well as CPU consumption for packet switching networks.Comment: 12 Pages, IJCNC Journal 201

An SDN Approach: Quality of Service using Big Switch’s Floodlight Open-source Controller

Quality of Service in today’s packet-switched networks have various effecting factors that include both technical and non-technical aspects. Such factors include the reliability of service, availability of service, delay, scalability, effectiveness, grade of service etc. These factors play an important role into how a particular network may treat and handle packets within a given network. Properties of packet-switched networks can cause low throughput, dropped packets, corruption errors, latency, jitter, disordered delivery and more. The role of SDN allows for network operating systems to gain greater governance of the control plane within a given network. Using this SDN approach and the specifications provided by OpenFlow (OF) 1.0[1] we show an approach to Quality of Service that is managed and defined by a centralized network controller

End-to-end synchronization in packet switched networks

The provision of real time services through a Packet Switched Network, requires the adoption of end-to-end synchronization methods. Several of these methods, are compared and a specific hardware solution is discussed. Results obtained through a specially designed Simulation Programme are included, for several network time delay jitter distributions and synchronization methods. These results are used to evaluate systems and design parameters