| R. M. Grow. A timed-token protocol for local area networks. Electro 82, TokenAccessProtocols, (Paper 17/3), May 1982. |
.... PROcess FIeld BUS (PROFIBUS) 1] is one of the most popular fieldbuses, and has been granted the status of a real international standard by CENELEC [2] The PROFIBUS medium access control (MAC) protocol is based on a token passing procedure (simplified version of the time d token protocol [3]) used by masters to grant the bus access to each one of them, and a masterslave procedure used by masters to communicate with slaves. Similar to other timed token MAC protocols, such as IEEE802.4 [4] or FDDI [5] PROFIBUS supports two categories of messages: high priority (or synchronous) and low ....
Grow, R., "A Timed Token Protocol for Local Area Networks", in Proceedings of Electro'82, Token Access Protocols, Paper 17/3, 1982.
.... traffic and multiple asynchronous traffic classes of different priority levels [2] The objective of the timedtoken service discipline is to bound the token rotation time (the time between successive arrivals of the token at any particular station) so as to ensure timely service of all stations [13]. The requirements of synchronous traffic are satisfied by allocating a portion of the total ring bandwidth to each station, to be used by that station upon each arrival of the token for the transmission of synchronous data. After a portion of the total ring bandwidth has been allocated to ....
R. M. Grow. A Timed Token Protocol for local area networks. In Proc. Electro '82, 1982.
.... the High Speed Data Bus (HSDB) the High Speed Ring Bus (HSRB) and the Survivable Adaptable Fiber Optic Enbedded Networks (SAFENET) which are used as backbone networks in many embedded real time applications [1] The important concept of the timed token protocol was first proposed by Grow in [2] where the framework (the basic idea) of the timed token protocol, adaptable to either a physical or a logical ring, was described. Ulm [3] then studied the protocol proposed by Grow and its performance characteristics. The timing properties of the timed token protocol were first formally analyzed ....
....Various overheads possibly involved have been identified by Johnson and Sevcik in [4, 5] For example, protocol dependent overheads include token capture delay, token transmission delay, etc. 3 3 Timed Token MAC Protocol The basic ideas of the timed token protocol were first presented by Grow [2]. With this protocol [20] messages are distinguished into two types: synchronous and asynchronous. Synchronous messages, such as voice or video traffic, are periodic messages which come to the system at regular intervals and have delivery time constraints. Asynchronous messages are nonperiodic ....
[Article contains additional citation context not shown here]
R. Grow, "A Timed Token Protocol for Local Area Networks," in Proc. Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....example and the root cause behind has been indicated. The development of an optimal SBA scheme remains a challenge. Keywords The timed token protocol, synchronous bandwidth allocation, FDDI networks, real time communication. I. Introduction T HE timed token medium access control (MAC) protocol [1], 2] is suitable for real time communication due to its special timing property of bounded medium access time. With this protocol, messages are grouped into two types: synchronous and asynchronous. Synchronous messages arrive at regular intervals and have delivery time constraints. Asynchronous ....
R.M. Grow, \A timed token protocol for local area networks," in Proc. Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....due to its high data transmission rate but also because of its special timing property of bounded token rotation time, which is necessary for hard real time communication. FDDI uses, at its medium access control (MAC) layer, the timed token protocol whose basic ideas were first presented by Grow [1]. With this protocol [2] messages are distinguished into two types: synchronous and asynchronous. Synchronous messages, such as voice or video traffic, are periodic messages which come to the system at regular intervals and have delivery time constraints. Asynchronous messages are nonperiodic ....
....to be free from any hardware or software failures. A special bit pattern called the token, which grants permission right to its holder to transmit among the contending nodes, rotates around the ring in a pre determined order. The message transmission is controlled by the timed token MAC protocol [1, 2]. The node holding the token transmits its messages for as long as the protocol allows then passes the token to its downstream neighbor 1 . Let i denote the sum of various overheads possibly involved between the token s arrival at node i and the token s immediately subsequent arrival at node ....
R. Grow, "A timed token protocol for local area networks, " in Proc. Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....schedulability test, synchronous messages, FDDI networks, real time communication. I. Introduction T HIS letter presents a complemental note on testing the schedulability of real time traffic in a timed token network (e.g. FDDI[2] where the timed token medium access control (MAC) protocol[1], 2] is used. The timed token MAC protocol is capable of supporting real time communication due to its inherent timing property of bounded medium access time. With this protocol, messages are grouped into two types: synchronous and asynchronous. Synchronous messages arrive at regular intervals ....
....lead to an economical solution. The physical migration of nodes and the associated re cabling can be costly and should be avoided if possible. Also, in many circumstances, the physical migration of nodes can be avoided using the notion of logical ring inherent with the original idea of timed token [1]. Nodes in a timed token network can form a logical ring in spite of whether the formed ring is a physical ring network (e.g. FDDI) or not (e.g. IEEE 802.4 token bus) The sequence of nodes arranged in such a logical ring can be arbitrary but must be predefined. Bearing the logical ring in mind ....
R.M. Grow, "A timed token protocol for local area networks," in Proc. Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....scheme presented in this paper. 2 Controlling the access to the network The media access control layer responsible for arbitration and collision control in a network plays a key role for the predictable message transfer. We can distinguish between mechanims which statically avoid collisions [2, 4, 6, 7] and collision resolution mechanisms. It has to be noted that static collision avoidance schemes need complete off line resolution of conflicting temporal requirements. The most popular protocol based on collision resolution is the CSMA CD (Carrier Sense Multiple Access Collision Detection) ....
R.M. Grow: " A timed token protocol for local area networks", in: Proc. of Electro/82, Token Access Protocols, 1982
....of FDDI Under Overload 5.1 Introduction Fiber Distributed Data Interface (FDDI) is a high speed Metropolitan Area Network operating at 100 Mbps using optical fiber as the transmission medium. The Medium Access Control (MAC) protocol for FDDI is based on a timed token rotation protocol [22]. The basic protocol has been enhanced to accommodate both synchronous and asynchronous traffic, with asynchronous traffic classified into eight priority classes [61] The FDDI MAC protocol has been the subject of numerous performance studies. Sevcik and Johnson [64] showed that the maximum cycle ....
R. M. Grow. A timed-token protocol for local area networks. In Proceedings of the Electro '82, Token Access Protocols, 1982.
....for some applications if n or THT is large. For example, for voice traffic and real time applications, this interval may be limited to the 10 20 ms range. Using the token access method severely limits the number of stations on the rings. The timed token access method, invented by Grow [2], solves this problem by ensuring that all stations on the ring agree to a target token rotation time and limit their transmissions to meet this target as much as possible. There are two modes of transmission: synchronous and asynchronous. Time constrained applications such as voice and ....
R. M. Grow, "A timed-token protocol for local area networks," Presented at Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....National Standard Institute (ANSI) 2,17] The standard uses optical fibers as the transmission medium and allows rings with default maximum size of 1000 physical connections with a total fiber path length of up to 200 kilometers 1 . FDDI uses a timed token media access protocol proposed by Grow [4]. A number of papers have recently been published to analyze the performance and to prove certain operational characteristics of FDDI [1,9,18,20] Optical fiber is known to have a lower bit error rate (BER) than the traditional copper wire. FDDI specifications require each fiber segment to have a ....
R. M. Grow, "A Timed Token Protocol for Local Area Networks," Presented at Electro '82, Token Access Protocols, Paper 17/3, May 1982.
....MAC is based both on a token passing procedure, which is used by the master stations to communicate with each other, and on a master slave procedure, which is used by master stations to communicate with the slave stations. The Profibus token passing procedure uses a simplified timed token protocol [Gro82]. One important parameter to consider in this kind of protocols is the Target Token Rotation Time (T TR ) which is set at the network initialisation time and stands for all network nodes. Whenever a station receives the token, it may transmit its high priority messages, for a time period no more ....
....Low priority message cycles this includes poll list and GAP list message cycles ENDWHILE; Pass the token to station (k 1) modulo k) 3. BASIC CONCEPTS OF THE PROFIBUS MAC TIMING ANALYSIS 3.1. Previous Relevant Work The basic idea of the Timed Token protocol was presented by Grow [Gro82]. In this protocol, messages are distinguished in two types. One concerns the synchronous messages, which are periodic messages that come to the system at regular intervals and have delivery time constraints. The other concerns asynchronous messages, which are non periodic messages that have no ....
[Article contains additional citation context not shown here]
Grow, R.M., "A Timed Token Protocol for Local Area Networks", Proceedings of Electro'82, Token Access Protocols, Paper 17/3, (May 1982).
....property of bounding time between any two consecutive visits of the token to a node. However due to the fact that the worst case token rotation time is twice that of the average token rotation time only at most one half of the bandwidth of a FDDI ring can be used to transmit synchronous messages [7]. In a recent paper [13] Shin and Zheng proposed a modification to the FDDI MAC protocol, called FDDI M. It is shown through simulations that FDDI M doubles a ring s ability of supporting synchronous traffic while at the same time achieves a higher throughput for asynchronous traffic than the ....
R. M. Grow. A timed token protocol for local area networks. Proc. Electro '82, (17/3), 1992.
....mechanism is based on a token passing procedure, used by master stations to grant the bus access to each one of them, and a master slave procedure used by master stations to communicate with slave stations. The PROFIBUS token passing procedure uses a simplified version of the timed token protocol [9]. One of the PROFIBUS MAC main functions is the control of the token cycle time, which will now be briefly explained. After receiving the token, the measurement of the token rotation time begins. This measurement expires at the next token arrival and results in the real token rotation time (T RR ....
Grow, R.: "A Timed Token Protocol for Local Area Networks", Proceedings of Electro'82, May 1982, Token Access Protocols, Paper 17/3..
....This protocol is implementable as an enhancement to existing TCP IP protocol suite and will work with off the shelf Ethernet hardware. Earlier work in the area of supporting synchronous or real time traffic on LANs, based on timed token protocols have been analytical in nature ( 2] 3] [8], 11] while other implementation efforts have required specialized hardware ( 1] 5] 7] 9] 10] In contrast, the proposed protocol can be fully implemented in software without requiring any modifications to existing Ethernet hardware. Also, RETHER addresses failure and reliability issues ....
Grow, R.M. A timed token protocol for local area networks. Proc. Electro/82, Token Access Protocols, May 1982.
....FIP, the determinism is guaranteed by a bus arbitrator, which controls periodic data transfers according to a static scanning table. The real time capabilities of FIP have been widely studied, and [11,12] are just some examples. PROFIBUS adopts a simplified version of the timed token (TT) protocol [13]. Despite some differences to the TT protocol used in FDDI or IEEE802.4, for which real time characterisation have been extensively addressed ( 14,15] are just some examples) it is still possible to guarantee real time behaviour with PROFIBUS networks [16,17] CAN is itself a priority bus, which ....
Grow, R.: "A Timed Token Protocol for Local Area Networks", Proceedings of Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....mechanism is based on a token passing procedure used by master stations to grant the bus access to each one of them, and a master slave procedure used by master stations to communicate with slave stations. The Profibus token passing procedure uses a simplified version of the Timed Token protocol [9]. These MAC mechanisms are implemented at the layer 2 of the OSI reference model, which, in Profibus, is called Fieldbus Data Link (FDL) In addition to controlling the bus access and the token cycle time (a feature that will be later explained in section II.B) the FDL is also responsible for ....
....parameter to constrain the low priority traffic. The following stream notation will then be used: a b a b a b Dh Ch Sh , 1) a a a nlp Cl Sl = 2) B. Real Time Characteristics of the Profibus Protocol Compared to the Timed Token protocol [9], the main difference of the Profibus token passing consists in the absence of synchronous bandwidth allocation (H i ) In the Timed Token protocol this is a relevant station parameter, since it specifies the amount of time a station has to transfer its real time traffic. In Profibus, if a master ....
R. M. Grow, "A Timed Token Protocol for Local Area Networks", in Proceedings of Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....PROFIBUS networks. This section presents an improved version of the analysis proposed in [8,9] which assumes the worst case scenario for the token cycle time. In section 3 we survey some results on the evaluation of token cycle time in several network protocols based on the timed token protocol [10], as it is the case of IEEE802.4 [11] and FDDI [12] As PROFIBUS uses a simplified version of the timed token protocol, we discuss the applicability of the surveyed results to the PROFIBUS case. In section 4, we derive an accurate result for the PROFIBUS token cycle time, which is the basis ....
....low priority (including cyclic, non cyclic and management) messages. In the proposed methodology, real time traffic is supported using PROFIBUS high priority messages. The PROFIBUS medium access control (MAC) protocol is, as previously mentioned, a simplified version of the timed token protocol [10], and behaves as is below explained. After receiving the token, the measurement of the token rotation time begins. This measurement expires at the next token arrival and results in the real token rotation time (T RR ) which is a measure of the token cycle time. A target token rotation time (T TR ....
[Article contains additional citation context not shown here]
Grow, R.: "A Timed Token Protocol for Local Area Networks", Proceedings of Electro'82, Token Access Protocols, Paper 17/3, May 1982.
....towards the use of fieldbus networks to support DCCS applications lies in the evaluation of its temporal behaviour. Several studies have been performed, such as those on CAN [7,8] on FIP [9,10] and on P NET [11,12] Contrarily to other networks [15 16] which are based in the timed token protocol [17], in PROFIBUS it is not possible to define, in each master, its synchronous bandwidth allocation 1 . Thus, it is not possible to use analysis similar to those proposed in [18 19] In [13] the authors take two different approaches to guarantee real time traffic using PROFIBUS networks. One of the ....
Grow, R.: "A Timed Token Protocol for Local Area Networks". Proceedings of Electro'82, May 1982, Token Access Protocols, Paper 17/3.
....is different from the ISO 8802 5 token ring protocol. 5] The FDDI MAC protocol uses a timed token protocol, whereby MACs on the token ring cooperatively attempt to maintain a specified token rotation time by using the observed network load to regulate the amount of time a MAC may transmit. [6] The specified token rotation time is called the target token rotation time (TTRT) The TTRT is negotiated using a distributed algorithm called the claim token algorithm, which is invoked each time the ring is initialized. The FDDI MAC protocol also includes fault detection and recovery functions ....
R. M. Grow, "A Timed Token Protocol for Local Area Networks," Electro/82, Token Access Protocols (17/3) (May 1982).
....using the token access method severely restricts the number of stations on a ring. The timed token access method, invented by Grow, solves this problem by ensuring that all stations on a ring agree to a target token rotation time (TTRT) and limit their transmissions to meet this target. [4] There are two modes of transmission: synchronous Digital Technical Journal Vol. 3 No. 3 Summer 1991 1 Performance Analysis of FDDI and asynchronous. Time constrained applications such as voice and real time traffic use the synchronous mode. Traffic that does not have time constraints uses the ....
R. Grow, "A Timed-token Protocol for Local Area Networks," Proceedings of the IEEE Electro '82 Conference on Token Access Protocols, Paper 17/3, Boston, MA (May 1982).
....which supports two classes of traffic: synchronous and asynchronous. The synchronous traffic is assigned guaranteed bandwidth so that real time applications are allowed; whereas the asynchronous traffic is controlled by the station timers. Such a timed token scheme was first suggested by Grow [12]. Ulm [26] analyzed the influence of different parameters on the utilization of the ring. Johnson [14] and Sevcik and Johnson [22] proved cycle time properties in the FDDI token ring protocol. Although the ability to deal with synchronous traffic is one of the particularities of the FDDI protocol, ....
R. M. Grow, "A timed token protocol for local area networks", presented at Electro 82, Token Access Protocols (17/3), May 1982.
.... standards, including the Fiber Distributed Data Interface (FDDI) 1] the High Speed Data Bus and the High Speed Ring Bus (HSDB HSRB) 10, 72] and the Survivable Adaptable Fiber Optic Embedded Network (SAFENET) 16, 31, 48] A more detailed description of the timed token protocol can be found in [1, 17, 28, 55, 56]. System Model The target system for Class 2 application is a distributed system that implements the timed token protocol, e.g. a token ring. The system consists of a set of nodes of possibly different types connected by a multi access channel, e.g. ring. We will refer to this type of model as ....
R. M. Grow, "A timed token protocol for local area networks," in Proceedings Electro 82, May 1982.
....case performance is studied in [20] The implementation of the optimal rate monotonic policy on the IEEE 802.5 token ring was first proposed by Strosnider, Lehoczky and Sha [22] However, no analysis of such a scheme has been reported so far. The timed token protocol was first proposed by Grow in [6]. This protocol has the important property of bounded access time for the nodes on the ring. The real time performance of this protocol has been recently studied in [2, 3, 4, 9] It was shown that with a proper choice of protocol parameters, this protocol can guarantee a synchronous traffic of up ....
R. M. Grow, "A timed token protocol for local area networks", Proc. Electro/82, Token Access Protocols, May 1982.
....under an Engineering Excellence Grant. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing official positions or policies of NSF, ONR, or Texas A M University. Our discussion will concentrate on the timed token protocol [2]. The timed token protocol is a token passing protocol in which each node gets a guaranteed share of the network bandwidth. Partly because of this property, the timed token protocol has been incorporated into a number of network standards. These standards include the IEEE 802.4 token bus standard ....
....control of medium access. In the timed token protocol, access to the communication medium is controlled by a token that is passed among the nodes in a circular fashion. Messages in the timed token protocol are segregated into two separate classes: the synchronous class and the asynchronous class [2]. Synchronous messages are given a guaranteed share of the network bandwidth, and are used for real time communication. That is, they may be associated with deadline constraints. We will focus on meeting the deadlines of synchronous messages. The idea behind the timed token protocol is to control ....
R. M. Grow. A timed token protocol for local area networks. In Proceedings Electro/82, Token Access Protocols, May 1982.
....handle real time traffic is becoming increasingly important. The fiber distributed data interface (FDDI) 3] is an ANSI standard for a 100 Mbit s fiber optic token ring designed to support both real time synchronous traffic and conventional asynchronous traffic. FDDI uses the timed token protocol [5] to regulate access to the channel. This protocol employs a timing mechanism to ensure a bounded access delay for every node in the network [16] The high bandwidth supported by the fiber optic medium, and the guaranteed response time provided by the timed token protocol, make the FDDI standard an ....
R. M. Grow. A timed token protocol for local area networks. In Proceedings Electro/82, Token Access Protocols, May 1982.
.... Fair Queueing (FQ) 10] Virtual Clock (VC) 46] Delay Earliest Due Date (D EDD) 14] Jitter Earliest Due Date (J EDD) 42] Minimum Laxity First (MLF) 28] Rate Controlled Static Priority queuing (RCSP) 44] Rate Based Framed Round Robin (FRR) 35, 22] Stop and Go (S G) 15] Timed Token (TT) [18] Table 3.1: Real time scheduling algorithms. diverse messages. Priority based algorithms require the scheduler to maintain a sorted priority queue, which for most priority assignments is expensive and may not be feasible in a high speed switch. The RCSP algorithm also requires at each output port ....
....2w i . The FRR and S G schedulers can be modified to achieve these same properties, but they require global clock synchronization to do so. Our BWRR algorithm achieves these properties with no clock synchronization and no explicit flow control messages. Timed Token The timed token (TT) algorithm [18] was originally introduced as the medium access control mechanism for the FDDI local area network. However, the TT algorithm can also be used to provide a type of round robin service to message streams in an packet switch. The main difference between the two network architectures is that in the ....
[Article contains additional citation context not shown here]
R. M. Grow. A timed-token protocol for local area networks. Electro 82, Token Access Protocols, (Paper 17/3), May 1982.
....presented in Section 5. The paper concludes with Section 6. 2 Timed Token MAC Protocol For completeness, a brief overview of the timed token medium access control (MAC) protocol is presented in this section. A more detailed description of the timed token protocol and or of FDDI can be found in [1,7,13,18,19]. The stations in the network are connected to form a logical ring. A special bit pattern, called the token, rotates around the ring to signify the right to transmit. The timed token protocol regulates possession of the token and thus access to the transmission medium. The protocol supports two ....
R. M. Grow, "A timed token protocol for local area networks," in Proceedings Electro 82, May 1982.
....can be found in [14] 18] 19] These are window protocols which assume a slotted time axis. Implementation of this would again require hardware support, in particular global synchronized clocks. A lot of work has been done in the area of timed token protocols since it was first proposed by Grow [13] in 1982. Protocols for guaranteeing synchronous deadlines based on timed token protocols can be found in [5] 8] 16] 17] These protocols assume an underlying token bus MAC protocol. Our work, however, is the software implementation of such a protocol over commodity network hardware, with ....
Grow, R.M. A timed token protocol for local area networks. Proc. Electro/82, Token Access Protocols, May 1982.
....some important issues related to guarantees of synchronous message deadlines. A guaranteed message will always be transmitted before its deadline (unless a network fault occurs) We address the issue of guaranteeing message deadlines with the timed token medium access control (MAC) protocol [18]. This protocol is suitable for real time applications not only because of its use in high bandwidth networks but also due to the fact that it possesses the important property of bounded access time which is necessary for real time communications. The timed token protocol has been incorporated ....
....of the timed token protocol and the theory of hard real time scheduling and communication. 2.1 Timed token MAC protocol Since the early 1980 s, extensive research has been done on the timed token protocol and its use in FDDI networks. The timed token MAC protocol was first proposed by Grow [18]. The papers by Ross [48, 49, 50] Iyer and Joshi [23, 24] and others [39, 57, 58] provided comprehensive discussions on the timed token protocol and its use in the FDDI. Ulm [66] discussed the protocol performance with respect to parameters such as the channel capacity, the network cable length, ....
R. M. Grow, "A timed token protocol for local area networks," Proc. Electro/82, Token Access Protocols, May 1982.
....guaranteed by a bus arbitrator, which, for periodic traffic, controls data transfers according a static scanning table. The real time capabilities of FIP have been extensively studied (Pedro and Burns, 1997, Raja et al. 1995) PROFIBUS adopts a simplified version of the timed token (TT) protocol (Grow, 1982). Despite some differences to the TT protocol used in FDDI or 2 In both centralised and decentralised computer controlled architectures all the control algorithms are implemented in the single computer system. Contrarily, in a distributed computer controlled architecture the tasks of the control ....
Grow, R. 1982. A Timed Token Protocol for Local Area Networks. Proceedings of Electro'82, Token Access Protocols, Paper 17/3.
....length of the delay. In contrast, an asynchronous event triggered approach cannot predetermine when messages will be generated, thereby precluding preplanned transmissions. To regulate the transmission of messages, such an approach often uses a token based protocol such as the Timed Token Protocol [3, 7], or the Totem Protocol [2, 8] which we analyze here. Such protocols typically depend on acknowledgment and retransmission mechanisms to overcome communication faults. The disadvantage of such protocols for real time systems is that they introduce two sources of uncertainty, the delay until the ....
....for complex systems in which the dynamics of the system are not well understood a priori. The Timed Token Protocol, described in [7] is a token passing protocol that is used in the FDDI token ring and in the IEEE 902.4 token bus. The basic idea of the Timed Token Protocol was presented by Grow [3] and studied by Ulm [13] The performance of the Timed Token Protocol has been investigated by a number of researchers, including [1, 4, 10, 12, 14] The Timed Token Protocol differs from the Totem Protocol in that the Timed Token Protocol is oriented toward point to point movement of data rather ....
R. M. Grow, "A timed-token protocol for local area networks," Proceedings Electro/82 Token Access Protocols, Electronic Conventions, Inc., El Segundo, CA, Paper 17/3, May 1982.
....issues related to guarantees of synchronous message deadlines, i.e. no matter what happens (unless there is a network fault) the messages will be transmitted before their deadlines. We address the issue of guaranteeing message deadlines with the timed token medium access control (MAC) protocol [15]. This protocol is suitable for real time applications not only because of its use in high bandwidth networks but also due to the fact that it has the important property of bounded access time which is necessary for real time communications. The timed token protocol has been incorporated into many ....
....6 we will study several allocation schemes and derive their Worst Case Achievable Utilizations. Section 7 contains the concluding remarks and suggestions for future work. 2 Previous Relevant Work Extensive research has been done on the timed token protocol since it was first proposed by Grow [15] in 1982. Introductory tutorials on this protocol and its use in networking standards can be found in the papers by Ross [43, 44] Iyer and Joshi [20, 21] and others [34, 51, 52] Some important characteristics and architectural design considerations of FDDI token ring networks are discussed in ....
R. M. Grow, "A timed token protocol for local area networks," Proc. Electro/82, Token Access Protocols, May 1982.
....In particular, we enhance the FDDI architecture in order to improve its fault tolerance capability. Furthermore, we develop a scheduling methodology to ensure the satisfaction of message time constraints. This work complements previous work on the design of real time communication networks [1, 6, 7, 8, 9, 12, 13, 14, 19, 21, 23, 24, 25, 26]. For a recent comprehensive survey, the reader is referred to [17] 2 FBRN: An Enhanced FDDI Architecture We have designed an enhanced network architecture called FDDI based reconfigurable network (FBRN) 11] An FBRN uses multiple FDDI trunk rings to connect network stations. Specifically, n ....
R. M. Grow, "A Timed Token Protocol for Local Area Networks," Proc. Electro/82, Token Access Protocols, May 1982.
....without hardware support. We found a token passing protocol similar to the IEEE 802.4 token bus protocol, to be best suited to meet our goals. CHAPTER 2. RELATED WORK 13 2.2. 1 Token Passing Protocols A lot of work has been done in the area of token protocols since it was first proposed by Grow [Gro82] in 1982. The idea of token passing is also used in IEEE 802.4 Token Bus [80285a] IEEE 802.5 Token Ring [80285b] and FDDI [FDD87] standards. In [CCG93] Cheng et al. propose an enhanced token bus protocol, for transmission of time constrained multimedia data. In traditional token passing schemes, the ....
R.M. Grow. A timed token protocol for local area networks. Proc. Electro/82, Token Access Protocols, May 1982.
....Report 92 038 1 Introduction Timed token medium access control protocol has been incorporated into many network standards, including FDDI, HSDB HSRB and SAFENET. Many embedded real time applications use them as backbone networks. The basic idea of the timed token protocol was presented by Grow [3] and then studied by Ulm [9] considering only two classes: synchronous and asynchronous messages. When a network is initialized, the stations decide the value of a target token rotation time (TTRT) Moreover, the maximum time a station is allowed to transmit synchronous messages (i.e. synchronous ....
R. M. Grow, "A timed token protocol for local area networks," Proc. Electro/82, Token Access Protocols, May 1982.
.... ring environment has been investigated in [14, 35] while the average case performance is studied in [26] Implementation of the rate monotonic algorithm on an IEEE 802.5 token ring was first proposed by Strosnider, Lehoczky, and Sha [30] The timed token protocol was first proposed by Grow in [7]. Sevcik and Johnson [23] formally demonstrated that this protocol ensures a bounded access time for all stations on the ring. The issue of guaranteeing the deadlines of synchronous real time messages with this protocol has been addressed recently in [2, 3, 4] The average breakdown utilization ....
R. M. Grow. "A timed token protocol for local area networks". Proc. of Electro /82, Token Access Protocols, May 1982.
.... on top of a wormhole routing network include polling systems such as token ring, FDDI [24] and Hyper Token Ring (HTR) 5, 4, 15] FDDI and HTR support Constant Bit Rate (CBR) and Variable Bit Rate (VBR) by controlling the amount of traffic flow at each node via a timer controlled token scheme [10, 26]. To support quality of service requirements, a set of timers at each station is used to limit the amount of information transmitted. Details on the specifics of the timer scheme may be found in [28] for FDDI and [15] for HTR. The delay bounds provided by this mechanism are related to one of the ....
R.M. Grow. A Timed-Token Protocol for Local Area Networks. In Proceedings Electro '82, Paper 17/3, May 1982.
.... ring environment has been investigated in [14, 33] while the average case performance is studied in [25] Implementation of the rate monotonic algorithm on an IEEE 802.5 token ring was first proposed by Strosnider, Lehoczky, and Sha [29] The timed token protocol was first proposed by Grow in [7]. Sevcik and Johnson [22] formally demonstrated that this protocol ensures a bounded access time for all stations on the ring. The issue of guaranteeing the deadlines of synchronous real time messages with this protocol has been addressed recently in [2 4] The average breakdown utilization ....
R. M. Grow. "A Timed Token Protocol for Local Area Networks." Proc. of Electro/82, Token Access Protocols, May 1982.
.... Interface(FDDI) IEEE 802.4, the High Speed Data Bus and the High Speed Ring Bus (HSDB HSRB) and the Survivable Adaptable Fibre Optic Enbedded Networks (SAFENET) which are used as backbone networks in many embedded real time applications[3] FDDI uses the timed token protocol proposed by Grow[6]. With this protocol, messages are distinguished into two types: synchronous messages and asynchronous messages. Synchronous messages, such as sampled digitised voice and video data, are periodic messages which arrive at regular intervals and have delivery time constraints. Asynchronous messages ....
R.M. Grow, "A Timed Token Protocol for Local Area Networks", Proc. Electro'82, Token Access Protocols, Paper 17/3 (May 1982).
No context found.
R. M. Grow. A timed-token protocol for local area networks. Electro 82, TokenAccessProtocols, (Paper 17/3), May 1982.
No context found.
Gro82. Grow, R.M., "A Timed Token Protocol for Local Area Networks", Proc. Electro'82, Token Access Protocols, Paper 17/3 (May 1982).
No context found.
Gro82. Grow, R.M., "A Timed Token Protocol for Local Area Networks", Proc. Electro'82, Token Access Protocols, Paper 17/3 (May 1982).
No context found.
R. M. Grow, "A timed token protocol for local area networks", presented at Electro 82, Token Access Protocols (17/3), May 1982.
No context found.
R. M. Grow, "A timed token protocol for local area networks", presented at Electro 82, Token Access Protocols (17/3), May 1982.
No context found.
R. M. Grow, "A timed-token protocol for local area networks," in Proceedings Electro '82, Token Access Protocols, May 1982, pp. 17/3:1--7.
No context found.
R.M. Grow. Timed token protocol for local area networks, July 1984. Patent US4459588.
No context found.
R.M. Grow. A timed-token protocol for local area networks. In Proceedings Electro '82, Token Access Protocols, pages 17/3:1--7, May 1982.
No context found.
Gro82. Grow, R.M., "A Timed Token Protocol for Local Area Networks", Proc. Electro'82, Token Access Protocols, Paper 17/3 (May 1982).
No context found.
Gro82. Grow, R.M., "A Timed Token Protocol for Local Area Networks", Proc. Electro'82, Token Access Protocols, Paper 17/3 (May 1982).
No context found.
Gro82. Grow, R.M., "A Timed Token Protocol for Local Area Networks", Proc. Electro'82, Token Access Protocols, Paper 17/3 (May 1982).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC