Real-time bandwidth encapsulation for IP/MPLS Protection Switching

Bandwidth reservation and bandwidth allocation are needed to guarantee the protection of voice traffic during network failure. Since voice calls have a time constraint of 50 ms within which the traffic must be recovered, a real-time bandwidth management scheme is required. Such bandwidth allocation scheme that prioritizes voice traffic will ensure that the voice traffic is guaranteed the necessary bandwidth during the network failure. Additionally, a mechanism is also required to provide the bandwidth to voice traffic when the reserved bandwidth is insufficient to accommodate voice traffic. This mechanism must be able to utilise the working bandwidth or bandwidth reserved for lower priority applications and allocate it to the voice traffic when a network failure occurs

User-Centric Quality of Service Provisioning in IP Networks

The Internet has become the preferred transport medium for almost every type of communication, continuing to grow, both in terms of the number of users and delivered services. Efforts have been made to ensure that time sensitive applications receive sufficient resources and subsequently receive an acceptable Quality of Service (QoS). However, typical Internet users no longer use a single service at a given point in time, as they are instead engaged in a multimedia-rich experience, comprising of many different concurrent services. Given the scalability problems raised by the diversity of the users and traffic, in conjunction with their increasing expectations, the task of QoS provisioning can no longer be approached from the perspective of providing priority to specific traffic types over coexisting services; either through explicit resource reservation, or traffic classification using static policies, as is the case with the current approach to QoS provisioning, Differentiated Services (Diffserv). This current use of static resource allocation and traffic shaping methods reveals a distinct lack of synergy between current QoS practices and user activities, thus highlighting a need for a QoS solution reflecting the user services. The aim of this thesis is to investigate and propose a novel QoS architecture, which considers the activities of the user and manages resources from a user-centric perspective. The research begins with a comprehensive examination of existing QoS technologies and mechanisms, arguing that current QoS practises are too static in their configuration and typically give priority to specific individual services rather than considering the user experience. The analysis also reveals the potential threat that unresponsive application traffic presents to coexisting Internet services and QoS efforts, and introduces the requirement for a balance between application QoS and fairness. This thesis proposes a novel architecture, the Congestion Aware Packet Scheduler (CAPS), which manages and controls traffic at the point of service aggregation, in order to optimise the overall QoS of the user experience. The CAPS architecture, in contrast to traditional QoS alternatives, places no predetermined precedence on a specific traffic; instead, it adapts QoS policies to each individual’s Internet traffic profile and dynamically controls the ratio of user services to maintain an optimised QoS experience. The rationale behind this approach was to enable a QoS optimised experience to each Internet user and not just those using preferred services. Furthermore, unresponsive bandwidth intensive applications, such as Peer-to-Peer, are managed fairly while minimising their impact on coexisting services. The CAPS architecture has been validated through extensive simulations with the topologies used replicating the complexity and scale of real-network ISP infrastructures. The results show that for a number of different user-traffic profiles, the proposed approach achieves an improved aggregate QoS for each user when compared with Best effort Internet, Traditional Diffserv and Weighted-RED configurations. Furthermore, the results demonstrate that the proposed architecture not only provides an optimised QoS to the user, irrespective of their traffic profile, but through the avoidance of static resource allocation, can adapt with the Internet user as their use of services change.France Teleco

Extending OWns to include protection functionality

