Performance analysis of FDDI network under frequent bidding requirements

A bidding scheme is described for the fibre distributed data interface (FDDI). An analysis is presented for the throughput performance of an FDDI network under the assumption of heavy load, which allows the target token rotation time (TTRT) to be bid for and adjusted frequently as and when the access time requirements of synchronous traffic change. The authors' results show that better throughput performance is achievable under the new bidding scheme. It is also observed that although re-bidding is desirable, escalating and uncontrolled bidding intensity may incur undue overheads that results in unacceptable throughput degradation.<>     

ISO 8802/5 token ring local-area networks

Token ring networks are the second most commonly used type of local-area network (LAN). The second version of the formal token ring multiple access mechanism, ISO 8802/5, was released in late 1995 and this rationalised many of the new developments, e.g. the 16 Mbit/s solutions. The latest innovations are the full duplex dedicated token ring and the development of a 100 Mbit/s high-speed token ring solution. To many people's surprise there is an extensive legacy of token ring installations and the latest innovations, such as token ring switching, are an attempt to maintain and support this significant market presence. Token ring is designed to provide high throughput under heavy loads (something which is normally impossible for Ethernet to sustain) but in most cases it is used in typical office environments where there is infrequent occurrence of heavy loads     

Buzz-Net: A Hybrid Token/Random Access LAN

Buzz-net is a local network supported by a pair of unidirectional buses to which stations are connected via passive interfaces. The access protocol is a hybrid which combines random access and virtual token features. More precisely, the network operates in random access mode at light load and virtual token mode at heavy load. Because of the virtual token implementation, Buzz-net retains high efficiency even at very high bus speeds. Efficiency at high speeds and bus unidirectionality make Buzz-net particularly suitable for fiber optics media. This paper describes the protocol, develops approximate analytic models for performance evaluation, and compares Buzz-net performance results to those of other unidirectional bus schemes.     

Mixed time-constrained and non-time-constrained communications inlocal area networks

It is well known that some time-token medium access protocols for local area networks (LANs) like the IEEE 802.4 token bus and the FDDI token ring can guarantee the medium access delay for time-constrained packets. However, a problem which has been largely overlooked is how these protocols can be made to provide a maximum throughput for nontime-constrained packets while guaranteeing the delay bound of time-constrained packets. The authors first show how the parameters of the IEEE 802.4 token bus and the FDDI token ring can be set to solve the above problem. Then, they design a new timer mechanism for the timed-token protocols which provides the highest guaranteed throughput of nontime-constrained packets among a set of medium access protocols called the token passing protocol, to which most of the existing non-contention LAN protocols belong. They present numerical examples to compare different protocols, all of which have shown the superiority of the proposed protocol to the others     

Modeling and performance analysis of a symmetric fast-circuitswitched robust-WDM LAN with the AR/LTP protocol

