Fact-checked by Grok 2 weeks ago

Token passing

Token passing is a () employed in local area networks (LANs) to regulate access to a shared by circulating a special control frame known as a among connected . Only the possessing the at any given time is permitted to transmit data frames, after which it releases or passes the to the next station in the logical sequence, thereby guaranteeing fair access and eliminating data collisions inherent in contention-based methods like (CSMA). This deterministic approach provides predictable , making it suitable for environments requiring reliable, ordered communication. The protocol manifests in two main variants standardized by the IEEE: token bus (IEEE 802.4), which operates over a physical bus or tree topology using coaxial cable or fiber optic media at speeds of 1, 5, or 10 Mb/s, and token ring (IEEE 802.5), which uses a logical ring topology—often implemented physically as a star—at speeds of 4 or 16 Mb/s via shielded twisted-pair cabling. In token bus, stations are logically ordered in a ring despite the physical layout, with the token passed based on station addresses to maintain sequence. Token ring, conversely, relies on active or passive hubs to relay frames around the ring, incorporating mechanisms like priority queuing and early token release to optimize throughput under varying loads. Both standards define frame formats, including delimiters, addresses, and control fields, along with procedures for token maintenance and error recovery. Originating from research in the 1970s, token passing gained prominence through IBM's development of the network, first implemented in as a high-performance alternative to emerging Ethernet technologies for LANs. IBM's design emphasized and , leading to its by the IEEE 802.5 , with the initial standard published in and subsequent revisions extending capabilities like 100 Mb/s operation. Meanwhile, IEEE 802.4 token bus, finalized in 1990, targeted industrial and broadband applications, such as manufacturing automation, where predictable access times were critical. Although once widely adopted—particularly in IBM-dominated environments—token passing protocols have largely been supplanted by Ethernet due to lower costs and higher speeds; both standards were withdrawn in the early 2000s. Their principles influence modern deterministic networking standards like (TSN). Key advantages of token passing include collision-free transmission, which enhances efficiency under heavy traffic loads compared to bus topologies, and deterministic performance, enabling bounded delays essential for systems without requiring a central server for . However, it introduces complexities such as , which can disrupt the network if a station fails, and increased as frames traverse all nodes in the . These trade-offs, combined with the protocol's overhead for token circulation even during idle periods, contributed to its decline in favor of more flexible, scalable alternatives by the early .

Fundamentals

Definition and Principles

Token passing is a channel access employed in shared-medium networks, where a small known as a circulates sequentially among the connected . This serves as a permission mechanism, granting the possessing the exclusive right to transmit over the medium while preventing other from doing so simultaneously. By design, token passing operates as a controlled access method, ensuring that only one can initiate at a time, thereby eliminating the risk of collisions inherent in shared communication channels. The core principles of token passing revolve around deterministic access, which provides predictable and fair transmission opportunities for all nodes in the network. Unlike random access protocols such as , where nodes contend probabilistically for the medium and may experience variable delays or collisions, token passing enforces an ordered rotation of the token, guaranteeing that each node receives a turn within a bounded time frame. This structured approach promotes equitable bandwidth allocation in multi-node environments, particularly suited to local area networks (LANs) where multiple stations share a single broadcast channel. Central to the is the concept of the as a lightweight permission packet that maintains by circulating continuously in a logical . To avoid simultaneous transmissions, only a single active exists per , which is passed from one to the next upon completion of any data transmission or after a timeout period. This enhances efficiency in environments with multiple s, as it minimizes idle time and overhead associated with collision resolution, fostering reliable and ordered communication over shared media.

Basic Operation

In token passing systems, a special frame known as the token circulates sequentially among networked s, granting the holder exclusive rights to transmit and thereby managing medium in a controlled manner. initiates with token generation, typically performed by a designated during network startup, after which the token is passed to the subsequent according to a predefined , such as a logical ring . Each continuously monitors the network for the token's arrival. Upon receipt, the inspects whether it has pending for . In an idle state, if no is available, the forwards the token unchanged to the next , allowing circulation to continue without interruption. Conversely, in a busy state, if is queued, the captures the token and, during the time it holds the token (limited by a holding ), transmits one or more data frames over the shared medium to the destination(s). The exact varies by : in topologies, the data frame circulates until returning to the sender for removal; in bus topologies, frames are broadcast on the medium. To prevent any single from monopolizing access, is limited by a token holding , after which the must release the token even if additional remains. Following transmission, the generates a free and releases it to the next in the sequence, restoring the system to an idle circulation state. Nodes adhere to these behaviors by passively waiting for the when not in possession and strictly observing holding time limits to promote equitable access across the network. If the is lost due to errors or failures, timeout mechanisms detect the absence—such as a failing to receive the within an expected period—and trigger by regenerating the through a designated .

