Linear Formulation To Avoid Adjacent Channel Interference In Ltd Of Optical Networks

A strategy is implemented for solving the Logical Topology Design (LTD) based on a Linear Formulation (LP) with channel interference constraints. The formulation is able to provide excellent solutions. In traditional LTD Problem there is no a-priori knowledge of channel use and once the solution has been implemented the interference cannot be avoided. Taking into consideration the effects of adjacent channel interference, we extend the traditional formulation as a set of analytical formulas as additional constraints on LTD. © 2010 COPYRIGHT SPIE - The International Society for Optical Engineering.7959The Society of Photo-Optical Instrumentation Engineers (SPIE)Dutta, R., Rouskas, G., A Survey of Virtual Topology Design Algorithms for Wavelength Routed Networks (2000) Optical Networks (SPIE), 1 (1), pp. 73-89. , JanuaryZang, H., Jue, J.P., Mukherjee, B., A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed optical WDM Networks (2000) Optical Networks Magazine, 1, pp. 47-60. , JanDeng, T., Subbramaniam, S., Xu, J., Crosstalk-Aware are Wavelength Assignment in Dynamic Wavelength Routed Optical Networks Pr Proc. Broadn Dnets, 2004Manousakis, K., Christodoulopolos, K., Varvarigos, E., Avoiding Adjacent Channel Interference in Static RWA CSNDSP08He, J., Brandt-Pearce, M., QoT-Aware are Routing in Impairment-Constrained Optical Networks (2007) IEEE GLOBECOM, pp. 2269-2274. , NovKrishn Shnaswamy, R., Sivara Arajan, K., Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers (2001) IEEE Trans. Networking, 9 (2), pp. 186-198Ramaswami, R., Sivarajan, K.N., Design of Logical Topologies for Wavelength-Routed All Optical Networks (1996) IEEE/JSAC, 14, pp. 840-851. , JuneRamaswami, R., Optical Networking Technologies: What Worked and What Didn't (2006) IEEE Communications Magazine, pp. 132-139. , Septembe

How Many Lightpaths We Need Today And How Many Lightpaths We Will Need Tomorrow

We propose a linear formulation and an iterative heuristic for the Logical Topology Design (LTD) in optical networks. The formulation maximizes the number of remaining available routes, trying to preserve the open capacity for the accommodation of future unknown demands. The heuristic routes foreseen traffic through the previously set up routes and also the remaining "dark" lightpaths. The results suggest that it is feasible to preserve enough open capacity to avoid blocking of future requests in networks with scarce resources.303176179Ramaswami, R., Optical Networking Technologies: What Worked and What Didn't (2006) IEEE Communications Magazine, pp. 132-139Ramaswami, R., Sivarajan, K.N., Design of Logical Topologies for Wavelength-Routed All Optical Networks (1996) IEEE/JSAC, 14, pp. 840-851Tran, P.N., Killat, U., Design of Logical Topology for IP over WDM Networks Performance vs. Resources Utilization (2007) International Network Optimization Conference INOC, , Spa, Belgiu

Iterative Optimization In Vtd To Maximize The Open Capacity Of Wdm Networks

We propose an iterative algorithm for the Virtual Topology Design (VTD) in optical networks. The algorithm eliminates lighter traffic lightpaths and re-arrange the traffic through the remaining lightpaths. This tries to preserve the open capacity for the accommodation of future unknown demands. The results suggest that it is feasible to preserve enough open capacity to avoid blocking of future requests in networks with scarce resources; this is, maximize the traffic scaling. © Springer-Verlag 2004.3124735742Mannie, E., (2003) Generalized Multi-Protocol Label Switching Architecture, , draft-ietf-ccampgmpls-architecture-07, MarchLang, J., Link Management Protocol (LMP), , draft-ietf-ccamp-lmp-10, October 03Architecture for the Automatically Switched Optical Network (ASON), , ITU-T Rec. G.8080/Y.1304(2001) User Network Interface (UNI) 1.0 Signaling Specification, , Optical Networking Forum, OctoberFredette, A., (2003) Link Management Protocol (LMP) for Dense Wavelength Division Multiplexing (DWDM) Optical Line Systems, , draft-ietf-ccamp-lmp-wdm-02, MarchLang, J., Papadimitriou, D., (2003) SONET/SDH Encoding for Link Management Protocol (LMP) Test Messages, , draft-ietf-ccamp-lmp-test-sonet-sdh-03, MayDubuc, M., (2003) Link Management Protocol Management Information Base, , draft-ietfccamp-lmp-mib-07, OctoberAboul-Magd, O., (2003) A Transport Network View to LMP, , draft-aboulmagd-ccamptransport-lmp-01, JuneOperations Application Messages - Language for Operations Application Messages, , Telcordia, GR-831Rising, L., (2001) Design Patterns in Communication Software, , Cambridge University Press, UKGamma, E., (1998) Design Patterns: Elements of Reusable Object-Oriented Software, , Addison-Wesley, HollandLynch, N.A., (1997) Distributed Algorithms, , Morgan Kaufmann Publishers, Inc., CAKompella, K., (2003) Link Bundling in MPLS Traffic Engineering, , draft-ietf-mpls-bundle-04, JanuaryFox, B., Virtual Private Networks Identifier Internet RFC, 2685, p. 99. , SeptemberStevens, W.R., Maximum UDP Datagram Size (1994) TCP/IP Illustrated, 1. , Addison-WesleyJerram, N., Farrel, A., (2001) MPLS in Optical Networks, p. 33. , Data Connection, Enfield, UK, OctoberBanerjee, A., Generalized Multiprotocol Label Switching: An overview of Routing and Management Enhancements (2001) IEEE Communications Magazine, , Januar

