全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Topology Abstraction Service for IP VPNs: Core Network Partitioning for Resource Sharing

DOI: 10.4236/ajor.2018.83011, PP. 167-202

Keywords: IP-VPN Service, Topology Abstraction, Maximum Concurrent Flow, Maximum Multicommodity Flow

Full-Text   Cite this paper   Add to My Lib

Abstract:

VPN service providers (VSP) and IP-VPN customers have traditionally maintained service demarcation boundaries between their routing and signaling entities. This has resulted in the VPNs viewing the VSP network as an opaque entity and therefore limiting any meaningful interaction between the VSP and the VPNs. A key challenge is to expose each VPN to information about available network resources through an abstraction (TA) [1] which is both accurate and fair. In [2] we proposed three decentralized schemes assuming that all the border nodes performing the abstraction have access to the entire core network topology. This assumption likely leads to over- or under-subscription. In this paper we develop centralized schemes to partition the core network capacities, and assign each partition to a specific VPN for applying the decentralized abstraction schemes presented in [2]. First, we present two schemes based on the maximum concurrent flow and the maximum multicommodity flow (MMCF) formulations. We then propose approaches to address the fairness concerns that arise when MMCF formulation is used. We present results based on extensive simulations on several topologies, and provide a comparative evaluation of the different schemes in terms of abstraction efficiency, fairness to VPNs and call performance characteristics achieved.

References

[1]  Ravindran, R., Huang, C. and Thulasiraman, K. (2006) A Dynamic Managed VPN Service: Architecture and Algorithms. Proceedings of IEEE ICC, 2, 664-669.
https://doi.org/10.1109/ICC.2006.254783
[2]  Ravindran, R., Huang, C. and Thulasiraman, K. (2013) Topology Abstraction Service for IP-VPNs. IEEE Transactions on Parallel and Distributed Systems, 24, 184-195.
https://doi.org/10.1109/TPDS.2012.27
[3]  Ravindran, R., Huang, C. and Thulasiraman, K. (2007) Managed Dynamic VPN Service: Core Capacity Sharing Schemes for Improved VPN Performance. 2007 IEEE International Conference on Communications, Glasgow, 24-28 June 2007, 211-216.
https://doi.org/10.1109/ICC.2007.43
[4]  Shahrokhi, F. and Matula, D.W. (1990) The Maximum Concurrent Flow Problem. Journal of the Association for Computing Machinery, 37, 318-334.
https://doi.org/10.1145/77600.77620
[5]  Garg, N. and Konemann, J. (1998) Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. Proceedings of 39th Annual Symposium on Foundations of Computer Science, Palo Alto, 8-11 November 1998, 300-309.
https://doi.org/10.1109/SFCS.1998.743463
[6]  Fleischer, L. (1999) Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. Proceedings of IEEE 40th Annual Symposium of Foundations of Computer Science, New York, 17-19 October 1999, 24-31.
https://doi.org/10.1109/SFFCS.1999.814573
[7]  Waxman, B. (1988) Routing of Multipoint Connections. Journal on Selected Areas in Communications, 6, 1617-1622.
https://doi.org/10.1109/49.12889
[8]  Ho, K. and Cheung, K. (2007) Generalized Survivable Networks. IEEE/ACM Transactions on Networking, 15, 750-760.
https://doi.org/10.1109/TNET.2007.893889
[9]  Law, A. and Kelton, W. (1999) Simulation Modelling and Analysis. 3rd Edition, McGraw Hill, New York.
[10]  LINDO Systems, Inc. (2018) LINDO Optimization Tool.
http://www.lindo.com
[11]  Peleg, D. and Schaffer, A. (1989) Graph Spanners. Journal of Graph Theory, 13, 99-116.
https://doi.org/10.1002/jgt.3190130114
[12]  Cohen, E. (1998) Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM Journal on Computing, 28, 210-236.
https://doi.org/10.1137/S0097539794261295
[13]  Dragan, F. and Yan, C. (2006) Network Flow Spanners. LATIN, 3887, 410-422.
https://doi.org/10.1007/11682462_39
[14]  Thulasiraman, K., Javed, M. and Xue, G. (2010) Primal Meets Dual: A Generalized Theory of Logical Topology Survivability in IP-Over-WDM Optical Networks. 2010 Second International Conference on Communication Systems and Networks, Bangalore, 5-9 January 2010, 1-10.
[15]  Keralapura, R., Chuah, C., Taft, N. and Iannaccone, G. (2005) Can Co-Existing Overlays Inadvertently Step on Each Other. 2005 13th IEEE International Conference on Network Protocols, Boston, 6-9 November 2005, 211-214.
[16]  Jiang, W., Zhang-Shen, R., Rexford, J. and Chiang, M. (2009) Cooperative Content Distribution and Traffic Engineering in an ISP Network. ACM SIGMETRICS Performance Evaluation Review, 2, 239-250.
https://doi.org/10.1145/1555349.1555377
[17]  Chowdhury, K., Rahman, M. and Boutaba, R. (2009) Virtual Network Embedding with Coordinated Node and Link Mapping. 2009 IEEE INFOCOM, Rio de Janeiro, 19-25 April 2009, 783-791.
[18]  Rost, M., Fuerst, C. and Schmid, S. (2015) Beyond the Stars: Revisiting Virtual Cluster Embedding. ACM SIGCOMM Computer Communication Reviews, 45, 12-18.
https://doi.org/10.1145/2805789.2805792

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133