원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
The challenges faced by the today’s network are significantly increased. They decrease the efficiency of the network. If enough measures are not taken, this will lead to severe problems in future generation networks. Though many parameters are involved in improving the efficiency, this paper focuses on distance and bandwidth. The proposed algorithm identifies the shortest route faster than Dijkstra’s algorithm. It suggests new ideas in constructing source-todestination route by refining the steps in existing algorithm. It also identifies the bandwidtheffective route using proposed algorithm. Ultimately, the outcome of this paper increases the efficiency of the network.
목차
Abstract
1. Introduction
2. Motivations
2.1. Widest-shortest path (WSP)
2.2. Open shortest path first (OSPF)
2.3. Border gateway protocol (BGP)
2.4. Routing information protocol (RIP)
3. Proposed algorithm
3.1. Algorithm
4. Analysis
4.1. Dijkstra’s algorithm vs. proposed algorithm
4.2. Identifying bandwidth-effective route
5. Conclusion and future enhancements
References
1. Introduction
2. Motivations
2.1. Widest-shortest path (WSP)
2.2. Open shortest path first (OSPF)
2.3. Border gateway protocol (BGP)
2.4. Routing information protocol (RIP)
3. Proposed algorithm
3.1. Algorithm
4. Analysis
4.1. Dijkstra’s algorithm vs. proposed algorithm
4.2. Identifying bandwidth-effective route
5. Conclusion and future enhancements
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보