• DocumentCode
    3239293
  • Title

    Improving Network Utilization Using Dynamic Allocation Adjustment Algorithm

  • Author

    Bhende, M.S. ; Gothwal ; Patil

  • fYear
    2009
  • fDate
    16-18 Dec. 2009
  • Firstpage
    625
  • Lastpage
    629
  • Abstract
    When you design networks that transport voice over packet, frame, or cell infrastructures, it is important to understand and account for the delay components in the network. If you account correctly for all potential delays, it ensures that overall network performance is acceptable. Delay guarantees are critical to real-time applications. To ensure the end-to-end delay guarantee of a flow, the previous approaches usually statically divide the end-to-end delay requirement into per-hop delay requirements. However, such static resource allocations may cause unbalanced usage in a network, limit the total number of sessions that can be accommodated, and result in low network utilization. To address this issue, we propose a dynamic allocation adjustment (DAA) approach to evenly spread traffic over flow paths and related links, and improve the system utilization.It is useful for unicast and multicast or symmetric and asymmetric Topology DAA is able to significantly increase the total number of flows admitted; it reduces the average link reservations, decreases the total resource usage per flow, and balances link loads.
  • Keywords
    delay systems; radio spectrum management; cell infrastructure; dynamic allocation adjustment algorithm; end-to-end delay guarantee; network utilization improvement; per-hop delay requirement; potential delay; radio spectrum management; real-time application; transport voice over packet; Delay; Heuristic algorithms; IPTV; Industrial control; Jitter; Resource management; Routing; Satellites; Telecommunication traffic; Wide area networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Emerging Trends in Engineering and Technology (ICETET), 2009 2nd International Conference on
  • Conference_Location
    Nagpur
  • Print_ISBN
    978-1-4244-5250-7
  • Electronic_ISBN
    978-0-7695-3884-6
  • Type

    conf

  • DOI
    10.1109/ICETET.2009.129
  • Filename
    5395022