Capacity Utilization versus Congestion Levels in wavelength Routing for large scale WDM Networks

Wavelength routing (WR) has been a key issue in WDM optical networks which carry huge amount of traffic aggregated from Internet protocol (IP), asynchronous transfer mode (ATM) and SDH/SONET layers. The problem, however, has been proved NP-hard. The time complexity and the optimality of solutions are two conflicting metrics. In addition, for optimization purposes, capacity utilization and network congestion level can be compromised to reduce the blocking probability of future connections. In this paper, we propose a heuristic approach for WR in large scale networks based on a balanced model developed for the capacity utilization and the congestion level. This is a two step approach, i.e K shortest paths (KSP) algorithm and a path selection algorithm (PSA), and is applicable not only at network design phase but also for online provisioning where a number of traffic connections may be requested simultaneously. We investigate the time complexity and the optimality of solutions as metrics for comparing our approach and the ILP formulation for wavelength routing. Simulation results show that our approach yields very promising results in terms of the optimality of solutions whilst also applicable to very large scale networks, say 500 nodes or mor

Design of power efficient multicast algorithms for sparse split WDM networks

Recent years witnessed tremendous increase in data traffic as new Internet applications were launched. Optical networks employing recent technologies such as DWDM and EDFA`s emerged as the most prominent and most promising solutions in terms of their ability to keep with the demand on bandwidth. However for a class of applications bandwidth is not the only important requirement, These applications require efficient multicast operations. They include data bases, audio/video conferencing, distributed computing etc. Multicasting in the optical domain however has its own unique set of problems. First, an optical signal can be split among the outputs of a node but the power due to splitting can be significantly reduced. Second, the hardware for split nodes is relatively expensive and therefore we cannot afford to employ it at every node. Third, there are other sources of losses such as attenuation losses and multiplexing /de-multiplexing losses. This thesis deals with the important issue of Power Efficient multicast in WDM optical networks. We report three new algorithms for constructing power efficient multicast trees and forests. Our algorithms are the first to take into account all possible sources of power losses while constructing the trees. We utilize the techniques of backtracking and tree pruning judiciously to achieve very power efficient multicast trees. The first two algorithms use modified versions of the shortest path heuristic to build the tree. The third algorithm however, uses a novel concept and considers power at every tree building step. In this algorithm, the order of inclusion of destination nodes into the tree is based on the power distribution in the tree and not distance. All three algorithms prune the trees if the power levels at the destinations are not acceptable. The performance of these three algorithms under several constraints is studied on several irregular topologies. All three algorithms reported in this work produce significant improvements in signal strength at the set of destinations over the existing multicast algorithms. Numerical results show that our third algorithm outperforms the first two algorithms as well as the existing multicasting algorithms

Journal of Telecommunications and Information Technology, 2004, nr 2

kwartalni

Integrated voice/data through a digital PBX

The digital voice/data PBX is finally reaching its anticipated potential and becoming a major factor when considering the total communications picture for many businesses today. The digital PBX has always been the choice for voice communications but has lagged behind the LAN industry when it comes to data transfers. The pendulum has begun to swing with the enhanced data capabilities of third and fourth generation PBXs. The battle for the total communication market is quite fierce between the LAN and PBX vendors now. This research thesis looks at the history, evolution, and architecture of voice/data PBXs. It traces development of PBXs through the present fourth generation architectures. From the first manual switches introduced in the late 1800\u27s through the Strowger switch, step-by-step switching, stored program control, common control, digital switches, dual bus architectures, and finally what is anticipated in the future. A detailed description of the new fourth generation dual bus architectures is presented. Lastly, speculations on the future direction PBX architectures will take is explored. A description of the mechanics of a possible Wave Division PBX is presented based on a fiber optic transport system

Differentiated quality-of-recovery and quality-of-protection in survivable WDM mesh networks

In the modern telecommunication business, there is a need to provide different Quality-of-Recovery (QoR) and Quality-of-Protection (QoP) classes in order to accommodate as many customers as possible, and to optimize the protection capacity cost. Prevalent protection methods to provide specific QoS related to protection are based on pre-defined shape protection structures (topologies), e.g., p -cycles and p -trees. Although some of these protection patterns are known to provide a good trade-off among the different protection parameters, their shapes can limit their deployment in some specific network conditions, e.g., a constrained link spare capacity budget and traffic distribution. In this thesis, we propose to re-think the design process of protection schemes in survivable WDM networks by adopting a hew design approach where the shapes of the protection structures are decided based on the targeted QoR and QoP guarantees, and not the reverse. We focus on the degree of pre-configuration of the protection topologies, and use fully and partially pre-cross connected p -structures, and dynamically cross connected p -structures. In QoR differentiation, we develop different approaches for pre-configuring the protection capacity in order to strike different balances between the protection cost and the availability requirements in the network; while in the QoP differentiation, we focus on the shaping of the protection structures to provide different grades of protection including single and dual-link failure protection. The new research directions proposed and developed in this thesis are intended to help network operators to effectively support different Quality-of-Recovery and Quality-of-Protection classes. All new ideas have been translated into mathematical models for which we propose practical and efficient design methods in order to optimize the inherent cost to the different designs of protection schemes. Furthermore, we establish a quantitative relation between the degree of pre-configuration of the protection structures and their costs in terms of protection capacity. Our most significant contributions are the design and development of Pre-Configured Protection Structure (p-structure) and Pre-Configured Protection Extended-Tree (p -etree) based schemes. Thanks to the column generation modeling and solution approaches, we propose a new design approach of protection schemes where we deploy just enough protection to provide different quality of recovery and protection classe

DYNAMIC ROUTING WITH CROSS-LAYER ADAPTATIONS FOR MULTI-HOP WIRELESS NETWORKS

In recent years there has been a proliferation of research on a number of wireless multi-hop networks that include mobile ad-hoc networks, wireless mesh networks, and wireless sensor networks (WSNs). Routing protocols in such networks are of- ten required to meet design objectives that include a combination of factors such as throughput, delay, energy consumption, network lifetime etc. In addition, many mod- ern wireless networks are equipped with multi-channel radios, where channel selection plays an important role in achieving the same design objectives. Consequently, ad- dressing the routing problem together with cross-layer adaptations such as channel selection is an important issue in such networks. In this work, we study the joint routing and channel selection problem that spans two domains of wireless networks. The first is a cost-effective and scalable wireless-optical access networks which is a combination of high-capacity optical access and unethered wireless access. The joint routing and channel selection problem in this case is addressed under an anycasting paradigm. In addition, we address two other problems in the context of wireless- optical access networks. The first is on optimal gateway placement and network planning for serving a given set of users. And the second is the development of an analytical model to evaluate the performance of the IEEE 802.11 DCF in radio-over- fiber wireless LANs. The second domain involves resource constrained WSNs where we focus on route and channel selection for network lifetime maximization. Here, the problem is further exacerbated by distributed power control, that introduces addi- tional design considerations. Both problems involve cross-layer adaptations that must be solved together with routing. Finally, we present an analytical model for lifetime calculation in multi-channel, asynchronous WSNs under optimal power control