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:
主要作者: | Abu Yazid, Mohamad Haider |
---|---|
格式: | Thesis |
语言: | English |
出版: |
2013
|
主题: | |
在线阅读: | http://eprints.utm.my/id/eprint/37980/1/MohamadHaiderAbuYazidMFSKSM2013.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
VHDL modelling and asic design of a shortest-path processor core for network routing
由: Teoh, Giap Seng
出版: (2003) -
Traffic Balancing Method in Shortest Path Routing
由: Mohamed Abdulqader, Makarem
出版: (2007) -
Shortest Path Routing Using Heuristic Search
由: Alaiwan, Ahmed Omran A.
出版: (2006) -
Determination of the shortest path by using genetic algorithms
由: Abu Hassan, Mohd. Fadzil
出版: (2008) -
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
由: Ch'ng, Heng Sun
出版: (2007)