• DocumentCode
    3098715
  • Title

    Ring Optimal Assignment of Slot Reservations for Cyclic TDMA Protocols

  • Author

    Mosko, Marc ; Solis, Ignacio ; Garcia-Luna-Aceves, J.J.

  • Author_Institution
    Palo Alto Res. Center, Palo Alto, CA, USA
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 4 2011
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    We present an algorithm to assign time slots to nodes in a TDMA network that minimizes the jitter in time slot assignments. By reducing the jitter in time slots around the TDMA frame, we can provide more consistent network access and reduce the overall delay seen by an application with time-varying traffic patterns, such as normal web traffic. Our algorithm can reduce the average delay seen by all nodes in a network by up to 51%, based on our numerical analysis. The algorithm is designed for TDMA MAC layers where a node has the potential to reserve some number of time slots out of a larger selection of available slots, and one wishes to choose the slots that most evenly distribute them around the TDMA ring. The algorithm solves the Minimum Variance Placement problem for the special case of a directed ring. After describing an exact solution using dynamic programming, we present a much faster run time heuristic that closely approximates the exact solution.
  • Keywords
    access protocols; dynamic programming; jitter; numerical analysis; telecommunication traffic; time division multiple access; TDMA MAC layer; cyclic TDMA protocol; delay reduction; dynamic programming; jitter; minimum variance placement problem; numerical analysis; ring optimal assignment; slot reservation; time slot assignment; time-varying traffic pattern; Delay; Heuristic algorithms; Peer to peer computing; Protocols; Resource management; Time division multiple access;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communications and Networks (ICCCN), 2011 Proceedings of 20th International Conference on
  • Conference_Location
    Maui, HI
  • ISSN
    1095-2055
  • Print_ISBN
    978-1-4577-0637-0
  • Type

    conf

  • DOI
    10.1109/ICCCN.2011.6005899
  • Filename
    6005899