{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:24:09Z","timestamp":1781105049432,"version":"3.54.1"},"reference-count":34,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7,1]]},"abstract":"<p>The simultaneous usage of multiple paths in communication networks has the potential to generate important benefits like better utilization of available resources and higher resiliency. Routing solutions with poor adaptive performance can benefit from multi-path techniques, since information about alternative paths is gathered beforehand. In particular, this study explores the embracement of multi-path routing by inter-domain routing protocols, which have been proven to have large convergence delay after network changes. Unfortunately, there are not many tools available to evaluate and compare the adaptive properties of different multi-path inter-domain routing proposals. An evaluation framework for those proposals is presented in this paper. The framework is aimed to provide a common ground for their evaluation and comparison. It is conceived based on a Swiss-army-knife approach and has a modular and extensible architecture. For completeness, a case of use is depicted to show the functionality and analyses that can be carried out using this framework.<\/p>","DOI":"10.4018\/jaras.2011070103","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:00:11Z","timestamp":1319025611000},"page":"24-44","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation Framework for Adaptive Multi-Path Inter-Domain Routing Protocols"],"prefix":"10.4018","volume":"2","author":[{"given":"Jose M.","family":"Camacho","sequence":"first","affiliation":[{"name":"Universidad Carlos III de Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lisardo","family":"Prieto","sequence":"additional","affiliation":[{"name":"Universidad Carlos III de Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francisco","family":"Valera","sequence":"additional","affiliation":[{"name":"Universidad Carlos III de Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jaras.2011070103-0","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Sommers, J., & Barford, P. (2005). Scalable network path emulation. In Proceedings of the 13th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (pp. 219-228).","DOI":"10.1109\/MASCOTS.2005.60"},{"key":"jaras.2011070103-1","unstructured":"Albrightson, B., Garcia-Luna-Aceves, J., & Boyle, J. (1994). Eigrp - a fast routing protocol based on distance vectors. Retrieved from http:\/\/ccrg.soe.ucsc.edu\/publications\/interop94.pdf"},{"key":"jaras.2011070103-2","unstructured":"Bagnulo, M., Burness, L., Eardley, P., Garc\u00eda-Mart\u00ednez, A., Valera, F., & Winter, R. (2009). Joint multi-path routing and accountable congestion control. In Proceedings of the ICT-Mobile Summit."},{"key":"jaras.2011070103-3","author":"D. P.Bertsekas","year":"1989","journal-title":"Parallel and distributed computation: Numerical methods"},{"key":"jaras.2011070103-4","doi-asserted-by":"crossref","unstructured":"Chau, C.-K. (2006). Policy-based routing with non-strict preferences. ACM SIGCOMM Computer Communication Review, 36(4).","DOI":"10.1145\/1151659.1159957"},{"key":"jaras.2011070103-5","doi-asserted-by":"crossref","unstructured":"Chau, C.-K., Gibbens, R., & Griffin, T. G. (2006). Towards a unified theory of policy-based routing. In Proceedings of the 25th International Conference of INFOCOM.","DOI":"10.1109\/INFOCOM.2006.125"},{"key":"jaras.2011070103-6","unstructured":"Cisco Systems. (2010). BGP best path selection algorithm. Retrieved from http:\/\/www.cisco.com\/en\/US\/tech\/tk365\/technologies_tech_note09186a0080094431.shtml"},{"key":"jaras.2011070103-7","unstructured":"Click. (2010). The click modular router project. Retrieved from http:\/\/read.cs.ucla.edu\/click\/"},{"key":"jaras.2011070103-8","doi-asserted-by":"publisher","DOI":"10.1109\/90.974523"},{"key":"jaras.2011070103-9","doi-asserted-by":"crossref","unstructured":"Godfrey, P. B., Ganichev, I., Shenker, S., & Stoica, I. (2008). Pathlet routing. In Proceedings of the SIGCOMM Workshop on Hot Topics in Networking.","DOI":"10.1145\/1592568.1592583"},{"key":"jaras.2011070103-10","unstructured":"Graphviz (n. d.). Graph visualization software. Retrieved from http:\/\/www.graphviz.org\/"},{"key":"jaras.2011070103-11","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"jaras.2011070103-12","unstructured":"Hibler, M., Ricci, R., Stoller, L., Duerig, J., Guruprasad, S., Stack, T., et al. (2008). Large-scale virtualization in the emulab network testbed. In Proceedings of the Annual Technical Conference (pp. 113-128)."},{"key":"jaras.2011070103-13","doi-asserted-by":"crossref","unstructured":"Katz, D., Kompella, K., & Yeung, D. (2003). RFC 3630 traffic engineering (TE) extensions to OSPF version 2. Retrieved from http:\/\/tools.ietf.org\/html\/\/rfc3630","DOI":"10.17487\/rfc3630"},{"key":"jaras.2011070103-14","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232927"},{"key":"jaras.2011070103-15","doi-asserted-by":"crossref","unstructured":"Labovitz, C., & Wattenhofer, R. (2001). The impact of Internet policy and topology on delayed routing convergence. In Proceedings of the IEEE International Conference of INFOCOM (pp. 537-546).","DOI":"10.1109\/INFCOM.2001.916775"},{"key":"jaras.2011070103-16","doi-asserted-by":"crossref","unstructured":"Motiwala, M., Feamster, N., & Vempala, S. (2007). Path splicing: Reliable connectivity with rapid recovery. In Proceedings of the SIGCOMM Workshop on Hot Topics in Networking.","DOI":"10.1145\/1402958.1402963"},{"key":"jaras.2011070103-17","unstructured":"Park, J. (n. d.). Internet topology collection. Retrieved from homepage. http:\/\/irl.cs.ucla.edu\/topology\/"},{"key":"jaras.2011070103-18","doi-asserted-by":"crossref","unstructured":"Psenak, P., Mirtorabi, S., Roy, A., Nguyen, L., & Pillay-Esnault, P. (6 de 2007). Multi-Topology (MT) Routing in OSPF. RFC 4915 (Proposed Standard).","DOI":"10.17487\/rfc4915"},{"key":"jaras.2011070103-19","unstructured":"Quoitin, B. (2004). C-BGP A new approach to BGP simulation. Retrieved from http:\/\/c-bgp.sourceforge.net\/downloads\/cbgp-1.pdf"},{"key":"jaras.2011070103-20","unstructured":"Quotin, B. (2006). C-BGP internals: Wiki. Retrieved from http:\/\/cbgp.info.ucl.ac.be\/wiki\/index.php?n=Main.Internals"},{"key":"jaras.2011070103-21","unstructured":"Quotin, B. (2011). Official site of C-BGP network resolver. Retrieved from http:\/\/cbgp.info.ucl.ac.be\/index.php"},{"key":"jaras.2011070103-22","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T., & Hares, S. (2006). RFC 427: A border gateway protocol 4 (BGP-4). Retrieved from http:\/\/tools.ietf.org\/html\/rfc4271","DOI":"10.17487\/rfc4271"},{"key":"jaras.2011070103-23","doi-asserted-by":"crossref","unstructured":"Riley, G. (2003). Large-scale network simulations with gtnets. In Proceedings of the Simulation Conference (pp. 676-684).","DOI":"10.1109\/WSC.2003.1261483"},{"key":"jaras.2011070103-24","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001). Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review, 31(4).","DOI":"10.1145\/964723.383071"},{"key":"jaras.2011070103-25","unstructured":"Subramanian., et al. (n. d.). Network topology. Retrieved from http:\/\/cbgp.info.ucl.ac.be\/downloads\/as.relation"},{"key":"jaras.2011070103-26","article-title":"Multi-path BGP: Motivations and solutions","author":"F.Valera","year":"2010","journal-title":"Next generation Internet architectures and protocols"},{"key":"jaras.2011070103-27","author":"I.Van Beijnum","year":"2002","journal-title":"BGP - building reliable networks with the border gateway protocol"},{"key":"jaras.2011070103-28","doi-asserted-by":"crossref","unstructured":"Van Beijnum, I., Crowcoft, J., Valera, F., & Bagnulo, M. (2009). Loop-freeness in multi-path bgp through propagatingthe longuest path. In Proceedings of the International Conference on Communications Workshops (pp. 1-6).","DOI":"10.1109\/ICCW.2009.5207968"},{"key":"jaras.2011070103-29","unstructured":"Walton, D. (2001). BGP MED Oscillation: NANOG 21. Retrieved from http:\/\/www.nanog.org\/meetings\/nanog21\/abstracts.php?pt=MTAyOCZuYW5vZzIx&nm=nanog21"},{"key":"jaras.2011070103-30","unstructured":"Walton, D., Retana, A., Chen, E., & Scudder, J. (2010). Advertisement of multiple paths in BGP. Retrieved from http:\/\/tools.ietf.org\/search\/draft-ietf-idr-add-paths-04"},{"key":"jaras.2011070103-31","doi-asserted-by":"crossref","unstructured":"Wischik, D., Handley, M., & Bagnulo, M. (2008). The resource pooling principle. ACM SIGCOMM Computer Communication Review, 38(5).","DOI":"10.1145\/1452335.1452342"},{"key":"jaras.2011070103-32","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159934"},{"key":"jaras.2011070103-33","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159933"}],"container-title":["International Journal of Adaptive, Resilient and Autonomic Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=55452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T17:07:36Z","timestamp":1654103256000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jaras.2011070103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,7,1]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jaras.2011070103","relation":{},"ISSN":["1947-9220","1947-9239"],"issn-type":[{"value":"1947-9220","type":"print"},{"value":"1947-9239","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,1]]}}}