* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download IJAER-International Journal of Advances in Engineering Research
Survey
Document related concepts
Network tap wikipedia , lookup
Internet protocol suite wikipedia , lookup
Asynchronous Transfer Mode wikipedia , lookup
Net neutrality law wikipedia , lookup
Zero-configuration networking wikipedia , lookup
Airborne Networking wikipedia , lookup
Computer network wikipedia , lookup
Deep packet inspection wikipedia , lookup
Piggybacking (Internet access) wikipedia , lookup
List of wireless community networks by region wikipedia , lookup
Recursive InterNetwork Architecture (RINA) wikipedia , lookup
Wake-on-LAN wikipedia , lookup
Cracking of wireless networks wikipedia , lookup
Multiprotocol Label Switching wikipedia , lookup
Transcript
International Journal of Advances in Engineering Research http://www.ijaer.com (IJAER) 2012, Vol. No. 4, Issue No. III, September ISSN: 2231-5152 DESIGN ANANLYSIS AND DEVELOPLMENT OF OPTIMIZATION TECHNIQUES IN SWITCHED ROUTING 1 Dr. Umesh Sehgal and 2Yadu Sharma [email protected],Asso. Prof. Arni University [email protected], M.Tech student Arni University ABSTRACT In the emerging environment of high performance IP networks, it is expected that local and campus area backbones, enterprise networks, and Internet Service Providers (ISPs) will use multigigabit and terabit networking technologies where IP routers will be used not only to interconnect backbone segments but also to act as points of attachments to high performance wide area links. Special attention must be given to new powerful architectures for routers in order to play that demanding role. In this paper, we identify important trends in router design and outline some design issues facing the next generation of routers. It is also observed that the achievement of high throughput IP routers is possible if the critical tasks are identified and special purpose modules are properly tailored to perform them. Keywords: - IP, ISP, WLAN, Router INTRODUCTION The popularity of the Internet has caused the traffic on the Internet to grow drastically every year for the last several years. It has also spurred the emergence of many Internet Service Providers (ISPs). To sustain growth, ISPs need to provide new differentiated services, e.g., tiered service, support for multimedia applications, etc. The routers in the ISPs’ networks play a critical role in providing these services. Internet Protocol (IP) traffic on private enterprise networks have also been growing rapidly for some time. These networks face significant bandwidth challenges as new application types, especially desktop applications uniting voice, video, and data traffic need to be delivered on the network infrastructure. This growth in IP traffic is beginning to stress the traditional processor-based design of current-day routers and as a result has created new challenges for router design. Routers have traditionally been implemented purely in software. Because of the software implementation, the performance of a router was limited by the performance of the processor executing the protocol code. To achieve wire-speed routing, high-performance processors together with large memories were required. This translated into higher cost. Thus, while software-based wire-speed routing was possible at low-speeds, for example, with 10 megabits per second (Mbps) ports, or with a International Journal of Advances in Engineering Research International Journal of Advances in Engineering Research http://www.ijaer.com (IJAER) 2012, Vol. No. 4, Issue No. III, September ISSN: 2231-5152 relatively smaller number of 100 Mbps ports, the processing costs and architectural implications make it difficult to achieve wire-speed routing at higher speeds using software-based processing. Fortunately, many changes in technology (both networking and silicon) have changed the landscape for implementing high-speed routers. Silicon capability has improved to the point where highly complex systems can be built on a single integrated circuit (IC). The use of 0.35 m and smaller silicon geometries enables application specific integrated circuit (ASIC) implementations of millions gateequivalents. Embedded memory (SRAM, DRAM) and microprocessors are available in addition to high-density logic. This makes it possible to build single-chip, low-cost routing solutions that incorporate both hardware and software as needed for best overall performance. In this paper we investigate the evolution of IP router designs and highlight the major performance issues affecting IP routers. The need to build fast IP routers is being addressed in a variety of ways. We discuss these in various sections of the paper. We discuss in detail the various router mechanisms needed for high-speed operation. In particular, we examine the architectural constraints imposed by the various router design alternatives. The scope of the discussion presented here does not cover more recent label switching routing techniques such as IP Switching [1], the Cell Switching Router (CSR) architecture [2], Tag Switching [3], and Multiprotocol Label Switching (MPLS). Generally, routers consist of the following basic components: several network interfaces to the attached networks, processing module(s), buffering module(s), and an internal interconnection unit (or switch fabric). Typically, packets are received at an inbound network interface, processed by the processing module and, possibly, stored in the buffering module. Then, they are forwarded through the internal interconnection unit to the outbound interface that transmits them on the next hop on the journey to their final destination. The aggregate packet rate of all attached network interfaces needs to be processed, buffered and relayed. Therefore, the processing and memory modules may be replicated either fully or partially on the network interfaces to allow for concurrent operations. A generic architecture of an IP router is given in Figure 1. Figure 1a shows the basic architecture of a typical router: the controller card (which holds the CPU), the router backplane, and interface cards. The CPU in the router typically performs such functions as path computations, routing table maintenance, and reach ability propagation. It runs which ever routing protocols are needed in the router. The interface cards consist of adapters that perform inbound and outbound packet forwarding (and may even cache routing table entries or have extensive packet processing capabilities). The router backplane is responsible for transferring packets between the cards. 1. Architectures with Route Caching International Journal of Advances in Engineering Research International Journal of Advances in Engineering Research http://www.ijaer.com (IJAER) 2012, Vol. No. 4, Issue No. III, September ISSN: 2231-5152 For the second generation IP routers, improvement in the shared-bus router architecture was introduced by distributing the packet forwarding operations. Distributing fast processors and route caches, in addition to receive and transmit buffers, over the network interface cards reduces the load on the system bus. Packets are therefore transmitted only once over the shared bus. This reduces the number of bus copies and speeds up packet forwarding by using a route cache of frequently seen addresses in the network interface This architecture allows the network interface cards to process packets locally some of the time. CONCLUSION We must note that any of the products in this roundup will serve you well if your ISP doles out under 5 Mbps of bandwidth to you and your Internet use is primarily web browsing, emailing, IM and the occasional file download. But if you're looking for more out of a router, then the following comments will be helpful for ranking the products in this roundup. Though it won't be winning any router beauty contests any time soon with its homely design, theAirlink101 AR504 soundly beats the competition in this roundup, both in terms of performance and feature set. With nearly double the benchmarked speeds of its nearest competitor, along with a full set of features, the AR504 offers the best combination of features and performance for its price. Coming in second is the Edimax BR-6104K with its extensive feature list and attractive admin console UI. Its tough firewall options make it a fine choice for the security-minded, along with its port forwarding and access control options and its total memory size (with both RAM and flash being double the size of its nearest competitor) make up for its middling speed. The TrendNet and Zonet offerings make up the middle of the pack, with a decent amount of features coupled with adequate speed. Either router would make a fine addition to a small network environment. Pulling up the rear are the the D-Link EBR-2310 and U.S. Robotics USR8004. While the EBR-2310 comes with a good amount of features, its low ranking is mainly due to its relatively low throughput. However, the USR8004 comes in dead last due not only to low throughput but also its lackluster feature set and bare-bones UI, which harken back to first generation routers. Consumer routers have come a long way, but you would never know it from the USR8004. And you can see by this roundup that there are better products, although with lesser-known brand names, for the money. With the exception of the USR8004, none of these routers can truly be called 'cheap'. Rather, they all offer functional solutions for the small office or home user on a budget, without carrying the same price tag as more hefty routers. The conventional wisdom of 'you get what you pay for' can be thrown International Journal of Advances in Engineering Research International Journal of Advances in Engineering Research http://www.ijaer.com (IJAER) 2012, Vol. No. 4, Issue No. III, September ISSN: 2231-5152 to the wind when it comes to these routers, as nearly all fare well when put to the test and all can be had for the price of a song if you look in the right place. REFERENCES [1]. P. Newman, T. Lyon, and G. Minshall, “Flow Labelled IP: A Connectionless Approach to ATM,” Proc IEEE Infocom’96, San Francisco, CA, March 1996, . 1251 - 1260. [2]. Y. Katsube, K. Nagami, and H. Esaki, “Toshiba’s Router Architecture Extensions for ATM: Overview,” IETF RFC 2098, April 1997. [3]. Y. Rekhter, B. Davie, D. Katz, E. Rosen, and G. Swallow, “Cisco Systems’ Tag Switching Architecture Overview,” IETF RFC 2105, Feb. 1997. [4].F. Baker, “Requirements for IP Version 4 Routers,” IETF RFC 1812, Jun. 1995. [5].W. R. Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Reading, MA: Addison-Wesley, 1994. [6].C. Huitema, Routing in the Internet, Prentice Hall, 1996. [7].J. Moy, OSPF: Anatomy of an Internet Routing Protocol, 1998. [8].R. Braden, D. Borman, and C. Partridge, “Computing the Internet Checksum,”IETF RFC 1071, Sept. 1988. [9].T. Mallory and A. Kullberg, “Incremental Updating of the Internet Checksum,”IETF RFC 1141, Jan. 1990. [10]. C. A. Kent and J. C. Mogul, “Fragmentation Considered Harmful,” Computer Commun. Rev., Vol. 17, No. 5, Aug. 1987, pp. 390 - 401. [11]. J. Mogul and S. Deering, “Path MTU Discovery” IETF RFC 1191, April 1990. [12]. V. Fuller et al. “Classless Inter-Domain Routing,” IETF RFC 1519, Jun. 1993. [13]. K. Sklower, “A Tree-Based Packet Routing Table for Berkeley Unix,” USENIX, Winter’91, Dallas, TX, 1991. [14]. W. Doeringer, G. Karjoth, and M. Nassehi, “Routing on Longest-Matching Prefixes,” International Journal of Advances in Engineering Research International Journal of Advances in Engineering Research http://www.ijaer.com (IJAER) 2012, Vol. No. 4, Issue No. III, September ISSN: 2231-5152 IEEE/ACM Trans. on Networking, Vol. 4, No. 1, Feb. 1996, pp. 86 - 97. [15]. D. C. Feldmeier, “Improving Gateway Performance with a Routing-Table Cache,” Proc. IEEE Infocom’88, New Orleans, LI, Mar. 1988. [16]. C. Partridge, “Locality and Route Caches,” NSF Workshop on Internet Statistics Measurement and Analysis, San Diego, CA, Feb. 1996. [17]. D. Knuth, The Art of Computer Programming, Vol. 3. Sorting and Searching, AddisonWesley, 1973. [18]. M. Degermark, et al., “Small Forwarding Tables for Fast Routing Lookups,”Proc.ACM SIGCOMM’97, Cannes, France, Sept. 1997. [19]. H.-Y. Tzeng,“Longest Prefix Search Using Sydney, Australia, Nov. 1998. Compressed Trees,” Proc.Globecom’98, [20]. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, “Scalable High Speed IP Routing Lookup,” Proc. ACM SIGCOMM’97, Cannes, France, Sept. 1997. [21]. V. Srinivasan and G. Varghese, “Faster IP Lookups using Controlled Prefix Expansion,” Proc. ACM SIGMETRICS, May 1998. [22]. S. Nilsson and G. Karlsson, “Fast Address Look-Up for Internet Routers,” Proc. of IEEE Broadband Communications’98, April 1998. [23]. E. Filippi, V. Innocenti, and V. Vercellone, “Address Lookup Solutions for Gigabit Switch/Router,” Proc. Globecom’98, Sydney, Australia, Nov. 1998. International Journal of Advances in Engineering Research