Topology Aggregation for e-Science Networks

##plugins.themes.academic_pro.article.sidebar##

Published Jul 1, 2010
https://doi.org/10.47164/ijngc.v1i1.2
Download
PDF
Statistic

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...
Volume 1, Issue 1, Inaugural Issue 2010

##plugins.themes.academic_pro.article.main##

Eun-Sung Jung
Computer and Information Science and Engineering Department University of Florida
Sanjay Ranka
Computer and Information Science and Engineering Department University of Florida
Sartaj Sahni
Computer and Information Science and Engineering Department University of Florida

Abstract

We propose several algorithms for topology aggregation (TA) to summarize large-scale networks that are becoming prevalent in e-Science. These TA techniques are shown to be significantly better for path requests in e-Science that may consist of simultaneous reservation of multiple paths and/or simultaneous reservation for multiple requests. Our extensive simulation demonstrates the benefits of our algorithms both in terms of accuracy and performance.

##plugins.themes.academic_pro.article.details##

How to Cite
Jung, E.-S., Sanjay Ranka, & Sartaj Sahni. (2010). Topology Aggregation for e-Science Networks. International Journal of Next-Generation Computing, 1(1), 01–13. https://doi.org/10.47164/ijngc.v1i1.2
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. Abilene http://abilene.internet2.edu/.
  2. Baruch, A., and Yuval, S. 2001. Topology aggregation for directed graphs, IEEE/ACM Transactions on Networking, 9, 82–90.
  3. Bunn, J., and Newman, H. 2003. Data-intensive grids for high-energy physics, Grid Computing: Making the Global Infrastructure a Reality, John Wiley & Sons, Inc.
  4. CA*net4 http://www.canarie.ca/canet4/index.html Energy Science Network (ESnet) http://www.es.net Ferrari, T. Dec 2007. Grid Network Services Use Cases from the e-Science Community.
  5. Farrel, A. A Path Computation Element (PCE)-Based Architecture http://www.ietf.org/rfc/rfc4655.txt Foster, I., and Kesselman, C. 1999. The Grid: Blueprint for a New Computing Infrastructure, Morgan Kaufmann.
  6. Geant2 http://www.geant2.net Grimmett, G.R., and Welsh, D.J. 1982. Flow in networks with random capacities, Stochastics, 205-229. Internet2 http://www.internet2.edu Johnston, W.E.,Metzger, J. ,OConnor, M. ,Collins, M. ,Burrescia, E.,Dart, E.,Gagliardi, J.,Guok, C., and Oberman, K. 2008. Network Communication as a Service-Oriented Capability, High Performance Computing and Grids in Action, Vol. 16.
  7. Karypis, G., and Vipin, K. 1995. MeTis: Unstrctured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0, www.cs.umn.edu/ metis.
  8. King-Shan Lui, Nahrstedt, K., and Chen, S. 2004. Routing with topology aggregation in delay-bandwidth sensitive networks, IEEE/ACM Transactions on Networking, 12, 17–29.
  9. Korkmaz, T., and Krunz, M. 2000. Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks, ACM Transactions on Modeling and Computer Simulation, 10, 295–325.
  10. National Lambda Rail,http://www.nlr.net Liu, J.,Niu Z., and Zheng J. 2000. Parameter Dimensioning Algorithms of the PNNI Complex Node Model with Bypasses, IEICE Transaction on Communication, E83-B, 638–645.
  11. Medina, A., Lakhina, A.,Matta, I., and Byers, J. 2001. BRITE: an approach to universal topology generation, Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 346–353.
  12. Newman, H. B.,Ellisman, M. H., and Orcutt, J.A. Nov 2003. Data-intensive e-Science frontier research, Communications of the ACM, 46, 11,68–77.
  13. Pelsser, and Bonaventure 2006. Path Selection Techniques to Establish Constrained Interdomain MPLS LSPs, Networking Technologies, Services, and Protocols, 209–220.
  14. Rao, N.S.,Carter, S.M.,Wu, Q.,Wing, W.R.,Zhu, M.,Mezzacappa, A.,Veeraraghavan, M. , and Blondin, J.M. 2005. Networking for large-scale science: Infrastructure, provisioning, transport and application mapping, Proceedings of SciDAC Meeting..
  15. Ravindra, A. 1993. Network flows : theory, algorithms, and applications, Prentice Hall.
  16. Ricciato,F.,Monaco, U., and Ali, D. 2005. Distributed schemes for diverse path computation in multidomain MPLS networks, IEEE Communications Magazine, 43, 138–146
  17. SOHEILI, A.,KALOGERAKI, V., and GUNOPULOS, D. 2005. Spatial queries in sensor networks. In Proceedings of the Proceedings of the 13th annual ACM international workshop on Geographic information systems, Bremen, Germany 2005 ACM.
  18. Sarangan, V.,Ghosh, D., and Acharya, R. 2004. Performance analysis of capacity-aware state aggregation for inter-domain QoS routing, IEEE Global Telecommunications Conference, 3, 1458–1463.
  19. Sprintson, A.,Yannuzzi, M.,Orda, A., and Masip-Bruin, X. 2007. Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks,IEEE International Conference on Computer Communications, 1820–1828.
  20. Tam, W.-Y.,Lui, K.-S., Uludag, S. , and Nahrstedt, K. Aug 2007. Quality-of-Service routing with path information aggregation, Computer Networks, 51, 3574–3594.
  21. UKescience The U.K. Research Councils, http://www.research-councils.ac.uk/escience/ (Accessed: Feb 2008)
  22. Uludag, S.,Lui, K.-S. ,Nahrstedt, K., and Brewster, G. 2007. Analysis of Topology Aggregation techniques for QoS routing,ACM Computing Surveys, 39.
  23. Li, Yan,Ranka, S., and Sahni, S. July 2009. In-advance path reservation for file transfers In e-Science applications, Computers and Communications, 2009. ISCC 2009. IEEE Symposium on, 176–181.
  24. Yannuzzi, M.,Masip-Bruin, X., and Bonaventure, O. 2005. Open issues in interdomain routing: a survey, IEEE Network, 19, 49–56.
  25. Tang, Y. , and Chen, S. 2004. QoS information approximation for aggregated networks, IEEE International Conference on Communications, 4, 2107–2111.
  26. Yoo, Y.,Ahn, S. , and Chong Sang Kim 2000. Link state aggregation using a shufflenet in ATM PNNI networks, IEEE Global Telecommunications Conference, 481–486.