Historical Development

Origins and Early Concepts

Token passing emerged in the late as a response to the limitations of early shared-medium networks, particularly the contention-based access methods that led to unpredictable delays and collisions in emerging local area networks (LANs). Influenced by ring buffer concepts in , which enabled efficient circular data circulation between processes, researchers sought deterministic alternatives to protocols like and early CSMA variants. These ideas were initially explored in ring topologies to ensure fair and ordered medium access, addressing the inefficiencies of mechanisms that could cause prolonged wait times in busy environments. A pivotal early proposal came in 1969 from researchers David W. Farmer and John Newhall, who conceptualized a where a circulating control signal—later formalized as a —granted transmission rights to nodes in sequence, initially termed the Newhall ring. This built on prior work in distributed systems and was extended by David Farber at the , through the NSF-funded Distributed Computer System (DCS) project starting in 1969. Funded with $250,000 annually from 1970, the DCS implemented a 2.5 Mbps -passing ring using twisted-pair wiring and 8-bit , becoming operational by late 1973 and stable by early 1974; it emphasized over network commercialization, influencing subsequent designs. In parallel, initiated research in the mid-1970s at its Zurich Research Laboratory, led by figures like Werner Bux and Hans Müller, drawing inspiration from academic efforts such as the Cambridge Ring (developed from 1974 at the , using slot passing akin to tokens for medium access). These prototypes addressed the performance unpredictability of Robert Metcalfe's 1973 Ethernet, which relied on CSMA/CD and suffered from collision-induced delays in office settings requiring reliable, communication. IBM's early experiments focused on scalable ring architectures for business environments, prioritizing bounded over Ethernet's statistical multiplexing.

Standardization Efforts

The standardization of token passing protocols was primarily driven by the working group, which formalized key specifications in the to enable interoperable local area networks (LANs). The IEEE 802.4 standard for Token Bus, ratified in September 1984 and published as ANSI/IEEE Std 802.4-1985, defined a token-passing method and physical layer specifications for broadband cable networks. This standard implemented a logical bus over a physical bus or , supporting deterministic suitable for applications. It was particularly influential in industrial settings, such as ' Manufacturing Automation Protocol (MAP), which adopted IEEE 802.4 for factory automation networks requiring reliable, prioritized communication. Following closely, the IEEE 802.5 standard for was initially ratified in 1985 as ANSI/IEEE Std 802.5-1985, with significant contributions from , which had prototyped the technology since the early . This standard specified a physical star topology with a logical ring configuration, operating at initial speeds of 4 Mbps and later expanded to 16 Mbps through IBM's commercial implementations and subsequent revisions. The standard underwent multiple updates, including revisions in 1995 and 1998 (IEEE Std 802.5-1998), to incorporate enhancements like dedicated token support and improved , ensuring compatibility with evolving requirements until the late 1990s. In parallel, the (FDDI), developed by the ANSI X3T9.5 committee in the mid-1980s and standardized as ANSI X3.166-1989, emerged as a high-speed derivative of token passing principles. FDDI provided 100 Mbps transmission over dual counter-rotating fiber-optic rings, adapting timed token passing from concepts for backbone networks while adding redundancy for . By the 2000s, however, token passing standards like IEEE 802.4 and 802.5 declined sharply due to Ethernet's () growing dominance, driven by lower costs, simpler , and faster gigabit advancements. As of 2025, these protocols persist in niche legacy systems, such as manufacturing environments requiring deterministic behavior, often through virtual token mechanisms integrated into modern Ethernet infrastructures.

Implementations

Token Ring Networks

