Counting to Infinity

نویسنده

  • Janne Lindqvist
چکیده

Routing protocols have to deal with a known problem: the count-to-infinity. Counting to infinity can occur when a link breaks in the network, and the algorithm in the routing protocol tries to calculate new shortest paths. In this paper I survey the past and present solutions to the this problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resonances for Manifolds Hyperbolic near Infinity: Optimal Lower Bounds on Order of Growth

Suppose that (X, g) is a conformally compact (n+1)-dimensional manifold that is hyperbolic near infinity in the sense that the sectional curvatures of g are identically equal to minus one outside of a compact set K ⊂ X. We prove that the counting function for the resolvent resonances has maximal order of growth (n + 1) generically for such manifolds. This is achieved by constructing explicit ex...

متن کامل

Natural and Formal Infinities†

Concepts of infinity usually arise by reflecting on finite experiences and imagining them extended to the infinite. This paper will refer to such personal conceptions as natural infinities. Research has shown that individuals’ natural conceptions of infinity are ‘labile and self-contradictory’ (Fischbein et al., 1979, p. 31). The formal approach to mathematics in the twentieth century attempted...

متن کامل

Upper and Lower Bounds on Resonances for Manifolds Hyperbolic near Infinity

For a conformally compact manifold that is hyperbolic near infinity and of dimension n + 1, we complete the proof of the optimal O(r) upper bound on the resonance counting function, correcting a mistake in the existing literature. In the case of a compactly supported perturbation of a hyperbolic manifold, we establish a Poisson formula expressing the regularized wave trace as a sum over scatter...

متن کامل

Avoiding Counting to Infinity in Distance Vector Routing

The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is known as the counting to infinity problem. In the past, the distance metric had to be below 16 hops, in order to keep this counting within reasonable limits. In this paper a more elaborate approach is presented in or...

متن کامل

Renormalising Nn Scattering: Is Power Counting Powerless?

The renormalisation of NN scattering in theories with zero-range interactions is examined using a cut-off regularisation where the cut-off is taken to infinity, dimensional regularisation (DR) with minimal subtraction, and DR with powerdivergence subtraction. In the infinite cut-off limit power counting breaks down: terms of different orders in the potential contribute to the scattering amplitu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004