Dimensioning Burst Assembly Process in Optical Burst Switching Networks

Choi, JungYul

doi:10.1093/ietcom/e88-b.10.3855

Cited by 23 publications

(21 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Analytical queueing models for the edge node were proposed in [27,28]. Choi et al [29] used an approximate model to study the BHP delay distribution in the SCU and applied the result to guide the configuration of the burst assembler. In [30], the burst loss performance due to the BHP delay/loss in the SCU was studied.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A framework for deterministic delay guarantee in OBS networks

Raffaelli

2010

Photon Netw Commun

View full text Add to dashboard Cite

In OBS networks, the delay of control packets in the switch control unit (SCU) of core nodes influences burst loss performance in the optical switching and should be constrained. Furthermore, the end-to-end (E2E) delay requirements of premium services need queueing delay guarantee in network nodes throughout the transmission path. For this purpose, a framework for deterministic delay guarantee is proposed in this article. It incorporates the deterministic delay model in the ingress edge node as well as in the SCUs of core nodes. On this basis, the configuration of the assembler and the offset time is addressed by means of an optimization problem under the delay constraints. Scenario studies are carried out with reference to realistic transport network topologies. Compared to statistical delay models in the literature, the deterministic model has advantages in rendering robust absolute delay guarantee for individual FEC flows, which is especially appreciated in the provisioning of premium services. By performance evaluation in comparison with the statistical models, it is shown that the adopted deterministic delay models lead to practical delay bounds in a magnitude that is close to the delay estimations by stochastic analysis.

show abstract

Section: Related Workmentioning

confidence: 99%

“…A comparable statistical queueing model for the SCU is the M/D/1 model [29,38]. Here, it is assumed that the BHP Fig.…”

Section: Comparison With Statistical Modelmentioning

confidence: 99%

A framework for deterministic delay guarantee in OBS networks

Raffaelli

2010

Photon Netw Commun

View full text Add to dashboard Cite

show abstract

“…Assembly algorithms limiting the waiting time of packets by a threshold on the burstification time are classified as time-based and lend themselves ideally to control the edge node delay of real-time traffic [CCK05,IST05]. In contrast, assembly schemes ensuring a minimum and/or maximum burst size by respective thresholds are classified as size-based [YCQ02b,Lae02].…”

Section: Burst Assembly Schemesmentioning

confidence: 99%

Novel Network Architecture for Optical Burst Transport

Gauger¹

2009

PIK - Praxis Der Informationsverarbeitung Und Kommunikation

View full text Add to dashboard Cite

SummaryTransport networks form the backbone of communication networks by cost-efficiently offering huge bandwidth and by guaranteeing a high service quality and availability. These requirements can best be met by using optical communication technologies. Currently, wavelength-switching is the most prominent network technology employing optical fiber communication and wavelength division multiplexing. It transports data in circuit-switched wavelength channels, the so-called lightpaths. While for years progress in optical networks has been defined by ever increasing transmission bit-rates, higher flexibility and manageability as well as multi-service and multi-layer integration are equally important criteria today. Accounting for these trends, optical burst switching (OBS) has been proposed as a highly dynamic optical network architecture. It offers fine-granular transport of different packet-switched services and applies statistical multiplexing directly in the optical layer.This thesis presents the design, modeling, and evaluation of the optical burst transport network architecture (OBTN). The architecture is motivated by the need for flexible, scalable, and cost-efficient transport in next generation networks. In addition, it is stimulated by the research activities towards highly dynamic optical network infrastructures.OBTN defines a network architecture to transport and switch optical burst data in a core network. The design objectives for the OBTN architecture are (i) an overall high quality of service, (ii) a network design allowing for cost-efficiency and scalability, and (iii) a network evolution perspective based on the current wavelength-switched networks. These objectives are achieved by combining selected concepts, architectures, and strategies of optical burst and optical packet switching as well as of multi-layer traffic engineering.In order to provide the background information for the design of OBTN, Chapter 2 introduces the general characteristics, requirements, and trends for next generation transport networks. Also, it discusses the concept of layering in next generation networks and its application in layer networks for the virtualization of transport resources. Consequently, virtual topology design and dimensioning are analyzed to quantify the trade-offs regarding connectivity and resource requirements. Chapter 2 also reviews the fundamental technologies as well as currently emerging data and control plane architectures for optical transport networks. This presentation is then extended towards a long-term perspective. It describes architectural constraints and classification criteria for highly dynamic optical network architectures. These criteria are used to characterize the fast optical circuit switching, optical burst switching, and optical packet switching architectures. Then, hybrid optical network architectures are discussed as a framework to combine wavelength-switched and optical burst/packet-switched networks.i ii Summary Chapter 3 discusses the state of research and technology for o...

show abstract

“…To date, optical burst switching (OBS) has been received a lot of attention as a promising switching technology for the next generation Internet owing to high network utilization and low queueing delay compared to existing wavelength-routed networks and feasibility compared to optical packet switching (OPS) [1][2][3][4]. In order to ensure acceptable performance for Internet application services, OBS needs to overcome several roadblocks, especially including data burst contention.…”

Section: Introductionmentioning

confidence: 99%

A tree-based slot allocation algorithm for loss-free slotted OBS networks

2009

View full text Add to dashboard Cite

Optical burst switching (OBS) is regarded as one of the most promising switching technologies for next generation optical networks. However, the data burst contention problem is still unresolved thoroughly even though slotted OBS (SOBS) is studied as a new paradigm reducing the blocking rate. In this article, we propose a tree-based slot allocation (TSA) algorithm for loss-free SOBS networks, where the TSA algorithm originally avoids contention of the time-slots by reserving the time-slots with different timeslot positions for the source nodes, respectively. In order to manage the time-slots efficiently, we also propose an OBS superframe, which is a cyclic period and consists of multiple time-slots transmitted by the source nodes toward the same incoming port of a destination node. In addition, we attempt to optimize multiplexing of the OBS superframes to reduce wavelength consumption. On the other hand, when incoming traffic is beyond expectation, a source node may need more time-slots to prevent packet loss because of buffer overflow. For reallocation of the time-slots, we propose a flow control scheme managing some number of shared time-slots, where a control node adaptively allocates (or redeems) the time-slots to (or from) source nodes by utilizing the shared H. Jeong (B) Long Term Evolution R&D Laboratory, DMC, time-slots based on fluctuating traffic condition. Simulation results show that the blocking rate of the proposed TSA-OBS scheme is zero with acceptable queueing delay at moderate traffic offered loads. In addition, multiplexing optimization simulated in the 14-node NSFNET achieves a 63% reduction of wavelength consumption. Moreover, the proposed flow control scheme assisting the TSA algorithm maintains a target upper-bound of queueing delay at the source node, so that packet loss caused by buffer overflow is prevented.

show abstract

Dimensioning Burst Assembly Process in Optical Burst Switching Networks

Cited by 23 publications

References 0 publications

A framework for deterministic delay guarantee in OBS networks

A framework for deterministic delay guarantee in OBS networks

Novel Network Architecture for Optical Burst Transport

A tree-based slot allocation algorithm for loss-free slotted OBS networks

Contact Info

Product

Resources

About