Token Ring networks implement token passing in a logical ring topology, where data circulates unidirectionally among connected stations, ensuring controlled access to the medium. Physically, these networks employ a star-wired configuration using Multistation Access Units (MAUs) as central hubs to connect stations, forming a logical ring by relaying signals through internal ports while allowing for easier fault isolation and station management compared to a pure ring layout. MAUs can operate in active mode, using relays to actively pass signals and support features like automatic reconfiguration, or passive mode for simpler, non-amplified connections. Standard operating speeds were 4 Mbps and 16 Mbps, with later extensions to 100 Mbps, utilizing shielded twisted pair (STP) or unshielded twisted pair (UTP) cabling types such as Type 1 (STP for backbone), Type 2 (STP with integrated services), Type 3 (UTP for telephony integration), and Type 6 (flat patch cables). The IEEE 802.5 standard was maintained until 2009 but is now obsolete. Developed primarily by in the early 1980s, saw widespread deployment in corporate local area networks (LANs) during the late 1980s and , particularly for integrating with IBM's () in enterprise environments requiring reliable, deterministic performance. By 1990, IBM held a dominant position with approximately 58% in 4 Mbps adapters and over 92% in 16 Mbps adapters, reflecting its strong influence in business computing where 's structured access suited mainframe and system connectivity. Peak adoption occurred around 1990, with millions of adapters shipped annually, but declined sharply in the mid- as Ethernet's lower and faster evolution—driven by 10/100 Mbps advancements—overtook it, reducing to niche legacy use by the late . Key unique features of Token Ring networks include beaconing for fault detection, where a station detecting a serious issue, such as signal loss, transmits frames every 20 ms to alert neighbors and isolate the problem domain, enabling neighbor stations to perform diagnostics and purge the ring if needed. Ring wrapping provides redundancy by allowing the network to reconfigure around faults, such as by closing internal relays in to bypass failed segments or stations, maintaining connectivity in dual-ring extensions for higher . These networks support up to 250 stations per ring, limited by propagation delays and token circulation time, with cabling standards (Types 1–6) enabling flexible installations over distances up to 100 meters per lobe in configurations.

Token Bus Networks

Token Bus networks, defined by the IEEE 802.4 standard, utilize a physical bus or topology implemented with to create a logical for token passing among connected stations. Stations on the shared medium form a dynamic ordered list, organized by descending physical address order, which enables the token to circulate sequentially in a virtual ring manner without requiring a physical . This architecture supports broadband transmission at data rates of 5 Mbps or 10 Mbps, leveraging on the to separate control and data channels for reliable operation in noisy environments. The IEEE 802.4 standard was withdrawn in 2002. The protocol's design emphasizes predictable access in shared-medium scenarios, where stations transmit only upon receiving the token, thereby avoiding collisions through ordered token passing. Transmission occurs in time slots determined by the token hold time on the medium, allowing efficient use of the while accommodating dynamic insertion and removal to maintain the logical integrity. Token Bus networks can scale to support up to 1000 nodes, making them suitable for extensive deployments, and they integrate with Ethernet via bridges for interoperability in mixed environments. Deployment of Token Bus was concentrated in industrial and factory automation applications, notably through General Motors' Manufacturing Automation Protocol (MAP), which adopted IEEE 802.4 for its lower layers to enable real-time control in manufacturing settings. Its use in office environments was limited due to the installation complexity and cost of broadband coaxial wiring, which required specialized cabling and head-end equipment unlike simpler twisted-pair alternatives. By the 2000s, Token Bus had largely been phased out in favor of Ethernet-based solutions, though it persisted in niche industrial sectors like petroleum refining for legacy systems. Unlike token ring implementations, which rely on a physical ring for office-oriented wiring, Token Bus targeted broadband industrial use with its bus topology.

Protocol Details

Token and Frame Structures