Efficient Traffic Routing For Current And Future Demands In Optical Networks

We propose a linear formulation for traffic routing in optical networks after the Virtual Topology Design (VTD). The formulation maximizes the amount of traffic the network is able to accept, through minimizing the residual capacity in established lightpaths. The results suggest that it is feasible to preserve enough open capacity to avoid disruption of connections and blocking of future traffic demands in networks with scarce resources. © 2009 IEEE.Ramaswami, R., Sivarajan, K.N., Design of logical topologies for wavelength-routed all optical networks (1996) IEEE/JSAC, 14, pp. 840-851. , JuneSkorin-Kapov, N., Routing and wavelength assignment in optical networks using bin packing based algorithms (2007) Europ. J. Op. Res, 177 (2), pp. 1167-1179. , MarchLisser, J., Gondzio, A., Ouorou, J.-P.V., Capacity planning under uncertain demand in telecommunications networks, (1999) TR 99.13, , Logilab, University of GenevaSen, S., Doverspike, R., Cosares, S., Network planning with random demand (1994) Telecommunication Systems, 3, pp. 11-30Ben-Ameur, W., Kerivin, H., Routing of uncertain traffic demands (2005) Optimization and Engineering, 3, pp. 283-313Italiano, G.F., Leonardi, S., Oriolo, G., Design of networks in the hose model, (2002) Proc. International Workshop on Approximation and Randomization Algorithms in Communication Networks, pp. 65-76. , Carleton Scientific Pres

On-arrival Planning For Sub-graph Routing Protection In Wdm Networks

In this paper we incorporate the rerouting of backup paths to the Call Admission Control algorithm of Sub-Graph Routing Protection (SGRP). Sub-Graph Routing Protection with On-Arrival Planning (SGRP-OAP) has the two-fold benefit of strongly reducing the blocking probability of the protected system while eliminating the physical rerouting of established connections, which is a major drawback of the original proposal of SGRP. The new scheme is so capacity-efficient that, for all investigated topologies, at low traffic intensity the blocking probability of the system protected against single link failures is the same as the blocking probability of the unprotected system. This is possible because the new protection scheme is extremely effective in using the idle network capacity to provide backup paths. © 2005 by International Federation for Information Processing.164129136Ramaswami, R., Sivarajan, K.N., (2002) Optical Networks: A Practical Perspective, , Morgan Kaufmann PublishersRamamurthy, S., Mukherjee, B., Survivable WDM mesh networks, part I-protection (1999) Proc. IEEE INFOCOM'99, pp. 744-751Mohan, G., Murthy, C.S.R., Somani, A.K., (2001) Efficient algorithms for routing dependable connections in WDM optical networks, 9 (5), pp. 553-566Frederick, M.T., Somani, A.K., A single-fault recovery strategy for optical networks using subgraph routing (2003) Proc. ONDM'03, pp. 549-568. , in, FebDatta, R., Frederick, M.T., Somani, A.K., Sub-graph routing: A novel fault-tolerant architecture for shared-risk link group failures in WDM optical networks (2003) Proc. DRCN'03, , in, OctMello, D.A.A., Pelegrini, J.U., Savasini, M.S., Pavani, G.S., Waldman, H., Interarrival planning for sub-graph routing protection in WDM networks (2004) Proc. ICT'04, , in, Au

Inter-arrival Planning For Sub-graph Routing Protection In Wdm Networks

We propose an inter-arrival planning strategy that strongly reduces path and wavelength reassignment in WDM networks protected by sub-graph routing. It has been recently demonstrated that Sub-Graph Routing Protection outperforms Backup Multiplexing in terms of blocking probability and link utilization. However, a major drawback is that upon occurrence of a link failure, even connections that do not traverse the faulty link may have to reassign their path or wavelength to accommodate others, interrupting the service. In this paper we show that offline inter-arrival planning of protection resources can efficiently reduce reassignment while preserving blocking performance. © Springer-Verlag 2004.3124328335Ramaswami, R., Sivarajan, K.N., (2002) Optical Networks: A Practical Perspective, , Morgan Kaufmann PublishersMohan, G., Murthy, C.S.R., Somani, A.K., Efficient algorithms for routing dependable connections in WDM optical networks (2001) IEEE/ACM Trans. Networking, 9, pp. 553-566Frederick, M.T., Somani, A.K., A single-fault recovery strategy for optical networks using subgraph routing (2003) Proc. ONDM'03, pp. 549-568Datta, P., Frederick, M.T., Somani, A.K., Sub-graph routing: A novel fault-tolerant architecture for shared-risk link group failures in WDM optical networks (2003) Proc. DRCN'03Ho, P.H., Mouftah, H.T., A novel distributed protocol for path selection in dynamic wavelength-routed WDM networks (2003) Kluwer Photonic Network Communications, 5, pp. 23-3