BGRP: Sink-tree-based aggregation for inter-domain reservations

Pan, Ping; Hahne, E.L.; Schulzrinne, Henning

doi:10.1109/jcn.2000.6596736

Cited by 91 publications

(43 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A more interesting proposal is the BGRP protocol described in [16]. The objective of the BGRP protocol is to provide QoS reservations across the entire Internet in a scalable manner.…”

Section: Interdomain Traffic Engineeringmentioning

confidence: 99%

Implications of Interdomain Traffic Characteristics on Traffic Engineering

Uhlig

Bonaventure

2002

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Abstract.We study the interdomain traffic as seen by a non-transit ISP, based on a six days trace covering all the interdomain links of this ISP. Our analysis considers the relationships between the interdomain traffic and the interdomain topology.We first discuss the day-to-day stability of the interdomain traffic matrix to evaluate the feasibility of interdomain traffic engineering. Then, we study the variability of the interdomain flows for several aggregation levels (prefix, AS and sink tree) and with respect to the interdomain topology seen by BGP. We show that despite the important variability of interdomain flows, it would be useful for a non-transit ISP to traffic engineer its access traffic by relying on a sink tree aggregation level.

show abstract

“…A more interesting proposal is the BGRP protocol described in [16]. The objective of the BGRP protocol is to provide QoS reservations across the entire Internet in a scalable manner.…”

Section: Interdomain Traffic Engineeringmentioning

confidence: 99%

Implications of Interdomain Traffic Characteristics on Traffic Engineering

Uhlig

Bonaventure

2002

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…Also, their algorithm is evaluated by simulation from a local perspective, while our paper presents an end-toend evaluation (including state consistency and message rate). For addressing the scalability issue, the authors of [1], [13], [14], [22] and some other proposals study state aggregation techniques.…”

Section: Related Workmentioning

confidence: 99%

End-to-end versus hop-by-hop state refresh in soft state signaling protocols

He¹,

Fu²,

Tang³

et al. 2009

IEEE Commun. Lett.

View full text Add to dashboard Cite

Abstract-To ensure state synchronization of signalling operations, many signaling protocol designs choose to establish "soft" state that expires if it is not refreshed. The approaches of refreshing state in multi-hop signaling system can be classified as either end-to-end (E2E) or hop-by-hop (HbH). Although both state refresh approaches have been widely used in practical signaling protocols, the design tradeoffs between state synchronization and signaling cost have not yet been fully investigated. In this paper, we investigate this issue from the perspectives of state refresh and state removal. We propose simple but effective Markov chain models for both approaches and obtain closed-form solutions which depict the state refresh performance in terms of state consistency and refresh message rate, as well as the state removal performance in terms of state removal delay. Simulations verify the analytical models. It is observed that the HbH approach yields much better state synchronization at the cost of higher signaling cost than the E2E approach. While the state refresh performance can be improved by increasing the values of state refresh and timeout timers, the state removal delay increases largely for both E2E and HbH approaches. The analysis here shed lights on the design of signaling protocols and the configuration of the timers to adapt to changing network conditions.

show abstract

“…Proposals such as [57][58][59][60][61] are very good examples of this kind of approach to the issue. It is important to notice that even though the non-extended version of BGP presents limited functionality, it is indeed a complex routing protocol, where mistakes and misconfigurations are not infrequent.…”

Section: Qos Extensions and Traffic Engineering Using Bgpmentioning

confidence: 99%

Research challenges in QoS routing

Masip-Bruin¹,

Yannuzzi

Domingo‐Pascual³

et al. 2006

Computer Communications

View full text Add to dashboard Cite

Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based network services is in general terms an extremely complex problem, and a significant part of this complexity lies in the routing layer. Indeed, the problem of QoS Routing with multiple additive constraints is known to be NP-hard. Thus, a successful and wide deployment of the most novel network services demands that we thoroughly understand the essence of QoS Routing dynamics, and also that the proposed solutions to this complex problem should be indeed feasible and affordable. This article surveys the most important open issues in terms of QoS Routing, and also briefly presents some of the most compelling proposals and ongoing research efforts done both inside and outside the E-Next Community to address some of those issues. q

show abstract

BGRP: Sink-tree-based aggregation for inter-domain reservations

Cited by 91 publications

References 19 publications

Implications of Interdomain Traffic Characteristics on Traffic Engineering

Implications of Interdomain Traffic Characteristics on Traffic Engineering

End-to-end versus hop-by-hop state refresh in soft state signaling protocols

Research challenges in QoS routing

Contact Info

Product

Resources

About