In token passing protocols, the token serves as a small control frame that circulates among network stations to grant permission to transmit data, ensuring orderly access to the shared medium. The standard token format, as defined in IEEE 802.5 for Token Ring networks, consists of three bytes: a starting delimiter (SD), an access control (AC) byte, and an ending delimiter (ED). The SD is a 1-byte field containing the bit pattern "JK0JK0EE" (where J and K are non-data symbols in the differential Manchester encoding used for synchronization), which uniquely signals the beginning of the token to receivers. The AC byte, also 1 byte, includes three priority bits (PPP) for access level (ranging from 0 to 7), a token bit (T) set to 0 to indicate it is a token rather than a data frame, a monitor bit (M) set to 0 for normal circulation (used by the active monitor station to detect duplicates), and three reservation bits (RRR) that allow downstream stations to reserve the token at a specific priority level. The ED is a 1-byte field with the pattern "JK1JK1EE", where the intermediate frame bit (I) is set to 1 to indicate no continuation and the error detection bit (E) is 0 for a valid token, marking its end and aiding in error checking. These fields enable the token to circulate continuously in an idle ring, with a station seizing it by setting the T bit to 1 and appending data to form a frame, after which it is released or passed to the next station. Data frames in token passing protocols extend the token structure by inserting additional fields between the AC and ED to carry information, transforming the token into a larger frame for transmission. In IEEE 802.5 Token Ring, the data frame begins with the same 1-byte SD as the token, followed by the AC byte (with T set to 1 to denote a data frame). A 1-byte frame control (FC) field follows, consisting of two bits (FF) indicating the frame type (e.g., 00 for LLC data, 01 for MAC management) and six control bits specific to the type, such as routing information indicator for source routing. This is succeeded by a 6-byte destination address (DA) and 6-byte source address (SA), both using 48-bit MAC addresses (with universal or local scope indicated in the first bit). The information field carries the payload, up to 4464 bytes in standard implementations to support efficient ring operation at 16 Mbps, accommodating upper-layer data from the LLC sublayer. A 4-byte frame check sequence (FCS) provides error detection using a 32-bit cyclic redundancy check (CRC) polynomial over the FC through information fields. The frame concludes with the 1-byte ED (similar to the token's but with I=1 for non-intermediate frames) and a 1-byte frame status (FS) field, which duplicates two bits from the AC for error checking and includes an address-recognized (A) bit (set to 1 if the DA matches a receiver) and a frame-copied (C) bit (set to 1 if the frame is successfully copied by the destination), enabling sender acknowledgment without separate replies. Variations in token and frame structures exist across token passing standards to accommodate different physical topologies and arbitration needs. In IEEE 802.4 Token Bus, which operates over a physical bus or topology forming a logical , the is a specialized MAC frame rather than a minimal 3-byte structure, including a (at least 1 byte for bit ), 1-byte SD ("00001000" pattern), 6-byte DA (addressing the next station in the logical ring for passing), 6-byte SA (sender's address), 4-byte FCS for integrity, and 1-byte ED, with no data field to keep it concise for rapid circulation and bus via carrier sense multiple access with collision avoidance (CSMA/CA)-like mechanisms. Data frames in 802.4 follow a similar header but insert a 1-byte FC after the SD (indicating token, data, or control with embedded priority bits PPP for access control) and include a variable LLC data field up to approximately 8182 bytes (with 2-byte addresses) or 8174 bytes (with 6-byte addresses), plus the same FCS and ED, resulting in longer headers overall to support station insertion, neighbor discovery, and ring maintenance on the broadcast bus medium. These adaptations in 802.4 ensure reliable token passing in a non-point-to-point environment, contrasting with the fixed-ring simplicity of 802.5.

Access Control and Priority Mechanisms

In token passing protocols, access control is enforced through mechanisms that regulate how long a station may transmit and ensure orderly token circulation. A key component is the token holding timer (THT), which limits the maximum transmission duration for a station possessing the to prevent monopolization of the medium; this is typically set to 10 milliseconds in IEEE 802.5 implementations. During transmission, stations can reserve future token access by setting bits in the field of passing frames, enabling priority-based queuing where higher- requests are queued ahead of lower ones. In IEEE 802.5 , the active monitor—a designated responsible for —plays a critical role in token reinsertion by detecting lost tokens via timers tracking circulation and generating a new to restore access when necessary. In contrast, IEEE 802.4 Token Bus uses priority-specific THT values, with longer holding times for higher priorities (e.g., up to 50 ms for priority 6 at 10 Mbps), and is distributed through periodic neighbor notification frames and processes to dynamically update the logical . Priority mechanisms in token passing allow differentiation of traffic classes. In IEEE 802.5 , a 3-bit in the access control byte of token and structures defines eight levels (0 through 7), with higher values indicating greater urgency. When a station seizes the token, it may elevate its for transmission, but upon release, the token's is set to the maximum of its current level and any accumulated reservations, ensuring it is only captured by stations with equal or higher to maintain fairness within bands. For time-critical , preemptive reservations enable higher- stations to override lower ones by inserting their into the reservation of circulating , allowing them to claim the next available token of sufficient level. In IEEE 802.4 , are handled via 3 bits () in the control , supporting four levels (0, 2, 4, 6), with 6 being the highest for urgent ; stations by and request token capture at the appropriate level, with higher allowing longer THT and preempting lower ones during contention for control . Error recovery in token passing addresses disruptions like token loss through distributed detection and corrective actions. In IEEE 802.5 , token loss is detected via neighbor monitoring, where each tracks activity from its nearest active upstream neighbor (NAUN); prolonged inactivity signals potential loss, prompting the to intervene. In cases of severe faults, such as duplicate tokens or ring pollution, a purge station is elected through a contention process where stations transmit special claim frames with escalating parameters until one is selected to issue a , clearing erroneous frames. initialization follows this purge with a sequence managed by the active monitor: it transmits a purge frame to the , followed by the insertion of an initial with the monitor bit set, allowing stations to join and stabilize the . In IEEE 802.4 Token Bus, token loss is detected by individual station timers; if a station does not receive the token within its quiet time, it initiates a claim token using contention-based of claim frames on the bus, with the winner becoming the new token holder and rebuilding the logical ring via solicitation and response frames to notify neighbors and recover the sequence.

