{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"institution":[{"id":[{"id":"https:\/\/ror.org\/03mb6wj31","id-type":"ROR","asserted-by":"publisher"},{"id":"https:\/\/www.isni.org\/000000041937028X","id-type":"ISNI","asserted-by":"publisher"},{"id":"https:\/\/www.wikidata.org\/entity\/Q1640731","id-type":"wikidata","asserted-by":"publisher"}],"name":"Universitat Polit\u00e8cnica de Catalunya","acronym":["UPC"]}],"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T16:19:18Z","timestamp":1785428358307,"version":"3.56.0"},"reference-count":0,"publisher":"Universitat Polit\u00e8cnica de Catalunya","license":[{"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/3.0\/es\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In just four decades the Internet has gone from a lab experiment to a worldwide, business critical infrastructure that caters to the communication needs of almost a half of the Earth's population. With these figures on its side, arguing against the Internet's scalability would seem rather unwise. However, the Internet's organic growth is far from finished and, as billions of new devices are expected to be joined in the not so distant future, scalability, or lack thereof, is commonly believed to be the Internet's biggest problem.\r\nWhile consensus on the exact form of the solution is yet to be found, the need for a semantic decoupling of a node's location and identity, often called a location\/identity separation, is generally accepted as a promising way forward. Typically, this requires the introduction of new network elements that provide the binding of the two names-paces and caches that avoid hampering router packet forwarding speeds. But due to this increased complexity the solution's scalability is itself questioned.\r\nThis dissertation evaluates the suitability of using the Locator\/ID Separation Protocol (LISP), one of the most successful proposals to follow the location\/identity separation guideline, as a solution to the Internet's scalability problem. However, because the deployment of any new architecture depends not only on solving the incumbent's technical problems but also on the added value that it brings, our approach follows two lines. In the first part of the thesis, we develop the analytical tools to evaluate LISP's control plane scalability while in the second we show that the required control\/data plane separation provides important benefits that could drive LISP's adoption.\r\nAs a first step to evaluating LISP's scalability, we propose a methodology for an analytical analysis of cache performance that relies on the working-set theory to estimate traffic locality of reference. One of our main contribution is that we identify the conditions network traffic must comply with for the theory to be applicable and then use the result to develop a model that predicts average cache miss rates. Furthermore, we study the model's suitability for long term cache provisioning and assess the cache's vulnerability in front of malicious users through an extension that accounts for cache polluting traffic. As a last step, we investigate the main sources of locality and their impact on the asymptotic scalability of the LISP cache. An important finding here is that destination popularity distribution can accurately describe cache performance, independent of the much harder to model short term correlations. Under a small set of assumptions, this result finally enables us to characterize asymptotic scalability with respect to the amount of prefixes (Internet growth) and users (growth of the LISP site). We validate the models and discuss the accuracy of our assumptions using several one-day-long packet traces collected at the egress points of a campus and an academic network.\r\nTo show the added benefits that could drive LISP's adoption, in the second part of the thesis we investigate the possibilities of performing inter-domain multicast and improving intra-domain routing. Although the idea of using overlaid services to improve underlay performance is not new, this dissertation argues that LISP offers the right tools to reliably and easily implement such services due to its reliance on network instead of application layer support. In particular, we present and extensively evaluate Lcast, a network-layer single-source multicast framework designed to merge the robustness and efficiency of IP multicast with the configurability and low deployment cost of application-layer overlays. Additionally, we describe and evaluate LISP-MPS, an architecture capable of exploiting LISP to minimize intra-domain routing tables and ensure, among other, support for multi protocol switching and virtual networks.<\/jats:p>\n                <jats:p>En menos de cuatro d\u00e9cadas Internet ha evolucionado desde un experimento de laboratorio hasta una infraestructura de alcance mundial, de importancia cr\u00edtica para negocios y que atiende a las necesidades de casi un tercio de los habitantes del planeta. Con estos n\u00fameros, es dif\u00edcil tratar de negar la necesidad de escalabilidad de Internet. Sin embargo, el crecimiento org\u00e1nico de Internet est\u00e1 a\u00fan lejos de finalizar ya que se espera que mil millones de dispositivos nuevos se conecten en el futuro cercano. As\u00ed pues, la falta de escalabilidad es el mayor problema al que se enfrenta Internet hoy en d\u00eda. Aunque la soluci\u00f3n definitiva al problema est\u00e1 a\u00fan por definir, la necesidad de desacoplar sem\u00e1nticamente la localizaci\u00f3n e identidad de un nodo, a menudo llamada locator\/identifier separation, es generalmente aceptada como un camino prometedor a seguir. Sin embargo, esto requiere la introducci\u00f3n de nuevos dispositivos en la red que unan los dos espacios de nombres disjuntos resultantes y de cach\u00e9s que almacenen los enlaces temporales entre ellos con el fin de aumentar la velocidad de transmisi\u00f3n de los enrutadores. A ra\u00edz de esta complejidad a\u00f1adida, la escalabilidad de la soluci\u00f3n en si misma es tambi\u00e9n cuestionada. Este trabajo eval\u00faa la idoneidad de utilizar Locator\/ID Separation Protocol (LISP), una de las propuestas m\u00e1s exitosas que siguen la pauta locator\/identity separation, como una soluci\u00f3n para la escalabilidad de la Internet. Con tal fin, desarrollamos las herramientas anal\u00edticas para evaluar la escalabilidad del plano de control de LISP pero tambi\u00e9n para mostrar que la separaci\u00f3n de los planos de control y datos proporciona un importante valor a\u00f1adido que podr\u00eda impulsar la adopci\u00f3n de LISP. Como primer paso para evaluar la escalabilidad de LISP, proponemos una metodolog\u00eda para un estudio anal\u00edtico del rendimiento de la cach\u00e9 que se basa en la teor\u00eda del working-set para estimar la localidad de referencias. Identificamos las condiciones que el tr\u00e1fico de red debe cumplir para que la teor\u00eda sea aplicable y luego desarrollamos un modelo que predice las tasas medias de fallos de cach\u00e9 con respecto a par\u00e1metros de tr\u00e1fico f\u00e1cilmente medibles. Por otra parte, para demostrar su versatilidad y para evaluar la vulnerabilidad de la cach\u00e9 frente a usuarios malintencionados, extendemos el modelo para considerar el rendimiento frente a tr\u00e1fico generado por usuarios maliciosos. Como \u00faltimo paso, investigamos como usar la popularidad de los destinos para estimar el rendimiento de la cach\u00e9, independientemente de las correlaciones a corto plazo. Bajo un peque\u00f1o conjunto de hip\u00f3tesis conseguimos caracterizar la escalabilidad con respecto a la cantidad de prefijos (el crecimiento de Internet) y los usuarios (crecimiento del sitio LISP). Validamos los modelos y discutimos la exactitud de nuestras suposiciones utilizando varias trazas de paquetes reales. Para mostrar los beneficios adicionales que podr\u00edan impulsar la adopci\u00f3n de LISP, tambi\u00e9n investigamos las posibilidades de realizar multidifusi\u00f3n inter-dominio y la mejora del enrutamiento dentro del dominio. Aunque la idea de utilizar servicios superpuestos para mejorar el rendimiento de la capa subyacente no es nueva, esta tesis sostiene que LISP ofrece las herramientas adecuadas para poner en pr\u00e1ctica de forma fiable y f\u00e1cilmente este tipo de servicios debido a que LISP act\u00faa en la capa de red y no en la capa de aplicaci\u00f3n. En particular, presentamos y evaluamos extensamente Lcast, un marco de multidifusi\u00f3n con una sola fuente dise\u00f1ado para combinar la robustez y eficiencia de la multidifusi\u00f3n IP con la capacidad de configuraci\u00f3n y bajo coste de implementaci\u00f3n de una capa superpuesta a nivel de aplicaci\u00f3n. Adem\u00e1s, describimos y evaluamos LISP-MPS, una arquitectura capaz de explotar LISP para minimizar las tablas de enrutamiento intra-dominio y garantizar, entre otras, soporte para conmutaci\u00f3n multi-protocolo y redes virtuales.<\/jats:p>","DOI":"10.5821\/dissertation-2117-95746","type":"dissertation","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T01:46:26Z","timestamp":1689731186000},"approved":{"date-parts":[[2015,7,23]]},"source":"Crossref","is-referenced-by-count":0,"title":["On the scalability of LISP and advanced overlaid services"],"prefix":"10.5821","author":[{"given":"Florin","family":"Coras","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"3865","container-title":[],"original-title":[],"contributor":[{"sequence":"additional","affiliation":[],"role":[null]}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T06:33:25Z","timestamp":1769409205000},"score":1,"resource":{"primary":{"URL":"https:\/\/hdl.handle.net\/2117\/95746"}},"subtitle":[],"editor":[{"given":"Alberto","family":"Cabellos Aparicio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]},{"given":"Jordi","family":"Domingo Pascual","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.5821\/dissertation-2117-95746","relation":{},"subject":[]}}