%
%   BibTeX entry for \cite{brp:1985b}
%
%   Copyright (c) 2004 by Bruno R. Preiss, P.Eng.
%
%   URL:http://www.brpreiss.com/papers/published/1985/ieeetc/paper.bib
%
%

%
%   Copyright (c) 1999 by Bruno R. Preiss, P.Eng.
%
%   $Author: brpreiss $
%   $Date: 2001/12/09 19:22:40 $
%   $RCSfile: abbrev.bib,v $
%   $Revision: 1.22 $
%
%   $Id: abbrev.bib,v 1.22 2001/12/09 19:22:40 brpreiss Exp $
%

@string{ablex = "Ablex Publishing Corporation"}
@string{acm = "Association for Computing Machinery, Inc."}
@string{acmsurveys = "ACM Computing Surveys"}
@string{acmtomacs = "ACM Trans.\ on Modeling and Computer Simulation"}
@string{acmtoplas = "ACM Trans.\ on Programming Languages and Systems"}
@string{ass = " Ann.\ Simulation Symp."}
@string{brp = "Bruno R. Preiss"}
@string{cacm = "Communications of the ACM"}
@string{ccece = " Canadian Conf.\ on Elec.\ and Comp.\ Eng."}
@string{ccng = "Computer Communications Networks Group"}
@string{ccvlsi = " Canadian Conf.\ on VLSI"}
@string{cips = "Canadian Information Processing Society"}
@string{csece = "Canadian Society for Electrical and Computer Engineering"}
@string{ece = "Department of Electrical and Computer Engineering"}
@string{ee = "Department of Electrical Engineering"}
@string{eic = "Engineering Institute of Canada"}
@string{home = "http://www.brpreiss.com"}
@string{icpp = " Int.\ Conf.\ on Parallel Processing"}
@string{ieee = "Institute of Electrical and Electronics Engineers, Inc."}
@string{ieeecomp = "IEEE Computer"}
@string{ieeemicro = "IEEE Micro"}
@string{ieeetc = "IEEE Trans.\ on Computers"}
@string{ieeetcad = "IEEE Trans.\ on Computer-Aided Design"}
@string{ieeetpds = "IEEE Trans.\ on Parallel and Distributed Systems"}
@string{ieeetse = "IEEE Trans.\ on Software Engineering"}
@string{ijcs = "International Journal in Computer Simulation"}
@string{infocom = " INFOCOM"}
@string{isca = " Int.\ Symp.\ on Computer Architecture"}
@string{jpdc = "Journal of Parallel and Distributed Computing"}
@string{pads = " Workshop on Parallel and Distributed Simulation"}
@string{pennstate = "Pennsylvania State University"}
@string{proc = "Proc.\ "}
@string{sc = "Simulation Councils, Inc."}
@string{scs = "Society for Computer Simulation"}
@string{scsmcds = " SCS Multiconf. on Distributed Simulation"}
@string{tscs = "Trans.\ of the Society for Computer Simulation"}
@string{ut = "University of Toronto"}
@string{uw = "University of Waterloo"}
@string{wiley = "John Wiley \& Sons"}
@string{wsc = " Winter Simulation Conf."}

%
%   Copyright (c) 1999, 2000 by Bruno R. Preiss, P.Eng.
%
%   $Author: brpreiss $
%   $Date: 2004/11/13 13:48:41 $
%   $RCSfile: preiss.bib,v $
%   $Revision: 1.204 $
%
%   $Id: preiss.bib,v 1.204 2004/11/13 13:48:41 brpreiss Exp $
%


@article{brp:1985b,
    url = home # "/papers/published/1985/ieeetc/paper.pdf",
    bibtex = home # "/papers/published/1985/ieeetc/paper.bib",
    author = "Wayne Mervin Loucks and V. Carl Hamacher and
	Bruno Richard Preiss and Luke Wong",
    title = "Short Packet Transfer Performance in Local Area Ring Networks",
    journal = ieeetc,
    volume = "C-34",
    number = 11,
    month = Nov,
    year = 1985,
    pages = "1006--1014",
    copyright = ieee,
    abstract =
    {
	The performance of various access control protocols for bit-serial
	local area computer network (LACN) rings is studied.
	Applications in which message packets are of fixed length and shorter
	than the total inherent propagation delay around the ring are the focus
	of attention.
	Token, slotted, and static and dynamic insertion rings are included in
	the study.
	In all cases, the transmitting station is responsible for removing its
	transmitted packet from the ring.
	Under this type of removal rule,
	it is possible for the stations of all types of ring structures
	to execute their access control algorithms with only a short
	fixed in-line delay in each station.
	The insertion rings dynamically switch longer delays
	(insertion registers)
	into the ring when they are transmitting a packet.
	The transmitter-remove rule operates in such a way that hogging of the
	ring transmission facility by a subset of stations cannot occur.
	Expressions that approximate average transfer time as a function of
	utilization are derived for all ring types and are check by simulation.
	The expressions are found to be quite accurate at low ring utilization
	levels, which is the case of most importance for LACN's;
	but some of them exhibit significant errors at high utilization levels.
	For the assumed short-packet environment,
	it is found that token rings exhibit the slowest transfer times,
	while dynamic insertion rings are fastest.
    }
}