Advantages and Limitations

Key Benefits

Token passing protocols deliver deterministic by ensuring that each gains access to medium within a bounded time frame, specifically the maximum wait equal to the ring multiplied by the number of . This guaranteed access time prevents indefinite delays, making token passing particularly suitable for real-time applications such as and video , where consistent timing is essential. A primary advantage is the collision-free operation inherent in token passing, as only the holding the may transmit , thereby eliminating the need for backoff mechanisms and carrier sensing common in contention-based systems. Under heavy network loads, this results in near-100% efficiency, approaching the theoretical maximum utilization while providing fair allocation of resources among all stations regardless of their position in the . The protocol's predictability stems from its bounded characteristics, which ensure that delays remain and independent of traffic volume, supporting reliable operation in industrial control systems requiring precise timing for processes. Additionally, token passing scales effectively in ordered topologies, where the method inherently avoids hidden node problems that plague other configurations, maintaining performance as the number of nodes increases without requiring complex collision resolution. Priority mechanisms within token passing further enhance by allowing higher-priority traffic to seize the token more readily.

Primary Drawbacks

One significant drawback of token passing protocols is the vulnerability to single points of failure, which can halt the entire network. In networks, the logical structure means that the failure of a single station or link disrupts circulation, preventing all s from transmitting data until procedures are initiated. Similarly, loss—due to crashes, errors, or duplication—requires an active station to detect and regenerate the , introducing substantial overhead and potential downtime. In bus networks, while the physical bus offers some , distributed requires stations to detect failures and reconfigure the logical , which can lead to delays affecting network availability. Token passing also exhibits high under light loads, making it inefficient for environments with bursty or intermittent . Stations must wait for the token to complete a full circulation—averaging half the ring time in token rings—before attempting , even when the medium is otherwise idle. This overhead dominates under low utilization, where token passing consumes a disproportionate share of without carrying useful data, leading to poorer performance compared to contention-based alternatives in such scenarios. For token bus, the logical ring overlaid on the physical bus exacerbates this issue, as token rotation among nodes adds delay regardless of volume. The implementation complexity and associated costs further limit the practicality of token passing systems. Specialized hardware, such as network interface cards (NICs) with integrated token logic and timing mechanisms, is required to handle token detection, insertion, and , increasing deployment expenses over simpler bus-based solutions. Maintenance proves challenging, particularly in large , due to the need for ongoing monitoring of token malfunctions, frame duplication, and ring reconfiguration, which demands sophisticated protocols and skilled administration. Scalability is constrained, with typically limited to around 250 stations to maintain acceptable delays, and expansion beyond 1,000 nodes becomes impractical due to cumulative and management overhead. These factors contributed to the decline of token passing in favor of more flexible technologies like Ethernet.

Comparisons

Versus Contention-Based Protocols

Token passing protocols, such as those used in (IEEE 802.5) and Token Bus (IEEE 802.4) networks, employ a controlled access model where a special token circulates among stations, granting exclusive transmission rights to the holder and preventing simultaneous access by multiple nodes. In contrast, contention-based protocols like (Carrier Sense Multiple Access with Collision Detection), as implemented in Ethernet (), rely on a mechanism where stations listen before transmitting (carrier sense) and detect collisions if transmissions overlap, followed by a backoff and retry process to resolve conflicts. This fundamental difference ensures that token passing eliminates collisions entirely through its deterministic token circulation, providing bounded access times, while CSMA/CD inherently allows for potential collisions, introducing variability in medium access. Performance profiles of these protocols diverge notably based on load. Under low loads, where few stations are active, CSMA/CD exhibits lower average due to its immediate transmission attempts without the overhead of token passing, making it more responsive for sporadic traffic. However, token passing shines at high loads, maintaining stable throughput close to the 's capacity—often approaching 99% utilization—because the token ensures fair and orderly access without collision-related inefficiencies. CSMA/CD, conversely, suffers from increased collisions and backoff delays under heavy traffic, leading to throughput degradation and highly variable delays that can exceed worst-case bounds in token systems. For instance, in simulations with 100 stations and packet sizes of 2000 bits across data rates up to 24 Mbps, token passing demonstrates minimal deterioration in performance as load increases, while CSMA/CD's efficiency drops significantly. These characteristics influence their respective use cases. Token passing is particularly suited for predictable, time-critical environments such as flexible systems, where deterministic access guarantees low message delays for signals in industrial settings like factories. CSMA/CD, with its simplicity and lower under light loads, better serves general-purpose networks with bursty, non-real-time . Over time, Ethernet's contention-based approach prevailed in widespread adoption due to its cost-effective implementation and flexibility, despite the collision overhead, largely supplanting token passing in non-industrial applications.