The objective of this dissertation is to enhance the functionality of an existing simulation package that is used to simulate fiber optic networks. These enhancements include the capability to simulate protection mechanisms following link failure, which is a necessity in real-world optical networks to ensure the continued flow of information following a failure in a part of the network. The capability for network traffic to choose from additional paths is also an addition to the software. The enhanced, as well as the original simulation software, are open source: this allows anyone to freely modify and improve the source code to suit his or her requirements. This dissertation will focus on mesh-based optical network topologies, which are commonly found in regional optical backbone networks, but which are also increasingly found in metropolitan areas. The regional networks all make use of wavelength division multiplexing (WDM), which consists of putting multiple different wavelengths of light on the same physical fiber. A single fiber breakage will therefore disrupt multiple fiber-optic connections. A fiber-optic network designer has to satisfy various conflicting requirements when designing a network: it must satisfy current and predicted future traffic requirements, it must be immune to equipment failure, but it must also be as inexpensive as possible. The network designer therefore has to evaluate different topologies and scenarios, and a good network simulator will provide invaluable assistance in finding an optimal solution. Protection and restoration need to be looked at in conjunction with routing and wavelength assignment (RWA), to ensure that resources in a network are used at maximum efficiency. Connection restoration time will also be looked at: this should be minimised to ensure minimal network downtime and ensuing loss of revenue. The chosen alternate connection path should also be as short as possible to minimise use of resources and maximise the carrying capacity of the network. Blocking probability (the inability to establish a connection due to a congested network) is a crucial factor and is also investigated. The topologies investigated in this dissertation consist of various mesh based real-world regional WDM fiber-optic networks. The impact of various link failures, the addition of additional alternate paths, as well as the effect of a protection mechanism on these topologies are also investigated. The proposed goals were all successfully achieved. The capability of simulating single as well as multiple link failures was introduced to the simulation package. The blocking probability of various network topologies was compared to each other in the presence of link failures. Success was also achieved in the introduction of a third alternate path to the simulation package.Dissertation (MEng(Electronic))--University of Pretoria, 2005.Electrical, Electronic and Computer Engineeringunrestricte

QoS-aware Mobility Management in IP-based Communication Networks

