Packet scheduling algorithms and performance of a buffered shufflenet with deflection routing

A detailed analytical model for hot-potato ShuffleNet with limited wavelength conversion is presented in this paper for the first time. Network simulations are performed to validate the results of theoretical analysis. The analytical and simulation results show that the performance of ShuffleNet under limited wavelength conversion improves with wavelength conversion degree d w , and the efficiency of contention resolution per wavelength conversion degree decreases largely with increasing d w . ShuffleNet performs well with limited wavelength conversion and can achieve performance close to that of full wavelength conversion adopting a wavelength conversion degree as small as 8 for nodes equipped with 16 wavelength channels. The results presented in this paper are interesting and valuable in the designation of the other kind of multi-path optical packet networks.

show abstract

“…The analysis of deflection probability can be greatly simplified by making full use of the special topology properties of ShuffleNet [6]. …”

Section: Theory Analysismentioning

confidence: 99%

Performance analysis of hot-potato ShuffleNet with limited wavelength conversion

Wang

Zhang

et al. 2004

SPIE Proceedings

View full text Add to dashboard Cite

show abstract

“…Optical buffering [4] and wavelength conversion [5] are two strategies that have been investigated respectively to decrease the deflection probability of packets [6,7]. Hybrid contention resolution combining both optical buffering and wavelength conversion may be a better choice.…”

Section: Introductionmentioning

confidence: 99%

Performance Evaluation of a Buffered ShuffleNet with Wavelength Conversion

Wang¹,

Zhang²,

Li³

et al. 2005

Journal of Optical Communications

View full text Add to dashboard Cite

A novel hybrid contention resolution utilizing optical buffering and wavelength conversion is proposed for deflection routing networks. The corresponding network performance is investigated systematically by means of theoretical analysis and network simulation. Taking two-connected ShuffleNet as an example, we show that a 64-node ShuffleNet indeed performs very well with only single optical buffer and four wavelengths, and can achieve performance close to the store-and-forward case using only single optical buffer and ten wavelengths.

show abstract

“…In the past years, the issue of evaluating performance of deflection routing in regular topologies has been extensively studied [1][2][3][4][5][6] [8]. For example, various analytical models for buffered deflection routing were proposed under specific assumptions of network topology or traffic model [1][2] [8].…”

Section: Performance Analysis Of Deflection Routing In Optical Burst-mentioning

confidence: 99%

“…Compared slotted deflection routing with unslotted case, analyses or simulations all indicated that unslotted network should be the better solution to build an optical deflection-routing network [3][4] [6]. By exploiting the special topological properties of shufflenet, Chan and Kobayashi derived a simple but accurate closed-form approximation of the deflection probability [5].…”

Section: Performance Analysis Of Deflection Routing In Optical Burst-mentioning

confidence: 99%

Performance analysis of deflection routing in optical burst-switched networks

Hsu

Liu

Huang

Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies

View full text Add to dashboard Cite

This paper concerns itself with the performance of deflection routing in optical burst-switched networks based on Just-Enough-Time (JET) signaling. Generally speaking, buffer requirement is not vital for JET-based optical burst switching (OBS). However, if deflection routing is enabled, optical buffers are necessary to solve the insufficient offset time problem. A variant of priority queuing model is proposed to approximate burst loss probability and the results show that the model provides an accurate estimation. We also evaluate the performance of deflection routing in arpanet-2 topology. Simulation results indicate that deflection routing evidently brings significant blocking performance gain, especially with fewer wavelengths and under lighter load. In addition, we notice that excessive deflection will cause longer end-to-end delay and reduce the blocking performance. Therefore, it is necessary to control the maximum allowed deflection occurrences of a burst. IEEE INFOCOM 2002

show abstract

Packet scheduling algorithms and performance of a buffered shufflenet with deflection routing

Cited by 14 publications

References 30 publications

Performance analysis of hot-potato ShuffleNet with limited wavelength conversion

Performance analysis of hot-potato ShuffleNet with limited wavelength conversion

Performance Evaluation of a Buffered ShuffleNet with Wavelength Conversion

Performance analysis of deflection routing in optical burst-switched networks

Contact Info

Product

Resources

About