Architecture, design, and modeling of the OPSnet asynchronous optical packet switching node

An all-optical packet-switched network supporting multiple services represents a long-term goal for network operators and service providers alike. The EPSRC-funded OPSnet project partnership addresses this issue from device through to network architecture perspectives with the key objective of the design, development, and demonstration of a fully operational asynchronous optical packet switch (OPS) suitable for 100 Gb/s dense-wavelength-division multiplexing (DWDM) operation. The OPS is built around a novel buffer and control architecture that has been shown to be highly flexible and to offer the promise of fair and consistent packet delivery at high load conditions with full support for quality of service (QoS) based on differentiated services over generalized multiprotocol label switching

Using Self-management for Establishing Light Paths in Optical Networks: an Overview

Current optical networks are generally composed of multi-service optical switches, which enable forwarding of data at multiple levels. Huge flows at the packet-level (IP-level) may be moved to the optical-level, which is faster than the packet-level. Such move could be beneficial since congested IP networks could be off-loaded, leaving more resources for other IP flows. At the same time, the flows switched at the optical-level would receive better Quality of Service (QoS). The transfer of those flows to the optical-level requires the creation of dedicated light paths to carry them. Currently, two approaches are used for that purpose: the first is based on conventional management techniques and the second is based on GMPLS signalling. In both approaches, the decision which IP flows will be moved to light paths is taken by managers. Therefore, only IP flows explicitly selected by such managers will take advantage of being transferred over light path connections. However, it may be that there are also other large IP flows, not known to the manager, that could potentially profit from being moved to the optical-level. The idea proposed in this paper is therefore to add self-management capabilities to the multi-service optical switches and make them responsible for identifying which IP flows should be moved to the optical level and establish and release light path connections for such flows

Deliverable DJRA1.2. Solutions and protocols proposal for the network control, management and monitoring in a virtualized network context

This deliverable presents several research proposals for the FEDERICA network, in different subjects, such as monitoring, routing, signalling, resource discovery, and isolation. For each topic one or more possible solutions are elaborated, explaining the background, functioning and the implications of the proposed solutions.This deliverable goes further on the research aspects within FEDERICA. First of all the architecture of the control plane for the FEDERICA infrastructure will be defined. Several possibilities could be implemented, using the basic FEDERICA infrastructure as a starting point. The focus on this document is the intra-domain aspects of the control plane and their properties. Also some inter-domain aspects are addressed. The main objective of this deliverable is to lay great stress on creating and implementing the prototype/tool for the FEDERICA slice-oriented control system using the appropriate framework. This deliverable goes deeply into the definition of the containers between entities and their syntax, preparing this tool for the future implementation of any kind of algorithm related to the control plane, for both to apply UPB policies or to configure it by hand. We opt for an open solution despite the real time limitations that we could have (for instance, opening web services connexions or applying fast recovering mechanisms). The application being developed is the central element in the control plane, and additional features must be added to this application. This control plane, from the functionality point of view, is composed by several procedures that provide a reliable application and that include some mechanisms or algorithms to be able to discover and assign resources to the user. To achieve this, several topics must be researched in order to propose new protocols for the virtual infrastructure. The topics and necessary features covered in this document include resource discovery, resource allocation, signalling, routing, isolation and monitoring. All these topics must be researched in order to find a good solution for the FEDERICA network. Some of these algorithms have started to be analyzed and will be expanded in the next deliverable. Current standardization and existing solutions have been investigated in order to find a good solution for FEDERICA. Resource discovery is an important issue within the FEDERICA network, as manual resource discovery is no option, due to scalability requirement. Furthermore, no standardization exists, so knowledge must be obtained from related work. Ideally, the proposed solutions for these topics should not only be adequate specifically for this infrastructure, but could also be applied to other virtualized networks.Postprint (published version

Pareto based bat algorithm for multi objectives multiple constraints optimization in GMPLS networks

Modern communication networks offer advance and diverse applications, which require huge usage of network resources while providing quality of services to the users. Advance communication is based on multiple switched networks that cannot be handle by traditional IP (internet protocol) networks. GMPLS (Generalized multiprotocol label switched) networks, an advance version of MPLS (multiprotocol label switched networks), are introduced for multiple switched networks. Traffic engineering in GMPLS networks ensures traffic movement on multiple paths. Optimal path(s) computation can be dependent on multiple objectives with multiple constraints. From optimization prospective, it is an NP (non-deterministic polynomial-time) hard optimization problem, to compute optimal paths based on multiple objectives having multiple constraints. The paper proposed a metaheuristic Pareto based Bat algorithm, which uses two objective functions; routing costs and load balancing costs to compute the optimal path(s) as an optimal solution for traffic engineering in MPLS/GMPLS networks. The proposed algorithm has implemented on different number of nodes in MPLS/GMPLS networks, to analysis the algorithm performance

A Framework for Optimized Bandwidth Allocation to LSPs in an MPLS Network

Bandwidth allocation is a vital issue in the emerging MPLS technology in the area of computer networking. There is need to ensure an ecient and congestion free trac through suitable bandwidth allocation. Though some algorithms exist to address this issue, it is felt that more optimized algorithms can be benecial. \Weighted Max-Min congestion control algorithm" [1] by Marty and Ali, proposed a basis of congestion control. The \Weighted Proportional fair rate allocation algorithm"[2] and\Adaptive Bandwidth Allocation Algorithm"[3] addressed the issue of congestion control in MPLS networks. The above approaches used the concept of predened weights to the LSPs which means that bandwidth is allocated according to some presumptions. This may lead to some amount of unused bandwidth and a situation may arise where bandwidth is allocated to an LSP which doesnt utilize it fully but there exists another LSP which falls short of its current bandwidth requirement. To account for the changing bandwidth needs and also the current datarate of the LSPs, this paper proposes a framework for fair bandwidth allocation to the LSPs in a more optimized manner. In addition to the algorithm, we include a simulation of a static bandwidth allocation approach using RSVP-TE with MPLS in OMNET++ IDE integrated with INET framework. We compare the parameter of queue length for all interfaces of all LSRs in the network and for a particular interface at dierent datarate values. We show from our observations that with increasing datarate, the average queue length gradually decreases