Skip to main content

BR-WRR Scheduling Algorithm in PFTS

  • Conference paper
Book cover Parallel and Distributed Processing and Applications (ISPA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3358))

  • 679 Accesses

Abstract

The novel concept of Physical Frame Time-slot Switching (PFTS) over DWDM, proposed by Sichuan Network and Communication technology key laboratory (SC-Netcom Lab), has been around for some time. It differs from existing switching techniques over DWDM by its superior QoS mechanisms embedded in and its capability to simplify Internet into a Single physical-layer User-data transfer Platform Architecture (SUPA).

This paper proposed a Borrow & Return Weighted Round Robin (BR-WRR) algorithm of output scheduling and dispatching in a multiple-priority queue environment in PFTS nodes. In such nodes, there are multi-ports in a DWDMbased PFTS node and each port contains multi-lambdas. Furthermore, multiple queues with different priorities plus burst queue with the highest priority are devised for each output lambda. A Borrow-and-Return mechanism is introduced to improve the orthodox WRR in PFTS, which cannot satisfy continuous transmitting privileged data of a burst to maintain its integrity. Comparison of the results between simulation of BR-WRR and that of WRR is provided in this paper and shows that BR-WRR has better performance with regard to fairness and important QoS parameters such as transit delay, jitters, and nondisordering.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Zeng, H., Xu, D., Dou, J.: On Physical Frame Time-slot Switching over DWDM. In: Proceedings of PACAT 2003, pp. 535–540. IEEE press, Los Alamitos (2003)

    Google Scholar 

  2. Zeng, H., Xu, D., Dou, J.: Promotion of Physical Frame Timeslot Switching (PFTS) over DWDM. IEC Annual Report of Communications 57 (2004) (to be published)

    Google Scholar 

  3. Zeng, H., Dou, J., Xu, D.: Single physical layer U-plane Architecture (SUPA) for Next Generation Internet. IEC Annual Review of IP Applications and Services (2004) (to be published)

    Google Scholar 

  4. Hua-xin, Z., Jun, D., Hai-ying, W.: On the Single Physical Layer User Plane Architecture Network. Journal of Computer Applications (Chinese) 24, 1–5 (2004)

    Google Scholar 

  5. ITU, I.120 – Integrated Services Digital Networks (ISDN)

    Google Scholar 

  6. Ge, A., et al.: On Optical Burst Switching and Self-Similar Traffic. IEEE Communication Letters 4 (March 2000)

    Google Scholar 

  7. Stiliadis, D., et al.: Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE J. Sel. Areas Commun. 9 (1991)

    Google Scholar 

  8. "Traffic Management Specification Version 4.0", ATM Forum (April 1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, D., Zeng, H., Xu, C. (2004). BR-WRR Scheduling Algorithm in PFTS. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_106

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_106

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24128-7

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics