229 research outputs found

    Benchmarking and viability assessment of optical packet switching for metro networks

    Get PDF
    Optical packet switching (OPS) has been proposed as a strong candidate for future metro networks. This paper assesses the viability of an OPS-based ring architecture as proposed within the research project DAVID (Data And Voice Integration on DWDM), funded by the European Commission through the Information Society Technologies (IST) framework. Its feasibility is discussed from a physical-layer point of view, and its limitations in size are explored. Through dimensioning studies, we show that the proposed OPS architecture is competitive with respect to alternative metropolitan area network (MAN) approaches, including synchronous digital hierarchy, resilient packet rings (RPR), and star-based Ethernet. Finally, the proposed OPS architectures are discussed from a logical performance point of view, and a high-quality scheduling algorithm to control the packet-switching operations in the rings is explained

    Node design in optical packet switched networks

    Get PDF

    Packet Size Optimization for Cognitive Radio Sensor Networks Aided Internet of Things

    Get PDF
    Cognitive Radio Sensor Networks (CRSN) is state of the art communication paradigm for power constrained short range data communication. It is one of the potential technology adopted for Internet of Things (IoT) and other futuristic Machine to Machine (M2M) based applications. Many of these applications are power constrained and delay sensitive. Therefore, CRSN architecture must be coupled with different adaptive and robust communication schemes to take care of the delay and energy-efficiency at the same time. Considering the tradeoff that exists in terms of energy efficiency and overhead delay for a given data packet length, it is proposed to transmit the physical layer payload with an optimal packet size (OPS) depending on the network condition. Furthermore, due to the cognitive feature of CRSN architecture overhead energy consumption due to channel sensing and channel handoff plays a critical role. Based on the above premises, in this paper we propose a heuristic exhaustive search based Algorithm-1 and a computationally efficient suboptimal low complexity Karuh-Kuhn- Tucker (KKT) condition based Algorithm-2 to determine the optimal packet size in CRSN architecture using variable rate m-QAM modulation. The proposed algorithms are implemented along with two main cognitive radio assisted channel access strategies based on Distributed Time Slotted-Cognitive Medium Access Control (DTS-CMAC) and Centralized Common Control Channel based Cognitive Medium Access Control (CC-CMAC) and their performances are compared. The simulation results reveals that proposed Algorithm-2 outperforms Algorithm-1 by a significant margin in terms of its implementation time. For the exhaustive search based Algorithm-1 the average time consumed to determine OPS for a given number of cognitive users is 1.2 seconds while for KKT based Algorithm-2 it is of the order of 5 to 10 ms. CC-CMAC with OPS is most efficient in terms of overall energy consumption but incurs more delay as compared to DTS-CMAC with OPS scheme

    On the highly stable performance of loss-free optical burst switching networks

    Get PDF
    Increase of bandwidth demand in data networks, driven by the continuous growth of the Internet and the increase of bandwidth greedy applications, raise the issue of how to support all the bandwidth requirements in the near future. Three optical switching paradigms have been defined and are being investigated: Optical Circuit Switching (OCS); Optical Packet Switching (OPS); and Optical Burst Switching (OBS). Among these paradigms, OBS is seen as the most appropriate solution today. However, OBS suffers from high burst loss as a result of contention in the bufferless mode of operation. This issue was investigated by Coutelen et al., 2009 who proposed the loss-free CAROBS framework whereby signal convertors of the optical signal to the electrical domain ensure electrical buffering. Convertors increase the network price which must be minimized to reduce the installation and operating costs of the CAROBS framework. An analysis capturing convertor requirements, with respect to the number of merging flows and CAROBS node offered load, was carried out. We demonstrated the convertor location significance, which led to an additional investigation of the shared wavelength convertors scenario. Shared wavelength convertors significantly decrease the number of required convertors and show great promise for CAROBS. Based on this study we can design a CAROBS network to contain a combination of simple and complex nodes that include none or some convertors respectively, a vital feature of network throughput efficiency and cost

    Multiservice QoS-Enabled MAC for Optical Burst Switching

    Get PDF
    The emergence of a broad range of network-driven applications (e.g., multimedia, online gaming) brings in the need for a network environment able to provide multiservice capabilities with diverse quality-of-service (QoS) guarantees. In this paper, a medium access control protocol is proposed to support multiple services and QoS levels in optical burst-switched mesh networks without wavelength conversion. The protocol provides two different access mechanisms, queue-arbitrated and prearbitrated for connectionless and connection-oriented burst transport, respectively. It has been evaluated through extensive simulations and its simplistic form makes it very promising for implementation and deployment. Results indicate that the protocol can clearly provide a relative quality differentiation for connectionless traffic and guarantee null (or negligible, and thus acceptable) burst loss probability for a wide range of network (or offered) load while ensuring low access delay for the higher-priority traffic. Furthermore, in the multiservice scenario mixing connectionless and connection-oriented burst transmissions, three different prearbitrated slot scheduling algorithms are evaluated, each one providing a different performance in terms of connection blocking probability. The overall results demonstrate the suitability of this architecture for future integrated multiservice optical networks

    Benchmarking and viability assessment of optical packet switching for metro networks

    Get PDF
    Optical packet switching (OPS) has been proposed as a strong candidate for future metro networks. This paper assesses the viability of an OPS-based ring architecture as proposed within the research project DAVID (Data And Voice Integration on DWDM), funded by the European Commission through the Information Society Technologies (IST) framework. Its feasibility is discussed from a physical-layer point of view, and its limitations in size are explored. Through dimensioning studies, we show that the proposed OPS architecture is competitive with respect to alternative metropolitan area network (MAN) approaches, including synchronous digital hierarchy, resilient packet rings (RPR), and star-based Ethernet. Finally, the proposed OPS architectures are discussed from a logical performance point of view, and a high-quality scheduling algorithm to control the packet-switching operations in the rings is explained

    Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM

    Get PDF
    We propose a multi-class mechanism for Optical Code Division Multiplexing (OCDM), Wavelength Division Multiplexing (WDM) Optical Packet Switch (OPS) architecture capable of supporting Quality of Service (QoS) transmission. OCDM/WDM has been proposed as a competitive hybrid switching technology to support the next generation optical Internet. This paper addresses performance issues in the slotted OPS networks and proposed four differentiation schemes to support Quality of Service. In addition, we present a comparison between the proposed schemes as well as, a simulation scheduler design which can be suitable for the core switch node in OPS networks. Using software simulations the performance of our algorithm in terms of losing probability, the packet delay, and scalability is evaluated
    corecore