Dynamically established transmission paths in the future Internet - proposal of a framework

• Autorzy: Kamola M. , Arabas P.
• Języki publikacji: EN

Abstrakty

EN

An idea of a global system for dynamic contracting data paths in the global IP network is presented. System scalability and efficiency is based on the current natural hierarchy of Internet providers. Architecture of the bandwidth market service accomplishing operation of such system is outlined. Benefits from dynamic provisioning of such dedicated paths with QoS guarantees are shown. Utilization of various technologies for this system is discussed.

Słowa kluczowe

EN

data path; QoS; interconnection; future internet; NGN; services marketplace

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2011
• Tom: Vol. 59, nr 3
• Strony: 357--366
• Opis fizyczny: Bibliogr. 16 poz., rys., tab.

Twórcy

autor

Kamola M.

autor

Arabas P.

• Institute of Control and Computation Engineering, Warsaw University of Technology, 15/19 Nowowiejska St., 00-665 Warszawa, Poland,

Bibliografia

• [1] T. Aoyama, “A new generation network: beyond the internet and NGN”, Communications Magazine, IEEE 47 (5), 82–87 (2009).
• [2] O. Dugeon, D. Morris, E. Monteiro, W. Burakowski, and M. Diaz, “End to end quality of service over heterogeneous networks (EuQoS)”, Proc. Conf. on Network Control and Engineering for QoS, Security and Mobility 1, CD-ROM (2005).
• [3] P. Arabas and M. Kamola, “Dynamic contracting of IP services – system architecture and prototype”, J. Telecommunications and Information Technology 2, 43–52 (2011).
• [4] B. Rochwerger, A. Galis, E. Levy, J.A. Caceres, D. Breitgand, Y. Wolfsthal, I.M. Llorente, M. Wusthoff, R.S. Montero, and E. Elmroth, “Reservoir: management technologies and requirements for next generation Service Oriented Infrastructures”, Integrated Network Management 1, 307–310 (2009).
• [5] I. Laso-Ballesteros, “Future Internet and NGN. Design requirements and principles for a future media and 3D Internet”, Technical Report, Report by Eur. Commission 1, ftp://ftp.cordis.europa.eu/pub/fp7/ict/docs/netmedia/futureinternet-and-ngn-2009-4071 en.pdf (2005).
• [6] P. Arabas, M. Kamola, K. Malinowski, and M. Malowidzki, “Pricing for IP networks and services”, Inf. Knowl. Syst. Manag. 3, 153–171 (2002).
• [7] Xin Wang and H. Schulzrinne, “An integrated resource negotiation, pricing, and QoS adaptation framework for multimedia applications”, Selected Areas in Communications, IEEE J. 18 (12), 2514–2529 (2000).
• [8] P. Baake and T. Wichmann, “On the economics of Internet peering”, Netnomics 1, 89–105 (1999).
• [9] R. Hancock, “Initial overall architecture”, Technical Report, Trilogy Consortium, http://typo3.trilogy-project.eu/fileadmin/publications/Deliverables/D3 - Initial Overall Architecture.pdf (2008).
• [10] H. Harai, “Akari architecture design project”, 2nd Japan EU Symposium on New-Generation Network and Future Internet, http://akari-project.nict.go.jp/document/akarijapaneu20091013.pdf (2009).
• [11] C. Di Cairano-Gilfedder and B. Briscoe, “Potential business model analysis and requirements”, Technical Report, Etics Consortium, https://bscw.ict-etics.eu/pub/bscw.cgi/d21756/D3.2 v1 Final 170111.pdf (2011).
• [12] CAIDA, IPv4 & IPv6 Internet Topology Map, http://www.caida.org/publications/posters/png/ascore-ipv4-ipv6.200902.poster.png (2009).
• [13] FreecoNet, Freeconet. How to Begin, http://www.freeconet.pl/en/business (2011).
• [14] J.-S. Lee and B.K. Szymanski, “Stabilizing markets via a novel auction based pricing mechanism for short-term contracts for network services”, Proc. 9th IFIP/IEEE Int. Symposium on Integrated Network Management 1, 367–380 (2007).
• [15] M. Karpowicz and K. Malinowski, “Characterization of scalar strategy mechanisms for efficient resource allocation: supply side case”, Decision and Control, 46th IEEE Conf. 1, 150–155 (2007).
• [16] D.D. Clark, J. Wroclawski, K.R. Sollins, and R. Braden, “Tussle in cyberspace: defining tomorrow’s internet”, IEEE/ACM Trans. Netw. 13, 462–475 (2005).