An efficient solution to a retrial queue for the performability evaluation of DHCP

Authors:
Tien Van Do
Affiliations:
Department of Telecommunications, Budapest University of Technology and Economics, H-1117, Magyar tudósok körútja 2., Budapest, Hungary
Venue:
Computers and Operations Research
Year:
2010

Citing 4
Cited 3

Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method

Performance Evaluation
On the Solution of a Nonlinear Matrix Equation arising in Queueing Problems

SIAM Journal on Matrix Analysis and Applications
Templates for the solution of algebraic eigenvalue problems: a practical guide

Templates for the solution of algebraic eigenvalue problems: a practical guide
Usage-based dhcp lease time optimization

Proceedings of the 7th ACM SIGCOMM conference on Internet measurement

A new computational algorithm for retrial queues to cellular mobile systems with guard channels

Computers and Industrial Engineering
Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes

Computers and Operations Research
Optimization of the (MAP1, MAP2)/(PH1, PH 2)/N retrial queue model of wireless cellular networks with channel allocation

Computers and Electrical Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Dynamic Host Configuration Protocol (DHCP) is designed to provide an automatic mechanism for the allocation, configuration and management of IP addresses and TCP/IP protocol stack parameters of computers and devices in IP networks. The important feature of DHCP is a ''dynamic allocation'' mechanism, which assigns an IP address to a client for a limited period of time (called a lease time). Therefore, a previously allocated IP address can automatically be assigned to another host by a DHCP server upon the expiration of the lease time if a host does not renew the use of an allocated IP address. This paper proposes a retrial queueing model to approximate the performability of the DHCP dynamic allocation mechanism. An efficient computational algorithm is developed to calculate the steady state probabilities of a continuous time discrete state Markov process. A comparison of our approximate model with a detailed simulation model of the DHCP dynamic allocation mechanism shows an excellent agreement between the analytical and the simulation results. The impact of the lease time parameter on the performability of the DHCP dynamic allocation mechanism is also illustrated through a numerical study.