Der allgegenwärtige Zugang zu Informationen, jederzeit und überall, ist ein wichtiges Merkmal künftiger All-IP-Mobilfunktnetze, die verschiedene Systeme miteinander verbinden, dabei dynamischer und flexibler sein werden. Der Einsatz dieser Netze erfordert es jedoch, viele Herausforderungen zu überwinden. Eine der wichtigsten im Rahmen dieser Arbeit, ist die Frage, wie Quality of Service (QoS) Eigenschaften in solchen hoch dynamischen, mobilen Umgebungen zu garantieren sind. Bekanntermaßen beeinflusst die Mobilität von Mobilknoten (MN) die Dienstgüte in mobilen Netzen, da QoS-Parameters für die Ende-zu-Ende-Kommunikation vereinbart werden. Daher müssen Lösungen entwickelt werden, die nahtlose Mobilität, bei gleichzeitigen QoS-Garantien nach Handoffs, unterstützen. Diese Herausforderung ist das Hauptziel der vorliegenden Dissertation, die einen umfassenden Überblick über die bestehenden Mobilitäts- und QoS-Managment-Lösungen in IP-basierten Netzen liefert, gefolgt von einem Einblick in Methoden zur Kopplung von Mobilitätsmanagement und QoS-Lösungen. Nach Betrachtung der Vor- und Nachteile bestehender Ansätze, kommt die Dissertation zu dem Schluss, dass hybride Strategien vielversprechend sind und zu praktikablen Lösungen weiterentwickelt werden können, die sowohl Mobilitäts- als auch QoS-Anforderungen auf effiziente Weise,in allen zukünftigen IP-Mobilfunknetzen erfüllen können. Auf dieser Grundlage schlägt die Dissertation ein neues Hybrid-Protokoll, genannt "QoS-aware Mobile IP Fast Authentication Protocol" (QoMIFA), vor. Unser Vorschlag integriert MIFA als Mobilitäts-Management-Protokoll mit RSVP als QoS Reservierungsprotokoll. MI-FA wird aufgrund seiner Fähigkeit zu schnellen, sicheren und robusten Handoffs gewählt. RSVP hingegen dient als Standardlösung zur Bereitstellung von QoS in bestehenden IP-basierten Netzen. Unter Einhaltung der Hybrid-Architektur wird RSVP um ein neues Objekt, genannt "Mobility Object" erweitert, welches MIFA-Kontrollnachrichten kapselt. Nach der Spezifikation des neuen Vorschlags, bewertet die Dissertation auch seine Leistung im Vergleich zu dem bekannten "Simple QoS Signaling Protocol" (Simple QoS), mittels Simulationsstudien, modelliert mit dem "Network Simluator 2" (NS2). In der Auswertung werden der Einflusses der Netzwerklast und der Geschwindigkeit des Mobilknotens untersucht. Die hierzu verwendeten Leistungsparameter umfassen die Ressourcen-Reservierungs-Latenz, die Anzahl verlorener Pakete pro Handoff, die Anzahl der, vor Abschluss der Reservierung, mit Best-Effort-Eigenschaften übertragenen Pakete pro Handoff und die Wahrscheinlichkeit von Verbindungsabbrüchen. Unsere mittels Simulation erzielten Ergebnisse zeigen, dass QoMIFA schnelle und nahtlose Handoffs mit schneller Ressourcenreservierung nach Handoffs kombinieren kann. Unter Berücksichtigung des Einflusses der Netzwerklast, ist nachweisbar, dass QoMIFA eine besser Leistung als Simple QoS in allen untersuchten Szenarien mit geringer, mittlerer und hoher Last erreicht. Bei Betrachtung des Einflusses der Bewegungsgeschwindigkeit des Mobilknotens auf die Leistung, lassen sich unter beiden Protokollen Ping-Pong-Effekte beobachten, welche zu höheren Ressourcen-Reservierungs-Latenzen, mehr verlorenen Paketen und mehr Best-Effort-Paketen pro Handoff bei geringeren Geschwindigkeiten führen. Der stärkste Einfluss dieser Pinp-Pong-Effekte ist jeweils bei 3 km/h zu beobachten. Allerdings verhält sich QoMIFA unter allen untersuchten Bewegungsgeschwindigkeiten besser als Simple QoS und kann Mobilknoten auch bei hohen Geschwindigkeiten bedienen. In Anschluss an die simulationsgestützte Evaluierung, schätzt die Dissertation die Signalisierungskosten beider Protokolle unter Betrachtung der Kosten für Ortslokalise-rung und Paketzustellung. Im Ergebnis erreicht QoMIFA die zuvor genannten Leistungsverbesserungen auf Kosten von größeren Ortslokalisierungskosten und leicht höherer Paketzustellungskosten.Ubiquitous access to information anywhere, anytime and anyhow is an important feature of future all-IP mobile communication networks, which will interconnect various systems and be more dynamic and flexible. The deployment of these networks, however, requires overcoming many challenges. One of the main challenges of interest for this work is how to provide Qual-ity of Service (QoS) guarantees in such highly dynamic mobile environments.As known, mobility of Mobile Nodes (MNs) affects the QoS in mobile networks since QoS parameters are made for end-to-end communications. Therefore, it is a challenge to develop new solutions capable of supporting seamless mobility while simultaneously providing QoS guarantees after handoffs. Addressing this challenge is the main objective of this dissertation, which provides a comprehensive overview of mobility management solutions and QoS mech-anisms in IP-based networks followed by an insight into how mobility management and QoS solutions can be coupled with each other. Following the highlight of the state of art along with the pros and cons of existing approaches, the dissertation concludes that hybrid strategies are promising and can be further developed to achieve solutions that are capable of simultaneous-ly supporting mobility and QoS, simple from the implementation point of view, efficient and applicable to future all-IP mobile communication networks.Based on this, the dissertation proposes a new hybrid proposal named QoS-aware Mobile IP Fast Authentication Protocol (QoMIFA). Our proposal integrates MIFA as a mobility man-agement protocol with RSVP as a QoS reservation protocol. MIFA is selected due to its capa-bility of the provision of fast, secure and robust handoffs, while RSVP is chosen because it presents the standard solution used to support QoS in existing IP-based networks. The hybrid architecture is retained by introducing a new object, called “mobility object”, to RSVP in or-der to encapsulate MIFA control messages.Following the specification of the new proposal, the dissertation also evaluates its perfor-mance compared to the well-known Simple QoS signaling protocol (Simple QoS) by means of simulation studies modeled using the Network Simulator 2 (NS2). The evaluation compris-es the investigation of the impact of network load and MN speed. The performance measures we are interested in studying comprise the resource reservation latency, number of dropped packets per handoff, number of packets sent as best-effort per handoff until the reservation is accomplished and probability of dropping sessions. Our simulation results show that QoMIFA is capable of achieving fast and smooth handoffs in addition to its capability of quickly re-serving resources after handoffs. Considering the impact of network load, QoMIFA outper-forms Simple QoS in all studied scenarios (low- , middle- and high-loaded scenarios). With respect to the impact of MN speed, it can be observed that the impact of ping-pong effects is seen with both protocols and results in higher resource reservation latency, more dropped packets per handoff and more best-effort packets per handoff at low speeds than at higher ones. The worst impact of ping-pong effects is seen at a speed of 3 km/h when employing QoMIFA and Simple QoS, respectively. However, QoMIFA remains performing significantly better than Simple QoS under all studied MN speeds and can even properly serve MNs mov-ing at high speeds.Following the simulative evaluation, the dissertation estimates the signaling cost of both stud-ied protocols with respect to the location update and packet delivery cost. Our results show that QoMIFA achieves the above mentioned performance improvements at the cost of greater location update cost and slightly higher packet delivery cost than Simple QoS

