Performance Enhancement of Border Gateway protocol for Large-Scale Autonomous | ||||
| Menoufia Journal of Electronic Engineering Research | ||||
| Article 13, Volume 26, Issue 1, January 2017, Page 213-225 | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/mjeer.2017.63478 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
Nasser Solayman; Mohammed Badawy; Ayman EL-SAYED
| ||||
| Dept. of Computer Science and Eng., Faculty of Elect., Eng., Menoufia University | ||||
| Abstract | ||||
| "> BGP (border gateway protocol)is used for routing between autonomous systems, its main advantage among the other routing protocols is its stability and its ability to maintain and contain large amount of updates in its routing table, and so this is very important as its main usage of it is routing in the internet which consists of large amount of autonomous systems.These internet autonomous systems create a large amount of updates that cannot be maintained and handled by other routing protocol except the BGP. BGP has a big problem which is convergence delay due to large amount of updates that may reach to minutes in cases of topology failure or problems, also it need to high processing in the CPU memory which may lead to a freezing node in lot of cases.So it’sso important to pay more work and attention to reduce these effects that lead to routing instability and nodes freeze. A lot of studied work on solving this problems which create a dynamic model change in the BGP routing MRAI (minimum route advertisement interval) according to the network size.This MRAI is a main functional factor to decrease the convergence delay in much networks, but no one study the effect of many flapping node (neighbor) in a topology on the convergence delay and number of created messages which recreated more and more every time the flapping happened.In this work we will study the effect of the flapping node on a different network size with different sized failure network and then we will apply our solution and study the effect of it on the same different sized failure network, this solutiondepends on disabling this node for the flapping time of this node. | ||||
| References | ||||
|
e-adjust: auto; -webkit-text-stroke-wi[1] Stewart, J.W.: BGP4: Inter-Domain Routing in the Internet. AddisonWesley (1998). [2] Huston, G.: Analyzing the Internet’s BGP Routing Table. Cisco Internet Protocol Journal (2001). [3] Bu, T., Gao, L., Towsley, D.: On routing table growth. In: Proc. IEEE Global Internet Symposium. (2002) [4] Halabi, S., McPherson, D.: Internet Routing Architectures. Second edn. Cisco Press (2001) [5] A. Sahoo, K. Kant, and P. Mohapatra, “Characterization of Istanbul, Turkey, Jun. 11–15, 2006. [6] C. Labovitz, A. Ahuja, et al., “The Impact of Internet Policyand Topology on Delayed Routing Convergence,” in Proc.IEEE INFOCOM 2001, vol. 1, Anchorage, Alaska, Apr. 22—26, 2001, pp. 537–546. [7] T.G. Griffin and B.J. Premore, “An experimental analysis ofBGP convergence time,” in Proc. ICNP 2001, Riverside, California,Nov. 11–14, 2001, pp. 53–61. [8] Dan Pei, B. Zhang, et al., “An analysis of convergence delayin path vector routing protocols,” Computer Networks, vol. 30,no. 3, Feb. 2006, pp. 398– 421. [9] D. Obradovic, “Real-time Model and Convergence Time ofBGP,” in Proc. IEEE INFOCOM 2002, vol. 2, New York, Jun.23–27, 2002, pp. 893–901. [10] G. Siganos and M. Faloutsos, “Analyzing BGP Policies:Methodology and Tool,” in Proc. IEEE INFOCOM 2004, vol.3, Hong Kong, Mar. 7–11, 2004, pp. 1640-1651. [11] Labovitz, C., Ahuja, et al., “Delayed internet routing convergence,” in Proc. ACM SIGCOMM 2000, Stockholm, Sweden, Aug. 28–Sep. 1, 2000, pp. 175–187. troke-width: 0px; "> [12] Sahoo, A.; Kant, K.; Mohapatra, P., "Improving BGP Convergence Delay for Large-Scale Failures," International Conference on Dependable Systems and Networks (DSN), pp.323-332, 25-28 June 2006. [13] S. Deshpande and B. Sikdar, “On the Impact of Route Processing and MRAI Timers on BGP Convergence Times,” in Proc. GLOBECOM 2004, Vol. 2, pp 1147- 1151. [14] H. Tangmunarunkit, J. Doyle, et al, “Does Size Determine Degree in AS Topology?” ACM SIGCOMM Computer Communication Review, vol. 31, issue 5, pp. 7–10, Oct. 2001. [15] B. Waxman, “Routing of Multipoint Connections,” IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, pp. 1617–1622, Dec. 1988. [16] “SSFNet: Scalable Simulation Framework”. [Online]. Available: http://www.ssfnet.org/ | ||||
|
Statistics Article View: 140 |
||||
