On the physical and logical topology design of large-scale optical networks

We consider the problem of designing a network of optical cross-connects (OXCs) to provide end-to-end lightpath services to large numbers of label switched routers (LSRs). We present a set of heuristic algorithms to address the combined problem of physical topology design (i.e., determine the number of OXCs required and the fiber links among them) and logical topology design (i.e., determine the routing and wavelength assignment for the lightpaths among the LSRs). Unlike previous studies which were limited to small topologies with a handful of nodes and a few tens of lightpaths, we have applied our algorithms to networks with hundreds or thousands of LSRs and with a number of lightpaths that is an order of magnitude larger than the number of LSRs. In order to characterize the performance of our algorithms, we have developed lower bounds which can be computed efficiently. We present numerical results for up to 1000 LSRs and for a wide range of system parameters such as the number of wavelengths per fiber, the number of transceivers per LSR, and the number of ports per OXC. The results indicate that it is possible to build large-scale optical networks with rich connectivity in a cost-effective manner, using relatively few but properly dimensioned OXCs.     

Optimal quantization of periodic task requests on multiple identical processors

We simplify the periodic tasks scheduling problem by making a trade off between processor load and computational complexity. A set N of periodic tasks, each characterized by its density /spl rho//sub i/, contains n possibly unique values of /spl rho//sub i/. We transform N through a process called quantization, in which each /spl rho/i /spl isin/ N is mapped onto a service level s/sub j/ /spl isin/ L, where |L| = l /spl Lt/ n and /spl rho//sub i/ /spl les/ s/sub j/, (this second condition differentiates this problem from the p-median problem on the real line). We define the periodic task quantization problem with deterministic input (PTQ-D) and present an optimal polynomial time dynamic programming solution. We also introduce the problem PTQ-S (with stochastic input) and present an optimal solution. We examine, in a simulation study, the trade off penalty of excess processor load needed to service the set of quantized tasks over the original set, and find that, through quantization onto as few as 15 or 20 service levels, no more than 5 percent processor load is required above the amount requested. Finally, we demonstrate that the scheduling of a set of periodic tasks is greatly simplified through quantization and we present a fast online algorithm that schedules quantized periodic tasks.     

Edge-Reconfigurable Optical Networks (ERONs): Rationale, Network Design, and Evaluation

