A Modified Priority-Based Multischeduler (PBMS) for Optical Network

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 324)


In an optical network, packet scheduling is a big challenge over the communication. For the requirement to achieve high-speed communication, the network communication society needs the novel scheduler to schedule the variable length of packets in apropos method. The previous scheduling algorithms support mostly fixed size of packet, and it provides low throughput, high waiting time, and high latency. The proposed modified scheduler priority-based multischeduler (PBMS) scheduling algorithm overcomes these disadvantages through the following three methodologies: (i) prioritizer, (ii) splitter, and (iii) Round robin (RR) method; the prioritizer provides priority to the variable length of packets, queue splitter fixes the appropriate queue where the packet has been processed, and RR method assigns a fixed time unit to process the packets in queue with round drip mode. This paper proves the feasibility of our scheduler and comparative experimental results.


Priority-based multischeduler (PBMS) Turnaround time (TT) 


  1. 1.
    S.H. Moon, D.K. Sung, in High-performance variable-length packet scheduling algorithm for IP traffic, vol. 4. Global Telecommunication Conference, GLOBECOM’01 (2001), pp. 305–701Google Scholar
  2. 2.
    S. Jaiswal, G. Iannacone, C. Diot, J. Kurose, D. Towsley, in Measurement and classification of out-of-sequence packets in a tier-1 IP backbone, vol. 2. Proceedings of INFOCOM (2003), pp. 1199–1209Google Scholar
  3. 3.
    I. kotuliak, T. Atmaca, in Optical networks access node performance. Proceedings of ELMAR-2004 (2004), pp. 418–423Google Scholar
  4. 4.
    H. Xia, Z. Zeng, in Congestion based opportunistic packet scheduling algorithm with variable size packets support in Ad hoc Networks. Wireless communications networking and mobile computing (WiCOM), 2010. 6th International Conference on 23–25 Sept 2010, pp. 1–5Google Scholar
  5. 5.
    M. Elhaddad, R. Melhem, in On the emulation of finite-buffered output queued switches using combined input–output queuing, vol. 5218. Proceedings of 22nd International Symposium DISC (2008), pp. 197–221Google Scholar
  6. 6.
    B.-G. Chun, M. Baker, Evaluation of packet scheduling algorithms in mobile ad hoc networks. Mobile Comput. Commun. Rev. 6(3), 36–49 (2002)CrossRefGoogle Scholar
  7. 7.
    Z. Hu, X.W. Li, B. Liu, Fixed length switching vs variable length switching in input queued IP switches, IP operations and management, 2004, in Proceedings of IEEE Workshop (2004), pp. 117–122Google Scholar
  8. 8.
    F. Xue, Z. Pan, H. OSA, J. Yang, J. Yang, OSA Cao, K. Okamoto, S. Kamei, B. Venkatesh Akella, S.J. Yoo, Design and experimental demonstration of a variable-length optical packet routing system with unified contention resolution. J. Lightwave Technol. 22(11), 2570–2581 (2004)Google Scholar
  9. 9.
    B.C. Chatterjee, N. Sarma, P.P. Sahu, Priority based routing and wavelength assignment with traffic grooming for optical networks. Opt. Commun. Netw. IEEE/OSA J. 4(6), 480–489 (2012)CrossRefGoogle Scholar
  10. 10.
    M. Laor, L. Gendel, The effect of packet reordering in a backbone link on application throughput. Netw. IEEE 16(5), 28–36 (2002)CrossRefGoogle Scholar
  11. 11.
    W.K. Jaspher, A. Raj, Packet scheduling algorithms in different wireless networks a survey. Int. J. Eng. Res. Technol. (IJERT) 1(8), 1–6 (2012)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.ECE, MCA, ECE DepartmentAnna UniversityChennaiIndia
  2. 2.RMD Engineering CollegeChennaiIndia
  3. 3.Vel Tech MultiTech Dr. Rangarajan Dr. Sakunthala Engineering CollegeChennaiIndia

Personalised recommendations