Versus Other Controlled Access Methods

Token passing differs from polling in its decentralized approach, where stations pass a token in a logical or bus , eliminating the need for a central controller to query each sequentially. This reduces overhead associated with a master station's polling messages and walk times, enabling more efficient channel utilization under moderate loads, as no dedicated controller is required to manage access. However, token circulation introduces proportional to the network's delay and number of stations, potentially delaying access more than polling's bounded cycle times in small networks with low traffic. Compared to (TDMA) and reservation protocols, token passing provides dynamic slot allocation based on token possession, allowing stations to transmit variable-length without fixed time slots assigned in advance. This flexibility suits bursty patterns common in local area networks (LANs), where stations can hold the token longer to send multiple , achieving higher throughput than TDMA's rigid scheduling that wastes slots during idle periods. In contrast, TDMA offers predictable delays and better in wireless environments through fixed slots and guard times, but token passing's adaptability comes at the cost of overhead and vulnerability to token loss in scenarios. Other controlled access protocols like the distributed-queue dual-bus (DQDB) protocol, standardized as IEEE 802.6 for networks (MANs), introduce greater complexity through distributed s on dual counter-propagating buses, contrasting with the simplicity of single-token circulation in protocols like IEEE 802.5 . While basic token passing ensures fairness by guaranteeing in wired LANs, achieving equal sharing under uniform loads, DQDB's queue arbitration and balancing modules address head-of-line blocking but require additional signaling for slot requests, reducing overall simplicity and increasing overhead. DQDB provides superior balancing in MANs with asymmetric , allowing up to 153 Mbit/s aggregate throughput on dual 100 Mbit/s buses, whereas token passing excels in , low-latency access for symmetric wired environments but lacks inherent mechanisms for dynamic load balancing across directions.

