Call admission control schemes: a review
HG Perros, KM Elsayed - IEEE communications Magazine, 1996 - ieeexplore.ieee.org
Call admission control schemes: A review - IEEE Communications Magazine Page 1
ABSTRACT Over the last few years, a substantial number of call admission control (CAC) …
ABSTRACT Over the last few years, a substantial number of call admission control (CAC) …
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms
C Hsin, M Liu - Proceedings of the 3rd international symposium on …, 2004 - dl.acm.org
This paper investigates the problem of providing network coverage using wireless sensors
that operate on low duty cycles (measured by the percentage time a sensor is on or active) …
that operate on low duty cycles (measured by the percentage time a sensor is on or active) …
SMC for discrete-time networked semi-Markovian switching systems with random DoS attacks and applications
This article concentrates on the discrete-time sliding mode control (DTSMC) problem for
uncertain networked semi-Markovian switching systems (S-MSSs) under random denial-of …
uncertain networked semi-Markovian switching systems (S-MSSs) under random denial-of …
Parallel implementation of Bouvka's minimum spanning tree algorithm
S Chung, A Condon - Proceedings of International Conference …, 1996 - ieeexplore.ieee.org
We study parallel algorithms for the minimum spanning tree problem, based on the
sequential algorithm of O. Boruvka (1926). The target architectures for our algorithm are …
sequential algorithm of O. Boruvka (1926). The target architectures for our algorithm are …
Randomly duty-cycled wireless sensor networks: Dynamics of coverage
C Hsin, M Liu - IEEE Transactions on Wireless …, 2006 - ieeexplore.ieee.org
This paper studies wireless sensor networks that operate in low duty cycles, measured by
the percentage of time a sensor is on or active. The dynamic change in topology as a result …
the percentage of time a sensor is on or active. The dynamic change in topology as a result …
[PDF][PDF] From Poisson processes to self-similarity: a survey of network traffic models
M Becchi - Washington University in St. Louis, Tech. Rep, 2008 - Citeseer
The paper provides a survey of network traffic models. It starts from the description of the
Poisson model, born in the context of telephony, and highlights the main reasons for its …
Poisson model, born in the context of telephony, and highlights the main reasons for its …
[HTML][HTML] Delay analysis of multiclass queues with correlated train arrivals and a hybrid priority/FIFO scheduling discipline
We analyze the delay experienced in a discrete-time priority queue with a train-arrival
process. An infinite user population is considered. Each user occasionally sends packets in …
process. An infinite user population is considered. Each user occasionally sends packets in …
Quality-of-service analysis for statistical multiplexing with Gaussian distributed and autoregressive input
G Hasslinger - Telecommunication Systems, 2001 - Springer
We investigate multiplexers in telecommunication systems with a workload process
developing equivalent to that of a service system with semi-Markovian input, which includes …
developing equivalent to that of a service system with semi-Markovian input, which includes …
[PDF][PDF] Dynamic resource allocation based on measured QoS
S Rampal, DS Reeves, Y Viniotis - 1996 - repository.lib.ncsu.edu
Most methods for guaranteeing quality of service (QoS) in packet-switched networks require
a static characterization of the user's tra c, and allocate resources accordingly. This process …
a static characterization of the user's tra c, and allocate resources accordingly. This process …
Queueing models for the analysis of communication systems
Queueing models can be used to model and analyze the performance of various
subsystems in telecommunication networks; for instance, to estimate the packet loss and …
subsystems in telecommunication networks; for instance, to estimate the packet loss and …