Publicação
SICAP, a Shared-Segment Inter-domain Control Aggregation Protocol
| Resumo: | Most 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 |
|---|---|
| Autores principais: | Sofia, Rute |
| Assunto: | Aggregation Signaling Control Inter-domain Reservations BGRP |
| Ano: | 2004 |
| País: | Portugal |
| Tipo de documento: | tese de doutoramento |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade de Lisboa |
| Idioma: | português |
| Origem: | Repositório da Universidade de Lisboa |
| Resumo: | Most 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 |
|---|