Ros86. Ross, F.E., "FDDI - A Tutorial", IEEE Communication Magazine 24(5), pp. 10-17 (May 1986).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....reference IEEECS Log Number 100950.0. R point network via routers or bridges. Hence, a multiaccess bus will be used in our scheme as the interconnecting hardware. Several schemes for real time communication on general multiaccess networks (not limited to bus networks) have been proposed [15] [21], 24] or implemented on the token ring and the token bus, but they generally belong to the best effort category. They do not reserve resources according to the user specified traffic characteristics and performance requirements, and have no explicit admission control. Thus, even if each node ....

F.E. Ross, "FDDI---A Tutorial," IEEE Comm. Magazine, vol. 24, pp. 1017, May 1986.

....both greater than zero) On the other hand, when the token is late on its arrival at node i (i.e. LC i = 1) the LC i is reset to zero. In this case, node i is still permitted to transmit synchronous frames for a time no more than H i but no asynchronous frames are allowed to transmit. Refer to [2, 20, 21, 22] for a more detailed description of the timed token protocol. Due to inevitable overheads involved, the total bandwidth available for synchronous message transmission during one complete traversal of the token around the ring is less than the actual token rotation time. Because forms part of the ....

F. Ross, "FDDI - A Tutorial," IEEE Communication Magazine, vol. 24, pp. 10--17, May 1986. 33

