Passive estimation algorithms for queueing delays in LANs and other polling systems
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
Passive estimation algorithms for queueing delays in LANs and other polling systems
|
|
Creator |
MANJUNATH, D
MOLLE, ML |
|
Subject |
estimation
local area networks queueing theory constraint theory |
|
Description |
Queue inferencing algorithms are used to derive estimates of queue lengths and/or customer waiting times from a priori information about the customer arrival process and the observed sequence of times at which each customer enters and leaves service. In this paper, we extend these techniques by decoupling the arrival time constraints from the customer departure times, which allows us to handle additional features like server vacations. We then show how these techniques can be used to monitor a single station in a polling system, or in a shared medium local area network such as Ethernet, token ring and FDDI. Using these results, passive, non-intrusive network monitoring tools could be developed to estimate waiting times and queue lengths for any host on the network by observing only the packet departure times from the nodes.
|
|
Publisher |
IEEE
|
|
Date |
2009-01-12T11:57:50Z
2011-11-28T07:05:27Z 2011-12-15T09:56:43Z 2009-01-12T11:57:50Z 2011-11-28T07:05:27Z 2011-12-15T09:56:43Z 1996 |
|
Type |
Article
|
|
Identifier |
INFOCOM '96: Proceedings of the IEEE Fifteenth Annual Joint Conference of the Computer Societies, Networking the Next Generation ( V 1 ), San Francisco, USA, 24-28 March 1996, 240-247
0-8186-7293-5 10.1109/INFCOM.1996.497899 http://hdl.handle.net/10054/555 http://dspace.library.iitb.ac.in/xmlui/handle/10054/555 |
|
Language |
en
|
|