Robust wavelength division multiplexing (WDM) is a technique to implement WDM local area networks (LAN's) in the presence of laser wavelength drifts. A medium access control (MAC) protocol is used in conjunction with a wavelength-tracking receiver to tolerate the variations of transmission wavelengths. Among the proposed medium access schemes, the aperiodic reservation (AR) scheme with token-passing based control channel gives the best performance. An AR protocol with a lenient token passing policy (AR/LTP) is thus presented. An analytical model is developed to design Robust-WDM AR/LTP LAN's and predict their performance characteristics. The model can be used to evaluate the variation of waiting time and throughput for load and network parameters such as the arrival rate, number of nodes, number of channels and timing parameters. It also addresses the issues related to traffic loss, channel-blocking, token rotation time, network span, and the effect of device parameters     

The token grid network

An overwhelming majority of local and metropolitan area network products (LANs and MANs) are based upon linear topologies such as buses and rings. Such networks are economical for high speed operation since the station interfaces are simple and require very little transit buffering. However because of their linear structure, the total throughput is restricted by the transmission rate of the media access channels. In the paper, a token grid network is introduced where media access is performed over a two-dimensional mesh. In the resulting system, each station is two-connected and has the same transmission hardware and small station latency as in a dual token ring. In the token grid however, the total system throughput may be many factors larger than that which is possible in a dual token ring. In a large √N×√N network, the uniform load capacity is approximately √N/2 times that of an N station dual token ring. In addition, the token grid can take advantage of communities-of-interest amongst the stations. It is possible to implement the system in such a way as to achieve robust operation in the presence of station and link failures     

Setting target rotation times in an IEEE token bus network

The IEEE standard 802.4 token bus protocol requires each network station to implement a synchronous (highest priority) message class, and permits a station to implement three lower priority classes: urgent asynchronous, normal asynchronous, and time available. Each of the lower three priorities (called access classes) is assigned a target token rotation time that limits the amount of time that a station can use to service lower priority traffic. A formulation of the problem is presented in which messages are transmitted from an access class as long as network throughput remains below a user-specified threshold. Formulas are derived that transform this priority scheme, based on network throughput limits, into the proper target rotation time settings that the token bus protocol actually requires. The analytical model is compared with a computer simulation of the token bus protocol and shows close agreement     

Selection of token holding times in timed-token protocols

Minimum requirements for the high-priority token holding time (HPTHT) in a network using timed token access protocols (such as IEEE 802.4 and FDDI) are derived in order to ensure that the throughput of synchronous messages is no lower than the amount of traffic generated for that class. The minimal value is essential in order to avoid unbounded queue length for the synchronous class as well as to achieve high network responsiveness. The results have been obtained for synchronous messages generated according to a generic periodic pattern with no constraint for the shape and for the period of the pattern. The manner in which the theoretical results obtained can be used to tune the network performance is also shown     

Approximate analysis of asymmetric single-service prioritized tokenpassing systems

A LAN or MAN (local or metropolitan area network) using token passing to allow stations to access the transmission medium is studied. Ibe and Cheng (1989) recently presented an approximate derivation of message delays for an asymmetric single-service token passing with only one type of message. In the present work, this analysis is extended to an operation with nonpreemptive priority queuing. The number of message priority levels and the walktime vary from one station to another. Moreover, the assumed Poisson message arrival process and the message transmission time vary, not only from one station to another, but also from one class to another. The performance, as measured by the mean delay for any message class at any station, is derived. The simulation results show excellent agreement with the analytical results, even under heavy loading. The results confirm earlier findings that the performance at a station is influenced by its position relative to heavily loaded stations     

The IEEE token bus-A performance bound on GM MAP

All versions of the General Motors manufacturing automation protocol (GM MAP) specify that MAP's lower-layer services are to be provided by the IEEE 802.4 token bus. An understanding of 802.4 and its performance aspects is therefore a prerequisite to predicting the performance of MAP. It is shown how total bus capacity is divided among data throughput, token traffic, and propagation delays. The relative contributions of access delay and queuing delay to total message delivery time are discussed. The effects on message delivery times of message size and the number of active stations are also reported. As the token cycle time increases beyond the target rotation time for each of the asynchronous access classes, service to the lower-priority classes is curtailed; a formula that can be used to identity the offered load at which the transition from normal to curtailed service begins is presented     

Proof that Timing Requirements of the FDDI Token Ring Protocol are Satisfied

The fiber distributed data interface (FDDI) is an ANSI draft proposed standard for a 100 Mbit/s fiber-optic token ring. The FDDI timed token access protocol provides dynamic adjustment of the load offered to the ring, with the goal of maintaining a specified token rotation time and of providing a guaranteed upper bound on time between successive arrivals of the token at a station. FDDI also provides automatic recovery when errors occur. The bound on time between successive token arrivals is guaranteed only if the token rotates quickly enough to satisfy timer requirements in each station when all ring resources are functioning properly. Otherwise, recovery would be initiated unnecessarily. The purpose of this paper is to prove that FDDI timing requirements are satisfied, i.e., the token rotates quickly enough to prevent initiation of recovery unless there is failure of a physical resource or unless the network management entity within a station initiates the recovery process.     

A novel spread slotted Aloha system with channel load sensingprotocol

This paper presents a novel spread slotted Aloha system with channel load sensing protocol (CLSP). CLSP is an effective scheme to improve the throughput performance in spread unslotted Aloha systems. In spread slotted Aloha systems, however, it does not make sense to utilize CLSP because the slot size is usually the same as the packet size. The slot size of the proposed system is set less than the packet size, thereby enabling the authors to apply CLSP and improving the throughput performance. Another feature of the proposed system is that the system is not likely affected by the time difference between channel load sensing and timing of packet access, which they call the access timing delay. Throughput performance of the proposed system is evaluated in the presence of the access timing delay and a significant increase of the throughput is shown compared with that of spread unslotted Aloha with CLSP     

考虑慢启动影响的TCP吞吐量模型

TCP吞吐量模型的研究是网络协议研究的一个重要方面,同一些其它模型相比,Padhye提出的TCP吞吐量模型比较精确地描述了TCP吞吐量与往返时间、丢包率和超时时限的关系,但在丢包率很高的场合,Padhye模型误差较大,本文分析了高网络负荷下TCP传输的性能,提出了一个高网络负荷下TCP吞吐量的改进Padhye模型,实验表明,该模型在高网络负荷环境下更接近实际情况.     

Analysis of a probabilistic topology-unaware TDMA MAC policy for ad hoc networks

The design of an efficient medium access control (MAC) for ad hoc networks is challenging. Topology-unaware time-division multiple-access-based schemes, suitable for ad hoc networks, that guarantee a minimum throughput, have already been proposed. These schemes consider a deterministic policy for the utilization of the assigned scheduling time slots that never utilizes nonassigned slots although in such slots collision-free transmissions are possible even under heavy traffic conditions. A simple probabilistic policy, capable of utilizing the nonassigned slots according to an access probability, fixed for all users in the network, is introduced and analyzed here. The conditions under which the system throughput under the probabilistic policy is higher than that under the deterministic policy are derived analytically. Further analysis of the system throughput is shown to be difficult or impossible for the general case and certain approximations have been considered whose accuracy is also investigated. The approximate analysis determines the value for the access probability that maximizes the system throughput, as well as simplified lower and upper bounds that depend only on a topology density metric. Simulation results demonstrate the comparative advantage of the probabilistic policy over the deterministic policy and show that the approximate analysis successfully determines the range of values for the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic policy, but it is also close to the maximum.     

Performance Evaluation of Wireless Controller Area Network (WCAN) Using Token Frame Scheme

In this paper, a proposed new wireless protocol so-called wireless controller area network is introduced. WCAN is an adaptation of its wired cousin, controller area network protocol. The proposed WCAN uses token frame scheme in providing channel access to nodes in the system. This token frame method follows the example used in wireless token ring protocol which is a wireless network protocol that reduces the number of retransmissions as a result of collisions. This scheme based on CAN protocol allows nodes to share a common broadcast channel by taking turns in transmitting upon receiving the token frame that circulates around the network for a specified amount of time. The token frame allows nodes to access the network one at a time, giving ‘fair’ chance to all nodes instead of competing against one another. This method provides high throughput in a bounded latency environment. The proposed WCAN protocol has been developed and simulated by means of QualNet simulator. The performances of this proposed protocol are evaluated from the perspective of throughput, end-to-end delay and packet delivery ratio, and are compared against the IEEE 802.11 protocol. Simulation results show that the proposed WCAN outperforms IEEE 802.11 based protocol by 62.5 % in terms of throughput with increasing network size. Also, it shows an improvement of 6 % compared to IEEE 802.11 standard at a higher data interval rate.     

Performance of token schemes supporting delay-constrained prioritytraffic streams

A symmetric priority-based token network is considered. Messages are divided into two priority classes. High-priority messages are assumed to require tight delay constraints. As a result, each station is allowed to establish, at any time, at most a single real-time high-priority access concentration. High-priority messages are guaranteed access onto the channel within a prescribed limited period. In turn, regular priority messages are only served when the system determines, through the repetitive use of circulating tokens (as used by the IEEE 802.5 token-ring-type protocol), that no high-priority messages are currently waiting in the system. Two token schemes employing different service disciplines are used to provide network access. Exact and approximate mean delay formulas for both message classes are derived. Numerical results are then exhibited to illustrate the network performance under various traffic conditions     

Design and performance evaluation of a new medium access controlprotocol for local wireless data communications

This paper proposes a new medium access control protocol for wireless data communications in local area, called the reservation-based multiple access with variable frame length (RMAV). We design RMAV under the consideration that the population of wireless terminals and the system load frequently change and are almost unpredictable in wireless data communications. RMAV is based on the slot reservation scheme and adopts a frame structure with variable length. The frame length increases as the number of active terminals and/or the system load increases. We evaluate the performance of RMAV by analysis and computer simulation. Due to its adaptability to traffic patterns, RMAV offers short delay in light load conditions and high throughput in heavy load conditions     

A load awareness medium access control protocol for single‐hop wireless ad hoc networks

A contention‐based wireless ad hoc medium access control (MAC) protocol, such as carrier sense multiple access with collision avoidance (CSMA/CA), has excellent efficiency when the system is light loaded. The main drawback of such protocols is their inefficiency and unbounded delay when the system load is heavy. On the other hand, a contention‐free MAC protocol, such as token passing, has a better and fair throughput when the system is heavy loaded. The main drawback of such protocols is their inefficiency when only a small amount of users want to transmit. In this paper, we propose a new load awareness single‐hop wireless ad hoc MAC protocol (which is called the LA protocol) that exploits the benefits of both contention‐based and contention‐free protocols. A contention‐based MAC protocol is used when the system is light loaded and a contention‐free one is used otherwise. Our LA protocol, which operates in a distributed fashion and is fully compatible with the IEEE 802.11 wireless local area network (WLAN) standard, can switch smoothly between the contention‐based protocol and the contention‐free one. Simulation results show that our protocol indeed extracts the better part of two kinds of protocols. Copyright © 2006 John Wiley & Sons, Ltd.     

A token circulation scheme for code assignment and cooperative transmission scheduling in CDMA-based UAV ad hoc networks

Code division multiple access (CDMA) ad hoc networks have been considered a promising multiple-channel networking architecture for connecting tactical platforms in battle fields. In this paper we consider a network of a swarm of unmanned aerial vehicles (UAVs) that are used in a tactical surveillance mission. The UAVs are assumed to have multiuser detection capability and form a CDMA-based ad hoc network. A token circulation scheme is proposed to conduct functions required at the medium access control layer including detection of hidden/lost neighbors, code assignment and schedule-based cooperative transmission scheduling. In the proposed scheme, a token continuously circulates around the network based on the “receive-forward” module. Through circulation of the token, each UAV can detect its hidden and/or lost neighbors in near real-time, assign codes enabling the spatial reuse of code channels without incurring code collision, and schedule data transmissions in a cooperative and distributed manner. In addition, the proposed scheme is able to take advantage of multiuser detection functionality and allows for simultaneous transmissions from multiple transmitters to a same receiver. The performance of the proposed token circulation scheme is evaluated, both analytically and through simulations. It is shown that the latency of the token is at most linearly proportional to the network size, and the average delay of a data packet increases with either the packet generation rate or the network size. The results also show that the proposed token circulation scheme is suitable for large-scale CDMA-based UAV ad hoc networks with even heavy network traffic load.     

5G Mobile Virtual Reality Optimization Solution for Communication and Computing Integration

5G network is an inevitable trend in the development of mobile communications. Mobile cloud computing is a more promising technology for 5G networks. This paper proposes a hierarchical distributed cloud service network model, which is composed of three layers: “access cloud + distributed micro cloud + core cloud”. On the basis of access to the cloud, a distributed micro cloud system is deployed to migrate the service capabilities of the remote core cloud server to the local area. This paper proposes a task offloading assignment algorithm in a small cell cloud scenario. This algorithm establishes a SCC (Small Cell Cloud) based on the channel quality between small cells and the remaining available computing resources, and allocates the load to each small cell in the SCC according to the channel quality and the remaining available computing resources. Simulation results show that this solution can improve the utilization of wireless and computing resources in the small cell cloud computing scenario, and improve the user QoE (Quality of Experience). In order to make the system operate normally under heavy load, this paper proposes a feedback adaptive random access strategy based on the adaptive random access model. This can ensure that the throughput rate does not decrease under heavy load conditions, and at the same time, the average access delay of the existing system is reduced. When the arrival rate of user requests gradually increases, the throughput rate of RA-RACH access will continue to decrease due to collisions until it approaches below 0.1. In the state where the number of users is low and the load is lighter, both RA-RACH, AC-RACH, and FC-RACH have a higher access success rate. But as the load continues to increase, RA-RACH will quickly drop to 0.