....total capacity between node i and 8 node j) This means, since the topology is bidirectional, that for every link we have 30 units of capacity in each direction. Figure 1: The three node topology The set S 1 (U) has three matrices, T 1(1;2) T 1(1;3) and T 1(2;3) related to the OD pairs [1,2], 1,3] and [2,3] respectively. The matrices are: T 1(1;2) 2 6 4 0 1(1 U) 2(1 Gamma r 1(1;2) 1(1 U) 0 3(1 Gamma r 1(1;2) 2(1 Gamma r 1(1;2) 3(1 Gamma r 1(1;2) 0 3 7 5 where r 1(1;2) U=5. T 1(1;3) 2 6 4 0 1(1 Gamma r 1(1;3) 2(1 U) 1(1 Gamma r 1(1;3) 0 ....

....capacity between node i and 8 node j) This means, since the topology is bidirectional, that for every link we have 30 units of capacity in each direction. Figure 1: The three node topology The set S 1 (U) has three matrices, T 1(1;2) T 1(1;3) and T 1(2;3) related to the OD pairs [1,2] [1,3] and [2,3] respectively. The matrices are: T 1(1;2) 2 6 4 0 1(1 U) 2(1 Gamma r 1(1;2) 1(1 U) 0 3(1 Gamma r 1(1;2) 2(1 Gamma r 1(1;2) 3(1 Gamma r 1(1;2) 0 3 7 5 where r 1(1;2) U=5. T 1(1;3) 2 6 4 0 1(1 Gamma r 1(1;3) 2(1 U) 1(1 Gamma r 1(1;3) 0 3(1 ....

[Article contains additional citation context not shown here]

F. E. Ross, "FDDI-a Tutorial", IEEE Comm. Mag., May 1986, vol.24, no.5, pp. 10-17

....be separated. Network dependent QoS These N QoS parameters are located in the two lowest levels of the ISO OSI Basic Reference Model [3] and define capabilities of the network, its topology, and features of the medium itself. Examples may be found in I. 356 [6] for ATM networks or for FDDI in [7]. 1 This reference cites a survey on QoS in German. 4 performancerelated (quantitative) functionalityrelated (qualitative) protocolrelevant systemrelevant otherwise networkdependent communicationspecific applicationoriented QoS x y z Figure 1: Orthogonal Classification of QoS ....

F. Ross, "FDDI --- A Tutorial," IEEE Communications Magazine, vol. 24, pp. 10--17, May 1986.

....bit compared to 10 Gamma5 errors per bit for copper wire) In addition to this, the technology evolved to the point where optical fiber become more cost effective than alternative copper links for high speed transmissions. Networks that use optical fiber as a communication media such as FDDI [Ros86] and DQDB [DQD88] are already in use today. However, these are traditional network architectures where fiber merely replaces copper wire. The total capacity in these networks is time shared among many users and each user operates at the aggregate bit rate at which the network operates. The total ....

F. E. Ross. "FDDI---A Tutorial." IEEE Communications Magazine, 24(5):10--17, May 1986.

....traffic (voice, video and image) as well as the more traditional computer data traffic (interactive, file transfers etc. The first generation of FOLANs has evolved from previous LAN designs (bus, ring, star, etc. The most important examples are the Fiber Distributed Data Interface (FDDI)[Ross86] and the Distributed Queue Dual Bus (DQDB) Moll88] First generation architectures, however, cannot be operated at speeds of more than a few hundred Mbps, because each station s interface represents an electrooptical bottleneck that limits network speed. Thus, though adequate for the near term, ....

F.E. Ross, "FDDI---A tutorial", IEEE Communications Magazine, May 1986.

.... 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 ....

F. E. Ross, "FDDI -- A tutorial," IEEE Communications Magazine, vol. 24, pp. 46--61, May 1986.

....before releasing the token to its downstream neighbor. Messages from its asynchronous load are transmitted only if time permits. The protocol is formally described in Section 2. The Fiber Distributed Data Interface (FDDI) network is a 100 Mbits sec token ring that supports this protocol [1,13,18,19]. The main advantage of this protocol is that each station is guaranteed a certain average bandwidth as well as a bounded access time to the transmission medium. These two properties are very important for applications like digitized audio video communication and distributed real time control ....

....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 ....

F. E. Ross, "FDDI -- A tutorial," IEEE Communications Magazine, vol. 24, no. 5, pp. 10--17, May 1986.

....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, and the number of stations. ....

F. E. Ross, "FDDI---A tutorial," IEEE Commun. Mag., Vol. 24, No. 5, pp. 10-17, 1986.

....experience any delay introduced by buffering. Observe that each node operates in a completely asynchronous and distributed fashion, a property we preserve in our protocol. In addition, several concurrent transmissions can take place independently, a feature not found in several other architectures [3, 16, 17]. Below, we describe our full duplex architecture and the method of transmitting control information. 2.1 Full duplex Operation In our full duplex version of the basic buffer insertion ring (see [4] for further details) each node possesses two transmitters and two receivers. Figure 1 shows the ....

....each of the two rings. The two rings, which we call the I ring (or Inner ring) and the O ring (or Outer ring) for simplicity, carry messages in opposite directions. We note the following distinguishing features of the system: ffl Both rings are used at all times, in contrast to some other designs [17] where a second ring is used as as backup ring. ffl The routing is assumed to be fixed, shortest hop routing; thus, each node transmits to half the nodes on the I ring and the other half using the O ring. For example, in figure 1, node 4 uses the I ring to transmit to nodes 3; 2; 1 and 9, whereas ....

F.E.Ross, "FDDI - A Tutorial", IEEE Communications Magazine, May 1986.

....option among those that will define the various grades of service most observers believe will be offered by the networks of the future. Such guarantees will have to be provided not only by local area networks, where solutions like the FDDI ring and its protocols are already being developed [Ross86], but also by wide area networks: the need for multimedia conferencing services is only one of the many examples that can be invoked to demonstrate the validity of this statement. The available options for providing real time services in a wide area context are circuit switching, fast packet ....

F. E. Ross, "FDDI - A tutorial", IEEE Communic. Magaz., vol. 24, n. 5, pp. 10-17, May 1986.

.... i ) and then apply rate monotonic scheduling policies [10] It should be noted that our choice of a rate monotonic or deadline monotonic 3 capacity based scheduling algorithms are used in different types of scheduler such as in Fair Share Scheduler [5] and in FDDI s capacity allocation scheme [12]. However, our motivation was not fairness rather to reduce the response time of aperiodic activities while we guarantee the periodic tasks deadlines are met. paradigm instead of a dynamic scheduling policy, like earliest deadline is that it is extremely difficult to utilize such deadline ....

F. Ross, "FDDI - A Tutorial", IEEE Communication Magazine, May, 1986.

....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 [3, 12, 13, 16, 18, 22, 27, 33, 38, 56, 58] The various fault recovery and ring management procedures of the FDDI are outlined in ....

F. E. Ross, "FDDI---A tutorial," IEEE Commun. Mag., Vol. 24, No. 5, pp. 10-17, 1986.

.... environment includes an FDDI ring connected to an ATM network (XUNET II) On an FDDI ring, as long as a node does not generate more synchronous traffic than its reserved synchronous bandwidth, delay can be bounded, because media access delay is bounded by twice the Target Token Rotation Time [Ro86]. Such behavior allows the reservation of bandwidth in order to guarantee performance. The ATM network will participate as a subnet which provides guarantees. 2. Protocol Design 2.1. Design Goals Our real time delivery system has been designed with multiple goals in mind. First, ....

F. Ross, "FDDI - A Tutorial," IEEE Communications Magazine 24(5), May 1986, pp. 10-17.

....LAN. Most adapters have only one physical address, which can be easily recognized. However, each station also accepts a number of multicast addresses and the adapter must quickly decide whether to receive a multicast frame. In some token ring networks, e.g. Fiber Distributed Data Interface (FDDI) [6,22], stations need to set an address recognized flag in the frame. For the smallest size frames this means that the address has to be recognized within 13 octets (1.04 s) This puts an upper bound on the time within which end stations have to recognize the multicast addresses they want to listen ....

F. E. Ross, "FDDI-A Tutorial," IEEE Communications Magazine, Vol. 24, No. 5, May 1986, pp. 10-17.

No context found.

Ros86. Ross, F.E., "FDDI - A Tutorial", IEEE Communication Magazine 24(5), pp. 10-17 (May 1986).

No context found.

Ros86. Ross, F.E., "FDDI - A Tutorial", IEEE Communication Magazine 24(5), pp. 10-17 (May 1986).

No context found.

Ross, F. (1986). FDDI--a tutorial (fibre distributed data interface), IEEE Commun. Mag., 24(5), 10-17.

No context found.

F. E. Ross, "FDDI-a Tutorial," IEEE Comm. Mag., May 1986, vol.24, no.5, pp. 10-17

No context found.

. F. E. Ross. "FDDI - A Tutorial". IEEE Communications Magazine 24, 5 (May 1986), 10-17.

No context found.

Ros86. Ross, F.E., "FDDI - A Tutorial", IEEE Communication Magazine 24(5), pp. 10-17 (May 1986).

No context found.

Ros86. Ross, F.E., "FDDI - A Tutorial", IEEE Communication Magazine 24(5), pp. 10-17 (May 1986).

No context found.

F. E. Ross, "FDDI---A tutorial," IEEE Commun. Mag., Vol. 24, No. 5, pp. 10-17, 1986.

No context found.

F. Ross. "FDDI - A tutorial". IEEE Communications Mag., vol 24, no 5, 1986.

No context found.

Ros86. Ross, F.E., "FDDI - A Tutorial", IEEE Communication Magazine 24(5), pp. 10-17 (May 1986).

First 50 documents

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