<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://rs-485.com/index.php?action=history&amp;feed=atom&amp;title=Token_passing</id>
	<title>Token passing - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://rs-485.com/index.php?action=history&amp;feed=atom&amp;title=Token_passing"/>
	<link rel="alternate" type="text/html" href="https://rs-485.com/index.php?title=Token_passing&amp;action=history"/>
	<updated>2026-05-04T12:36:35Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.42.3</generator>
	<entry>
		<id>https://rs-485.com/index.php?title=Token_passing&amp;diff=1732&amp;oldid=prev</id>
		<title>RS-485: Imported from Wikipedia (overwrite)</title>
		<link rel="alternate" type="text/html" href="https://rs-485.com/index.php?title=Token_passing&amp;diff=1732&amp;oldid=prev"/>
		<updated>2026-05-03T14:17:35Z</updated>

		<summary type="html">&lt;p&gt;Imported from Wikipedia (overwrite)&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Channel access method}}&lt;br /&gt;
On a [[local area network]], &amp;#039;&amp;#039;&amp;#039;token passing&amp;#039;&amp;#039;&amp;#039; is a [[channel access method]] where a packet called a &amp;#039;&amp;#039;token&amp;#039;&amp;#039; is passed between nodes to authorize that node to communicate.&amp;lt;ref&amp;gt;{{cite web|last1=Sheldon|first1=Tom|title=Token and Token-Passing Access Methods|url=http://www.linktionary.com/t/token_access.html|website=Linktionary|accessdate=8 July 2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite book|last1=Littlejohn Shinder|first1=Debra|title=Computer Networking Essentials|date=2001|publisher=Cisco Press|isbn=978-1587130380|page=123|url=https://books.google.com/books?id=ZMizSUW7XF4C&amp;amp;q=token+passing&amp;amp;pg=PA123|accessdate=8 July 2017}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite web|last1=Savage|first1=Stefan|title=Lecture 6: Media Access Control|url=https://cseweb.ucsd.edu/classes/fa11/cse123-a/123f11_Lec6.pdf|website=Computer Science and Engineering|publisher=UC San Diego|accessdate=8 July 2017}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Channel access method==&lt;br /&gt;
In contrast to [[polling (computer science)|polling]] access methods, there is no pre-defined &amp;quot;master&amp;quot; node.&amp;lt;ref&amp;gt;{{cite web|last1=DiNicolo|first1=Dan|title=Essential Network Concepts Part 3|url=http://www.securitypronews.com/essential-network-concepts-part-3-2004-03|website=Security Pro News|accessdate=9 July 2017|archive-date=16 July 2013|archive-url=https://web.archive.org/web/20130716120055/http://www.securitypronews.com/essential-network-concepts-part-3-2004-03|url-status=dead}}&amp;lt;/ref&amp;gt; The most well-known examples are [[Token Ring|IBM Token Ring]] and [[ARCNET]], but there were a range of others, including [[FDDI]] (Fiber Distributed Data Interface), which was popular in the early to mid 1990s.&lt;br /&gt;
&lt;br /&gt;
Token passing schemes degrade deterministically under load, which is a key reason why they were popular for industrial control LANs such as [[Manufacturing Automation Protocol]] (MAP).&amp;lt;ref&amp;gt;{{cite web|title=Token Bus (IEEE 802.4)|url=https://www.technologyuk.net/telecommunications/networks/token-bus.shtml|website=www.technologyuk.net|accessdate=8 July 2017|archive-date=4 July 2019|archive-url=https://web.archive.org/web/20190704173558/http://www.technologyuk.net/telecommunications/networks/token-bus.shtml|url-status=dead}}&amp;lt;/ref&amp;gt; The advantage over [[contention_(telecommunications)|contention]] based channel access (such as the [[CSMA/CD]] of early Ethernet), is that collisions are eliminated, and that the channel [[bandwidth (computing)|bandwidth]] can be fully utilized without idle time when demand is heavy.&amp;lt;ref&amp;gt;{{cite book|last1=Hura|first1=Gurdeep|title=Data and Computer Communications: Networking and Internetworking|date=2001|publisher=CRC Press|isbn=978-0849309281|page=327|url=https://books.google.com/books?id=c0z7d9S82EsC&amp;amp;q=token+deterministic&amp;amp;pg=PA327}}&amp;lt;/ref&amp;gt; The disadvantage is that even when demand is light, a station wishing to transmit must wait for the token, increasing [[latency (engineering)|latency]].&lt;br /&gt;
&lt;br /&gt;
Some types of token passing schemes do not need to explicitly send a token between systems because the process of &amp;quot;passing the token&amp;quot; is implicit. An example is the channel access method used during &amp;quot;Contention Free Time Slots&amp;quot; in the [[ITU-T]] [[G.hn]] standard for high-speed [[local area network]]ing using existing home wires (power lines, phone lines and coaxial cable).{{cn|date=July 2017}}&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Cambridge Ring (computer network)|Cambridge Ring]]&lt;br /&gt;
*[[HP-IL]] (HP Interface Loop)&lt;br /&gt;
*[[Ring network]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Token Passing}}&lt;br /&gt;
[[Category:Channel access methods]]&lt;/div&gt;</summary>
		<author><name>RS-485</name></author>
	</entry>
</feed>