36 research outputs found

    Architectures and protocols for sub-wavelength optical networks: contributions to connectionless and connection-oriented data transport

    Get PDF
    La r脿pida evoluci贸 d鈥橧nternet i l鈥櫭爉plia gamma de noves aplicacions (per exemple, multim猫dia, videoconfer猫ncia, jocs en l铆nia, etc.) ha fomentat canvis revolucionaris en la manera com ens comuniquem. A m茅s, algunes d鈥檃questes aplicacions demanden grans quantitats de recursos d鈥檃mple de banda amb diversos requeriments de qualitat de servei (QoS). El desenvolupament de la multiplexaci贸 per divisi贸 de longitud d鈥檕na (WDM) en els anys noranta va fer molt rendible la disponibilitat d鈥檃mple de banda. Avui dia, les tecnologies de commutaci贸 貌ptica de circuits s贸n predominants en el nucli de la xarxa, les quals permeten la configuraci贸 de canals (lightpaths) a trav茅s de la xarxa. No obstant aix貌, la granularitat d鈥檃quests canals ocupa tota la longitud d鈥檕na, el que fa que siguin ineficients per a proveir canals de menor ample de banda (sub-longitud d鈥檕na). Segons la comunitat cient铆fica, 茅s necessari augmentar la transpar猫ncia dels protocols, aix铆 com millorar l鈥檃provisionament d鈥檃mple de banda de forma din脿mica. Per tal de fer aix貌 realitat, 茅s necessari desenvolupar noves arquitectures. La commutaci贸 貌ptica de r脿fegues i de paquets (OBS/OPS), s贸n dues de les tecnologies proposades. Aquesta tesi contribueix amb tres arquitectures de xarxa destinades a millorar el transport de dades sub-longitud d鈥檕na. En primer lloc, aprofundim en la naturalesa sense connexi贸 en OBS. En aquest cas, la xarxa incrementa el seu dinamisme a causa de les transmissions a r脿fega. A m茅s, les col路lisions entre r脿fegues degraden el rendiment de la xarxa fins i tot a c脿rregues molt baixes. Per fer front a aquestes col路lisions, es proposa un esquema de resoluci贸 de col路lisions pro actiu basat en un algorisme d鈥檈ncaminament i assignaci贸 de longitud d鈥檕na (RWA) que balanceja de forma autom脿tica i distribu茂da la c脿rrega en la xarxa. En aquest protocol, el RWA i la transmissi贸 de r脿fegues es basen en l鈥檈xplotaci贸 i exploraci贸 de regles de commutaci贸 que incorporen informaci贸 sobre contencions i encaminament. Per donar suport a aquesta arquitectura, s鈥檜tilitzen dos tipus de paquets de control per a l鈥檈ncaminament de les r脿fegues i l鈥檃ctualitzaci贸 de les regles de commutaci贸, respectivament. Per analitzar els beneficis del nou algorisme, s鈥檜tilitzen quatre topologies de xarxa diferents. Els resultats indiquen que el m猫tode proposat millora en diferents marges la resta d鈥檃lgorismes RWA en funci贸 de la topologia i sense penalitzar altres par脿metres com el retard extrem a extrem. La segona contribuci贸 proposa una arquitectura h铆brida sense i orientada a connexi贸 sobre la base d鈥檜n protocol de control d鈥檃cc茅s al medi (MAC) per a xarxes OBS (DAOBS). El MAC ofereix dos m猫todes d鈥檃cc茅s: arbitratge de cua (QA) per a la transmissi贸 de r脿fegues sense connexi贸, i pre-arbitratge (PA) per serveis TDM orientats a connexi贸. Aquesta arquitectura permet una 脿mplia gamma d鈥檃plicacions sensibles al retard i al bloqueig. Els resultats avaluats a trav茅s de simulacions mostren que en l鈥檃cc茅s QA, les r脿fegues de m茅s alta prioritat tenen garantides zero p猫rdues i lat猫ncies d鈥檃cc茅s molt baixes. Pel que fa a l鈥檃cc茅s PA, es reporta que la duplicaci贸 de la c脿rrega TDM augmenta en m茅s d鈥檜n ordre la probabilitat de bloqueig, per貌 sense afectar en la mateixa mesura les r脿fegues sense connexi贸. En aquest cap铆tol tamb茅 es tracten dos dels problemes relacionats amb l鈥檃rquitectura DAOBS i el seu funcionament. En primer lloc, es proposa un model matem脿tic per aproximar el retard d鈥檃cc茅s inferior i superior com a conseq眉猫ncia de l鈥檃cc茅s QA. En segon lloc, es formula matem脿ticament la generaci贸 i optimitzaci贸 de les topologies virtuals que suporten el protocol per a l鈥檈scenari amb tr脿fic est脿tic. Finalment, l鈥櫭簂tima contribuci贸 explora els beneficis d鈥檜na arquitectura de xarxa 貌ptica per temps compartit (TSON) basada en elements de c脿lcul de camins (PCE) centralitzats per tal d鈥檈vitar col路lisions en la xarxa. Aquesta arquitectura permet garantir l鈥檃provisionament orientat a connexi贸 de canals sub-longitud d鈥檕na. En aquest cap铆tol proposem i simulem tres arquitectures GMPLS/PCE/TSON. A causa del enfocament centralitzat, el rendiment de la xarxa dep猫n en gran mesura de l鈥檃ssignaci贸 i aprovisionament de les connexions. Amb aquesta finalitat, es proposen diferents algorismes d鈥檃ssignaci贸 de ranures temporals i es comparen amb les corresponents formulacions de programaci贸 lineal (ILP) per al cas est脿tic. Per al cas de tr脿fic din脿mic, proposem i avaluem mitjan莽ant simulaci贸 diferents heur铆stiques. Els resultats mostren els beneficis de proporcionar flexibilitat en els dominis temporal i freq眉encial a l鈥檋ora d鈥檃ssignar les ranures temporals.The rapid evolving Internet and the broad range of new data applications (e.g., multimedia, video-conference, online gaming, etc.) is fostering revolutionary changes in the way we communicate. In addition, some of these applications demand for unprecedented amounts of bandwidth resources with diverse quality of service (QoS). The development of wavelength division multiplexing (WDM) in the 90's made very cost-effective the availability of bandwidth. Nowadays, optical circuit switching technologies are predominant in the core enabling the set up of lightpaths across the network. However, full-wavelength lightpath granularity is too coarse, which results to be inefficient for provisioning sub-wavelength channels. As remarked by the research community, an open issue in optical networking is increasing the protocol transparency as well as provisioning true dynamic bandwidth allocation at the network level. To this end, new architectures are required. Optical burst/packet switching (OBS/OPS) are two such proposed technologies under investigation. This thesis contributes with three network architectures which aim at improving the sub-wavelength data transport from different perspectives. First, we gain insight into the connectionless nature of OBS. Here, the network dynamics are increased due to the short-lived burst transmissions. Moreover, burst contentions degrade the performance even at very low loads. To cope with them, we propose a proactive resolution scheme by means of a distributed auto load-balancing routing and wavelength assignment (RWA) algorithm for wavelength-continuity constraint networks. In this protocol, the RWA and burst forwarding is based on the exploitation and exploration of switching rule concentration values that incorporate contention and forwarding desirability information. To support such architecture, forward and backward control packets are used in the burst forwarding and updating rules, respectively. In order to analyze the benefits of the new algorithm, four different network topologies are used. Results indicate that the proposed method outperforms the rest of tested RWA algorithms at various margins depending on the topology without penalizing other parameters such as end-to-end delay. The second contribution proposes a hybrid connectionless and connection-oriented architecture based on a medium access control (MAC) protocol for OBS networks (DAOBS). The MAC provides two main access mechanisms: queue arbitrated (QA) for connectionless bursts and pre-arbitrated (PA) for TDM connection-oriented services. Such an architecture allows for a broad range of delay-sensitive applications or guaranteed services. Results evaluated through simulations show that in the QA access mode highest priority bursts are guaranteed zero losses and very low access latencies. Regarding the PA mode, we report that doubling the offered TDM traffic load increases in more than one order their connection blocking, slightly affecting the blocking of other connectionless bursts. In this chapter, we also tackle two of the issues related with the DAOBS architecture and its operation. Firstly, we model mathematically the lower and upper approximations of the access delay as a consequence of the connectionless queue arbitrated access. Secondly, we formulate the generation of the virtual light-tree overlay topology for the static traffic case.Postprint (published version

    GMPLS-OBS interoperability and routing acalability in internet

    Get PDF
    The popularization of Internet has turned the telecom world upside down over the last two decades. Network operators, vendors and service providers are being challenged to adapt themselves to Internet requirements in a way to properly serve the huge number of demanding users (residential and business). The Internet (data-oriented network) is supported by an IP packet-switched architecture on top of a circuit-switched, optical-based architecture (voice-oriented network), which results in a complex and rather costly infrastructure to the transport of IP traffic (the dominant traffic nowadays). In such a way, a simple and IP-adapted network architecture is desired. From the transport network perspective, both Generalized Multi-Protocol Label Switching (GMPLS) and Optical Burst Switching (OBS) technologies are part of the set of solutions to progress towards an IP-over-WDM architecture, providing intelligence in the control and management of resources (i.e. GMPLS) as well as a good network resource access and usage (i.e. OBS). The GMPLS framework is the key enabler to orchestrate a unified optical network control and thus reduce network operational expenses (OPEX), while increasing operator's revenues. Simultaneously, the OBS technology is one of the well positioned switching technologies to realize the envisioned IP-over-WDM network architecture, leveraging on the statistical multiplexing of data plane resources to enable sub-wavelength in optical networks. Despite of the GMPLS principle of unified control, little effort has been put on extending it to incorporate the OBS technology and many open questions still remain. From the IP network perspective, the Internet is facing scalability issues as enormous quantities of service instances and devices must be managed. Nowadays, it is believed that the current Internet features and mechanisms cannot cope with the size and dynamics of the Future Internet. Compact Routing is one of the main breakthrough paradigms on the design of a routing system scalable with the Future Internet requirements. It intends to address the fundamental limits of current stretch-1 shortest-path routing in terms of RT scalability (aiming at sub-linear growth). Although "static" compact routing works fine, scaling logarithmically on the number of nodes even in scale-free graphs such as Internet, it does not handle dynamic graphs. Moreover, as multimedia content/services proliferate, the multicast is again under the spotlight as bandwidth efficiency and low RT sizes are desired. However, it makes the problem even worse as more routing entries should be maintained. In a nutshell, the main objective of this thesis in to contribute with fully detailed solutions dealing both with i) GMPLS-OBS control interoperability (Part I), fostering unified control over multiple switching domains and reduce redundancy in IP transport. The proposed solution overcomes every interoperability technology-specific issue as well as it offers (absolute) QoS guarantees overcoming OBS performance issues by making use of the GMPLS traffic-engineering (TE) features. Keys extensions to the GMPLS protocol standards are equally approached; and ii) new compact routing scheme for multicast scenarios, in order to overcome the Future Internet inter-domain routing system scalability problem (Part II). In such a way, the first known name-independent (i.e. topology unaware) compact multicast routing algorithm is proposed. On the other hand, the AnyTraffic Labeled concept is also introduced saving on forwarding entries by sharing a single forwarding entry to unicast and multicast traffic type. Exhaustive simulation campaigns are run in both cases in order to assess the reliability and feasible of the proposals

    Quality of service in optical burst switching networks

    Get PDF
    Tese dout., Engenharia Electr贸nica e Computa莽茫o, Universidade do Algarve, 2009Funda莽茫o para e Ci锚ncia e a Tecnologi

    On IP over WDM burst-switched long haul and metropolitan area networks

    Get PDF
    The IP over Wavelength Division Multiplexing (WDM) network is a natural evolution ushered in by the phenomenal advances in networking technologies and technical breakthroughs in optical communications, fueled by the increasing demand in the reduction of operation costs and the network management complexity. The unprecedented bandwidth provisioning capability and the multi-service supportability of the WDM technology, in synergy with the data-oriented internetworking mechanisms, facilitates a common shared infrastructure for the Next Generation Internet (NGJ). While NGI targets to perform packet processing directly on the optical transport layer, a smooth evolution is critical to success. Intense research has been conducted to design the new generation optical networks that retain the advantages of packet-oriented transport prototypes while rendering elastic network resource utilization and graded levels of service. This dissertation is focused on the control architecture, enabling technologies, and performance analysis of the WDM burst-switched long haul and Metropolitan Area Networks (MANs). Theoretical analysis and simulation results are reported to demonstrate the system performance and efficiency of proposed algorithms. A novel transmission mechanism, namely, the Forward Resource Reservation (ERR) mechanism, is proposed to reduce the end-to-end delay for an Optical Burst Switching (OBS)-based IP over WDM system. The ERR scheme adopts a Linear Predictive Filter and an aggressive reservation strategy for data burst length prediction and resource reservation, respectively, and is extended to facilitate Quality of Service (QoS) differentiation at network edges. The ERR scheme improves the real-time communication services for applications with time constraints without deleterious system costs. The aggressive strategy for channel holding time reservations is proposed. Specifically, two algorithms, the success probability-driven (SPD) and the bandwidth usage-driven (BUD) ones, are proposed for resource reservations in the FRRenabled scheme. These algorithms render explicit control on the latency reduction improvement and bandwidth usage efficiency, respectively, both of which are important figures of performance metrics. The optimization issue for the FRR-enabled system is studied based on two disciplines - addressing the static and dynamic models targeting different desired objectives (in terms of algorithm efficiency and system performance), and developing a \u27\u27crank back\u27\u27 based signaling mechanism to provide bandwidth usage efficiency. The proposed mechanisms enable the network nodes to make intelligent usage of the bandwidth resources. In addition, a new control architecture with enhanced address resolution protocol (E-ARP), burst-based transmission, and hop-based wavelength allocation is proposed for Ethernet-supported IP over WDM MANs. It is verified, via theoretical analysis and simulation results, that the E-ARP significantly reduces the call setup latency and the transmission requirements associated with the address probing procedures; the burst-based transport mechanism improves the network throughput and resource utilization; and the hop-based wavelength allocation algorithm provides bandwidth multiplexing with fairness and high scalability. The enhancement of the Ethernet services, in tandem with the innovative mechanisms in the WDM domain, facilitates a flexible and efficient integration, thus making the new generation optical MAN optimized for the scalable, survivable, and IP-dominated network at gigabit speed possible

    Traffic engineering in dynamic optical networks

    Get PDF
    Traffic Engineering (TE) refers to all the techniques a Service Provider employs to improve the efficiency and reliability of network operations. In IP over Optical (IPO) networks, traffic coming from upper layers is carried over the logical topology defined by the set of established lightpaths. Within this framework then, TE techniques allow to optimize the configuration of optical resources with respect to an highly dynamic traffic demand. TE can be performed with two main methods: if the demand is known only in terms of an aggregated traffic matrix, the problem of automatically updating the configuration of an optical network to accommodate traffic changes is called Virtual Topology Reconfiguration (VTR). If instead the traffic demand is known in terms of data-level connection requests with sub-wavelength granularity, arriving dynamically from some source node to any destination node, the problem is called Dynamic Traffic Grooming (DTG). In this dissertation new VTR algorithms for load balancing in optical networks based on Local Search (LS) techniques are presented. The main advantage of using LS is the minimization of network disruption, since the reconfiguration involves only a small part of the network. A comparison between the proposed schemes and the optimal solutions found via an ILP solver shows calculation time savings for comparable results of network congestion. A similar load balancing technique has been applied to alleviate congestion in an MPLS network, based on the efficient rerouting of Label-Switched Paths (LSP) from the most congested links to allow a better usage of network resources. Many algorithms have been developed to deal with DTG in IPO networks, where most of the attention is focused on optimizing the physical resources utilization by considering specific constraints on the optical node architecture, while very few attention has been put so far on the Quality of Service (QoS) guarantees for the carried traffic. In this thesis a novel Traffic Engineering scheme is proposed to guarantee QoS from both the viewpoint of service differentiation and transmission quality. Another contribution in this thesis is a formal framework for the definition of dynamic grooming policies in IPO networks. The framework is then specialized for an overlay architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. A family of grooming policies based on constraints on the number of hops and on the bandwidth sharing degree at the IP level is defined, and its performance analyzed in both regular and irregular topologies. While most of the literature on DTG problem implicitly considers the grooming of low-speed connections onto optical channels using a TDM approach, the proposed grooming policies are evaluated here by considering a realistic traffic model which consider a Dynamic Statistical Multiplexing (DSM) approach, i.e. a single wavelength channel is shared between multiple IP elastic traffic flows

    Telecommunications Networks

    Get PDF
    This book guides readers through the basics of rapidly emerging networks to more advanced concepts and future expectations of Telecommunications Networks. It identifies and examines the most pressing research issues in Telecommunications and it contains chapters written by leading researchers, academics and industry professionals. Telecommunications Networks - Current Status and Future Trends covers surveys of recent publications that investigate key areas of interest such as: IMS, eTOM, 3G/4G, optimization problems, modeling, simulation, quality of service, etc. This book, that is suitable for both PhD and master students, is organized into six sections: New Generation Networks, Quality of Services, Sensor Networks, Telecommunications, Traffic Engineering and Routing

    Node design in optical packet switched networks

    Get PDF
    corecore