Scheduling of routing table calculation schemes in open shortest path first using artificial neural network
Internet topology changes due to events such as router or link goes up and down. Topology changes trigger routing protocol to undergo convergence process which eventually prepares new shortest routes needed for packet delivery. Real-time applications (e.g. VoIP) are increasingly being deployed in in...
Saved in:
Main Author: | Abu Yazid, Mohamad Haider |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/37980/1/MohamadHaiderAbuYazidMFSKSM2013.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
VHDL modelling and asic design of a shortest-path processor core for network routing
by: Teoh, Giap Seng
Published: (2003) -
Traffic Balancing Method in Shortest Path Routing
by: Mohamed Abdulqader, Makarem
Published: (2007) -
Shortest Path Routing Using Heuristic Search
by: Alaiwan, Ahmed Omran A.
Published: (2006) -
Determination of the shortest path by using genetic algorithms
by: Abu Hassan, Mohd. Fadzil
Published: (2008) -
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
by: Ch'ng, Heng Sun
Published: (2007)