Earticle

초록

영어

The selection of a path in the exponentially growing internet is a difficult task. The upcoming high-speed networks are expected to support a wide variety of communication-intensive real-time multimedia applications. There are many significant factors which affect the performance of a computer network such as choice of routing algorithm, heavy traffic, etc. There must be a mechanism to effectively use the network. Using shortest paths conserves network resources, but it causes some resources of the network to be over utilized while other resources remain under utilized. As the path selection directly affects the throughput, an efficient path selection algorithm is needed which periodically finds the optimum path. In this paper, we would like propose an algorithm that can be used in both datagram and virtual circuit environment. This is a small step in building throughput-aware and traffic-sensitive path selection. Ultimately, our idea contributes to find a route in an integrated network environment.

목차

Abstract
 1. Introduction
 2. Network and path selection
 3. Related research work
 4. Existing path selection algorithms
  4.1. Widest-shortest path
  4.2. Shortest-widest path
  4.3. Breadth first search path selection
  4.4. Per-pair path selection
  4.5. Global path selection
 5. Proposed algorithm
 6. Conclusion and Future enhancements
 7. References

키워드

저자

• P. Calduwel Newton [ Lecturer, Bishop Heber College (Autonomous) ]
• L. Arockiam [ Lecturer (SG, St.Joseph’s College (Autonomous) ]
• Tai-hoon Kim [ Dept. of Multimedia, Hannam University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605