Gossip-Based Real-Time Task Scheduling Using Expander Graph

  • Moumita ChatterjeeEmail author
  • S. K. Setua
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 897)


In this paper, we consider the scheduling of real-time distributed tasks in large-scale dynamic networks, where node and link failures and message losses occur frequently. We propose a distributed scheduling algorithm using gossip-based approach called GBTS for dynamic and reliable discovery of suitable nodes that can execute the tasks. GBTS takes advantage of the slack times to optimize the gossiping duration, thereby satisfying the end-to-end timing constraints of tasks with a probabilistic guarantee. Although gossip-based protocols are fault tolerant, they incur high message overheads. We propose to use a highly connected, sparse graph called the expander graph to control the communication complexity of our algorithm. Performance analysis shows that GBTS performs better in terms of both time and message complexity.


Time/utility functions Real-time task Gossip Transition probability Expander graphs 


  1. 1.
    Han, K., et al.: Exploiting slack for scheduling dependent, distributable real-time threads in mobile ad hoc networks. In: RTNS, March 2007Google Scholar
  2. 2.
    Bettati, R.: End-to-End scheduling to meet deadlines in distributed systems. Ph.D. thesis. UIUC (1994)Google Scholar
  3. 3.
    Han, K., Ravindran, B., Jensen, E.D.: RTG-L: dependably scheduling real-timedistributable threads in large-scale, unreliable networks. In: Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing (PRDC) (2007)Google Scholar
  4. 4.
    Zhang, B., Han, K., Ravindran, B., Jensen, E.D.: RTQG: Real-time quorumbased gossip protocol for unreliable networks. In: Proceedings of The Third International Conference on Availability, Reliability and Security (2008)Google Scholar
  5. 5.
    Jensen, E.D., et al.: A time-driven scheduling model for real-time systems. In: RTSS, pp. 112–122, Dec 1985Google Scholar
  6. 6.
    Kasprzyk, R.: Diffusion in networks. J. Telecommun. Inf. Technol. 2 (2012)Google Scholar
  7. 7.
    Doerr, B., Friedrich, T., Sauerwald, T.: Quasirandom rumor spreading: expanders, push vs. pull, and robustness. In: Albers, S. et al. ICALP 2009, Part 1. LNCS, vol. 5555, pp. 366–377. Springer, Heidelberg (2009)Google Scholar
  8. 8.
    Shah, D.: Gossip algorithms. In: Foundations and Trends in Networking, vol. 3, no. 1, pp. 1–125 (2009).
  9. 9.
    Wijetunge, U., Perreau, S., Pollok, A.: Distributed stochastic routing optimization using expander graph theory. In: IEEE Australian Communication Theory Workshop AusCTW (2011)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringUniversity of CalcuttaKolkataIndia

Personalised recommendations