Burst-cluster transmission: service differentiation mechanism for immediate reservation in optical burst switching networks

Tachibana, Takuji; Kasahara, Shoji

doi:10.1109/mcom.2006.1637946

Cited by 19 publications

(10 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Burst-cluster transmission has been proposed to provide service differentiation in terms of the burst loss probability [9]. This method has been extended to resolve unfairness as hop-based burst-cluster transmission [8].…”

Section: Overviewmentioning

confidence: 99%

Random scheduling based on transmission delay and buffer size for hop-based burst-cluster transmission in OBS networks

2009

View full text Add to dashboard Cite

Hop-based burst-cluster transmission improves fairness significantly in OBS ring networks. However, in mesh networks, the overall burst loss probability increases using the method because the transmission of a burst-cluster from an ingress node is often synchronized with a burstcluster from another ingress node. In order to resolve the synchronization issue, we propose in this article the utilization of random scheduling for hop-based burst-cluster transmission. In random scheduling, the maximum waiting time is determined in advance from the maximum acceptable delay of an IP packet and the buffer size of the ingress node. Every time a burst-cluster is generated, a scheduler derives the actual waiting time at random based on the obtained maximum waiting time. When a timer becomes the actual waiting time, the burst cluster is transmitted from the scheduler. By simulation, we evaluate the effectiveness of random scheduling for NSF-NET. Numerical examples show that the random scheduling can resolve the synchronization issue and can decrease the overall burst loss probability. In addition, it is shown that random scheduling can also improve the fairness significantly.

show abstract

Section: Overviewmentioning

confidence: 99%

Random scheduling based on transmission delay and buffer size for hop-based burst-cluster transmission in OBS networks

2009

View full text Add to dashboard Cite

show abstract

“…Some approaches are based on the modification of signaling protocols [4,13,16] and also on burst preemption [6,10]. These approaches, however, may increase the end-to-end delay of high-priority bursts because of the extra offset introduced [12], and are also hard to implement in practice.…”

Section: Related Workmentioning

confidence: 99%

An efficient admission control mechanism for optical burst-switched networks

et al. 2008

View full text Add to dashboard Cite

This article proposes the load-level-based admission control (LLAC) mechanism in order to provide service differentiation for optical burst-switched networks. The LLAC mechanism admits bursts of a given service class according to the network load and a class-associated parameter. Based on this parameter, called load level, the proposed mechanism differentiates the burst blocking probability experienced by each service class. We develop an analytical model for the proposed mechanism and evaluate its performance for different configurations through mathematical analysis. The results show that the load-level-based mechanism reduces the blocking probability of high-priority bursts by two orders of magnitude or more depending on the analyzed scenario. In addition, compared to other similar mechanisms, the loadlevel-based mechanism effectively differentiates the services in all analyzed configurations, requires less states in optical burst switching (OBS) nodes, and does not suffer from priority inversion.

show abstract

“…Moreover, burst-cluster transmission has been recently proposed to provide service differentiation for immediate reservation [12]. The performance of the method is not affected so much by the switching time of the optical switch and the processing time of a control packet.…”

Section: Signaling Protocolmentioning

confidence: 99%

“…At an ingress edge node, the burst-cluster transmission [12] is used for providing service differentiation. In the following, let M denote the number of service classes, where class 1 is the highest priority class and class M has the lowest priority.…”

Section: Edge Nodementioning

confidence: 99%

See 1 more Smart Citation

Burst-cluster transmission with probabilistic pre-emption for reliable data transfer in high-performance OBS networks

Tachibana

2008

Photon Netw Commun

View full text Add to dashboard Cite

Recently, optical switching and packet processing technologies have been developed and high-performance optical burst switching (OBS) networks are constructed by using these technologies. In high-performance OBS networks, several types of applications such as Grid computing and HDTV can be provided for users according to immediate reservation protocol. Because some applications require that data is transmitted reliably over high-performance OBS networks, it is indispensable to provide reliable data transfer service for high-priority users. Therefore, in this paper, we propose a reliable burst transmission method which can be available for the immediate reservation protocol. In the proposed method, both burst-cluster transmission and probabilistic pre-emption are used at edge and core nodes. By using these methods together, the reliable data transfer and the service differentiation can be provided. We evaluate by simulation the performance of the proposed method in the 14-node NSFNET. Numerical examples show that the proposed method can transmit higher-priority bursts more reliably than the conventional method while not increasing the overall burst loss probability so much. In addition, we investigate effective parameter settings from some simulation results.

show abstract

Burst-cluster transmission: service differentiation mechanism for immediate reservation in optical burst switching networks

Cited by 19 publications

References 12 publications

Random scheduling based on transmission delay and buffer size for hop-based burst-cluster transmission in OBS networks

Random scheduling based on transmission delay and buffer size for hop-based burst-cluster transmission in OBS networks

An efficient admission control mechanism for optical burst-switched networks

Burst-cluster transmission with probabilistic pre-emption for reliable data transfer in high-performance OBS networks

Contact Info

Product

Resources

About