References

  1. [1]
    IEEE/ANSI 802.4-1990 - IEEE SA
    This local area network (LAN) standard deals with all elements of the token-passing bus access method and its associated physical signaling and media ...
  2. [2]
    ANSI/IEEE 802.5-1998
    May 26, 1998 · Its purpose is to provide compatible interconnection of data processing equipment by means of a LAN using the token-passing ring access method.
  3. [3]
    The IBM token-ring network — A functional overview
    **Summary of IBM Token Ring and IEEE 802.5 Development:**
  4. [4]
    What is token ring and how does it work? - TechTarget
    Jul 8, 2021 · Learn all about token ring network technology, developed by IBM in the 1980s as a competitor to Ethernet for heavily trafficked data ...
  5. [5]
    [PDF] Chapter 5 Link Layer and LANs
    ❍ channel access if shared medium. ❍ “MAC” addresses used in frame headers ... Token passing: ❒ control token passed from one node to next.Missing: definition | Show results with:definition
  6. [6]
    Deterministic Medium Access Control algorithms
    Jan 19, 2016 · The proponents of deterministic MAC algorithms agreed on the basic principle of exchanging special frames called tokens between devices to ...Missing: passing | Show results with:passing
  7. [7]
    IEEE Standard for Local Area Networks: Token Ring Access Method ...
    Its purpose is to provide compatible interconnection of data processing equipment by means of a LAN using the token-passing ring access method. The frame ...
  8. [8]
  9. [9]
    Dissecting the Disruptor: What's so special about a ring buffer?
    Jun 22, 2011 · It's a ring (it's circular and wraps), and you use it as a buffer to pass stuff from one context (one thread) to another.
  10. [10]
    [PDF] Token Ring
    Proposed in 1969 and initially referred to as a. Newhall ring. Token ring :: a number of stations connected by transmission links in a ring topology.
  11. [11]
    8.6 Token Ring and David Farber, UC Irvine and the NSF 1969-1974
    A token ring network interconnects devices as node-to-node connections that close into a ring. Each node consists of a device, such as a computer, with a ...
  12. [12]
    The Emergence of Technological Order: 1983 - 1984
    In September 1984, the IEEE approved the token bus standard (802.4). It was automatically adopted by ISO as an OSI standard. On October 31, 1984, the ...Missing: ratified details
  13. [13]
    Milestones:Origin of the IEEE 802 Family of Networking Standards ...
    ANSI/IEEE Std 802.4-1985: IEEE Standards for Local Area Networks: Token-Passing Bus Access Method and Physical Layer Specifications. ANSI/IEEE Std 802.5-1985 ...
  14. [14]
    Token Bus (IEEE 802.4) - GeeksforGeeks
    Jul 11, 2025 · The Token Bus (IEEE 802.4) is a standard for deploying token rings in LANs over a virtual ring. The physical medium uses coaxial cables and has a bus or tree ...
  15. [15]
    Token bus network - Wikipedia
    IEEE 802.4​​ Token Bus was standardized by IEEE standard 802.4. It was mainly used for industrial applications. Token Bus was used by General Motors for their ...
  16. [16]
    [PDF] ethernet vs. token ring in the local area network - Martin Kenney
    These early improvements failed to seriously rival Token Ring as they did not address Ethernet's biggest problem, its problematic bus topology.
  17. [17]
    Token Ring IEEE 802.5 - IBM
    The token-ring architecture specifies the maximum value of the I-field in the data frame, which corresponds to the maximum size of the L-PDU.
  18. [18]
    [PDF] Planning for the fiber distributed data interface (FDDI)
    The Fiber Distributed Data Interface (FDDI) is a standard for a 1 00 Mbps fiber optic token ring, ... data rate, as well as the token ring packet service.
  19. [19]
    [PDF] Fiber Distributed Data Interface (FDDI) - filibeto.org
    Background. The Fiber Distributed Data Interface (FDDI) specifies a 100-Mbps token-passing, dual-ring LAN using fiber-optic cable. FDDI is frequently used ...
  20. [20]
    Enforcing the timing behavior of real-time stations in legacy bus ...
    Aug 6, 2025 · This paper proposes a virtual token-passing mechanism, which allows the coexistence of legacy industrial Ethernet devices with enhanced ...Missing: decline | Show results with:decline
  21. [21]
    Architecture and Design of a Reliable Token-Ring Network
    Jan 1, 1983 · Architecture, performance, transmission system, and wiring strategy of a token-ring local area network implemented at the IBM Zurich ...
  22. [22]
    [PDF] Networking Token ring - IBM
    This topic collection can help you plan, configure, manage, tune, and troubleshoot token-ring support for. TCP/IP and Systems Network Architecture (SNA).
  23. [23]
    [PDF] IBM Token-Ring Product Guide - Bitsavers.org
    IBM Token-Ring Network, which operates at up to a speed of 4 Mbps using protocols conforming with IEEE 802.5 and ECMA 89 standards. Significant reliability ...Missing: ratified | Show results with:ratified<|separator|>
  24. [24]
    Token Ring - an overview | ScienceDirect Topics
    Token Ring is a LAN protocol first developed by IBM in the 1970s and then standardized as IEEE 802.5 in 1985. ... In the mid-1980s, Token Ring ran at 4Mbps ...
  25. [25]
    Token Bus - an overview | ScienceDirect Topics
    The token bus protocol, standardized as IEEE 802.4, combines features of Ethernet and token ring protocols by organizing devices into a logical ring while ...
  26. [26]
    [PDF] Workshop on analytic and simulation modeling of IEEE 802.4 token ...
    Jul 31, 1985 · IEEE Standard 802.4 Token Passing Bus Access Method and Physical. Layer Specifications, Draft F, July 1984. [MAP85]. [IS084]. Manufacturing ...Missing: ratified | Show results with:ratified
  27. [27]
    [PDF] Ch t 12 apter 12 Token Bus Bus
    The MAC sublayer is responsible for the token passing operations. • The IEEE 802.4 defines four specifications for the physical layer: carrier band with ...
  28. [28]
    IEEE 802.4 Token Bus in Detail - Dr. Balvinder Taneja
    IEEE 802.4 Token Bus is a networking standard designed for environments where predictable communication times and collision-free transmission are essential.<|control11|><|separator|>
  29. [29]
    [PDF] IEEE 802.4 Token-Bus
    ❖ One of the most important issues of the token-bus protocol is to maintain the logical ring under the following possible conditions: ➢ Multiple Tokens.
  30. [30]
    [PDF] LLC and Bridges
    ❑ 802.4 Token Bus. ❑ 802.5 Token Ring. ❑ 802.6 DQDB. ❑ 802.7 Broadband ... ❑ Ethernet bridges learn source addresses. ❑ Spanning tree algorithm.
  31. [31]
    [PDF] IEEE 802 Standards for Local Area Networking
    Recently, IBM introduced a new version of the token-passing protocol called "Early Token Release." This new protocol is intended to make more efficient use of ...<|control11|><|separator|>
  32. [32]
  33. [33]
    Life begins at 40: how Ethernet's future could be even more golden ...
    The arrival of switched Ethernet, full duplex modes, and Fast Ethernet further increased the lead over Token Ring and Token Bus. Although 100Mbit/sec versions ...Missing: decline legacy industrial
  34. [34]
    Retrospective on Development of Radio and Wire Data ...
    Mar 4, 2006 · IEEE 802.4 Token Bus​​ This token bus LAN used CATV type coax with duplex up and down radio-frequency links. The frequency division duplex used 6 ...Missing: broadband | Show results with:broadband
  35. [35]
    Troubleshooting Token Ring [Support] - Cisco Systems
    Token Ring and IEEE 802.5 are the primary examples of token-passing networks. ... The access control byte contains the priority and reservation fields, as ...
  36. [36]
    Token Ring/IEEE 802.5
    The Token Ring network was originally developed by IBM in the 1970s. It is still IBM's primary local-area network (LAN) technology, and is second only to ...
  37. [37]
    How Token Ring Works - Network Cabling Help
    The ring polling allows all machines on the network to find out who is participating in the ring and to learn the address of their Nearest Active Upstream ...
  38. [38]
    US5280478A - No-owner frame and multiple token removal ...
    A ring purging station for a token-ring network is disclosed. The station ... stations which are elected as ring purging stations after the ring is initialized.
  39. [39]
    Performance comparison of token ring protocols for hard-real-time ...
    In this paper, we study two token ring protocols, the priority driven protocol and the timed token protocol, for their suitability for hard real-time systems.Missing: passing latency
  40. [40]
    How do the physical topologies of IEEE 802.3 and IEEE 802.5 ...
    Dec 11, 2024 · Deterministic Performance: The token-passing mechanism provides predictable performance because each device has guaranteed access to the network ...
  41. [41]
    [PDF] Chapter 6 Medium Access Control Protocols and Local Area Networks
    ○ Efficiency of 100% is not possible. Xt. tM. MX. MX. Efficiency. /1. 1. ′. +. = ′. +. = Single frame per poll. Page 59. Application: Token-Passing Rings. Free ...
  42. [42]
    What Is a Token Ring? Understanding Local Area Networks | Coursera
    Oct 25, 2024 · Token ring employs a token-passing protocol, ensuring a more controlled and reliable data transmission. Types of token rings. Token rings ...
  43. [43]
    Understanding Token Ring In Computer Networks - Unstop
    Q1. What is Token Ring? Token Ring is a networking protocol that uses a token-passing mechanism to control access in a logical ring topology.Token Ring Topology · Token Passing In Computer... · Frequently Asked Questions...
  44. [44]
    [PDF] 13 Embedded Communication Protocols
    Oct 12, 2015 · Token holder = OWNER; only the owner may transmit. • Master/slave polling is a special form where token is passed by master and returned to ...
  45. [45]
    [PDF] Module
    Token passing LANs use a token that circulates, allowing only one station to transmit at a time, eliminating collisions. The token is passed in a round robin ...<|control11|><|separator|>
  46. [46]
    [PDF] Token Ring
    Token Ring uses a ring topology where a token circulates, allowing only one station to transmit at a time. Only the station with the token can transmit.
  47. [47]
    Comparative dynamic performance of token passing and CSMA/CD ...
    This paper presents a methodology for investigating the dynamic performance of a local area network (LAN) using token passing and carrier-sense multiple ...
  48. [48]
    [PDF] 15.565 Integrating Information Systems
    -- TOKEN RING LEAST EFFECTED BY LOAD. -- CSMA/CD DETERIORATES UNDER HEAVY LOAD. -- TOKEN RING HAS MORE DELAY UNDER LIGHT LOAD. 14. Page 15. CSMA/CD BUS VS.Missing: low | Show results with:low
  49. [49]
    IMAGENET: a high speed local area network - IEEE Xplore
    Bus [1] has demonstrated that as throughput increases the performance of the token is superior to that of CSMA/CD. This is because as traffic intensity ...Missing: load | Show results with:load
  50. [50]
    [PDF] A Comparison of FDDI Asynchronous Mode - and DQDB Queue ...
    Abstract-The performance of the FDDI token ring and. IEEE 802.6 DQDB protocols are compared using discrete event simulation models.
  51. [51]
    [PDF] Comparing Ucn with Fddi and Dqdb Using a Realistic Workload Model
    The fundamental difference between the two systems is that in the token ring there is a single token that controls the access to the entire bandwidth, whereas ...<|control11|><|separator|>