9 research outputs found

    Spacelab system analysis: The modified free access protocol: An access protocol for communication systems with periodic and Poisson traffic

    Get PDF
    The protocol definition and terminal hardware for the modified free access protocol, a communications protocol similar to Ethernet, are developed. A MFA protocol simulator and a CSMA/CD math model are also developed. The protocol is tailored to communication systems where the total traffic may be divided into scheduled traffic and Poisson traffic. The scheduled traffic should occur on a periodic basis but may occur after a given event such as a request for data from a large number of stations. The Poisson traffic will include alarms and other random traffic. The purpose of the protocol is to guarantee that scheduled packets will be delivered without collision. This is required in many control and data collection systems. The protocol uses standard Ethernet hardware and software requiring minimum modifications to an existing system. The modification to the protocol only affects the Ethernet transmission privileges and does not effect the Ethernet receiver

    Investigation of the consumer electronics bus

    Get PDF
    The objectives of this dissertation are to investigate the performance of the Consumer Electronics Bus (CEBus) and to develop a theoretical formulation of the Carrier Sense Multiple Access with Contention Detection and Contention Resolution (CSMA/CDCR) with three priority classes protocol utilized by the CEBus A new priority channel assigned multiple access with embedded priority resolution (PAMA/PR) theoretical model is formulated. It incorporates the main features of the CEBus with three priority classes. The analytical results for throughput and delay obtained by this formulation were compared to simulation experiments. A close agreement has been found thus validated both theory and simulation models Moreover, the performance of the CEBus implemented with two physical media, the power line (PL) and twisted pair (TP) communication lines, was investigated by measuring message and channel throughputs and mean packet and message delays. The router was modeled as a node which can handle three priority levels simultaneously. Satisfactory performance was obtained. Finally, a gateway joining the CEBus to ISDN was designed and its perfor-mance was evaluated. This gateway provides access to ISDN-based services to the CEBus. The ISDN and CEBus system network architecture, gateway wiring, and data and signaling interface between the CEBus and ISDN were designed, analyzed, and discussed. Again, satisfactory performance was found

    Protocols for voice/data integration in a CDMA packet radio network.

    Get PDF
    Thesis (Ph.D.)-University of Natal, Durban, 1999.Wireless cellular communications is witnessing a rapid growth in, and demand for, improved technology and range of information types and services. Future third generation cellular networks are expected to provide mobile users with ubiquitous wireless access to a global backbone architecture that carries a wide variety of electronic services. This thesis examines the topic of multiple access protocols and models suitable for modem third-generation wireless networks. The major part of this thesis is based on a proposed Medium Access Control (MAC) protocol for a Code Division Multiple Access (CDMA) data packet radio network, as CDMA technology is proving to be a promising and attractive approach for spectrally efficient, economical and high quality digital communications wireless networks. The proposed MAC policy considers a novel dual CDMA threshold model based on the Multiple Access Interference (MAl) capacity of the system. This protocol is then extended to accommodate a mixed voice/data traffic network in which variable length data messages share a common CDMA channel with voice users, and where the voice activity factor of human speech is exploited to improve the data network performance. For the protocol evaluation, the expected voice call blocking probability, expected data throughput and expected data message delay are considered, for both a perfect channel and a correlated Rayleigh fading channel. In particular, it is shown that a significant performance enhancement can be made over existing admission policies through the implementation of a novel, dynamic, load-dependent blocking threshold in conjunction with a fixed CDMA multiple access threshold that is based on the maximum acceptable level of MAl

    Performance analysis of priority queueing systems in discrete time

    Get PDF
    The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes

    Journal of Telecommunications and Information Technology, 2008, nr 1

    Get PDF
    kwartalni

    Discrete-time queueing models with priorities

    Get PDF
    This PhD-dissertation contains analyses of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the system contents and packet delays of both classes. The results are applicable in heterogeneous telecommunication networks, when delay-sensitive traffic gets transmission priority over best-effort traffic. Our results predict the influence of priority scheduling on the QoS (Quality-of-Service) of the different types of traffic

    PROCEEDING SEMINAR NASIONAL RISET TEKNOLOGI INFORMASI 2013

    Get PDF
    corecore