Abstract
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.
Highlights
Introduction unc oAuthor ProofAs networking environments evolve, the inherent limitations of the current TCP/IP protocol stack to cope with the increasing variety of communication requirements of heterogeneous distributed applications are clearer than ever [1]
The performance of the proposed policy is assessed in an experimental Recursive InterNetwork Architecture (RINA) network test-bed and its performance compared against other policies, either RINA-specific or adopted from TCP/IP
Model, RINA is a clean-slate recursive Internet architecture based on the idea of distributed Inter-Process Communication (IPC), which aims to progressively replace the current
Summary
The inherent limitations of the current TCP/IP protocol stack to cope with the increasing variety of communication requirements of heterogeneous distributed applications are clearer than ever [1]. In order to provide the best service to a diverse set of distributed applications, a key point to consider is how resources are shared between flows In this regard, the information that QoS Cubes give on flow requirements facilitate the configuration of different scheduling policies in a RINA DIF. We propose a new rate-limiting scheduling policy that provides the same upper limits for priority traffic injected into the provider network, while giving end-users the freedom to decide on how they use their leased resources With this in mind, we propose a 2-dimensional rate limiting policy, based on the !Q framework and the C/U Matrix ( extendible to other dimensions if required), that limits the amount of outgoing traffic depending on its urgency and cherish level independently. Pseudo-codes 1 and 2 describe the process of credit consumption and gain for both Cherish and Urgency, respectively
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
