Contact at mumbai.academics@gmail.com or 8097636691
Responsive Ads Here

Thursday, 22 February 2018

Distributed Packet Buffers for High-Bandwidth Switches and Routers(2012)

Distributed Packet Buffers for High-Bandwidth Switches and Routers(2012)


Abstract:
High-speed routers rely on well-designed packet buffers that support multiple queues, provide large capacity and short response times. Some researchers suggested combined SRAM/DRAM hierarchical buffer architectures to meet these challenges. However, these architectures suffer from either large SRAM requirement or high time-complexity in the memory management. In this paper, we present scalable, efficient, and novel distributed packet buffer architecture. Two fundamental issues need to be addressed to make this architecture feasible: 1) how to minimize the overhead of an individual packet buffer; and 2) how to design scalable packet buffers using independent buffer subsystems. We address these issues by first designing an efficient compact buffer that reduces the SRAM size requirement by (k - 1)/k. Then, we introduce a feasible way of coordinating multiple subsystems with a load-balancing algorithm that maximizes the overall system performance. Both theoretical analysis and experimental results demonstrate that our load-balancing algorithm and the distributed packet buffer architecture can easily scale to meet the buffering needs of high bandwidth links and satisfy the requirements of scale and support for multiple queues.
Existing System
The router buffer sizing is still an open issue. The traditional rule of thumb for Internet routers states that the routers should be capable of buffering RTT*R data, where RTT is a round-trip time for flows passing through the router, and R is the line rate. Many researchers claimed that the size of buffers in backbone routers can be made very small at the expense of a small loss in throughput. Focusing on the performance of individual TCP flows, researchers claimed that the output/input capacity ratio at a network link largely determines the required buffer size. If the output/input capacity ratio is lower than one, the loss rate follows a power-law reduction with the buffer size and significant buffering is needed
Proposed System
We devise a “traffic-aware” approach which aims to provide different services for different types of data streams. This approach further reduces the system overhead. Both mathematical analysis and simulation demonstrate that the proposed architecture together with its algorithm reduce the overall SRAM requirement significantly while providing guaranteed performance in terms of low time complexity, upper bounded drop rate, and uniform allocation of resources.
Modules
  • Source
            It loads data and sends data to its router (source router).
  • Source Router
            Source router uses leaky bucket mechanism to maintain the buffer in available bandwidth.
  • Main Router
            Main router sends the forward packets from source to destination and backward packets from destination to source. It receives empty packets from destination to calculate the bandwidth of destination and ack packets to send the next packet to destination.
  • Destination Router
            It sends empty, ack packets to centralized router.
  • Destination
            Destination receives the data from destination router.
Software Requirement Specification
Software Specification
Operating System       :           Windows XP
Technology                 :           JAVA 1.6
Hardware Specification
Processor                     :           Pentium IV
RAM                           :           512 MB
Hard Disk                   :           80GB

No comments:

Post a Comment