Open Access Subscription Access
Deterministic IP Networking based on Traffic History Records
There are many algorithms to improve the network traffic and to avoid losing packets in the network. This paper proposed determining the shortest paths for hops, which are in the middle of the source and destination. The shortest path in this paper means the fastest path between them. Recently, dynamic routing algorithm is currently used now but this paper suggests the fastest paths between the source and the destination is by using the record of the network traffic history. People are using the networking and the network traffic is always corresponding to how many people use the networking in specific time. Therefore, we can predict the network condition by referring to the history of network traffic record, and then the shortest path can be produced without using RIP too much. It will be helpful to improve the network traffic.
Network Traffic, Static Routing, The Shortest Paths.
Call for Papers
- Hedrick C. Routing Information Protocol. RutgersUniversity; 1988 June. Available from http://www.ietf.org/rfc/rfc1058.txt
- Guerin R, Orda A. Computing Shortest Paths for Any Number of Hops. IEEE/ACM Transaction on Networking. 2002 Oct; 10(5).
- Wang B, Hou, Jennifer C. Multicast routing and its QoS extension: Problems, algorithms, and protocols. IEEE Network. 2000 Jan/Feb; 14(1):15,22.
- Sahasrabuddhe, Laxman H, Biswanath M. Multicast routing algorithms and protocols: A tutorial. IEEE Network. 2000 Jan/ Feb; 14(1):13,90.
- Nilesh BM, Krishna SM, Fabry-Asztalos. Routing Mechanisms Employing Adaptive Weight Functions for Shortest Path Routing in Optical WDM Networks. Tibor Source: Photonic Network Communication. 2001; 3(3):227–36.
- Heide AD, Friedhelm, Berthold V. Shortest-Path Routing in Arbitrary Networks. Journal of Algorithms. 1999; 31(1):105.
- Amir A, Farhad K. Dynamic shortest path in stochastic dynamic networks: Ship routing problem. European journal of operational research. 2003; 144(1):138.
- Ramakrishnan KG, Rodrigues MA. Optimal Routing in ShortestPath Data Networks. Bell Labs technical journal. 2001; 6(1):117.
- Chich T. An Adaptive Shortest-path On-line Routing Algorithm. Conference record / 3, 1998.
- Deepinder S, Fu T, Shukri A. Open Shortest Path First (OSPF) Routing Protocol Simulation. Computer communication review. 1993 Oct; 23(4):53–63.
- William S. High-speed networks and Internets performance and quality of service. 2nd ed. Prentice Hall. p. 7,8.
- Hocking RR. Methods and Applications of Linear Models. Wiley Series In; 1996 Feb.
- Graybill FA. Theory and Application of the Linear Model. Pacific Grove; 1976.
- Nash JC. Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation. 2nd ed. Bristol, England: Adam Hilger; 1990. p. 21–4.
- Lancaster P, Salkauskas K. Curve and Surface Fitting: An Introduction. London: Academic Press; 1986.
- Internet Traffic Information. CyberLynk Network, Inc. 2003 April. Available from http://www.cyberlynk.net/customercare_ techsupport/traffic/
Abstract Views: 128
PDF Views: 30