Online time-constrained scheduling in linear networks

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2005, Pages 855-865

  Naor, Joseph ^a   Rosén, Adi ^a   Scalosub, Gabriel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTROL SYSTEMS; MATHEMATICAL MODELS; PACKET NETWORKS; SCHEDULING;

BUFFERLESS MODELS; DETERMINISTIC ONLINE ALGORITHMS; OPTICAL NETWORKS; OPTIMAL COMPETITIVE RATIOS;

LINEAR NETWORKS;

EID: 25844509954     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. M. Adler, A. L. Rosenberg, R. K. Sitaraman, and W. Unger, "Scheduling time-constrained communication in linear networks," Theoretical Computer Science, vol. 35, no. 6, pp. 599-623, 2002.
2. J. Liebeherr, "Multimedia networks: Issues and challanges," IEEE Computer, vol. 28, no. 4, pp. 68-69, 1995.
3. J. Rexford, J. Hall, and K. G. Shin, "A router architecture for real-time communication in multicomputer networks," IEEE Transactions on Computers, vol. 47, no. 10, pp. 1088-1101, 1998.
4. M. Adler, S. Khanna, R. Rajaraman, and A. Rosen, "Time-constrained scheduling of weighted packets on trees and meshes," Algorithmica, vol. 36, no. 2, pp. 123-152, 2003.
5. D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules," Communications of the ACM, vol. 28, no. 2, pp. 202-208, 1985.
6. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press, 1998.
7. over: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems," SIAM Journal on Computing, vol. 24, no. 2, pp. 318-339, 1995.
8. J. A. Garay, J. Naor, B. Yener, and P. Zhao, "On-line admission control and packet scheduling with interleaving," in Proceedings of the IEEE INFOCOM'02, New York, NY, June 2002, pp. 94-103.
9. J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung, "Efficient on-line call control algorithms," Journal of Algorithms, vol. 23, no. 1, pp. 180-194, 1997.
10. S. K. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. E. Rosier, D. Shasha, and F. Wang, "On the competitiveness of on-line real-time task scheduling," Real Time Systems, vol. 4, no. 2, pp. 125-144, 1992.
11. R. J. Lipton and A. Tomkins, "Online interval scheduling,'' in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 302-311.
12. R. Adler and Y. Azar, "Beating the logarithmic lower bound: Randomized preemptive disjoint paths and call control algorithms," Journal of Scheduling, vol. 6, no. 2, pp. 113-129, 2003.
13. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi, and A. Rosén, "On-line competitive algorithms for call admission in optical networks," Algorithmica, vol. 31, no. 1, pp. 29-43, 2001.