An efficient and shortest path selection primary-segmented backup algorithm for real - time communication in multi-hop networks

The Development of high-speed networking has introduced opportunities for new applications such as real-time distributed computation, remote control systems, video conferencing, medical imaging, digital continuous media (audio and motion video), and scientific visualization. Several distributed real-time applications (e.g., medical imaging, video conferencing and air traffic control) demand hard guarantees on the message delivery latency and the recovery delay from component failures. As these generally demands cannot be met in old or traditional datagram services, special type of schemes have been proposed to provide timely as well as efficiently recovery for real-time communications in multihop or multi node networks. These schemes reserve additional network resources (spare resources) a priori along a backup channel that is disjoint with the primary.Such distributed real-time applications demand quality-of-service (QoS) guarantees on timeliness of message delivery and failure-recovery delay. These guarantees are agreed upon before setting up the communication channel and must be met even in the case of bursty network traffic, hardware failure (router and switch crashes, physical cable cuts, etc.), or software bugs. Applications using traditional best effort datagram services like IP experience varying delays due to varying queue sizes and packet drops at the routers. As we know that in distributed system all application required guarantees of the message delivery in short time along with shortest path. To deliver message from source to destination node, we have used a primary path.Since we know that the primary path is the shortest path and very advantageous too.But it can break down due to numerous reasons as any communication network is prone to faults due to hardware failure or software bugs.If the primary path