Search

Looking at the ever-increasing amount of heterogeneous distributed applications supported on current data transport networks, it seems evident that best-effort packet delivery falls short to supply their actual needs. Multiple approaches to Quality of Service (QoS) differentiation have been proposed over the years, but their usage has always been hindered by the rigidness of the TCP/IP-based Internet model, which does not even allow for applications to express their QoS needs to the underlying network. In this context, the Recursive InterNetwork Architecture (RINA) has appeared as a clean-slate network architecture aiming to replace the current Internet based on TCP/IP. RINA provides a well-defined QoS support across layers, with standard means for layers to inform of the different QoS guarantees that they can support. Besides, applications and other processes can express their flow requirements, including different QoS-related measures, like delay and jitter, drop probability or average traffic usage. Greedy end-users, however, tend to request the highest quality for their flows, forcing providers to apply intelligent data rate limitation procedures at the edge of their networks. In this work, we propose a new rate limiting policy that, instead of enforcing limits on a per QoS class basis, imposes limits on several independent QoS dimensions. This offers a flexible traffic control to RINA network providers, while enabling end-users freely managing their leased resources. The performance of the proposed policy is assessed in an experimental RINA network test-bed and its performance compared against other policies, either RINA-specific or adopted from TCP/IP. Results show that the proposed policy achieves an effective traffic control for high QoS traffic classes, while also letting lower QoS classes to take profit of the capacity initially reserved for the former ones when available., Peer Reviewed, Postprint (author's final draft)

This is the peer reviewed version of the following article: Leon Gaixas S, Perelló J, Careglio D, Grasa E, López DR, Aranda PA. Scalable topological forwarding and routing policies in RINA-enabled programmable data centers. Trans Emerging Tel Tech. 2017;28:e3256, DOI 10.1002/ett.3256, which has been published in final form at DOI: 10.1002/ett.3256. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving, Given the current expansion of cloud computing, the expected advent of the Internet of Things, and the requirements of future fifth-generation network infrastructures, significantly larger pools of computational and storage resources will soon be required. This emphasizes the need for more scalable data centers that are capable of providing such an amount of resources in a cost-effective way. A quick look into today's commercial data centers shows that they tend to rely on variations of well-defined leaf-spine/Clos data center network (DCN) topologies, offering low latency, ultrahigh bisectional bandwidth, and enhanced reliability against concurrent failures. However, DCNs are typically restricted by the use of the Transmission Control Protocol/Internet Protocol (TCP/IP) suite, thus suffering limited routing scalability. In this work, we study the benefits that replacing TCP/IP with the recursive internetwork architecture (RINA) can bring into commercial DCNs, focusing on forwarding and routing scalability. We quantitatively evaluate the benefits that RINA solutions can yield against those based on TCP/IP and highlight how, by deploying RINA, topological routing solutions can improve even more the efficiency of the network. To this goal, we propose a rule-and-exception forwarding policy tailored to the characteristics of several DCN variants, enabling fast forwarding decisions with merely neighbors' information. Upon failures, few exceptions are necessary, whose computation can also profit from the known topology. Extensive numerical results show that the proposed policy requirements depend mainly on the number of neighbors and concurrent failures in the DCN rather than its size, dramatically reducing the amount of forwarding and routing information stored at DCN nodes., Peer Reviewed, Postprint (author's final draft)

With the proliferation of cloud computing and the expected requirements of future Internet of Things (IoT) and 5G network scenarios, more efficient and scalable Data Centers (DCs) will be required, offering very large pools of computational resources and storage capacity cost-effectively. Looking at todays' commercial DCs, they tend to rely on well-defined leaf-spine Data Center Network (DCN) topologies that not only offer low latency and high bisectional bandwidth, but also enhanced reliability against multiple failures. However, routing and forwarding solutions in such DCNs are typically based on IP, thus suffering from its limited routing scalability. In this work, we quantitatively evaluate the benefits that the Recursive InterNetwork Architecture (RINA) can bring into commercial DCNs. To this goal, we propose rule-based topological routing and forwarding policies tailored to the characteristics of publicly available Google's and Facebook's DCNs. These policies can be programmed in a RINA-enabled environment, enabling fast forwarding decisions in most scenarios with merely neighboring node information. Upon DCN failures, invalid forwarding rules are overwritten by exceptions. Numerical results show that the scalability of our proposal depends on the number of concurrent failures in the DCN rather than its size (e.g., number of nodes/links), dramatically reducing the total amount of routing and forwarding information to be stored at nodes. Furthermore, as routing information is only disseminated upon failures across the DCN, the associated communication cost of our proposals largely outperforms that of the traditional IP-based solutions., Peer Reviewed, Postprint (published version)

In this paper, we describe the basics of the Recursive InterNetwork Architecture (RINA) and its advantages as a packet transport technology over programmable optical networks. In particular, its seamless integration over an SDN-controlled network infrastructure and its intrinsic capability of providing QoS is analysed and further discussed, Peer Reviewed, Postprint (published version)

Software-Defined Networking and Network Functions Virtualisation has brought a revolution within the telecom market landscape. Initial proof-of-concept prototypes for NFV-enabled solutions are being developed at the same time SDN models are identified as the futures solutions within the telecom realm. We provide in this article an overview of the SDN/NFV technologies over optical networks, as well as we provide the first formalisation model for the virtual network function complex scheduling problem. The article aims at being used as starting point in order to optimally solve the scheduling problem of virtual network functions that compose network services to be provisioned within the SDN paradigm., Postprint (published version)

Internet roku 2015 se potýká s problémy, které jsou důsledky špatného designu pojmenovávání a adresování v TCP/IP a jež mají přeneseny vliv i na škálovatelnost směrování. Problémy jako růst páteřních směrovacích tabulek, neefektivní multihoming sítí či mobilita zařízení a mnohé další zadávají k otázce, jestli není třeba architekturu Internetu pozměnit. V teoretické části je kvantifikován dopad problémů, možná řešení a zejména je formálně definována teorie kompilujicí poznatky významných publikací zabývajících se problematikou pojmenování, adresování a směrování v počítačových sítí. Tato práce se zabývá dvěma konkrétními technologiemi, jež mají ambicí Internet měnit - Locator/Id Separation Protocol a Recursive InterNetwork Architecture. Výstupem práce jsou vylepšení funkcionality obou výše zmíněných technologií. Za účelem praktického ověření dopadů našeho výzkumu jsou vyvinutý a popsány nové simulační modely pro OMNeT++, které jsou věrné úrovni detailu popisu ze specifikací., nternet of the year 2015 struggles with problems that are just implications of flawed naming and addressing the concept of TCP/IP, which have an impact on overall routing scalability. Problems such as default-free zone routing table growth, cumbersome multihoming or mobility motivate question whether the Internet deserves major architecture redesign. In the theoretical part, the impact of problems above is evaluated, solutions are discussed and unifying theory compiled and described using formal methods taking into account revered papers about naming, addressing and routing. This work provides in-depth Investigation of two technologies - Locator/Id Separation Protocol a Recursive InterNetwork Architecture. Research contribution is an operational improvement of above-mentioned technologies. New OMNeT++, full-fledged simulation modules compliant with behavior in the specification are used to as verification tool.