Classification and Comparative Study of Routing Techniques in Adhoc Wireless Networks

Wireless systems have been in use since 1980s. We have seen their evolutions to first, second and third generation's wireless systems. Wireless systems operate with the aid of a centralized supporting structure such as an access point. These access points assist the wireless users to keep connected with the wireless system, when they roam from one place to the other. The presence of a fixed supporting structure limits the adaptability of wireless systems. In other words, the technology cannot work effectively in places where there is no fixed infrastructure. Future generation wireless systems will require easy and quick deployment of wireless networks. This quick network deployment is not possible with the Infrastructured wireless systems. Recent advancements such as Bluetooth introduced a new type of wireless systems known as ad-hoc networks. Ad-hoc networks or "short live" networks operate in the absence of fixed infrastructure. They offer quick and easy network deployment in situations where it is not possible otherwise. Ad-hoc is a Latin word, which means "for this or for this only." Mobile ad-hoc network is an autonomous system of mobile nodes connected by wireless links; each node operates as an end system and a router for all other nodes in the network. Nodes in ad-hoc network are free to move and organize themselves in an arbitrary fashion. Each user is free to roam about while communication with others. The path between each pair of the users may have multiple links and the radio between them can be heterogeneous. This allows an association of various links to be a part of the same network. A mobile ad-hoc network is a collection of mobile nodes forming an ad-hoc network without the assistance of any centralized structures. These networks introduced a new art of network establishment and can be well suited for an environment where either the infrastructure is lost or where deploy an infrastructure is not very cost effective. The popular IEEE 802.11 "WI-FI" protocol is capable of providing ad-hoc network facilities at low level, when no access point is available. However in this case, the nodes are limited to send and receive information but do not route anything across the network. Ad-hoc networks can operate in a standalone fashion or could possibly be connected to a larger network such as the Internet. An ad-hoc network has certain characteristics, which imposes new demands on the routing protocol. The most important characteristic is the dynamic topology, which is a consequence of node mobility. Nodes can change position quite frequently; the nodes in an ad-hoc network can consist of laptops and personal digital assistants and are often very limited in resources such as CPU power, storage capacity, battery power and bandwidth. This means that the routing protocol should try to minimize control traffic, such as periodic update messages. The Internet Engineering Task Force currently has a working group named Mobile Ad-hoc Networks that is working on routing specifications for ad-hoc networks. This M.Phill thesis evaluates some of the protocols put forth by the working group. This evaluation is done by means of simulation using Network simulator 2 from Berkeley. This work aims at classification of the existing routing protocols of adhoc wireless networks using some definite parameters. After classification of routing protocols of adhoc wireless network, their comparative study was undertaken in order to yield category wise distribution. Furthermore performance evaluation of these protocols was carried out by employing different parameters like fading models, mobility models, traffic patterns etc using the network simulator NS-2 Hence I explore and evaluate different methods for validation of ad hoc routing protocols which are used to set up forwarding paths in spontaneous networks of mobile/Adhoc devices to accomplish the above mentioned comparative study and classification

End-to-end provisioning in multi-domain/multi-layer networks

