Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Journal of Lightwave Technology
  • Vol. 23,
  • Issue 10,
  • pp. 3012-
  • (2005)

On the Resource Efficiency of Virtual Concatenation in SDH/SONET Mesh Transport Networks Bearing Protected Scheduled Connections

Not Accessible

Your library or personal account may give you access

Abstract

Virtual concatenation (VCAT) is a Synchronous Digital Hierarchy (SDH)/Synchronous Optical Network (SONET) network functionality recently standardized by the International Telecommunication Union Telecommunication Standardization Sector (ITU-T). VCAT provides the flexibility required to efficiently allocate network resources to Ethernet, Fiber Channel (FC), Enterprise System Connection (ESCON), and other important data traffic signals. In this article, we assess the resources' gain provided by VCAT with respect to contiguous concatenation (CCAT) in SDH/SONET mesh transport networks bearing protected scheduled connection demands (SCDs).<xref rid="fn1"type="fnote"><footnote id="fn1"> As explained later, an SCD is a connection demand for which the set-up and tear-down dates are known in advance.</footnote></xref> We define mathematical models to quantify the add/drop and transmission resources required to instantiate a set of protected SCDs in VCAT-and CCAT-capable networks. Quantification of transmission resources requires a routing and slot assignment (RSA) problem to be solved. We formulate the RSA problem in VCAT-and CCAT-capable networks as two different combinatorial optimization problems: RSA in VCAT-capable networks (RSAv) and RSA in CCAT-capable networks (RSAc), respectively. Protection of the SCDs is considered in the formulations using a shared backup path protection (SBPP) technique. We propose a simulated annealing (SA)-based meta-heuristic algorithm to compute approximate solutions to these problems (i.e., solutions whose cost approximates the cost of the optimal ones). The gain in transmission resources and the cost structure of add/drop resources making VCAT-capable networks more economical are analyzed for different traffic scenarios.

© 2005 IEEE

PDF Article
More Like This
Survivable Multipath Traffic Grooming in Telecom Mesh Networks With Inverse Multiplexing

Sheng Huang, Ming Xia, Chip Martel, and Biswanath Mukherjee
J. Opt. Commun. Netw. 2(8) 545-557 (2010)

Optimized Routing and Buffer Design for Optical Transport Networks Based on Virtual Concatenation

João Santos, João Pedro, Paulo Monteiro, and João Pires
J. Opt. Commun. Netw. 3(9) 725-738 (2011)

Adaptive Reliable Multipath Provisioning in Survivable WDM Mesh Networks

Sheng Huang, Chip Martel, and Biswanath Mukherjee
J. Opt. Commun. Netw. 2(6) 368-380 (2010)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved