Access regulation mechanism for switch-based LAN
This paper describes a mechanism that regulates access of bursty traffic sources to a switch-based LAN. This regulation mechanism ensures global fairness, such that, within a well-defined global control cycle each node can transmit a predefined number of data units over its adjacent links, i.e., it provides deterministic access delay bound and bandwidth. The global control cycle is created over a tree that spans a network with an arbitrary topology, in contrast with previous works, in which a global control cycle was created over a ring (e.g., token-ring, MetaRing). As a result, in this work the global control cycle can be shorter and the access mechanism to the network is more efficient. The regulation mechanism is based on exchanging control signals between neighboring nodes. The proposed mechanism has the following properties: (i) time-driven automatic stabilization, (ii) automatic tolerance of one control signal loss in every global control cycle, and (iii) only two bits of information required for the control signals.
access regulation switch-based lans fairness algorithms self stabilization fault tolerance fault recovery local area networks (lan) media access control (mac) tree fairness algorithm metropolitan area networks (man) spatial bandwidth reuse deadlock freeness automatic fault recovery