Edge-to-Edge Bailout Forward Contracts for Single-Domain Internet Services

Liu, Weini; Karaoglu, Hasan T.; Gupta, Aparna; Yüksel, Murat; Kar, Koushik

doi:10.1109/iwqos.2008.35

Cited by 8 publications

(4 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We use data from the U.S. Census Bureau [13] and the United Nations Statistics Division [14] to calculate the city population of each node in the network. In addition, we employ the Breadth-First Search algorithm to assign link capacity [15] in Abovenet and Sprint topologies. Furthermore, we scale the traffic matrices such that the maximum link utilisation does not exceed 100% under failure-free conditions.…”

Section: A Methodsmentioning

confidence: 99%

Recursive Loop-Free Alternates for full protection against transient link failures

Lor

Ali

Landa

et al. 2010

The IEEE Symposium on Computers and Communications

View full text Add to dashboard Cite

Abstract-In this paper, we propose a routing technique, "recursive Loop-Free Alternates (rLFAs)", to alleviate packet loss due to transient link failures. The technique consists of a backup path calculation with corresponding re-routing scheme based on the Loop-Free Condition (LFC) as defined in the basic specification for IP Fast Re-Route (IPFRR). Under this routing strategy, nodes calculate backup paths by modifying the weights of links in the primary shortest path tree. If a failure occurs, the detecting node determines the number of recursions, which indicates the number of times packets must be forwarded along the alternate next hops to bypass the failed link. This technique guarantees full repair coverage for single link failures. We evaluate the performance of our proposed technique through simulations and show that the incurred overheads, the stretch of its pre-computed alternate paths, and the failure-state Maximum Link Utilisation (MLU) are minimal.

show abstract

Section: A Methodsmentioning

confidence: 99%

Recursive Loop-Free Alternates for full protection against transient link failures

Lor

Ali

Landa

et al. 2010

The IEEE Symposium on Computers and Communications

View full text Add to dashboard Cite

show abstract

“…To use realistic inputs to the gravity models, we use data from the U.S. Census Bureau [17] and the United Nations Statistics Division [18] to calculate the city population of each node in the network. Furthermore, we use a technique based on the Breadth-First Search (BFS) algorithm to assign link capacity [19]. To examine the traffic characteristics, we scale the traffic matrices such that the maximum link utilisation does not exceed 100% under normal routing or after re-convergence.…”

Section: Methodsmentioning

confidence: 99%

Handling Transient Link Failures Using Alternate Next Hop Counters

et al. 2010

View full text Add to dashboard Cite

Abstract. In this paper, we propose a routing technique to alleviate packet loss due to transient link failures, which are major causes of disruption in the Internet. The proposed technique based on Alternate Next Hop Counters (ANHC) allows routers to calculate backup paths and re-route packets accordingly, thereby bypassing transient failures. This technique guarantees full repair coverage for single link failures, without significantly changing the way traditional routing works and with minimal impact on the computation and memory requirements for routers. We evaluate the performance of our proposed ANHC approach through extensive simulations and show that the stretch of its pre-computed alternate paths, its failure-state link load increase, and its computational and memory overheads are minimal.

show abstract

“…The time component relates to the time duration for which the contract is negotiated. It can be at the current time (spot contract), or for the future but negotiated in advance (forward contract) [14]. Finally, the financial component relates to issues of how the contract is priced and terms of payback in case the contract is violated.…”

Section: Contract-based Inter-domain Routingmentioning

confidence: 99%

“…ISPs need to provide network services, as well as safeguard their own, and their end-users, interests in presence of these risks. Advanced contracting terms, such as bailout forward contracts [14], can be developed to manage some of these risks. Similar and additional risk sharing, risk transfer and risk management mechanisms can be developed for intra-domain risks under the FCT model.…”

Section: Inter-domain Economicsmentioning

confidence: 99%

RAIDER: Responsive architecture for inter-domain economics and routing

Shenoy

Yüksel

Gupta

et al. 2010

2010 IEEE Globecom Workshops

Self Cite

View full text Add to dashboard Cite

Multi-owner structure shaping inter-domain operations is arguably the most important factor determining the end-to-end performance in the current Internet. Financial sustainability of Internet service provisioning has significantly changed the way Internet grows and all the other business sectors using the Internet as infrastructure. Further, scalability of BGP routing table sizes is becoming a stressing problem. Architectural solutions providing ways to better inter-domain economics and more scalable inter-domain routing protocols are of crucial importance. In this position paper, we present a new interdomain communications architecture to address routing scalability by leveraging the inherent structure in ISP topologies and using a simplified addressing method. To manage risks in costly backbone business and open the doors for realizing higher quality end-to-end services, our architecture uses protocol-level techniques to increase operational granularity of inter-ISP market with automated service level agreements (SLAs).

show abstract

Edge-to-Edge Bailout Forward Contracts for Single-Domain Internet Services

Cited by 8 publications

References 29 publications

Recursive Loop-Free Alternates for full protection against transient link failures

Recursive Loop-Free Alternates for full protection against transient link failures

Handling Transient Link Failures Using Alternate Next Hop Counters

RAIDER: Responsive architecture for inter-domain economics and routing

Contact Info

Product

Resources

About