The last decade has seen many advances in high-speed networking technologies. At the Layer 1 fiber-optic level, dense wavelength division multiplexing (DWDM) has seen fast growth in long-haul backbone/metro sectors. At the Layer 1.5 level, revamped next-generation SONET/SDH (NGS) has gained strong traction in the metro space, as a highly flexible sub-rate\u27 aggregation and grooming solution. Meanwhile, ubiquitous Ethernet (Layer 2) and IP (Layer 3) technologies have also seen the introduction of new quality of service (QoS) paradigms via the differentiated services (Diff-Serv) and integrated services (Intserv) frameworks. In recent years, various control provisioning standards have also been developed to provision these new networks, e.g., via efforts within the IETF, ITU-T, and OIF organizations. As these networks technologies gain traction, there is an increasing need to internetwork multiple domains operating at different technology layers, e.g., IP, Ethernet, SONET, DWDM. However, most existing studies have only looked at single domain networks or multiple domains operating at the same technology layer. As a result, there is now a growing level of interest in developing expanded control solutions for multi-domain/multi-layer networks, i.e., IP-SONET-DWDM. Now given the increase in the number of inter-connected domains, it is difficult for a single entity to maintain complete \u27global\u27 information across all domains. Hence, related solutions must pursue a distributed approach to handling multi-domain/multi-layer problem. Namely, key provisions are needed in the area of inter- domain routing, path computation, and signaling. The work in this thesis addresses these very challenges. Namely, a hierarchical routing framework is first developed to incorporate the multiple link types/granularities encountered in different network domains. Commensurate topology abstraction algorithms and update strategies are then introduced to help condense domain level state and propagate global views. Finally, distributed path computation and signaling setup schemes are developed to leverage the condensed global state information and make intelligent connection routing decisions. The work leverages heavily from graph theory concepts and also addresses the inherent distributed grooming dimension of multi-layer networks. The performance of the proposed framework and algorithms is studied using discrete event simulation techniques. Specifically, a range of multi-domain/multi-layer network topologies are designed and tested. Findings show that the propagation of inter-domain tunneled link state has a huge impact on connection blocking performance, lowering inter-domain connection blocking rates by a notable amount. More importantly, these gains are achieved without any notable increase in inter-domain routing loads. Furthermore, the results also show that topology abstraction is most beneficial at lower network load settings, and when used in conjunction with load-balancing routing.\u2

Localised Routing Algorithms with Quality of Service Constraints. Development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics.

School of Computing, Informatics and MediaLocalised QoS routing is a relatively new, alternative and viable approach to solve the problems of traditional QoS routing algorithms which use global state information resulting in the imposition of a large communication overhead and route flapping. They make use of a localised view of the network QoS state in source nodes to select paths and route flows to destination nodes. Proportional Sticky Routing (PSR) and Credit Based Routing (CBR) have been proposed as localised QoS routing schemes and these can offer comparable performances. However, since network state information for a specific path is only updated when the path is used, PSR and CBR operate with decision criteria that are often stale for paths that are used infrequently. The aim of this thesis is to focus on localised QoS routing and contribute to enhancing the scalability of QoS routing algorithms. In this thesis we have developed three new localised QoS routing schemes which are called Score Based QoS Routing (SBR), Bandwidth Based QoS Routing (BBR) and Delay Based Routing (DBR). In some of these schemes, the path setup procedure is distributed and uses the current network state to make decisions thus avoiding problems of staleness. The methods also avoid any complicated calculations. Both SBR and BBR use bandwidth as the QoS metric and mean delay is used as the QoS metric in DBR. Extensive simulations are applied to compare the performance of our proposed algorithms with CBR and the global Dijkstra¿s algorithm for different update intervals of link state, different network topologies and using different flow arrival distributions under a wide range of traffic loads. It is demonstrated by simulation that the three proposed algorithms offer a superior performance under comparable conditions to the other localised and global algorithms

Hybrid SDN Evolution: A Comprehensive Survey of the State-of-the-Art

Software-Defined Networking (SDN) is an evolutionary networking paradigm which has been adopted by large network and cloud providers, among which are Tech Giants. However, embracing a new and futuristic paradigm as an alternative to well-established and mature legacy networking paradigm requires a lot of time along with considerable financial resources and technical expertise. Consequently, many enterprises can not afford it. A compromise solution then is a hybrid networking environment (a.k.a. Hybrid SDN (hSDN)) in which SDN functionalities are leveraged while existing traditional network infrastructures are acknowledged. Recently, hSDN has been seen as a viable networking solution for a diverse range of businesses and organizations. Accordingly, the body of literature on hSDN research has improved remarkably. On this account, we present this paper as a comprehensive state-of-the-art survey which expands upon hSDN from many different perspectives