Failure Recovery Redundancy Overall Requirement

نویسنده

  • Emin Gabrielyan
چکیده

Forward Error Correction (FEC) is very efficient for off-line streaming with large buffering time, but real-time streaming puts hard restrictions on the buffer size making FEC inefficient for combating long link failures on single path routes. Multi-path routing, orthogonal to buffering, can however make FEC effective also for real-time streaming. For this purpose we introduce a capillary routing algorithm offering layer by layer a wide range of multi-path routing topologies starting from simple solutions and evolving toward reliable and secure routing schemes with highly developed path diversity. The friendliness of a particular multi-path routing is rated by the overall amount of FEC redundancy required for combating the non-simultaneous failures of all links in the multi-path route. We rated the friendliness of a dozen of capillary routing layers, built on several hundreds of network samples obtained from a random walk wireless Mobile Ad-Hoc Network (MANET). The overall requirement in redundant FEC codes decreases substantially as the spreading of the routing grows.

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

ثبت نام

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

منابع مشابه

Redundancy allocation in finite-length nested codes for nonvolatile memories

In this paper, we investigate the optimum way to allocate redundancy of finite-length nested codes for modern nonvolatile memories suffering from both permanent defects and transient errors (erasures or random errors). A nested coding approach such as partitioned codes can handle both permanent defects and transient errors by using two parts of redundancy: 1) redundancy to deal with permanent d...

متن کامل

Capillary routing for reliable real-time streaming

Application of forward error correction (FEC) in offline streaming with large buffering time dramatically improves the quality and performance of communications in challenging network conditions. However real-time streaming puts hard restrictions on the buffer size leaving FEC helpless for combating long link failures on a single path route. Multi-path routing is another method, orthogonal to b...

متن کامل

Design and Implementation of High Availability OSPF Router

In this paper, we propose a High Availability Open Shortest Path First (HA-OSPF) router which consists of two OSPF router modules, active and standby, to support a high availability network. First, we used the continuous-time Markov chain (CTMC) to analyze the steady-state availability of an HA-OSPF router with one active router and N standby routers (1 + N redundancy model). Then, with the fai...

متن کامل

Cold standby redundancy optimization for nonrepairable series-parallel systems: Erlang time to failure distribution

In modeling a cold standby redundancy allocation problem (RAP) with imperfect switching mechanism, deriving a closed form version of a system reliability is too difficult. A convenient lower bound on system reliability is proposed and this approximation is widely used as a part of objective function for a system reliability maximization problem in the literature. Considering this lower bound do...

متن کامل

Allocating Redundancy to Critical Information Technology Functions for Disaster Recovery

In the present network economy, businesses are becoming increasingly reliant on information technology (IT) to perform their operations and exchange information with business partners. This heavy dependence on IT, however, poses a potential threat for an organization. When natural or man-made disasters strike and cause malfunction to its computing and communicating systems, it would be vulnerab...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2006