The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Quality of Service Routing
Abstract
Traditionally, Internet routing is achieved through shortest path protocols that base their decision on the number of hops or administrative metrics. The path computation algorithms belong either to the distance vector or link state families. Distance vector protocols have been widely used on the Internet since the ARPANET and remain in use today. The protocols of the Distance Vector family are used by routers to exchange routing information with their neighbours and to select the shortest paths to all destinations within the network using the Bellman-Ford algorithm, such as in the routing information protocol (RIP) (Malkin, 1998).
Related Content
|
Ravi Mohan Sharma, Sunita Dwivedi, Vinod Kumar.
© 2025.
18 pages.
|
|
Nagendra Singh Yadav, Vishal Kumar Goar.
© 2025.
40 pages.
|
|
Venkat Narayana Rao T., M. Stephen, Rohan Kolachala.
© 2025.
28 pages.
|
|
Guillermo M. Limon-Molina, E. Ivette Cota-Rivera, Maria E. Raygoza-Limón, Fabian N. Murrieta-Rico, Jesus Heriberto Orduño-Osuna, Roxana Jimenez-Sánchez, Miguel E. Bravo-Zanoguera, Abelardo Mercado.
© 2025.
12 pages.
|
|
Ravi Kant Kumar, Sobin C. C..
© 2025.
20 pages.
|
|
S. Aditi Apurva.
© 2025.
18 pages.
|
|
Parveen Sadotra, Pradeep Chouksey, Mayank Chopra, Rabia Koser, Rishikesh Rawat.
© 2025.
16 pages.
|
|
|