By Topic

Computing the blocking probability in tactical communications networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shi, V.T.-S. ; Dept. of Comput. Sci., North Dakota State Univ., Fargo, ND, USA ; Perrizo, W.

Tactical communications networks are multi-hop wireless networks in which switches and endpoints are mobile nodes. In a tactical environment, fast algorithms for performance analysis are desirable for optimizing the network in a timely fashion. Also, preemptive priorities are commonly used to achieve low blocking probabilities for high priority calls when the loss of equipment in the battlefield is not trivial. Analytical algorithms are presented for computing the end-to-end blocking probability in a tactical communications network where a preemption service discipline is employed and traffic is divided into multiple classes to provide multiple grades of service. Each class of traffic has its distinct characteristics, such as average call arrival rate, average call holding time and service priority. Experiments show that the preemption does provide significantly better performance for higher priority traffic. The algorithms presented may also be useful in the optimization of other rapidly deployable networks, where mobility, communication efficiency and computational complexity for adapting the network to unpredictable environments are of significant concern.

Published in:

Telecommunications, 2003. ICT 2003. 10th International Conference on  (Volume:2 )

Date of Conference:

23 Feb.-1 March 2003