GDL

Efficient Algorithms to Enhance Recovery Schema in Link State Protocols

ISSN : 0975 – 8992
Journal from gdlhub / 2017-08-14 11:52:34
Oleh : Radwan S.Abujassar and Mohammed Ghanbari,, International Journal of UbiComp
Dibuat : 2012-06-26, dengan 1 file

Keyword : Link state protocol; ART (Alternative Routing Table); Dijkstra algorithm
Subjek : Efficient Algorithms to Enhance Recovery Schema in Link State Protocols
Url : http://airccse.org/journal/iju/papers/2311iju04.pdf
Sumber pengambilan dokumen : Internet

With the increasing demands for real-time applications traffic in net- works such as video and voice a high


convergence time for the existing routing protocols when failure occurred is required. These applications


can be very sensitive to packet loss when link/node goes down. In this paper, we propose two algorithms


schemas for the link state protocol to reroute the traffic in two states; first, pre-calculated an alternative


and disjoint path with the primary one from the source to the destination by re-routing traffic through it,


regardless of the locations of failure and the number of failed links. Second, rerouting the traffic via an


alternative path from a node whose local link is down without the need to wait until the source node knows


about the failure. This is achieved by creating a new backup routing table based on the original routing


table which is computed by the dijkstra algorithm. The goal of these algorithms is to reduce loss of packets,


end-to-end delay time, improve throughput and avoiding local loop when nodes re-converge the topology


in case of failure.

Deskripsi Alternatif :




With the increasing demands for real-time applications traffic in net- works such as video and voice a high


convergence time for the existing routing protocols when failure occurred is required. These applications


can be very sensitive to packet loss when link/node goes down. In this paper, we propose two algorithms


schemas for the link state protocol to reroute the traffic in two states; first, pre-calculated an alternative


and disjoint path with the primary one from the source to the destination by re-routing traffic through it,


regardless of the locations of failure and the number of failed links. Second, rerouting the traffic via an


alternative path from a node whose local link is down without the need to wait until the source node knows


about the failure. This is achieved by creating a new backup routing table based on the original routing


table which is computed by the dijkstra algorithm. The goal of these algorithms is to reduce loss of packets,


end-to-end delay time, improve throughput and avoiding local loop when nodes re-converge the topology


in case of failure.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of UbiComp
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com