2,784 research outputs found
Throughput analysis of the IEEE 802.4 token bus standard under heavy load
It has become clear in the last few years that there is a trend towards integrated digital services. Parallel to the development of public Integrated Services Digital Network (ISDN) is service integration in the local area (e.g., a campus, a building, an aircraft). The types of services to be integrated depend very much on the specific local environment. However, applications tend to generate data traffic belonging to one of two classes. According to IEEE 802.4 terminology, the first major class of traffic is termed synchronous, such as packetized voice and data generated from other applications with real-time constraints, and the second class is called asynchronous which includes most computer data traffic such as file transfer or facsimile. The IEEE 802.4 token bus protocol which was designed to support both synchronous and asynchronous traffic is examined. The protocol is basically a timer-controlled token bus access scheme. By a suitable choice of the design parameters, it can be shown that access delay is bounded for synchronous traffic. As well, the bandwidth allocated to asynchronous traffic can be controlled. A throughput analysis of the protocol under heavy load with constant channel occupation of synchronous traffic and constant token-passing times is presented
Recommended from our members
Analysis of a class of distributed queues with application
Recently we have developed a class of media access control algorithms for different types of Local Area Networks. A common feature of these LAN algorithms is that they represent various strategies by which the processors in the LAN can simulate the availability of a centralized packet transport facility, but whose service incorporates a particular type of change over time known as 'moving sever' overhead. First we describe the operation of moving server systems in general, for both First-Come - First-Served and Head-of-the-Line orders of service, together with an approach for their delay analysis in which we transform the moving server queueing system into a conventional queueing system having proportional waiting times. Then we describe how the various LAN algorithms may be obtained from the ideal moving server system, and how a significant component of their performance characteristics is determined by the performance characteristics of that ideal system. Finally, we evaluate the compatibility of such LAN algorithms with separable queueing network models of distributed systems by computing the interdeparture time distribution for M/M/1 in the presence of moving server overhead. Although it is not exponential, except in the limits of low server utilization or low overhead, the interdeparture time distribution is a weighted sum of exponential terms with a coefficient of variation not much smaller than unity. Thus, we conjecture that a service centre with moving server overhead could be used to represent one of these LAN algorithms in a product form queueing network model of a distributed system without introducing significant approximation errors
A study of topologies and protocols for fiber optic local area network
The emergence of new applications requiring high data traffic necessitates the development of high speed local area networks. Optical fiber is selected as the transmission medium due to its inherent advantages over other possible media and the dual optical bus architecture is shown to be the most suitable topology. Asynchronous access protocols, including token, random, hybrid random/token, and virtual token schemes, are developed and analyzed. Exact expressions for insertion delay and utilization at light and heavy load are derived, and intermediate load behavior is investigated by simulation. A new tokenless adaptive scheme whose control depends only on the detection of activity on the channel is shown to outperform round-robin schemes under uneven loads and multipacket traffic and to perform optimally at light load. An approximate solution to the queueing delay for an oscillating polling scheme under chaining is obtained and results are compared with simulation. Solutions to the problem of building systems with a large number of stations are presented, including maximization of the number of optical couplers, and the use of passive star/bus topologies, bridges and gateways
Performance analysis of the Fiber distributed data interface (FDDI) network using petri nets and SPNP software package
The main purpose of this thesis is to model a Fiber Distributed Data Interface (FDDI) Network using Petri Nets, and to analyze its performance with the help of the SPNP software package. The verification of a communication protocol, by modeling it as a discrete-event system using Petri Nets is a new approach.
The correlation between the throughput rate, voice and data throughput, and the parameters of the system, such as the network load and the network speed are investigated. An overview of the Fiber Distributed Data Interface is provided, along with its network protocol and the limitations of its operating parameters. A proposed Petri Net approach is then introduced. Finally, the effect of the network latency and load on the network\u27s overall performance is derived. A method for minimum delay is also proposed, and demonstrated with examples and computation results
Mapping Technological Trajectories as Patent Citation Networks. An application to Data Communication Standards
Technical systems, Technological trajectories, Patents, Network analysis, Data communications
Analysis of a queuing model for slotted ring networks
We study a multi-server multi-queue system which is intended to model a local area network with slotted ring protocol. Two special cases of the model are analysed and the results are used to motivate an approach to approximate mean queue lengths in the general model
Recommended from our members
On the management and performance of a class of local area networks
This dissertation is concerned with the management and performance issues of those register-insertion (R-I) ring type local area networks (LANs) which employ the message removal by destination node protocol. A typical example of such a network is the Distributed Loop Computer Network (DLCN). developed by Liu et al for fundamental research in the field of distributed computing. After considering the management issues of low cost R-J LANs. the research deals with performance analysis of the dynamically reconfigurable register-insertion (DRR) network.
In the first part of this research. a set of management functions is identified which are desirable and can be provided economically by a low cost LAN. A unique feature of the DLCN is that messages are removed from the network by the destination node. that is. messages do not travel whole of the loop. Therefore. it is not possible for a special control node to monitor the data traffic on the network without providing support functionality in each network access unit (NAU). The minimum functionality which must be provided in each NAU is identified in the thesis. A skeleton network was implemented to verify the feasibility of the proposed scheme. A paper describing the findings of this research was published and is reproduced as appendix A.
In the second part of this research. a new feature of the DLCN network is introduced. namely. that the performance of a network employing removal by destination protocol can be improved by reconfiguring the network in a particular way. A methodology to find the optimal configuration is developed and is shown. by worked examples. to lead to improved performance. The findings of this research are particularly applicable to the dynamically reconfigurable register-insertion (DRR) network. A paper dealing with the optimisation of a hypothetical fully connected DRR network has been accepted for publication. Another paper. which considers the general case of less than fully connected DRR networks. is to be published. Both papers are reproduced as append ices Band C.
Finally. a performance study of the ORR network is undertaken. As there seems to be no published attempt at formal analysis or simulation of a ORR network. a survey of literature dealing with performance study of the basic OLeN is performed. A simulation model of the DRR was then developed and implemented to verify the results arrived at in the previous section. Later. a queueing model of the DRR network. based on the work of Bux and Schlatter [7] is developed and analysed. Both simulation and analysis support the claim that the performance of a DRR network can be improved by adopting the configuration strategy developed in this thesis
Performance of buffer insertion LANs
This thesis presents an evaluation of the performance of some ring local area network protocols, specifically the buffer insertion ring and the token ring. Both dual and single versions of each are considered, and performance statistics are obtained by measurements on real networks, by mathematical analysis, and by computer simulation. New packet routing protocols for dual contrarotating buffer insertion and token ring networks are described and their performance is examined. It is found that, due to the bandwith reuse properties of the routing methods, maximum throughputs of 800% and 200% are achievable, for the dual buffer insertion ring and the dual token ring respectively
- …