Browse > Article
http://dx.doi.org/10.7840/kics.2012.37C.9.829

Study on OSPF Routing Cost Functions for Wireless Environments  

Shin, Dong Wook (광운대학교 전자융합공학과)
Lee, Seung Hwan (광운대학교 전자융합공학과)
Rhee, Seung Hyong (광운대학교 전자융합공학과)
Lee, Hyung-Joo (국방과학연구소)
Hoh, Mi-Jeong (국방과학연구소)
Choi, Jeung-Won (국방과학연구소)
Shin, Sang-Heon (삼성탈레스(주))
Kim, Tae-Wan (삼성탈레스(주))
Moon, Ho-Won (삼성탈레스(주))
Abstract
Recently, in network communication environments, it is changing very fast from wired to wireless. The open shortest path firtst (OSPF), one of link state routing protocols, mainly used in wired networks, is the routing method to select optimal traffic path as identifying the link state of neighbor routers. The traditional OSPF cost functions performs with first fixed cost permanently, unless the router link is changed. However, in wireless networks, the performance of links show big difference by other environment factors. The bit error rate (BER), a parameter which can quite affect link state in wireless networks, is not considered in the traditional OSPF cost functions. Only a link bandwidth is considered in the traditional OSPF cost functions. In this paper, we verify the various parameters which can affect link performance, whether it is permissible to use as the parameter of proposed cost functions. To propose new cost functions, we use the effective bandwidth. This bandwidth is calculated by proposed formula using the BER of the network link and link bandwidth. As applied by the proposed triggering condition, the calculated effective bandwidth decrease the unstable of network by generating less link state update messages in wireless networks that frequently changes the link state. Simulation results show that the proposed cost functions significantly outperforms the traditional cost functions in wireless networks in terms of the services of VoIP and data transmission.
Keywords
OSPF; Link State Routing Protocol; BER; Effective Bandwidth; Cost Functions; Triggering Condition; LSU;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. T. Moy, OSPF: Anatomy of An Internet Routing Protocol, Addison Wesley Longman, 1998.
2 C. Hedrick, "RFC 1058: The Routing Information Protocol (RIP)," IETF Request For Comments, 1988.
3 A. Zinin, Cisco IP Routing, Addison-Wesley, 2002.
4 I. Pepelnjak, EIGRP Network Design Solution, CISCO Press, 1999.
5 D. McPherson. "Intermediate system to intermediate system (IS-IS) transient blackhole avoidance," RFC 3277, 2002.
6 R. White and A. Retana, IS-IS: Deploygment in IP Networks, Addison-Wesley, 2003.
7 A. V. Aho and D. Lee, "Hierarchical networks and the LSA n-squared problem in OSPF routing," in Proc. IEEE GLOBECOM, 2000, pp.397∼403.
8 J. T. Moy, "OSPF version2," RFC 2328, Apr. 1997.
9 F. Baker and R. Coltun, "OSPF version 2 management information base," RFC 1850, Nov. 1995.
10 M. Viswanathan and M. Viswanathan, "Measuring speech quality for text-to-speech systems: Development and assessment of a modified mean opinion score scale," Comput. Speech and Language 19, pp.55-83, Jan. 2005.   DOI   ScienceOn