Temporal routing metrics for networks with advance reservations

Proceedings CCGRID 2008 - 8th IEEE International Symposium on Cluster Computing and the Grid

Volumn , Issue , 2008, Pages 710-715

  Barz, Christoph ^a   Pilz, Markus ^a   Wichmann, André ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Advance reservation; Dynamic routing; Temporal metrics

Indexed keywords

CHLORINE COMPOUNDS; GRID COMPUTING; TECHNICAL PRESENTATIONS;

ADVANCE RESERVATION; ADVANCE RESERVATIONS; DYNAMIC ROUTING; TEMPORAL METRICS;

ROUTING ALGORITHMS;

EID: 50649084579     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2008.93     Document Type: Conference Paper

References (24)

1. I. J. Taylor, E. Deelman, and D. B. Gannon, Workflows for e-Science: Scientific Workflows for Grids. Springer, December 2006.
2. I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt, and A. Roy, "A distributed resource management architecture that supports advance reservations and co-allocation," in Proceedings of the International Workshop on Quality of Service, 1999.
3. R. Guerin and A. Orda, "Networks with advance reservations: The routing perspective," IEEE INFOCOM 2000, vol. 1, pp. 118-127, 2000.
4. Q. Snell, M. J. Clement, D. B. Jackson, and C. Gregory, "The performance impact of advance reservation meta-scheduling," in IPDPS '00/JSSPP '00. London, UK: Springer, 2000, pp. 137-153.
5. C. Barz, T. Eickermann, M. P. Pilz, O. Wäldrich, L. Westphal, and W. Ziegler, "Co-allocating compute and network resources - bandwidth on demand in the viola testbed," in Proceedings of the CoreGRID Symposium, ser. CoreGRID Series. Springer, September 2007.
6. Y. Kim, "Grid information retrieval system for dynamically reconfigurable virtual organization," OGF, Tech. Rep. GFD.82, Oktober 2006.
7. J. Decker and J. Schneider, "Heuristic scheduling of grid workflows supporting co-allocation and advance reservation," in CCGRID '07. Washington, DC, USA: IEEE Computer Society, 2007, pp. 335-342.
8. M. Conte, Dynamic Routing in Broadband Networks, ser. Broadband Networks and Services. Kluwer Academic Publishers, 2003.
9. Q. Ma and P. Steenkiste, "On path selection for traffic with bandwidth guarantees," in ICNP'97, 1997, pp. 191-202.
10. R. A. Guérin, A. Orda, and D. Williams, "Qos routing mechanisms and ospf extensions," in IEEE GLOBECOM, vol. 3, November 1997.
11. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE Journal of Selected Areas in Communications, vol. 14, no. 7, pp. 1228-1234, 1996.
12. Q. Ma, P. Steenkiste, and H. Zhang, "Routing high-bandwidth traffic in max-min fair share networks," in SIGCOMM. New York, NY, USA: ACM Press, 1996, pp. 206-217.
13. R. J. Gibbens, F. P. Kelly, and P. B. Key, Dynamic alternative routing. Hertfordshire, UK, UK: Prentice Hall International (UK) Ltd., 1995.
14. K. Kar and M. Kodialam, "Minimum interference routing of bandwidth guaranteed tunnels with mpls traffic engineering applications," IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, vol. 18, no. 12, pp. 2566-2579, December 2000.
15. B. Wang, X. Su, and C. L. P. Chen, "A new bandwidth guaranteed routing algorithm for mpls traffic engineering," in IEEE International Conference on Communications (ICC), vol. 2, 2002, pp. 1001-1005.
16. R. Boutaba, W. Szeto, and Y. Iraqi, "Dora: Efficient routing for mpls traffic engineering," Journal of Network and Systems Management, vol. 10, no. 3, pp. 309-325, September 2002.
17. I. Iliadis and D. Bauer, "A new class of online minimum-interference routing algorithms," in NETWORKING '02, ser. Lecture Notes in Computer Science, vol. 2345. London, UK: Springer, 2002, pp. 959-971.
18. G. B. Figueiredo, N. L. S. da Fonseca, and J. A. S. Monteiro, "A minimum interference routing algorithm with reduced computational complexity," Comput. Networks, vol. 50, no. 11, pp. 1710-1732, 2006.
19. L. C. Wolf and R. Steinmetz, "Concepts for resource reservation in advance," Multimedia Tools Appl., vol. 4, no. 3, pp. 255-278, 1997.
20. L.-O. Burchard, "Advance reservations of bandwidth in computer networks," Ph.D. dissertation, Technical University of Berlin, 2004.
21. S. Naiksatam, "Supernetworking the metacomputer: Enabling guaranteed bandwidth through deterministic and efficient provisioning," Ph.D. dissertation, Santa Clara University, California, USA, November 2006.
22. C. Barz, U. Bornhauser, P. Martini, and M. Pilz, "Timeslot based resource management in grid environments," in Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, Innsbruck, Austria, February 2008.
23. S. Leonardi, "On-line network routing," in Online algorithms, ser. Lecture Notes In Computer Science, vol. 1442. London, UK: Springer-Verlag, 1998, pp. 242-267.
24. C. Barz, P. Martini, M. Pilz, and F. Purnhagen, "Experiments on network services for the grid," in Proceedings of the 32nd IEEE Conference on Local Computer Networks (LCN '07), 2007, pp. 45-54.