Generic framing procedure (GFP): the catalyst for efficient data over transport

Bonenfant, P.; Rodriguez-Moral, A.

doi:10.1109/35.1000216

Cited by 79 publications

(20 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is straightforward to show [28] that, given a set of demand points, there exists an optimal supply set such that , for each . Based on this observation and the fact that for a given demand set the density is constant, it is possible to solve DPM1 by using the following dynamic programming algorithm to compute recursively, where , is the set with the smallest demand points in (6) (7) (8) Expression (6) states that if there is only one demand point, it is the optimal supply point. Expression (7) is due to the fact that when , the optimal supply point is equal to the largest demand point.…”

Section: The Directional -Median Problem (Dpm1)mentioning

confidence: 99%

“…Legacy telephone networks and SONET/SDH networks, in particular, impose a rigid hierarchy of rates that are multiples of a voice channel (i.e., 64 Kbps), hence, there is a proliferation of data services with rates ranging from DS-1 (1.5 Mbps) and DS-3 (45 Mbps) to STS-3 (155 Mbps) and STS-48 (2.5 Gbps) and beyond. These services are implemented by mapping a user's payload directly onto specific time slots of the transport system, e.g., using the generic framing procedure (GFP) [8], [21], [24].…”

Section: Tdm Emulationmentioning

confidence: 99%

See 1 more Smart Citation

On Bandwidth Tiered Service

Rouskas

Baradwaj²

2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplify a wide range of core network functions, allowing the providers to scale their operations efficiently. In this work, we study a number of problem variants related to service tier selection. Our contributions include: 1) a faster algorithm for obtaining optimal service tiers; 2) a new formulation and optimal algorithm to optimize jointly the number and magnitude of each service tier; and 3) the concept of "TDM emulation" in which all service tiers are multiples of the same (software-configurable) bandwidth unit, and a suite of algorithms to select jointly the basic unit and service tiers. Our work provides a systematic framework for reasoning about and tackling algorithmically the general problem of service tier selection, and has applications to a number of networking contexts, including access networks (e.g., determining the tiers for ADSL, cable modem networks or PONs) and core networks (e.g., LSP sizing for MPLS networks).

show abstract

Section: The Directional -Median Problem (Dpm1)mentioning

confidence: 99%

Section: Tdm Emulationmentioning

confidence: 99%

On Bandwidth Tiered Service

Rouskas

Baradwaj²

2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…GFP deploys a HEC based frame delimiter mechanism in a similar manner as ATM [8], [2], [12], [13]. The 32-bit GFP frame delineation circuit utilises 4 CRC HEC calculators and 4 16-bit comparators to accommodate the wide datapath, a Payload Length Indicator (PLI) frame counter, frame synchronisation state machine and a single bit error correction mechanism.…”

Section: Gfp Frame Delineationmentioning

confidence: 99%

Investigation into programmability for layer 2 protocol frame delineation architectures

Toal

Sezer

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

“…Virtual concatenation technique coupling with link capacity adjustment scheme (LCAS) not only makes SDH/SONET accommodate the services efficiently, but also provides the higher-layer protection [7,8]. The main function of virtual concatenation is to provide a right-sized pipe for different services such as Ethernet [5].…”

Section: Introductionmentioning

confidence: 99%

Performance estimation of the protection with LCAS and virtual concatenation in metropolitan area networks

Yang

Zhang

et al. 2005

Eur. Trans. Telecomm.

View full text Add to dashboard Cite

SUMMARYThe new techniques, link capacity adjustment scheme (LCAS) and virtual concatenation not only make SDH/SONET networks accommodate the data service efficiently, but also provide a high-layer protection for client services, under which no spare capacity needs to be reserved for protection and the service transmission continues unless all concatenated links have failed. In this paper, we analyse the performance of this kind of protection in ring topology and mesh topology respectively. The results show that the timeto-transmission halt for the first time exceeding 1 year can reach 99.999%, if the number of the independent concatenated links is greater than two. In addition, the protection performance is analysed in detail given the granted maximal decrease ratio of the service transmission bandwidth.

show abstract

Generic framing procedure (GFP): the catalyst for efficient data over transport

Cited by 79 publications

References 2 publications

On Bandwidth Tiered Service

On Bandwidth Tiered Service

Investigation into programmability for layer 2 protocol frame delineation architectures

Performance estimation of the protection with LCAS and virtual concatenation in metropolitan area networks

Contact Info

Product

Resources

About