• DocumentCode
    2213078
  • Title

    Network Hardware Algorithms

  • Author

    Prabhakar, Balaji

  • Author_Institution
    Stanford University, Departments of Electrical Engineering and Computer Science, balaji@stanford.edu
  • fYear
    2005
  • fDate
    19-21 Dec. 2005
  • Firstpage
    1
  • Lastpage
    1
  • Abstract
    Over the past 10-15 years the area of Network Algorithms has grown from a collection of isolated algorithms and analysis methods into a cohesive body of research and development. The problems in this area are characterized by several requirements, of which speed, scalability and simplicity are the most important. For algorithms designed to operate in high-speed router hardware, there is the additional stringent constraint of low heat dissipation. We overview the development of Network Algorithms, emphasizing algorithms designed for high-speed hardware implementations. Specifically, we describe the algorithms and analysis methods developed for bandwidth partitioning, routing and security applications. We highlight the crucial role of randomization and probabilistic techniques in simplifying the implementation while delivering high performance.
  • Keywords
    Algorithm design and analysis; Bandwidth; Hardware; Partitioning algorithms; Research and development; Routing; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Collaborative Computing: Networking, Applications and Worksharing, 2005 International Conference on
  • Print_ISBN
    1-4244-0030-9
  • Type

    conf

  • DOI
    10.1109/COLCOM.2005.1651258
  • Filename
    1651258