scispace - formally typeset
Search or ask a question
Topic

Virtual concatenation

About: Virtual concatenation is a research topic. Over the lifetime, 275 publications have been published within this topic receiving 2414 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is argued that GFP serves as the catalyst for efficient and standard data over transport service offerings.
Abstract: We discuss the generic framing procedure (GFP) in the context of emerging nontraditional data over transport applications. Coupled with complementary efforts to define virtual concatenation, automatic link capacity adjustment schemes, and distributed control planes for transport networks, we contend that GFP serves as the catalyst for efficient and standard data over transport service offerings.

127 citations

Patent
31 Oct 2001
TL;DR: In this paper, a method classifies the Ethernet input pipes in a SONET/SDH network with a plurality of virtual concatenation channels, and allocates the classified packets onto the Virtual Concatenation Channel.
Abstract: An interface for an optical node with a plurality of input ports and output ports in SONET/SDH optical network connected to a plurality of virtual concatenation channels has a plurality of input ports for taking Ethernet signals as inputs, and a plurality of output ports for selectively outputting Ethernet frames in the Ethernet signals to the virtual concatenation channels A method classifies the Ethernet input pipes in a SONET/SDH network with a plurality of virtual concatenation channels, and allocates the classified packets onto the virtual concatenation channels

117 citations

Patent
08 Jul 2002
TL;DR: In this paper, the authors propose an architecture for efficient processing of the evolving OTN transmission technology, standardized under ITU-T G.707, in conjunction with existing and emerging SONET/SDH protocol signals.
Abstract: Architecture for efficient processing of the evolving OTN transmission technology, standardized under ITU-T G.709, in conjunction with existing and emerging SONET/SDH protocol signals, standardized under ANSI T1.105/ITU-T G.707. The new architecture allows processing the SONET/SDH signals, and/or OTN signals, and/or SONET/SDH mapped into OTN signals more efficiently. The architecture further allows processing and multiplexing of lower order signals into a higher order signal such as quad OC-192 into OC-768 or quad OC-192 into OPU3 and OTU3. This architecture uses an embedded processor to process some of the signals' overhead in software, contributing to an additional level of flexibility in the processing. This architecture enables customization and allowing for future standard updates and upgrades. The architecture can be upgraded to SONET OC-3072, SDH STM-1024 and OTU4, which currently are not standardized. The architecture can also be used for the implementation of SONET OC-192 with OTN OTU2.

83 citations

Journal ArticleDOI
TL;DR: It is found that exploiting link-disjoint paths is very efficient for survivable multipath provisioning; and SPLIT-DDCKDP is resource efficient, has low signaling overhead, and has fast fault-recovery for survivability of service paths based on differential-delay constraint (DDC) and multipath Provisioning together in a telecom backbone mesh network.
Abstract: Survivability is a critical concern in modern telecom mesh networks because the failure of a network element may cause tremendous data and revenue loss in such networks using high-capacity optical fibers employing wavelength-division multiplexing (WDM). Multipath provisioning is a key feature of next-generation SONET/SDH networks (which can be used on top of optical WDM), and they can support virtual concatenation (VCAT); thus, multipath provisioning can significantly outperform single-path provisioning in resource efficiency, service resilience, and flexibility. However, in multipath provisioning, differential delay is an important constraint that should be considered. We investigate survivability of service paths based on differential-delay constraint (DDC) and multipath provisioning together in telecom backbone mesh networks. We propose the Shared Protection of the Largest Individual Traversed link (SPLIT) method for survivable multipath provisioning and present a DDC-based algorithm for multipath routing subject to DDC. We also compare the DDC-based algorithm with the K shortest link-disjoint paths (KDP) algorithm, using SPLIT, under dynamic service requests. We find that exploiting link-disjoint paths is very efficient for survivable multipath provisioning, and our algorithm is resource-efficient, has low signaling overhead, and has fast fault recovery for survivable multipath provisioning with DDC. For a 5-ms DDC, our algorithm can decrease the bandwidth blocking ratio (BBR) significantly in typical U.S. backbone networks.

76 citations

Patent
04 Sep 2002
TL;DR: In this article, a method for mapping and multiplexing of constant bit rate (CBR) signals into optical transport network (OTN) frames is provided, which enables the transportation of data from a plurality of SONET/SDH clients through a single OTN frame.
Abstract: A method for mapping and multiplexing of constant bit rate (CBR) signals into optical transport network (OTN) frames is provided. The method, in addition, enables the transportation of data from a plurality of SONET/SDH clients through a single OTN frame. The preferred method thereby enables efficient adoption of SONET/SDH legacy equipment by OTN networks.

65 citations

Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
79% related
Quality of service
77.1K papers, 996.6K citations
78% related
Routing protocol
46.5K papers, 901.8K citations
77% related
Orthogonal frequency-division multiplexing
50.5K papers, 682.6K citations
77% related
Wireless network
122.5K papers, 2.1M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20181
20172
20167
20153
20145
201313