• DocumentCode
    2608408
  • Title

    MUST: a quasi-round robin access scheme for CAN networks

  • Author

    Cena, Gianluca ; Valenzano, Adriano

  • Author_Institution
    Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    59
  • Lastpage
    66
  • Abstract
    Because of their low implementation costs, optimum responsiveness and widespread availability, controller area networks (CANs) are being more and more used today for supporting communications in real-time systems. However, under heavy traffic conditions, the access protocol of a CAN may exhibit a quite unfair behaviour, in particular when the control applications require that the same quality of service be ensured to a number of different objects. In this paper, a new technique is proposed, called MUST (medium utilisation state tracking), which is based on CANs and introduces few changes to the original protocol. Such a solution is able to ensure a very fair behaviour $which resembles the one obtained in token-based networks - while maintaining, at the same time, the reduced access delays typical of CANs when operating in low traffic conditions
  • Keywords
    access protocols; controller area networks; delays; quality of service; real-time systems; telecommunication traffic; CAN access protocol; MUST; access delays; availability; communication traffic conditions; control applications; controller area networks; fair behaviour; implementation cost; medium utilisation state tracking; quasi-round robin access scheme; real-time system communications; responsiveness; service quality assurance; token-based networks; Access protocols; Automatic control; Automotive applications; Bandwidth; Communication system control; Cost function; Delay effects; Quality of service; Real time systems; Switches;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Factory Communication Systems, 2000. Proceedings. 2000 IEEE International Workshop on
  • Conference_Location
    Porto
  • Print_ISBN
    0-7803-6500-3
  • Type

    conf

  • DOI
    10.1109/WFCS.2000.882534
  • Filename
    882534