No abstract

No abstract

No abstract

In Spectrum-Sliced Elastic Optical Path Networks (SLICE), the lightpath bandwidth is variable and the virtual topology overlay on a physical topology shall be designed to optimize the spectrum utilization. Under static traffic, SLICE networks are typically designed through a Mixed Integer Linear Programming (MILP) with the aim of minimizing the spectrum utilization. In this paper, a new MILP formulation for protection in SLICE networks is proposed, which uses the concept of bandwidth squeezing and grooming to guarantee a minimum agreed bandwidth for each source-destination pair in the surviving bandwidth. The route for each demand on the physical topology is determined by balance equations together with physical layer constraints in the formulation, so that no pre-calculated routes are required and the modulation format of each established lightpath may be chosen with enough quality of transmission and save network spectrum. Therefore, the proposed formulation jointly solves the virtual topology design and physical topology design problems. The first results evaluate the effectiveness of the MILP formulation for two small networks when connections are under different Service Level Agreement (SLA) requirements and are provisioned by an appropriate protection scheme and different modulation formats. Due to the NP-hard nature of the proposed MILP formulation, a heuristic algorithm for moderately large networks is also proposed. Case studies are carried out in order to analyze the basic properties of the formulation and the performance of the proposed heuristic. With the proposed formulation, it is possible to identify the configurations that ensure minimum spectrum occupation with different kinds of protection for each lightpath. Different kinds of modulation formats are considered and contrasted to the benchmark case of a single modulation format and using the same kind of protection for all lightpaths.

No abstract

No abstract

In this paper we develop an analytical model for the FIFO delay-line buffer in asynchronous optical networks with any packet length distribution, under the assumption that arrivals are Poissonian. We consider that the incoming traffic is distributed among an infinite number of inputs (Aloha traffic) and show that this consideration represents very suitably a real system. The model enables the exact calculation of packet loss probability and average delay, which makes it a very powerful tool for performance evaluation and planning/dimensioning of networks that use this kind of contention resolution technique. The buffer performance as predicted by the model is compared with simulations and discussed for some packet length distributions.

No abstract