Scheduling Criteria Evaluation with Longer Job First in Information Centric Network

  • Ibrahim AbdullahiEmail author
  • A. Suki M. Arif
  • Yousef Fazea
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1073)


Schedulers are always important for good system performance in Operating systems. In Operating system concepts, the better and flexible a scheduler, the more likely the system attain optimization through maximum Central Processing Unit (CPU) utilization, maximum throughput, minimum turn-around time, minimum waiting time and less Context switch. Scheduling practice has also seemed to be of essence to the Internet. Packets are schedule to cross hops systematically to enhance quality of service (QoS) and minimize excessive bandwidth utilization. This report presents some scheduling algorithms and suggests an extension of the Longest Job First (LJF) algorithm to enhance system performance in multiprogramming domain and Internet. Cache improvement is shown by tapping the advantages of the LJF in Information Centric Networking. This was achieved by introducing a new technique called Combinational Burst Time (CBT) and Combined Weighted Average (Cwa). Monte Carlo simulation using discrete Poisson for the process burst time generation was demonstrated to achieve some of the optimization criteria in CPU Scheduling.


CPU scheduling Optimization Combinational Burst Time CBT Longest Job First Caching Operating system Information-Centric Networking 


  1. 1.
    Galvin, P.B., Gagne, G., Silberschatz, A.: Operating System Concepts. Wiley, Hoboken (2003)zbMATHGoogle Scholar
  2. 2.
    Fazea, Y., Amphawan, A.: 5 × 5 25 Gbit/s WDM-MDM. J. Opt. Commun. 36, 327–333 (2015)CrossRefGoogle Scholar
  3. 3.
    Hassan, S., Fazea, Y., Habbal, A., Ibrahim, H.: Twisted Laguerre-Gaussian mode division multiplexing to support blockchain applications. In: Region 10 Conference, TENCON 2017–2017, pp. 2421–2425. IEEE (2017)Google Scholar
  4. 4.
    Fazea, Y., Amphawan, A.: 32 channel DQPSK DWDM-PON for local area network using dispersion compensation fiber. In: EPJ Web of Conferences, vol. 162, pp. 1–3 (2017)Google Scholar
  5. 5.
    Fazea, Y.: Numerical simulation of helical structure mode-division multiplexing with nonconcentric ring vortices. Opt. Commun. 437, 303–311 (2019)CrossRefGoogle Scholar
  6. 6.
    Fazea, Y., Mezhuyev, V.: Selective mode excitation techniques for mode-division multiplexing: a critical review. Opt. Fiber Technol. 45, 280–288 (2018)CrossRefGoogle Scholar
  7. 7.
    Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp. 1–12 (2009)Google Scholar
  8. 8.
    Ahlgren, B., Dannewitz, C., Imbrenda, C., Kutscher, D., Ohlman, B.: A survey of information-centric networking. IEEE Commun. Mag. 50, 26–36 (2012)CrossRefGoogle Scholar
  9. 9.
    Biersack, E.W., Schroeder, B., Urvoy-Keller, G.: Scheduling in practice. ACM SIGMETRICS Perform. Eval. Rev. 34, 21–28 (2007)CrossRefGoogle Scholar
  10. 10.
    Abdullahi, I., Junaidu, S.: Empirical framework to mitigate problems in longer job first scheduling algorithm LJF+CBT. Int. J. Comput. Appl. 75 (2013)Google Scholar
  11. 11.
    Ahlgren, B., D’Ambrosio, M., Marchisio, M., Marsh, I., Dannewitz, C., Ohlman, B., et al.: Design considerations for a network of information. In: Proceedings of the 2008 ACM CoNEXT Conference, p. 66 (2008)Google Scholar
  12. 12.
    Fluhrer, S., Mantin, I., Shamir, A.: Weaknesses in the key scheduling algorithm of RC4. In: International Workshop on Selected Areas in Cryptography, pp. 1–24 (2001)Google Scholar
  13. 13.
    Mohanty, R., Das, M., Prasanna, M.L.: Design and performance evaluation of a new proposed fittest job first dynamic round robin (FJFDRR) scheduling algorithm. arXiv preprint arXiv:1109.3075 (2011)
  14. 14.
    Sourlas, V., Gkatzikis, L., Flegkas, P., Tassiulas, L.: Distributed cache management in information-centric networks. IEEE Trans. Netw. Serv. Manag. 10, 286–299 (2013)CrossRefGoogle Scholar
  15. 15.
    Abdullahi, I., Arif, S., Hassan, S.: Ubiquitous shift with information centric network caching using fog computing. In: Computational Intelligence in Information Systems, pp. 327–335. Springer (2015)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Ibrahim Abdullahi
    • 1
    Email author
  • A. Suki M. Arif
    • 2
  • Yousef Fazea
    • 2
  1. 1.Department of Mathematics/Computer ScienceIbrahim Badamasi Babangida UniversityLapaiNigeria
  2. 2.InterNetWorks Research Laboratory, School of ComputingUniversiti Utara MalaysiaSintokMalaysia

Personalised recommendations