Abstract
A recent trend of peering at geo-diversified Internet exchange points (IXPs) has empowered decades-old proposal of inter-networking and opened up new avenues of business ventures. IP-transit, cloud direct and remote peering are a few important amongst numerous proposals of service provisioning capitalizing on this peering infrastructure support across domains. Enduring these business proposals becomes a challenging task, especially when the increased dependency of enterprises over the Internet is affirmed. Volatile traffic priorities necessitate different strategies of flow management for each pattern of enterprise traffic. Providing diverse service guarantees to each traffic class require careful selection of resource allocation and compliance of inter-domain policies. In this paper, we propose a novel orchestration framework that helps to stitch end-to-end traffic engineering compliant multiple paths. The framework enables prioritized management of various traffic classes in a centralized manner by employing software defined networking paradigm. Abstraction of multi-graph from the inter-connectivity of peering anchors helps to gear service provisioning spanning across multiple domains. Beside presenting details of our framework, we have articulated use cases highlighting the efficacy of our proposal. We have observed a maximum increase of 26.52% in throughput using proposed model compared with an optimization formulation from literature. Our results imply transparent utility of this formulation for various network topologies and traffic loads.







Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
Usually hundreds of ISPs peer at a single IXP, for instance, in Amsterdam Internet Exchange (AMS-IX) 828 participants are peering to-date. 836 ASes are peering at London Internet Exchange (LINX). For brevity and better visualization, we have shown few service providers and few transit providers peer at each IXP.
References
Motamedi, R., Rejaie, R., & Willinger, W. (2015). A survey of techniques for internet topology discovery. IEEE Communications Surveys & Tutorials, 17(2), 1044–1065.
Antichi, G., Castro, I., Chiesa, M., Fernandes, E. L., Lapeyrade, R., Kopp, D., et al. (2017). Endeavour: A scalable sdn architecture for real-world IXPs. IEEE Journal on Selected Areas in Communications, 35(11), 2553–2562.
Antonopoulos, A., Kartsakli, E., Perillo, C., & Verikoukis, C. (2017). Shedding light on the Internet: Stakeholders and network neutrality. IEEE Communications Magazine, 55(7), 216–223.
Klöti, R., Ager, B., Kotronis, V., Nomikos, G., & Dimitropoulos, X. (2016). A comparative look into public IXP datasets. ACM SIGCOMM Computer Communication Review, 46(1), 21–29.
Giotsas, V., Dietzel, C., Smaragdakis, G., Feldmann, A., Berger, A., & Aben, E. (2017). Detecting peering infrastructure outages in the wild. In Proceedings of the conference of the ACM special interest group on data communication (pp. 446–459). ACM.
M. S. P. Ltd. (2018). Fast and direct multicloud connectivity. https://www.megaport.com/
C. C. Inc. (2018). The cloud connection company cloud connectivity. https://consoleconnect.com/
Zhou, X., Wei, J., & Xu, C.-Z. (2007). Quality-of-service differentiation on the internet: A taxonomy. Journal of Network and Computer Applications, 30(1), 354–383.
Levis, P.: (2008). RFC: Considerations of provider-to-provider agreements for internet-scale quality of service (QoS), no. 5160.
Griffin, T. G., & Wilfong, G. (2002). Analysis of the med oscillation problem in BGP. In 10th IEEE international conference on network protocols, 2002. Proceedings (pp. 90–99). IEEE.
Katz-Bassett, E., Madhyastha, H. V., John, J. P., Krishnamurthy, A., Wetherall, D., & Anderson, T. E. (2008). Studying black holes in the internet with hubble. In NSDI (Vol. 8, pp. 247–262).
Shao, W., Iannone, L., Rougier, J.-L., Devienne, F., & Viste, M. (2016). Scalable BGP prefix selection for effective inter-domain traffic engineering. In Network operations and management symposium (NOMS), 2016 IEEE/IFIP. IEEE (pp. 315–323).
Al-Musawi, B., Branch, P., & Armitage, G. (2016). BGP anomaly detection techniques: A survey. IEEE Communications Surveys & Tutorials, 19, 377–396.
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., et al. (2013). B4: Experience with a globally-deployed software defined WAN. ACM SIGCOMM Computer Communication Review, 43(4), 3–14.
Hong, C.-Y., Kandula, S., Mahajan, R., Zhang, M., Gill, V., Nanduri, M., & Wattenhofer, R. (2013). Achieving high utilization with software-driven WAN. In ACM SIGCOMM computer communication review (Vol. 43, no. 4, pp. 15–26). ACM.
Wang, Y., Bi, J., & Zhang, K. (2017). A sdn-based framework for fine-grained inter-domain routing diversity. Mobile Networks and Applications, 22(5), 906–917.
Kotronis, V., Rost, M., Georgopoulos, B. A., Ager, B., Schmid, S., & Dimitropoulos, X. (2016). Stitching inter-domain paths over IXPs. In ACM SOSR.
Birkner, R., Gupta, A., Feamster, N., & Vanbever, L. (2017) SDX-based flexibility or Internet correctness?: Pick two!. In Proceedings of the symposium on SDN research (pp. 1–7). ACM.
Basit, A., Qaisar, S. B., Syed, H. R., & Ali, M. (2017). SDN orchestration for next generation inter-networking: A multipath forwarding approach. IEEE Access, 5, 13077–13089.
Filsfils, C., Nainar, N. K., Pignataro, C., Cardona, J. C., & Francois, P. (2015). The segment routing architecture. In 2015 IEEE global communications conference (GLOBECOM) (pp. 1–6). IEEE.
Moreno, E., Beghelli, A., & Cugini, F. (2017). Traffic engineering in segment routing networks. Computer Networks, 114, 23–31.
Desmouceaux, Y., Pfister, P., Tollet, J., Townsley, M., & Clausen, T. (2018). 6LB: Scalable and application-aware load balancing with segment routing. IEEE/ACM Transactions on Networking, 26, 819–834.
Trimponias, G., Xiao, Y., Xu, H., Wu, X., & Geng, Y. (2017). On traffic engineering with segment routing in SDN based WANs. arXiv preprint arXiv:1703.05907.
Kotronis, V., Dimitropoulos, X., & Ager, B. (2012). Outsourcing the routing control logic: Better internet routing based on SDN principles. In Proceedings of the 11th ACM workshop on hot topics in networks (pp. 55–60). ACM.
Gupta, A., Vanbever, L., Shahbaz, M., Donovan, S. P., Schlinker, B., Feamster, N., et al. (2015). SDX: A software defined internet exchange. ACM SIGCOMM Computer Communication Review, 44(4), 551–562.
Caesar, M., Caldwell, D., Feamster, N., Rexford, J., Shaikh, A., & van der Merwe, J. (2005). Design and implementation of a routing control platform. In Proceedings of the 2nd conference on symposium on networked systems design & implementation (Vol. 2, pp. 15–28). USENIX Association.
Nomikos, G. (2017). Re-mapping the Internet: Bring the IXPs into play, no. Section II.
Chiesa, M., Dietzel, C., Antichi, G., Bruyere, M., Castro, I., Gusat, M., et al. (2016). Inter-domain networking innovation on steroids: Empowering IXPs with SDN capabilities. IEEE Communications Magazine, 54(10), 102–108.
Eppstein, D. (1998). Finding the k shortest paths. SIAM Journal on Computing, 28(2), 652–673.
Bu, C., Wang, X., Cheng, H., Huang, M., Li, K., & Das, S. K. (2017). Enabling adaptive routing service customization via the integration of SDN and NFV. Journal of Network and Computer Applications, 93, 123–136.
Bruyere, M., Antichi, G., Fernandes, E. L., Lapeyrade, R., Uhlig, S., Owezarski, P., et al. (2018). Rethinking IXPs’ architecture in the age of SDN. IEEE Journal on Selected Areas in Communications, 36(12), 2667–2674.
Lapeyrade, R., Bruyère, M., & Owezarski, P. (2016). Openflow-based migration and management of the TOUIX IXP. In Network operations and management symposium (NOMS), 2016 IEEE/IFIP. IEEE (pp. 1131–1136).
Sherwood, R., Chan, M., Covington, A., Gibb, G., Flajslik, M., Handigol, N., et al. (2010). Carving research slices out of your production networks with openflow. ACM SIGCOMM Computer Communication Review, 40(1), 129–130.
Afolabi, I., Taleb, T., Samdanis, K., Ksentini, A., & Flinck, H. (2018). Network slicing & softwarization: A survey on principles, enabling technologies & solutions. IEEE Communications Surveys & Tutorials, 20, 2429–2453.
Ryoo, H. S., & Sahinidis, N. V. (1996). A branch-and-reduce approach to global optimization. Journal of Global Optimization, 8(2), 107–138.
Fletcher, R., & Leyffer, S. (1994). Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming, 66(1), 327–349.
Lawler, E. L., & Bell, M. (1966). A method for solving discrete optimization problems. Operations Research, 14(6), 1098–1112.
Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica: Journal of the Econometric Society, 28, 497–520.
Pataki, G., Tural, M., & Wong, E. B. (2010). Basis reduction and the complexity of branch-and-bound. In Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms (pp. 1254–1261). Society for Industrial and Applied Mathematics.
Golub, G. H., & Van Loan, C. F. (2012). Matrix computations (Vol. 3). Baltimore: JHU Press.
Gonzaga, C. C. (1995). On the complexity of linear programming. Resenhas do Instituto de Matemática e Estatística da Universidade de São Paulo, 2(2), 197–207.
Fourer, R., Gay, D. M., & Kernighan, B. W. (1990). A modeling language for mathematical programming. Management Science, 36(5), 519–554.
Schult, D. A., & Swart, P. (2008). Exploring network structure, dynamics, and function using networkX. In Proceedings of the 7th Python in science conferences (SciPy 2008) (Vol. 2008, pp. 11–16).
Pérez, F., & Granger, B. E. (2007). Ipython: A system for interactive scientific computing. Computing in Science & Engineering, 9(3), 21–29.
Rossum, G. (1995). Python reference manual.
Lantz, B., Heller, B., & McKeown, N. (2010). A network in a laptop: Rapid prototyping for software-defined networks. In Proceedings of the 9th ACM SIGCOMM workshop on hot topics in networks (p. 19). ACM.
R. S. F. Community. (2017). Ryu SDN controller framework. https://osrg.github.io/ryu/.
Barabási, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509–512.
Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of ‘small-world’ networks. Nature, 393(6684), 440–442.
Erdos, P., & Rényi, A. (1960). On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5(1), 17–60.
Basit, A., & Ahmed, N. (2017). Path diversity for inter-domain routing security. In 2017 14th international Bhurban conference on applied sciences and technology (IBCAST) (pp. 384–391). IEEE.
F. I. Services. (2018). France-IX services marketplace for ISPs. https://www.franceix.net/en/solutions/marketplace/.
Karakus, M., & Durresi, A. (2017). Quality of service (QoS) in software defined networking (SDN): A survey. Journal of Network and Computer Applications, 80, 200–218.
N. Inc. (2018). Netflix open connect initiative program. https://openconnect.netflix.com/en/.
NL-ix.net. (2018). To the interconnect exchange internet exchange. https://public.nl-ix.net/.
Acknowledgements
This work was partially supported by the National Funding from the FCT—Fundação para a Ciência e a Tecnologia through the UID/EEA/50008/2019 Project; and by Brazilian National Council for Research and Development (CNPq) via Grant No. 309335/2017-5.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix A: AMPL code of proposed mathematical model
Appendix A: AMPL code of proposed mathematical model

Rights and permissions
About this article
Cite this article
Basit, A., Qaisar, S., Ali, M. et al. Interconnecting networks with optimized service provisioning. Telecommun Syst 73, 223–239 (2020). https://doi.org/10.1007/s11235-019-00606-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-019-00606-3