To bridge the gap between the current practice of setting up expensive, dedicated, lightpath connections (i.e., static topologies), and the distant future vision of inexpensive access to dynamically switched end-to-end lightpaths, we propose a medium term solution in the form of edge-reconfigurable optical networks (ERONs). An ERON is an overlay-control network created by installing readily available MEMS optical switches, and implementing a GMPLS control plane at sites interconnected by static lightpaths. The switches and control software are deployed at the edge of the network and operated by the organization-user (i.e., outside the network provider's control), hence the term ldquoedge-reconfigurablerdquo. By providing dynamic, automated control of end-to-end lightpaths, ERONs enable the sharing of expensive network resources among multiple users and applications that require sporadic access to these resources. We develop an algorithm for creating an ERON from an existing topology of static lightpaths. We also present simulation results that quantify the benefits of ERONs, in terms of the number of lightpaths that are needed when compared to a static configuration of independent and dedicated circuits.     

Reconfiguration of carrier assignment in cellular networks

We consider the problem of updating nominal carrier assignments in cellular networks, which dymamically operate with channel borrowing and reassignments, to match the timevarying offered traffic demands encountered on these systems. Assuming an existing assignment of nominal carriers and the new requirements in each cell, we formulate the problem of obtaining a new assignment such that the number of carriers required to meet the total traffic demand as well as the number of different assignments between the old and the new allocation are minimized. We introduce two approaches to obtain this new assignment. One approach treats the two objectives independently and is applicable to problems with cochannel interference constraints only. This approach produces a new assignment optimized with respect to the first goal, and then rearranges the frequencies of this new allocation so that the number of different assignments with respect to the previous allocation is minimum. A second approach aims at satisfying both goals at the same time and is applicable to problems with any type of interference constraints. The main advantage of this approach is the introduction of a single window parameter which can control the assignments produced, by favoring one goal at the expense of the other. We study several transition scenarios in macrocellular and microcellular environments, and show that in the majority of cases these objectives are conflicting, and that reconfiguration strongly depends on the amount of change of the traffic requirements.     

Minimizing the Call Setup Delay Caused by Reconfigurations of Dedicated Channels at the Downlink of WCDMA

Reconfigurations of downlink dedicated channels are often necessary during call setup to eliminate code blocking encountered in 3G WCDMA systems. These reconfigurations increase not only the signaling overhead, but also the setup delay of the incoming call and may yield prohibitive delays if performed inefficiently. In this paper, we introduce a reconfiguration scheme which manages to minimize this additional setup delay with a tolerable increase in signaling overhead.     

A Cross Layer Scheduling Framework for Supporting Bursty Data Applications in WCDMA Networks

In future wireless networks multimedia applications are expected to finally dominate the overall traffic volume. Shared channels are more suitable for the transmission of this type of traffic, as they are able to periodically adjust their transmission rate. In this paper, we introduce a cross-layer framework for WCDMA based networks which aims to make the packet scheduling procedure more efficient. In addition to that, we further propose a traffic scheduling scheme which serves the connections not only according to their delay sensitivity, but also according to the predicted state of their wireless channel. The efficiency of the proposed scheme, in terms of average packet delay and channel utilization is verified via simulations.     

A new framework for GLIF Interdomain Resource Reservation Architecture (GIRRA)

Many existing and emerging Scientific high-end applications (E-science) require end-to-end circuits interconnecting Grid resources for large data transfers. A few advanced networks, mainly National Research and Education Networks (NRENs), such as Surfnet, National Lambda Rail and Internet 2, now provide mechanisms for end-users to reserve and provision lightpaths via middleware referred to as Network Resource Mangers (NRMs). Although, some progress has been made in automated intra-domain lightpath services, inter-domain lightpath provisioning still requires manual intervention and presents several key challenges such as scalability of topology information exchanged, consistency and scalability of information model, security of access to the resources, hybrid networking and multi-layer lightpaths, and accounting and billing. In this paper, we describe a new architectural framework called Global Lambda Integrated Facility (GLIF) Interdomain Resource Reservation Architecture (GIRRA) with the goal to provide an integrated response to these challenges. We propose a new approach to model GLIF network domains and GOLEs as virtual switches and to describe their behavior, functionality, policy capabilities, and topology aggregation. We define an inter-domain path computation model to determine paths that meet constraints and access policy restrictions. We propose a security framework for authentication and authorization of users and a model for accounting and billing that aims to provide easy and secure access to the resources. Key aspects of the GIRRA solution are that it focuses on the inter-dependence between different challenges of inter-domain path provision, and it is built around already existing solutions for intra-domain resource provisioning.     

Traffic grooming in WDM networks: past and future

Traffic grooming refers to techniques used to combine low-speed traffic streams onto high-speed wavelengths in order to minimize the networkwide cost in terms of line terminating equipment and/or electronic switching. Such techniques become increasingly important for emerging network technologies, including SONET/WDM rings and MPLS/MP/spl lambda/S backbones, for which traffic grooming is essential. In this article we formally define the traffic grooming problem, and we provide a general formulation that captures the features of a wide range of problem variants. We then present a comprehensive comparative survey of the literature that unveils the significant amount of research on this subject (the traffic grooming past). We also offer a broad set of ambitious research directions (the traffic grooming future) that are motivated by the exciting new challenges arising with the advent of MP/spl lambda/S technology.     

On optimal traffic grooming in WDM rings

We consider the problem of designing a virtual topology to minimize electronic routing, that is, grooming traffic, in wavelength routed optical rings. The full virtual topology design problem is NP-hard even in the restricted case where the physical topology is a ring, and various heuristics have been proposed in the literature for obtaining good solutions, usually for different classes of problem instances. We present a new framework which can be used to evaluate the performance of heuristics and which requires significantly less computation than evaluating the optimal solution. This framework is based on a general formulation of the virtual topology problem, and it consists of a sequence of bounds, both upper and lower, in which each successive bound is at least as strong as the previous one. The successive bounds take larger amounts of computation to evaluate, and the number of bounds to be evaluated for a given problem instance is only limited by the computational power available. The bounds are based on decomposing the ring into sets of nodes arranged in a path and adopting the locally optimal topology within each set. While we only consider the objective of minimizing electronic routing in this paper, our approach to obtaining the sequence of bounds can be applied to many virtual topology problems on rings. The upper bounds we obtain also provide a useful series of heuristic solutions