As the technology of IP Fast Rerouting (FRR) become mature and the related methods and specifi cation such as RFC5286 accepted as standard, it is expected that IP FRR will be deployed gradually and will enhance the su...As the technology of IP Fast Rerouting (FRR) become mature and the related methods and specifi cation such as RFC5286 accepted as standard, it is expected that IP FRR will be deployed gradually and will enhance the survivability of IP network. This paper presents a different method for computing the Loop-free Alternate Interfaces. The new algorithm can be referred as "Next-Hop Cost Decrease (NHCD)" criterion. Compared with the RFC5286 LFA method, NHCD can handle both the simultaneous link failure and node failure, including multi-link failures. It has less computational complexity and can be used uniformly in the Traffi c Engineering and Network Recovery. However, NHCD is somewhat lower than the LFA method on recovery ratio of single link failure. After a formal description of NHCD criterion and a proof of loopfree alternates, the paper presents the simulation results of NHCD.展开更多
Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analys...Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.展开更多
文摘As the technology of IP Fast Rerouting (FRR) become mature and the related methods and specifi cation such as RFC5286 accepted as standard, it is expected that IP FRR will be deployed gradually and will enhance the survivability of IP network. This paper presents a different method for computing the Loop-free Alternate Interfaces. The new algorithm can be referred as "Next-Hop Cost Decrease (NHCD)" criterion. Compared with the RFC5286 LFA method, NHCD can handle both the simultaneous link failure and node failure, including multi-link failures. It has less computational complexity and can be used uniformly in the Traffi c Engineering and Network Recovery. However, NHCD is somewhat lower than the LFA method on recovery ratio of single link failure. After a formal description of NHCD criterion and a proof of loopfree alternates, the paper presents the simulation results of NHCD.
基金supported in part by the US National Science Foundation
文摘Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.
