Browsing by Author "Sofia, Rute"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
- An Investigation of Inter-Domain Control Aggregation ProceduresPublication . Sofia, Rute; Guérin, Roch; Veiga, PedroCurrent Quality of Service models such as those embodied in the Differentiated Services proposals, rely on data path aggregation to achieve scalability. Data path aggregation bundles into a single aggregate multiple individual flows with the same quality requirements, hence decreasing the amount of state that needs to be kept along a path. A similar scalability concern exists on the control path, where the state required to account for individual reservations needs to be minimized. There have been a number of proposals aimed at control path aggregation, and the goal of this report is to expand on these works in an attempt to gain a better understanding of the various parameters that influence the efficiency of different approaches. In particular, we focus on inter-domain control aggregation, and compare an Autonomous System (AS) sink-tree based approach with several examples of a shared AS segment based approach. The comparison is done in terms of the amount of state that is kept, both within a given AS, as well as at edge routers. The comparison is carried out primarily through simulations, but we also develop a simple analytical model for a basic AS configuration, which provides additional insight into the impact of different parameters on the efficiency of each approach. Our main contributions are in providing a greater understanding into the design of efficient control path aggregation methods.
- An Investigation of Inter-Domain Control Aggregation ProceduresPublication . Sofia, Rute; Guérin, Roch; Veiga, PedroCurrent Quality of Service models such as those embodied in the Differentiated Services proposals, rely on data path aggregation to achieve scalability. Data path aggregation bundles into a single aggregate multiple individual flows with the same quality requirements, hence decreasing the amount of state that needs to be kept along a path. A similar scalability concern exists on the control path, where the state required to account for individual reservations needs to be minimized. There have been a number of proposals aimed at control path aggregation, and the goal of this report is to expand on these works in an attempt to gain a better understanding of the various parameters that influence the efficiency of different approaches. In particular, we focus on inter-domain control aggregation, and compare an Autonomous System (AS) sink-tree based approach with several examples of a shared AS segment based approach. The comparison is done in terms of the amount of state that is kept, both within a given AS, as well as at edge routers. The comparison is carried out primarily through simulations, but we also develop a simple analytical model for a basic AS configuration, which provides additional insight into the impact of different parameters on the efficiency of each approach. Our main contributions are in providing a greater understanding into the design of efficient control path aggregation methods
- SICAP, a Shared-Segment Inter-domain Control Aggregation ProtocolPublication . Sofia, Rute; Veiga, Pedro Manuel BarbosaMost Internet services require some form of differentiation, mainly because users rightly demand guarantees about the services they are subscribing to. Hence, these services usually rely on customer-provider agreements describing end-to-end Quality of Service requirements such as bandwidth level, or maximum delay, i.e., resource reservation requisites. To function properly, such agreements have to be enforced end-to-end, meaning that each router along the path has to keep information to manage the requested reservations. Current RSVP broad deployment is proof positive that a resource reservation protocol is necessary and useful to manage end-to-end resources. However, RSVP has severe scalability problems, which have already been investigated in RSVP enhanced versions. Still, new versions also fail when it comes to end-to-end scalability, and there is not a feasible alternative to RSVP. The scalability problem is mostly a consequence of the possible high reservation volumes that links between different Autonomous Systems may experience, and one way of dealing with this is to treat data based on aggregate reservations, since aggregation diminishes the state and signaling required at routers. In this dissertation, we analyse issues related to reservation aggregation. We introduce a novel aggregation protocol, SICAP, which performs shared-segment aggregation. We compare SICAP against the only other existing alternative, BGRP, which performs sink-tree aggregation, in terms of state scalability, signaling load, and bandwidth efficiency