PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Scheduling architectures for DiffServ networks with input queuing switches

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Due to its simplicity and scalability, the differentiated services (DiffServ) model is expected to be widely deployed across wired and wireless networks. Though DiffServ supporting scheduling algorithms for output-queuing (OQ) switches have been widely studied, there are few DiffServ scheduling algorithms for input-queuing (IQ) switches in the literaure. In this paper, we propose two DiffServ scheduling algorithms for DiffServ networks with IQ switches: the dynamic DiffServ scheduling (DDS) algorithm and the hierarchical DiffServ scheduling (HDS) algorithm. The basic idea of DDS and HDS is to schedule EF and AF traffic according to their minimum service rates with the reserved bandwidth and schedule AF and BE traffic fairly with the excess bandwidth. Both DDS and HDS find a maximal weight matching but in different ways. DDS employs a centralized scheduling scheme. HDS features a hierarchical scheduling scheme that consists of two levels of schedulers: the central scheduler and port schedulers. Using such a hierarchical scheme, the implementation complexity and the amount of information needs to be transmitted between input ports and the central scheduler for HDS are dramatically reduced compared with DDS. Through simulations, we show that both DDS and HDS provide minimum bandwidth guarantees for EF and AF traffic as well as fair bandwidth allocation for BE traffic. The delay and jitter performance of DDS is close to that of PQWRR, an existing DiffServ supporting scheduling algorithm for OQ switches. The tradeoff of the simpler implementation scheme of HDS is its slightly worse delay performance compared with DDS.
Twórcy
autor
autor
autor
autor
autor
autor
  • Department of Electrical and Computer Engineering University of Nevada, Las Vegas, NV 89154, meiyang@egr.unlv.edu
Bibliografia
  • 1. D. Adami, S. Giordano, M. Pagano, R. Secchi: Optimization of scheduling algorithms parameters in a DiffServ environment, Symposium on Applications and the Internet Workshops, 2005, pp. 276-279.
  • 2. A. Bader, G. Karagiannis, L. Westberg, et. al.: QoS signaling across heterogeneous wired/wireless networks: resource managment in DiffServ using the NSIS protocol suite, International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks 2005, pp. 51-56.
  • 3. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss: An architecture for differentiated services, IETF RFC 2475, Dec. 1998.
  • 4. R. Braden, D. Clark, S. Shenker: Integrated services in the Internet architecture: an overview, IETF RFC 1633, 1994.
  • 5. B. Carpenter, K. Nichols: Differentiated services in the Internet, Proceedings of the IEEE. 2002, vol. 90, no. 9, pp. 1479-1494.
  • 6. C. Chen, M. Komatsu: An adaptive scheduler to provide QoS guarantees in an input-buffered switch, International Conference on Communications, 2002, vol. 2, pp. 1118-1122.
  • 7. F. Chiussi, A. Francini: A distributed scheduling architecture for scalable packet switches, IEEE Journal of Selected Areas in Communications 2000, vol. 18, no. 12, pp. 2665-2683.
  • 8. S. Floyd, V. Jacobson: Link-sharing and resource management models for packet switches, IEEE/ACM Transactions on Networking 1995, vol. 3, no. 4, pp. 365-386.
  • 9. J. Heinanen, F. Baker, W. Weiss, J. Wroclawski: Assured forwarding PHB group, IETF RFC 2597, 1999.
  • 10. I. S. Hwang, B. J. Hwang, C. S. Ding: Adaptive weighted fair queueing with priority (AWFQP) scheduler for DiffServ networks, Journal of Informatics & Electronics 2008, vol. 2, no. 2, pp. 15-19.
  • 11. V. Jacobson, K. Nichols, K. Poduri: An expedited forwarding PHB group, IETF RFC 2598, 1999.
  • 12. H. Jiang, W. Zhuang, X. Shen, A. Abdrabou, P. Wang: Differentiated services for wireless mesh backbone, IEEE Communications Magazine 2006, vol. 44, no. 7, pp. 113-119.
  • 13. A. Kam, K. Sui: Linear complexity algorithms for QoS support in input-queued switches with no speedup, IEEE Journal of Selected Areas in Communications 1999, vol. 17, no. 6, pp. 1040-1056.
  • 14. N. D. Kiameso, H. Hassanein, H. T. Mouftah: Analysis of prioritized scheduling of assured forwarding in DiffServ Architectures, IEEE International Conference on Local Computer Networks, 2003, pp. 614.
  • 15. H. Kim, K. Kim, Y. Lee: Hierachical scheduling algorithm for QoS guarantee in MIQ switches, IEEE Electronic Letters 2000, vol. 36, no. 18, pp. 1594-1595.
  • 16. S. Li, N. Ansari: Provisioning QoS features for input-queued ATM switches, Electronics Letters 1998, vol. 34, no. 19, pp. 1826-1827.
  • 17. Y. Li, S. Panwar, H. J. Chao: The dual round-robin matching with exhaustive service, IEEE Workshop on High Performance Switching and Routing, 2002, pp. 58-63.
  • 18. G. Mamais, M. Markaki, G. Politis, I. S. Venieris: Efficient buffer management and scheduling in a combined IntServ and DiffServ architecture: a performance study. International Conference on ATM, 1999, pp. 236-242.
  • 19. J. Mao, W. M. Moh, B. Wei: PQWRR scheduling algorithm in supporting of DiffServ, International Conference on Communications, 2001, vol. 3, pp. 679-684.
  • 20. N. Mckeown: Scheduling algorithms for input-buffered cell switches, Ph. D. Thesis, Univerity of California at Berkeley, 1995.
  • 21. N. Mckeown: The iSLIP scheduling algorithm for input-queued switches, IEEE/ACM Transactions on Networking 1999, vol. 7, no. 2, pp. 188-201.
  • 22. T. Minagawa, T. Kitami: Packet size based dynamic scheduling for assured services in DiffServ network, Electronics and Communications in Japan 2004, vol. 88, no. 1, pp. 12-20.
  • 23. R. Schoenen, G. Post, G. Sander: Prioritized arbitration for input-queued switches with 100% throughput, IEEE ATM Workshop, 1999, pp. 253-258.
  • 24. M. Song, M. Alam: Two scheduling algorithms for input-queued switches guaranteeing voice QoS, IEEE GLOBECOM, 2001, pp. 92-96.
  • 25. Y. Zhang, P. G. Harrison: Performance of a priority-weighted round robin mechanisms for differentiated service networks, IEEE International Conference on Computer Communications and Networks, 2007, pp. 1198-1203.
  • 26. S. Q. Zheng, M. Yang, J. Blanton, P. Golla, D. Verchere: A simple and fast parallel round-robin arbiter for high-speed switch control and scheduling, IEEE Midwest Symposium on Circuits and Systems, 2002, pp. 671-674.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BWA0-0037-0018
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.