@MISC{Inte86:Information,
AUTHOR="{International Organization for Standardi}",
TITLE="Information Processing Systems -- Open Systems Interconnection:
Transport Protocol Specification -- {IS} 8073",
YEAR=1986,
KEYWORDS="transport protocol; OSI",
}

@ARTICLE{Burm8601:Asymptotic,
AUTHOR="D. Y. Burman and David Burton Smith",
TITLE="An Asymptotic Analysis of a Queueing System with Markov-Modulated
Arrivals",
JOURNAL=or,
VOLUME=34,
NUMBER=1,
PAGES="105-119",
MONTH="January-February",
YEAR=1986,
KEYWORDS="queueing theory",
ANNOTE="Mean delay and mean number in queue in single-server system with
MMPP.",
}

@BOOK{Pres86:Numerical,
AUTHOR="William H. Press and Brian P. Flannery and Saul A. Teukolsky and
William T. Vetterling",
TITLE="Numerical Recipes - The Art of Scientific Computing",
PUBLISHER="Cambridge University Press",
ADDRESS="Cambridge, England",
YEAR=1986,
KEYWORDS="numerical methods",
}

@BOOK{Prud86:Integrals1,
AUTHOR="A. P. Prudnikov and Yu. A. Bryckkow and O. I. Maridev",
TITLE="Integrals and Series --- Elementary Functions",
ISBN="2-88124-089-5",
PUBLISHER="Gordon and Breach Science Publishers",
ADDRESS="New York, New York",
VOLUME=1,
YEAR=1986,
KEYWORDS="tables",
ANNOTE="library reference; \$175",
}

@BOOK{Prud86:Integrals2,
AUTHOR="A. P. Prudnikov and Yu. A. Bryckkow and O. I. Maridev",
TITLE="Integrals and Series --- Special Functions",
ISBN="2-88124-090-9",
PUBLISHER="Gordon and Breach Science Publishers",
ADDRESS="New York, New York",
VOLUME=2,
YEAR=1986,
KEYWORDS="tables",
}

@ARTICLE{Swen8611:GI,
AUTHOR="A. R. Swensen",
TITLE="On a $GI/M/c$ Queue with Bounded Waiting Times",
JOURNAL=or,
VOLUME=34,
NUMBER=6,
PAGES="895-908",
MONTH="November-December",
YEAR=1986,
ANNOTE="Coxian interarrival; distribution through eigenvalues and linear
equations",
}

@BOOK{Tijm86:Stochastic,
AUTHOR="H. Tijms",
TITLE="Stochastic Modelling and Analysis: A Computational Approach",
SERIES="Series in probability and mathematical statistics",
ISBN="0 471 90911 4",
PUBLISHER="John Wiley",
ADDRESS="Chichester, England",
PAGES=418,
YEAR=1986,
KEYWORDS="queueing theory; Markov process",
}

@INPROCEEDINGS{Abra86:Communication,
AUTHOR="Santosh Abraham and Edward S. Davidson",
TITLE="A Communication Model for Optimizing Hierarchical Multiprocessor
Systems",
BOOKTITLE="Parallel Processing Conference",
PAGES="467-474",
YEAR=1986,
}

@BOOK{Anna86:Digital,
AUTHOR="Marco Annaratone",
TITLE="Digital {CMOS} Circuit Design",
PUBLISHER="Kluwer Academic Publishers",
ADDRESS="Norwell, Massachusetts",
YEAR=1986,
}

@INPROCEEDINGS{Bhuy86:Effect,
AUTHOR="L. Bhuyan",
TITLE="Effect of arbitration policies on the performance of
interconnection networks",
BOOKTITLE="International Conference on Parallel Processing",
PAGES="4-7",
YEAR=1986,
}

@ARTICLE{Ilya86:Improvement,
AUTHOR="M. Ilyas and Hussein Mouftah",
TITLE="Towards Performance Improvement of Cut-Through Switching in
Computer Networks",
JOURNAL=pe,
VOLUME=6,
PAGES="125-133",
YEAR=1986,
}

@INPROCEEDINGS{Kova86:Architecture,
AUTHOR="A. Kovaleski and S. Ratheal and F. Lombardi",
TITLE="An Architecture and an Interconnection Scheme for Time-Sliced
Buses in Real-Time Processing",
BOOKTITLE="Real-Time Systems Symposium",
PAGES="20-27",
YEAR=1986,
}

@INPROCEEDINGS{Leho86:Real,
AUTHOR="J. P. Lehoczky and L. Sha",
TITLE="Performance of Real-Time Bus Scheduling Algorithms",
BOOKTITLE="Performance",
PAGES="44-53",
YEAR=1986,
}

@INPROCEEDINGS{Mok86:Graph,
AUTHOR="A. K. Mok",
TITLE="A Graph Theoretic Approach for Timing Analysis in Real-Time
logic",
BOOKTITLE="Real-Time",
YEAR=1986,
}

@INPROCEEDINGS{Olso86:Real,
AUTHOR="Robert Olson",
TITLE="Real-time Response on a message based multiprocessor",
BOOKTITLE="Real-Time Systems Symposium",
PAGES="28-35",
YEAR=1986,
}

@BOOK{Prit86:Simulation,
AUTHOR="A. Alan B. Pritsker",
TITLE="Introduction to Simulation and {SLAM} {II}",
EDITION=3,
PUBLISHER="Halsted Press, a division of John Wiley and Sons",
ADDRESS="New York",
YEAR=1986,
}

@INPROCEEDINGS{Schr86:Generalized,
AUTHOR="Gerhard Schrott",
TITLE="Generalized Task concept for Multiprocessor Real-Time Systems",
BOOKTITLE="Microprocessing and Microprogramming, Short Notes,
Euromicro",
ADDRESS="Venice, Italy",
VOLUME=20,
PAGES="85-90",
YEAR=1986,
}

@INPROCEEDINGS{Sha86:Solutions,
AUTHOR="L. Sha and John P. Lehoczsky and Ragunathan Rajkumar",
TITLE="Solutions for Some Practical Problems in Prioritized Preemptive
Scheduling",
BOOKTITLE="Real-Time Systems Symposium",
PAGES="181-191",
YEAR=1986,
}

@INPROCEEDINGS{Shaf86:Architecture,
AUTHOR="S. A. Shafer and A. Stentz and C. E. Thorpe",
TITLE="An Architecture for Sensor Fusion in a Mobile Robot",
BOOKTITLE="IEEE International Conference on Robotics and Automation",
ADDRESS="San Francisco",
PAGES="2002-2011",
YEAR=1986,
}

@INPROCEEDINGS{Wood86:Modeling,
AUTHOR="Michael H. Woodbury",
TITLE="Performance Modeling and Measurement of Real-Time Multiprocessors
with Time-shared buses",
BOOKTITLE="Real-Time Systems Symposium",
PAGES="109-118",
YEAR=1986,
}

@INPROCEEDINGS{Yang86:Packet,
AUTHOR="Q. Yang and L. Bhuyan and R. Pavaskar",
TITLE="Performance Analysis of Packet-Switched Multiple-Bus
Multiprocessor Systems",
BOOKTITLE="Real-Time",
PAGES="170-178",
YEAR=1986,
}

@INPROCEEDINGS{Zhao86:Virtual,
AUTHOR="W. Zhao",
TITLE="A Virtual Time {CSMA} Protocol for Hard Real-Time Communication",
BOOKTITLE="Real-Time Systems Symposium",
PAGES="120-127",
YEAR=1986,
}

@MISC{Inte86:IEC,
AUTHOR="{International Electrotechnical Commissio}",
TITLE="{IEC} 60461: Time and control code for video tape recorders",
YEAR=1986,
KEYWORDS="SMPTE",
}

@ARTICLE{Kaye86:Insights,
AUTHOR="A. R. Kaye and K. E. Byne",
TITLE="Insights on the Implementation of a Computer-based Message
System",
JOURNAL="Information and Management",
VOLUME=10,
PAGES="277-284",
YEAR=1986,
KEYWORDS="CSWC; electronic mail; CBMS; traffic analysis;
implementation",
ABSTRACT="Although computer-based message systems (CBMS) have been
adopted in parts of many corporations, they are still a new form of
communications to many others. This paper is addressed to management and
planners who may be contemplating the introduction of a CBMS into their
operations. Its purpose is to present insights we gained from a case
study of such an implementation in a medium-sized, multi-national firm
which decided to introduce a CBMS on a company-wide basis. We present
results on usage patterns, including traffic volumes, and on what
motivated staff and management to adopt the use of the system, the way
they used it and the effects it had on their work and their interactions
with others. The paper concludes wit a set of suggested implementation
guidelines which flow from our experience.",
}

@INCOLLECTION{Stei86:Computer,
AUTHOR="Charles W. Steinfield",
TITLE="Computer Mediated Communication in an Organizational Setting:
Explaining Task-Related and Socioemotional Uses",
BOOKTITLE="Communication Yearbook~9",
EDITOR="Margaret L. McLaughlin",
PUBLISHER="Sage Publications",
ADDRESS="Beverly Hills",
PAGES="777-803",
YEAR=1986,
KEYWORDS="CSWC; electronic mail",
ABSTRACT="Electronic mail systems are often viewed as the cornerstone of
the ``office of the future'' (Bair, 1979). These systems, which enable
asynchronous yet potentially rapid textual interaction between
individuals or groups, can be integrated with other functions of
computers such as word processing or information retrieval to create a
powerful support system for information workers. A substantial body of
literature supports the general finding that managers and professionals
spend a large proportion of their work day in communication-related
activities, as much as 79 to 80 percent (Bair, 1979; Klemmer \\& Snyder,
1972; Mintzberg, 1973; Ruchinskas, 1982). Because the managerial and
professional labor force represent the greatest proportion of costs for
labor, and the bulk of their time is spent communicating, improvements
in the process of communication should have the greatest payoff to
organizations. The argument is made by proponents of new office
technologies that computer-mediated systems of communication can
overcome many of the inefficiencies of communication in the work place,
leading to significant increases in productivity (compare Bair, 1979;
Uhlig, Farber, Bair, 1979).",
}

@INCOLLECTION{Rice86:Group,
AUTHOR="Ronald E. Rice and George A. Barnett",
TITLE="Group Communication Networking in an Information Environment:
Applying Metric Multidimensional Scaling",
BOOKTITLE="Communication Yearbook~9",
EDITOR="Margaret L. McLaughlin",
PUBLISHER="Sage Publications",
ADDRESS="Beverly Hills",
PAGES="315-338",
YEAR=1986,
KEYWORDS="CSWC; electronic mail; computer conferencing; group roles;
behavior",
ABSTRACT="Two major components of social interaction have been receiving
increasing attention by researchers. The first in new communication
media and the second is social networks. The research reported here
combines these interests by describing and modeling the changes in the
communication network of ten groups using a computer conferencing system
over a two-year period. This combined focus in natural in that
communication technologies facilitate human networks, while the analysis
of networks can begin to identify patterns of use and social structure
in new situations, such as new communication systems. Two aspects of
{\it new media} are emphasized here: (a) the potential for changes in
traditional communication patterns among groups due to attributes of
these communication systems and (b) the availability of behavioral
communication data collected by the medium's computer system. Two
aspects of {\it network analysis} are emphasized here as well: (a)
longitudinal analysis and modeling and (b) the application of metric
multidimensional scaling as one appropriate network methodology.",
}

@BOOK{Zimm86:Once,
AUTHOR="Jan Zimmerman",
TITLE="Once Upon The Future: A Woman's Guide to Tomorrow's Technology",
PUBLISHER="Pandora Press",
ADDRESS="New York, New York",
YEAR=1986,
KEYWORDS="computer conferncing",
ABSTRACT="This book discusses some of the futures for computer
conferencing, especially with respect to woman's groups.",
}

@INCOLLECTION{Dodd86:Computer,
AUTHOR="W. P. Dodd",
TITLE="Computer Conferencing aided learning : Some Initial Experiences",
BOOKTITLE="BLEND--5: The Computer Human Factors Journal",
EDITOR="B. Shackel and J. Florentin and P. E. Wright",
PUBLISHER="Library and Information Research Report",
PAGES="45-51",
YEAR=1986,
KEYWORDS="computer aided learning; conputer conferencing",
ABSTRACT="A potential shortcoming of computer aided learning is that no
provision is made for the student to ask unstructured questions, or for
fellow students to benefit from the replies. Computer conferencing
provides a facility whereby this shortcoming can be overcome. This
article describes the use of computer conferencing as a teaching aid and
presents some results which suggest that students would make good sue of
such a facility if it were available.",
}

@ARTICLE{Sieg86:Group,
AUTHOR="Jane Siegel and Vitaly Dubrovsky and Sara Kiesler and Timothy W
McGuire",
TITLE="Group Processes in Computer-Mediated Communication",
JOURNAL="Organizational Behavior and Human Decision Processes",
ADDRESS="Carnegie-Mellon University",
VOLUME=37,
PAGES="157-187",
YEAR=1986,
KEYWORDS="computer conferencing",
ABSTRACT="Three experiments explored the effects of computer-mediated
communication on communication efficiency, participation, interpersonal
behavior, and group choice.  Groups of three members were asked to reach
consensus on career choice problems; they communicated face-to-face and
in simultaneous computer-mediated discussions or through computer mail. 
When groups were linked by computer, group members made fewer remarks
than they did face-to-face and took longer to make their group
decisions.  Social equalization was higher in computer-mediated groups
in that group members participated more equally in discussions. 
Computer-mediated groups also exhibited more uninhibited behavior ---
using strong and inflammatory expressions in interpersonal interactions.
 Decisions of computer-mediated groups shifted further away from the
members' initial individual choices than group decisions which followed
face-to-face discussions.  We discuss the implications of these findings
for extension of theories about group interaction and for analyses of
effects of computers in organizations.",
}

@PHDTHESIS{Smit86:Communication,
AUTHOR="Jill Y. Smith",
TITLE="Communication Quality in Information Systems Development: The
Effect of Computer-Mediated Communication on Task-oriented Problem
Solving",
SCHOOL="North Texas State University",
PAGES=189,
YEAR=1986,
KEYWORDS="computer conferencing",
ABSTRACT="The problem motivating this research is that ineffective
communication may hamper systems development efforts. Specifically
germane to this study are development efforts characterized as
task-oriented, and which require information-sharing and problem-solving
activities. This research problem motivated an analysis of the
communication process and lead to the development of a temporal
framework that delineates variables associated with task-oriented, and
user/systems analyst communication interactions. Several variables
within this framework are depicted in two theoretical models. The first
model shows the theoretical relationship between an independent
variable, communication mode (represented by asynchronous computer
conferencing and face-to-face conferencing), and five dependent
variables: (1) the amount of information shared, (2) the significance of
the information shared, (3) the comprehensiveness of the information
shared, (4) the perception of progress toward the goal, and (5) the
perception of freedom to participate. The second model depicts the
assumed interaction between communication mode, the five variables cited
above (now acting as independent variables), and a dependent variable,
communication quality. There are two theoretical components of
communication quality: (1) deviation from an optimal set of user
requirements, and (2) the degree of convergence (unity based on mutual
understanding and mutual agreement) emanating from a communication
interaction. Using the theoretical models as a guide, an experiment was
designed and performed to test the relationships among the variables.
The experimental results led to the rejection of all null hypotheses;
the results strongly favored face-to-face conferencing for solving
task-oriented, information sharing problems analogous to the case used
in the present study. The findings indicate that asynchronous computer
conferencing may have a detrimental effect on the thoroughness of
information exchange, on the relevance of the information shared in
terms of making the correct decision, and on the completeness of the
consideration given to all problem dimensions.",
}

@ARTICLE{Levi86:Marshall,
AUTHOR="Paul Levinson",
TITLE="Marshall McLuhan and Computer Conferencing",
JOURNAL=ieeepc,
VOLUME="PC-29",
NUMBER=1,
PAGES="9-11",
YEAR=1986,
KEYWORDS="computer conferencing",
ABSTRACT="Marshall McLuhan's writing style has long been a source of
fascination and frustration to the scholarly community. Instead of
sequentially developed paragraphs and chapters, McLuhan's work often
took the form of numerous free-standing commentaries, usually not more
than a few pages in length, each self-sustaining yet revolving around
some sort of central theme. This ``holographic'' style turns out to have
much in common with the commentaries produced by participants in a
computer conference, where individuals engage in multi-dimensional
dialogues through comments of usually 20-60 lines of length around
several related themes. The similarities in the textures of computer
conferences and the books of McLuhan - who know nothing about computer
conferencing when he wrote his books - help us better understand both
the computer conference as a literary form and the style of McLuhan. The
electronic group production of dialogue fulfills McLuhans's oft stated
desire to overcome the boundaries of static print on a page, and shows
that literacy may actually be promoted rather than eclipsed by the
electronic revolution (author abstract). Article describes experiences
of EIES computer conferencing system and Western Behaviorial Sciences
Institute. Students in a conference would number 5-75 with 5-10
instructors. Typical conferences have 5-15 participants and generate
5-10 comments per week; they generally last one month and may produce
100-150 comments for the total conference.",
}

@ARTICLE{Kerr86:Electronic,
AUTHOR="E. L. Kerr",
TITLE="Electronic Leadership: A Guide to Moderating Online Conferences",
JOURNAL=ieeepc,
VOLUME="PC-29",
NUMBER=1,
PAGES="12-18",
YEAR=1986,
KEYWORDS="computer conferencing; moderation",
ABSTRACT="Summarizes effective leadership styles and skills for
moderating online meetings and facilitating electronic groups (using the
EIES conferencing system as an example). The ``acquired'' wisdom of many
different groups using EIES since its 1976 initiation are summarized.
LEADERSHIP CHARACTERISTICS. The most effective moderator style is
group-oriented (rather than authoritarian), and s/he includes all
conference members interested in the formation of policy and moves them
to consensus. The moderator of a active task-oriented conferences should
spend 30 min or more on line each day. Effective moderators must exert
strong organizational pressures and also be familiar with the
technology; if the do not have time or experience they should not take
on the role of moderator. The moderator should set the agenda and keep
the group moving toward its goal. FACE-TO-FACE. Group training prior to
conferencing can be valuable if time and money permit. This sets the
stage for a ``working relationship'' and uses the conferencing for the
communication techniques. Time should be allowed for socializing and
``getting to know one another'' as well as outlining the task and
getting exposure to the technology. The ideal session would be about 1.5
days and allow about 5 hrs on line. Structure. The moderator should
prepare a group message with initial instructions on procedures (first
task might be to send a message to the moderator, then introduce
themselves, comment on initial definition of the task). The moderator
should clarify the structure of the conferencing system (e.g., mail vs
conferencing). Specific tasks of moderators are given. ACTIVITIES. The
moderator should set agendas, indexing comments by keywords or by making
summaries. The moderator should welcome new members, provide initial
items, see members develop their resumes, build some ``social'' fabric
(host an on-line party - optimum size is 10-15 is all are making
entries), delegate responsibilities, provide positive feedback to
members and create a climate that adds to self-esteem, control the
process so ``loud'' users are calmed down and ``quiet'' users are drawn
out, and keep the comments flowing. Time should be set aside to ``self
analyze'' the conference and redirect efforts as appropriate. A list of
incentives for participation is provided.",
}

@ARTICLE{Feen86:Operating,
AUTHOR="Andrew Feenberg",
TITLE="Network Design: An Operating Manual for Computer Conferencing",
JOURNAL=ieeepc,
VOLUME="PC-29",
NUMBER=1,
PAGES="2-7",
YEAR=1986,
KEYWORDS="computer conferencing",
ABSTRACT="The communcations revolutions of the last century have so far
enhanced one-to-one contacts (e.g., telephone) and mass broadcast (e.g.,
radio and television). Yet, the small groups in which most of our daily
activities go on have been largely unaffected. Computer conferencing
addresses that ``last frontier''. This paper briefly reviews computer
conferences and how they differ from regular meetings, and describes
steps to be taken for a successful conferencing implementation.
Communication by computer conferencing is different than ``natural''
communications (e.g., one gets verbal and non-verbal cues by setting in
a group). At the time of computer communication, no objective context my
be present for guidance. Thus, computer conferencing does not ``just
automate meetings'', but requires careful DESIGN AND LEADERSHIP to
replace an old and familiar communicatons system. Computer conferencing
works with four elements (plus moderating as a fifth): HARDWARE. A
central computer and local terminals or personal computers. SOFTWARE:
Both host and terminal software affect use and interaction. Conferencing
systems which are complex to learn but have powerful features may not be
as ``useful'' as simple to learn with ``adequate'' features. Methods of
composing off-line and minimizing communications costs are helpful.
GROUPWARE: A word coined by Peter and Trudy Johnson-Lenz, a combination
of group processes AND software that make up the conferencing system.
How are conferences structured (few, many)? How is conference moderation
accomplished (see below). CONTEXTUALIZATION. Computer conferencing is
weak on ``context'' compared to the more familiar communications
methods. The absence of tacit cues and coded objects threatens
participants and may leave them speechless. This can be addressed by
bringing the participants together to discussed the common interests and
procedures, materials may be mailed to participants, telephone calls can
be used to contact members, and the conferences themselves can be made
context sensitive by the way opening comments are made and follow-up
statements used. MODERATING. The moderator is extremely important to
computer conferencing. A short check list would include 1) setting the
conference contents, 2) setting the norms and procedures, 3) setting the
agenda and flow of topics, 4) recognition of members contributions, 5)
prompting members to address certain issues, 6) weaving themes or
summarizing the state of discussion, and 7) meta-commenting (remarks
directed at changing the context or agenda of conference). groupware
(number of conferences offered, norms established for groups), and
contextualizations (especially designed opening statements, integration
of mail and conferencing). Suggestions for workstations and methods of
allowing ``browsing of the text'' are provided. CONCLUSIONS. We can
summarize five principles: 1) computer conferencing is a new technology
for effective interactive communication in small groups, 2) several
types of conferences are available (based on subject, project, or group
needs), 3) many ordinary conventions and rituals of small group
communications are lost in computer conferencing (and must be addressed
artificially), 4) this new type of communication must be organized and
sustained by designers and moderators, and 5) successful implementation
involves both communications knowledge and computer knowledge by the
installing group.",
}

@ARTICLE{Pull86:Chit,
AUTHOR="J. Pullinger",
TITLE="Chit-Chat to Electronic Journals: Computer Conferencing Supports
Scientific Communication",
JOURNAL=ieeepc,
VOLUME="PC-29",
NUMBER=1,
PAGES="23-29",
YEAR=1986,
KEYWORDS="computer conferencing",
ABSTRACT="In 1980-1985 the conferencing system NOTEPAD was extended to
serve as an experimental program into electronic journals and other
kinds of scientific communications in the United Kingdom. Several
locations were linked together and use ranged from ``chit-chat'' to
information exchange to refereed papers. The paper describes low,
moderate, high use groups (in terms of frequency of signin and of length
of session). Examples of conferences are: peer review of articles,
journal of abstracts were readers could post comments, poster papers
(pre-publication papers for early comment), full papers (for reading),
and newsletter. In addition, several ``information'' conferences or
seminars were run, lasting from 1 day to several months (of variety of
topic, including teaching students). Specific roles taken by coauthors
are: project organizer, timescale watcher, absent co-author (keeps track
of who is available), phase directors, writing team, section writer, and
planning team. Recommendations for improvement include: 1) encourage the
initiation of discussion by greater allocation of roles and leadership
forms, 2) put summaries of previous discussions into the conference at
periods relating to normal access, so members do not have information
overload in catching up, and 3) if a newsletter is available have it
tied to the average access pattern. One result of the experiment was
that four people who had not previously met had regular on-line
conferences to discuses a particular area of work, which was
subsequently published as a scientific paper.",
}

@ARTICLE{Spit86:Writing,
AUTHOR="Michael Spitzer",
TITLE="Writing Style in Computer Conferences",
JOURNAL=ieeepc,
VOLUME="PC-29",
NUMBER=1,
PAGES="19-22",
YEAR=1986,
KEYWORDS="computer conferencing; user behavior",
ABSTRACT="Users of computer conferencing must become aware of the
special characteristics of communicating in this medium and adopt new
communications strategies if computer conferencing is to achieve its
full potential. Based on experiences with the PARTI software at the New
York Institute of Technology, examples of written conference material
are presented. Some ``definitions'' users have formed about computer
conferencing are: - talking in writing. - running a debate in a
journal's ``notes and queries'' section, but without the tedium of
having to wait for each new monthly number. - a panel discussion in slow
motion. - writing letters which are mailed over the telephone. Computer
conferencing encourages what feels like intimate, conversational
discourse, yet, because it is ``many-to-many'' it requires the same
attention to form as the familiar essay. It is ``in between'' the forms
we are used to. The paper discusses computer conferencing behavior and
compares it to some other methods of communication. Computer
conferencing also allows some graphic representation (e.g., 'grin' after
a statement indicates humor, \#\$\%\# indicates 'oh darn' and so on). In
general, computer conferencing forces ``equality'' of the members; it
makes for more ``democratic'' discussion. Beginners tend to be passive
and shy, while they assimilate the etiquette before they participate.
Some experienced users sometimes focus too much on the text, rather than
the reader (again showing the need for feedback). There is a need for
METACOMMUNICATON (or talking about communication). This provides the
``threads'' that hold the discussion together, helps provide the cues
that are lacking in non-face-to-face meetings, and really takes
advantage of the ``transcript'' available in computer conferencing.
Computer conferencing in NOT just another form of writing. But we must
strive for clarity and precision of language (keeping informal), use
effective language, and occasionally avail ourselves to graphic
representation.",
}

@INPROCEEDINGS{Supp86:Communication,
AUTHOR="J. Suppan-Borowka",
TITLE="Analysis of Communication Requirements of Selected Applications
in Decentralized {LAN} Environments",
BOOKTITLE=iccc,
PUBLISHER="North Holland",
ADDRESS="Tel Aviv, Israel",
YEAR=1986,
REFERENCES=5,
KEYWORDS="LAN; application oriented performance; file server; peak",
}

@BOOK{Supp86:MAP,
AUTHOR="J. Suppan-Borowka and T. Simon",
TITLE="{MAP} -- Datenkommunikation in der automatisierten Fertigung",
PUBLISHER="Datacom verlag",
ADDRESS="Pulheim, Germany",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="LAN; MAP; performance parameter; performance metrics",
ABSTRACT="nur 2 Seiten (100-101) über leistungsbeeinflussende Parameter:
protokollabhängige Masse (zum Beispiel Token-Umlaufzeit, Anzahl von
Kollisionen, Anzahl Retransmissions)",
}

@ARTICLE{Swen86:GI,
AUTHOR="A. R. Swensen",
TITLE="On a {GI/M/c} queue with bounded waiting times",
JOURNAL=or,
VOLUME=34,
PAGES="895-908",
YEAR=1986,
KEYWORDS="Queueing system; GI/M/S; bounded waiting time; remaining load;
virtual waiting time; multiserver; switching system",
ABSTRACT="Derives the asymptotic distribution of the remaining load,
virtual waiting time and actual waiting time for a multiserver queueing
system with exponentially distributed service times andbounded waiting
times. Interarrival distributions are Coxian, with $m$ stages. The
explicit derivation of the distributions involves determining the
eigenvalues of m-dimensional matrices \ldots",
}

@BOOK{Taka86:Polling,
AUTHOR="H. Takagi",
TITLE="Analysis of polling systems",
ISBN="0-262-20057-0",
PUBLISHER="MIT Press",
ADDRESS="Cambridge, Massachusetts",
PAGES=197,
YEAR=1986,
REFERENCES=180,
KEYWORDS="Queueing system; polling",
}

@ARTICLE{Taka86:Approximate,
AUTHOR="H. Takagi and L. Kleinrock",
TITLE="Approximate output processes in hidden-user packet radio
systems",
JOURNAL=ieeecom,
VOLUME="COM-34",
PAGES="685-693",
YEAR=1986,
KEYWORDS="Packet radio; output process",
}

@ARTICLE{Taka86:Traffic,
AUTHOR="Yutaka Takahashi and T. Katayama",
TITLE="Traffic analysis of loss-delay combined model with batch
arrivals",
JOURNAL=recl,
VOLUME=34,
PAGES="545-553",
YEAR=1986,
REFERENCES=19,
KEYWORDS="Queueing system; MX; MX/M/S/N; delay loss model; batch",
}

@ARTICLE{Thak86:Interactions,
AUTHOR="G. H. Thaker and J. B. Cain",
TITLE="Interactions between Routing and Flow Control Algorithms",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=3,
PAGES="269-277",
YEAR=1986,
REFERENCES=13,
KEYWORDS="packet switching; flow control; routing algorithm",
ABSTRACT="In this paper we discuss the interactions between routing and
flow control algorithms for packet-switched networks. We present a new
variation on the Gallager-Golestaani flow control scheme and also a new
variable window scheme. The tradeoff between throughput and network
congestion is examined. It is shown that these two flow control schemes
have the unique feature that the parameters can be specified to place an
upper bound on the expec",
}

@ARTICLE{Tsit86:Precedence,
AUTHOR="J. Tsitsiklis and H. Papadimitriou and Pierre A. Humblet",
TITLE="The performance of a Precedence-Based Queueing Discipline",
JOURNAL=jacm,
VOLUME=33,
NUMBER=3,
PAGES="593-602",
YEAR=1986,
REFERENCES=4,
KEYWORDS="Performance evaluation; queueing system; physical design",
}

@INPROCEEDINGS{Turn86:New,
AUTHOR="J. S. Turner",
TITLE="New Directions in Communications",
BOOKTITLE="International Zurich Seminar on Digital Communication",
ADDRESS="Zürich, Switzerland",
PAGES="25-32",
YEAR=1986,
REFERENCES=30,
KEYWORDS="ATM",
ABSTRACT="This paper discusses the need of networks that provide basic
communications capabilities in an application-independent fashion. Also
is considered about some possible ways to implement them.",
}

@INPROCEEDINGS{Vara86:Congestion,
AUTHOR="R. Varakulsiripunth and N. Shiratori and S. Noguchi",
TITLE="Congestion Control Policy on Internetwork Gateway",
BOOKTITLE=iccc,
ADDRESS="München, Germany",
PAGES="659-664",
YEAR=1986,
LANGUAGE="Englisch",
REFERENCES=6,
KEYWORDS="Gateway; congestion control; congestion",
ANNOTE={A new approach to congestion control policy at a gateway in an
interconnected networks system, called "FCP", is proposed. The main
purpose of FCP policy is to avoid the congestion of a network which
would be caused by the increase in internetwork traffic, and to
guarantee the performance of each network up to its respective desired
value. We analyze FCP policy quantitatively in terms of network
throughput. Whereby the queueing models for a},
}

@INPROCEEDINGS{Wins86:Progress,
AUTHOR="R. T. Winston and A. Barthe",
TITLE="Progress of the International Conformance Test Standards as a
Tool for {DTE} Self-Verification",
BOOKTITLE=iccc,
ADDRESS="München, Germany",
PAGES="497-501",
YEAR=1986,
REFERENCES=5,
KEYWORDS="Protocol testing",
}

@ARTICLE{Wood86:Controllability,
AUTHOR="C. M. Woodside",
TITLE="Controllability of computer perforformance tradeoffs obtained
using controlled-share queue schedulers",
JOURNAL=ieeese,
VOLUME="SE-12",
PAGES="1041-1048",
YEAR=1986,
REFERENCES=16,
KEYWORDS="Queueing network; control theory; optimization",
}

@ARTICLE{Zipk86:Models,
AUTHOR="P. H. Zipkin",
TITLE="Models for Design and Control of Stochastic, Multi-Item Batch
Production Systems",
JOURNAL=or,
VOLUME=34,
NUMBER=1,
PAGES="91-104",
YEAR=1986,
REFERENCES=52,
KEYWORDS="Load Sharing; Analysis; Queueing system",
}

@ARTICLE{Bic86:Simulated,
AUTHOR="L. Bic and R. R. Hartmann",
TITLE="Simulated Performance Of A Data-Driven Database Machine",
JOURNAL=jpdc,
VOLUME=3,
PAGES="1-22",
YEAR=1986,
REFERENCES=11,
KEYWORDS="Database; active graph model; multiprocessor system",
}

@ARTICLE{Humb86:Throughput,
AUTHOR="Pierre A. Humblet",
TITLE="On the Throughput of Channel Access Algorithms with Limited
Sensing",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=4,
PAGES="345-347",
YEAR=1986,
REFERENCES=11,
KEYWORDS="Protocol; ALOHA; multiple access channel; Markov chain",
ABSTRACT={We consider some access protocols for Aloha type multiaccess
channels. We argue, and show in an important case, that they can be
modified to allow new transmitters to join the system at arbitrary
times. This feature, known as "limited sensing" or "continous entry",
need not reduce throughput performances. In the case presented, the
modified argorithm is also robust with respect to feedback errors.},
}

@ARTICLE{Jami86:FFT,
AUTHOR="L. H. Jamieson and P. T. Mueller and H. J. Siegel",
TITLE="{FFT} Algorithms For {SIMD} Parallel Processing Systems",
JOURNAL=jpdc,
VOLUME=3,
PAGES="48-71",
YEAR=1986,
REFERENCES=36,
KEYWORDS="FFT; Fast Fourier Transform; algorithm; DFT; Discrete
Fourier",
}

@ARTICLE{Linn86:Testing,
AUTHOR="R. J. Linn",
TITLE="Testing to Assure Interworking of Implementations of {ISO/OSI}
Protocols",
JOURNAL=cnis,
VOLUME=11,
PAGES="277-286",
YEAR=1986,
REFERENCES=18,
KEYWORDS="Computer network; internetwork protocol; OSI; protocol",
ABSTRACT="At the Instiute for Computer Sciences and Technology of the
national Bureau of Standards, an architecture has been specified for
testing protocols in layers four through seven of the ISO Basic
Reference Model for OSI. This paper describes the application of that
architecture to testing Class 4 Transport with thirteen vendor's
implementations if the protocol prior to a demonstration of ISO
protocols at the National Computer Conference in 1984.",
}

@ARTICLE{Mach86:Infinitely,
AUTHOR="F. Machihara",
TITLE="An Infinitely-Many Server Queue Having Markov Renewal Arrivals
And Hyperexponential Service Times",
JOURNAL=jorsj,
VOLUME=29,
PAGES="338-350",
YEAR=1986,
REFERENCES=13,
KEYWORDS="Markov; arrival process; renewal process; hyperexponential",
}

@TECHREPORT{Rame86:TRANSNET,
AUTHOR="L. Ramel",
TITLE="{TRANSNET} switch principles and architecture",
TYPE="Internal report",
INSTITUTION="Philips-TRT",
ADDRESS="Paris, France",
PAGES="1-63",
YEAR=1986,
KEYWORDS="ATM; switching system; switching network",
}

@INPROCEEDINGS{Roze86:Statistical,
AUTHOR="M. Rozenblit",
TITLE="Performance evaluation of statistical switching networks for
voice and data communications",
BOOKTITLE=iccc,
PUBLISHER="North-Holland",
ADDRESS="München, Germany",
PAGES="282-287",
YEAR=1986,
REFERENCES=9,
KEYWORDS="Performance evaluation; integrated voice/data switching",
ABSTRACT="This paper compares the overhead, average delays, and clipping
rates for fast circuit and packet switching networks. Qualitative
results are obtained for some limiting cases (light or veryheavy
traffic, no buffers, or unlimited buffers). The results show that fast
circuit switching causes less delay, clipping, and overhead than does
packet switching. The conclusions are in-dependent of the message
arrival process or message length.",
}

@ARTICLE{Sidh86:Verification,
AUTHOR="Deepinder Sidhu and T. P. Blumer",
TITLE="Verification of {NBS} Class 4 Transport Protocol",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=8,
PAGES="781-789",
YEAR=1986,
REFERENCES=22,
KEYWORDS="Transport layer; transport protocol; protocol engineering",
ABSTRACT="This paper discusses the verification of the connection
management aspects of a transport layer protocol available from the
National Bureau of Standards. An automated protocol developmment
technique is used to verify a subset of the protocol with respect to the
protocol properties of completeness, deadlock freeness, boundedness, and
termination.",
}

@MISC{Turn86:Broadcast,
AUTHOR="J. S. Turner",
TITLE="Broadcast packet switching network",
ADDRESS="St. Louis, Missouri",
PAGES=17,
NOTE="European Patent Application 84601042.5",
YEAR=1986,
KEYWORDS="ATM; packet switching; network; broadcast",
ABSTRACT="A high performance packet switching network that can be used
to provide voice data and video communication on a large scale is
disposed. The packet switching network has a broadcast capabilitywhich
makes it suitable for applications including commercial television
distribution and conferencing. The basic switching capability of the
network is provided by a switching module which iscapable of producing a
desired number of copies of a packet",
}

@ARTICLE{Atal86:Optimal,
AUTHOR="M. Atallah and S. Hambrusch",
TITLE="Optimal Rotation Problems in Channel Routing",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=9,
PAGES="843-847",
YEAR=1986,
KEYWORDS="Analysis; algorithm; channel routing",
ABSTRACT="In the channel routing problem, a problem arising in the
desing of layout systems, two rows of terminals which are opposite
eachother, have to be connected. We study what effect the rotation of
one row of terminals has on the cost measures of the routing phase. The
cost measures we consider are the density, which is proportional to the
widh of the channel, the crossing number, which is closely related to
the number of crossings between two.",
}

@ARTICLE{Bobb86:Aggregation,
AUTHOR="A. Bobbio and K. S. Trivedi",
TITLE="An Aggregation Technique for the Transient Analysis of Stiff
Markov Chains",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=9,
PAGES="803-814",
YEAR=1986,
KEYWORDS="Aggregation; approximation; Markov chain; reliability",
ABSTRACT="An approximation algorithm for systematically converting a
stiff Markov chain into a nonstiff chain with a smaller state space
isdiscussed in this paper. After classifying the set of all statesinto
fast and slow states, the algorithm proceeds by futher classifying fast
states into fast recurrent subsets and a fast transient subset. A
separate analysis of each of these fast subsets is done and each fast
recurrent subset is replaced by a single.",
}

@ARTICLE{Chou86:Distributed,
AUTHOR="T. Chou and J. Abraham",
TITLE="Distributed Control of Computer Systems",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=6,
PAGES="564-567",
YEAR=1986,
KEYWORDS="Parallel computing; distributed control; routing algorithm",
ABSTRACT="In order to be able to take full advantage of a distributed
computing facility it is important not only to distribute the hardware
but also to distribute the control of these resources. Howev er,
distributed control is very different from centralized control since at
any time, several controlles may observe different and inconsistent
views of the global system state.",
}

@ARTICLE{Dech86:Broadcast,
AUTHOR="R. Dechter and L. Kleinrock",
TITLE="Broadcast Communications and Distributed Algorithms",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=3,
PAGES="210-219",
YEAR=1986,
KEYWORDS="Access control; broadcast; distributed algorithm; sorting",
ABSTRACT={The paper adresses ways in which one can use broadcast
communication" in distributed algorithms and the relevant issues of
design and complexity. We present an algorithm for merging $k$ sorted
lists of $n/k$ elements using $k$ processors and prove its worst ca se
complexity to be $2n$, regardless of the number of processors, while
neglecting the cost arising from possible conflicts on thebroadcast
channel.},
}

@ARTICLE{De86:Clustering,
AUTHOR="E. de Souza and S. S. Lavenberg and R. R. Muntz",
TITLE="A Clustering Approximation Technique for Queueing Network Models
with a Large Number of Chains",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=5,
PAGES="419-430",
YEAR=1986,
KEYWORDS="Approximation; computer system; queueing network",
ABSTRACT="The past few years have witnessed an increasing number of
large distributed computer system implementations based on local area
networks. In these systems a number of resources are shared amo ng jobs
originating at different sites. Evaluating the performance of such large
systems typically requires the solution of a queueing network model with
a large number of closed chains, wh ich precludes the use of exact
solutions techniques.",
}

@ARTICLE{Gonz86:Routing,
AUTHOR="T. F. Gonzalez and Shiang-feng Lee",
TITLE="Routing Multiterminal Nets Around a Rectangle",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=6,
PAGES="543-549",
YEAR=1986,
KEYWORDS="Algorithm; routing algorithm; VLSI",
ABSTRACT="The problem of connecting a set of terminals that lie on the
sides of a rectangle to minimize the total area is discussed. We present
an approximation algorithm to solve this problem where $n$ is the number
of terminals and $m$ is the number of signal nets. Our algorithm
generates a solution with an area OPT where OPT is the area of an
optimal solution. Our algorithm routes some of the nets by a simple
greedy strategy.",
}

@BOOK{Kahl86:ISDN,
AUTHOR="P. Kahl",
TITLE="{ISDN:} Das künftige Fernmeldenetz der Deutschen Bundespost",
PUBLISHER="R. v. Decker's Verlag",
ADDRESS="Heidelberg, Germany",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="ISDN",
ABSTRACT="Das ISDN- Ein Überblick zum Konzept der DBP; Der
Teilnehmer-Bereich; ISDN-Übertragungstechnik auf der
Teilnehmer-Anschluß-Leitung; ISDN- Zeichengabe auf der
Teilnehmer-Anschluß-Leitung und zwischen VSt; Mögliche Dienste und
Endeinrichtungen im ISDN; Teilnehmer-bezogene Dienstmerkmale; Einsatz
herkömlicher Endgeräte im ISDN",
}

@ARTICLE{Kavi86:Formal,
AUTHOR="K. Kavi and B. P. Buckles and U. Narayan Bhat",
TITLE="A Formal Definition of Data Flow Graph Models",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=11,
PAGES="940-948",
YEAR=1986,
KEYWORDS="Graph theory; data flow graph; deadlock; parallel",
ABSTRACT="In this paper, a new model for parallel computations and paral
lel computer systems that is based on data flow principles is presented.
Uninterpreted data flow graphs can be used to model computer systems
including data driven and parallel processors. A data flow graph is
defined to be a bibartite graph with actorsand links as the two vertex
classes. Actors can be considered similar to transitions in Petri
nets.",
}

@ARTICLE{Ragh86:Fault,
AUTHOR="C. S. Raghavendra and A. Varma",
TITLE="Fault-Tolerant Multiprocessors with Redundand-Path
Interconnection Networks",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=4,
PAGES="307-316",
YEAR=1986,
KEYWORDS="Multiprocessor system; multistage interconnection network",
ABSTRACT="In this paper, we study fault-tolerant multiprocessor systems
employing redundand-path multistage interconnection networks. Such
systems permit interprocessor communication in the presence of faulty
components in the network. The interconnection netw ork augmented with
an extra switching stage in front. When the first and last stages are
fault-free, the extra-stage delta networks continue to provide full
access in the presence of all sing",
}

@ARTICLE{Tows86:Approximate,
AUTHOR="Donald F. Towsley",
TITLE="Approximate Models of Multiple Bus Multiprocessor Systems",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=3,
PAGES="220-228",
YEAR=1986,
KEYWORDS="bus; multiprocessor system; performance evaluation",
ABSTRACT="Two classes of approximate models are developed for
multiprocessor systems containing $P$ processors, $M$ memories, and $B$
buses. Oneclass of models is based on the flow equivalence technique for
the approximate analysis of queueing networks. A memory invariance
principle is presented and used to obtain the parameters of this model.
This approach is used to model homogeneous processorsystems where memory
times are either constant or exponentially.",
}

@TECHREPORT{Poda86:Enhancements,
AUTHOR="S. Podar",
TITLE="Enhancements to the Picture Environment of {LATEX}",
INSTITUTION="SUNY Dept. of Computer Science Stony Brook Techn.",
ADDRESS="Stony Brook, New York, New York",
PAGES=23,
YEAR=1986,
KEYWORDS="Text processing; graphics",
ABSTRACT="This document describes some new commands for the picture
environment of LATEX.",
}

@ARTICLE{Anag86:Selective,
AUTHOR="Miltos Anagnostou and E. Protonotarios",
TITLE="Performance Analysis of the Selective Repeat {ARQ} Protocol",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=2,
PAGES="127-135",
YEAR=1986,
KEYWORDS="Performance evaluation; protocol engineering; ARQ",
ABSTRACT="Delay, queue length are the main performance characteristics
of a data transmission system with ARQ error control. Various protocols
which have been proposed use, as a part or as a whole, the basic
selective-repeat ARQ protocol. Their performance analysis has, however,
been restricted to the throughput characteristics. An easily applicable
method to analyze this basic protocol has not appeared in the literature
so far.",
}

@ARTICLE{Apos86:Queueing,
AUTHOR="T. Apostolopoulos and E. Protonotarios",
TITLE="Queueing Analysis of Buffered {CSMA/CD} Protocols",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=9,
PAGES="898-905",
YEAR=1986,
KEYWORDS="LAN; CSMA/CD; queueing system; Markov chain",
ABSTRACT="In this paper, we propose a new queueing model appropriate for
the analysis of a buffered CSMA/CD protocol. We assume that each user
has a finite buffer capacity. The system, in general, can be modeled as
a multidimensional semi-Markov chain. The enormousstate space for the
complete description is reduced by apprioprate exploitation of the
features of the system, fairness towards all users, dependence of the
probability of successful tran.",
}

@ARTICLE{Brun86:Throughput,
AUTHOR="H. Bruneel and M. Moeneclaey",
TITLE="On the Throughput Performance of Some Continuous {ARQ} Strategies
with Repeated Transmissions",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=3,
PAGES="244-249",
YEAR=1986,
KEYWORDS="Throughput analysis; performance evaluation; ARQ",
ABSTRACT="The paper considers a class of continuous ARQ strategies,
where by multiple copies of each data block are sent contiguously,
andwhereby the data blocks are delivered at the receiver side in their
order of arrival at the transmitter. in order to achieve thebest
possible throughput efficiency-within this class-an optimumvalue for the
number of copies to be sent is determined, in ter ms of the block error
probability and the propagation delay.",
}

@ARTICLE{Chla86:Multibeam,
AUTHOR="I. Chlamtac and G. Ora",
TITLE="Performance of Multibeam Packet Satellite Systems with Conflict
Free Scheduling",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=10,
PAGES="1016-1023",
YEAR=1986,
KEYWORDS="Satellite communication; scheduling; ALOHA; delay analysis",
ABSTRACT="The concept of a multibeam satellite system with on-board
processing and memory is studied. In this system multiple slotted ALO HA
uplinks carry the traffic to the satellite. Packets are accepted at the
satellite, when memory is available, and are routed to their destination
zones using a TDM protocol. We present a model which can be used to
evaluate a satellite system with conflict-free scheduling.",
}

@ARTICLE{Daig86:Task,
AUTHOR="J. N. Daigle",
TITLE="Task-Oriented Queueing: An Analysis Tool for Software Design of
Communication Processing Systems",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=3,
PAGES="250-256",
YEAR=1986,
KEYWORDS="Software engineering; queueing system; priority",
ABSTRACT="Jobs associated with messages arriving to a communication
processing system can be described as ordered sets of prioritized
taskwhere each task represents the execution of some part of the
system's software. The service system of the CPS consists of a
collection of queues, one for each distinct priority, serviced by a
single server under a preemptive resume discipline. The routing of the
job trough this collection of queues is defined by job's",
}

@BOOK{Fran86:Rechnernetze,
AUTHOR="R. Franck",
TITLE="Rechnernetze und Datenkommunikation",
ISBN="3-540-15152-4",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin, Germany",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Computer network; communication protocol; data",
ABSTRACT="Klassifikation von Rechnernetze; Dienstleistungen eines
Rechnernetz; Verwaltung und Betrieb eines Rechnernetz; Lokale Netze;
Entwicklungsperspektiven der Datenkommunikation",
}

@ARTICLE{Gopa86:Dynamic,
AUTHOR="I. Gopal and A. Segall",
TITLE="Dynamic Address Assignment in Broadcast Networks",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=1,
PAGES="31-37",
YEAR=1986,
KEYWORDS="Broadcast; protocol engineering",
ABSTRACT="In this paper we consider the problem of dynamically assigning
addresses to stations attached to a broadcast network. We prese nt a
distributed protocol which guarantees that a new station will eventually
be assigned an address if one is free, and furthermore, that no two
stations on the network will have the same address. We show how the
protocol can be simplified in certain specific environments.",
}

@ARTICLE{Gree86:Protocol,
AUTHOR="P. E. Green",
TITLE="Protocol Conversion",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=3,
PAGES="257-268",
YEAR=1986,
KEYWORDS="Communication network; communication protocol; gateway",
ABSTRACT="The difficulty of interconnecting networks or network
componentswhen they obey different architectures is an important
inhibitorto computer communication growth and flxibility. This paper
reviews the state of the protocol conversion art from the architectural
point of view. The aim is to state the problem succinctly, propose
consistent definitions, review current ad hoc solutions, and speculate
about more effective and general methodologies.",
}

@ARTICLE{Heym86:Effects,
AUTHOR="D. P. Heyman",
TITLE="The Effects of Random Message Sizes on the Performance of the
{CSMA/CD} Protocol",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="547-553",
YEAR=1986,
KEYWORDS="LAN; CSMA/CD; performance evaluation",
ABSTRACT="We present a performance model of the carrier-sense
multiple-access protocol with collision detection when each message
consistsof a geometrically distributed number of pacets. We solve the
model analytically and present numerical evidence that throughput
degrades slightly when the mean number of packets per message
isincreased and the load is kept constant. The numerical examples
indicate that the everage response time of a message is approxi",
}

@ARTICLE{Hou86:Transmission,
AUTHOR="T.-C. Hou and V. Li",
TITLE="Transmission Range Control in Multihop Packet Radio Networks",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=1,
PAGES="38-44",
YEAR=1986,
KEYWORDS="Packet radio; multihop; performance evaluation",
ABSTRACT="This paper presents a model for analyzing the performance of
transmission strategies in a multihop packet radio network where each
station has adjustable transmission radius. A larger transmission radius
will increase the probability of finding a receiv er in the desired
direction and contribute bigger progress if the transmission is
successful, but it also has a higher probability of collision with other
transmissions.",
}

@ARTICLE{Mura86:Decomposition,
AUTHOR="K. Muralidhar and M. Sundareshan",
TITLE="On the Decomposition of Large Communication Networks for
Hierarchical Control Implementation",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=10,
PAGES="985-987",
YEAR=1986,
KEYWORDS="Communication network; hierarchical network; decomposition",
ABSTRACT="In the implementation of hierarchical schems for the adaptive
control of large communication networks, decomposition of the overall
network into node clusters and assignment of a supervisor for each
cluster are of central importance. A formulation of thedecomposition
problem as a mathematical optimization problem is given and an algorithm
for solution is presented.",
}

@ARTICLE{Rubi86:Terminal,
AUTHOR="I. Rubin and J. Baker",
TITLE="Performance Analysis for a Terminal-Priority Contentionless
Access Algorithm for Multiple-Access Communications",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="569-575",
YEAR=1986,
KEYWORDS="Access control; performance evaluation; broadcast",
ABSTRACT="We consider a multiple-access broadcast communication channel
which serves a network of terminals, each characterized by a distinet
priority level. Higher priority terminals require, on the average,
faster access across the communication channel than lowerpriority ones.
We present a terminal priority contentionaless access control scheme for
sharing such a channel on a conflict-free basis.",
}

@ARTICLE{Syka86:Queueing,
AUTHOR="E. Sykas and D. Karvelas and E. Protonotarios",
TITLE="Queueing Analysis of Some Buffered Random Multiple Access
Schemes",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=8,
PAGES="790-798",
YEAR=1986,
KEYWORDS="Queueing system; ALOHA; performance evaluation; TDMA; time
division multiple access",
ABSTRACT="A queueing model appropriate for the analysis of
multipleaccess schemes with finite user buffer capacity is proposed.
This modelcan be applied to serveral slotted random multiple-access sche
mes, such as the URN, ALOHA, random TDMA channels. The examined system,
in general, can be modeled as a multidimensional Markov chain. The
enormous state space for its complete description makes numerical
analysis intractable.",
}

@ARTICLE{Szpa86:Bounds,
AUTHOR="W. Szpankowski",
TITLE="Bounds for Queue Lengths in a Contention Packet Broadcast
System",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=11,
PAGES="1132-1140",
YEAR=1986,
KEYWORDS="Packet radio; broadcast; ALOHA; queue length",
ABSTRACT="A finite number of users communicating through a broadcast
channel is considered. Each user has a buffer of infinite capacity, and
a user randomly access the channel. Moreover, only one pack et per user
might be sent in an access time. Both symmetric and asymmetric models
are considered; that is, we assume either indistinguishable or
distinguishable users. An exact analysis of thequeue lengths in that
type of system is not now available.",
}

@ARTICLE{Tasa86:SRUC,
AUTHOR="S. Tasaka and K. Ishida",
TITLE="The {SRUC} Protocol for Satellite Packet Communication --- A
Performance Analysis",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=9,
PAGES="937-945",
YEAR=1986,
KEYWORDS="Satellite communication; performance evaluation; ARQ",
ABSTRACT="SRUC is an adaptive multiple access protocol which combines
the slotted ALOHA protocol and a reservation protocol; it switches from
one to the other according to the state of the channel. Th is paper
studies SRUC with a go-back ARQ scheme in a satellite communication
environment to improve the performance over SRUC with a stop-and-wait
ARQ scheme previously studiet. The performance of SRUC/GBN is analyzed
in this paper.",
}

@ARTICLE{Wies86:Discrimination,
AUTHOR="Jeffrey E. Wieselthier and Anthony Ephremides",
TITLE="Discrimination Against Partially Overlapping Interference - Its
Effect on Throughput in Frequency - Hopped Multiple Access Channels",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=2,
PAGES="136-142",
YEAR=1986,
KEYWORDS="Packet radio; multihop; throughput analysis",
ABSTRACT="In this paper we derive the probability of correct pacet
reception and the resulting channel throughput achivable in an
asynchronous slow-freuquency-hopped multiple user channel. Reed-Solomon
coding is used to correct erros caused by other-user-interference in an
otherwise noiseless channel. We analyze and evaluate an $M$-ary FSK
signaling scheme, which permits the discrimination against interfering
signals that are present for a sufficiently",
}

@ARTICLE{Kell86:Blocking,
AUTHOR="F. P. Kelly",
TITLE="Blocking probabilities in large circuit-switching networks",
JOURNAL=aap,
VOLUME=18,
PAGES="473-505",
YEAR=1986,
REFERENCES=31,
KEYWORDS="Loss probability; Erlang B formula; circuit switching",
ABSTRACT="The paper deals with blocking and loss probabilities in C/S
networks. Study of the limiting regime.",
}

@ARTICLE{Burr86:FDDI,
AUTHOR="W. R. Burr",
TITLE="The {FDDI} Optical Data Link",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=5,
PAGES="18-23",
YEAR=1986,
REFERENCES=1,
KEYWORDS="FDDI; physical layer; fiber optics; standard",
ABSTRACT="The article focusses on the Physical Medium Dependent (PMD)
layer of the FDDI.",
}

@ARTICLE{Ever86:Simple,
AUTHOR="David Everitt",
TITLE="Simple Approximations for Token Rings",
JOURNAL=ieeecom,
VOLUME=34,
NUMBER=7,
PAGES="719-721",
YEAR=1986,
REFERENCES=7,
KEYWORDS="Token ring; performance evaluation; approximation; waiting",
ABSTRACT="In the article a new conservation law for the waiting times at
a token ring is used to develop simple approximations to the waiting
times at individual queues. The approximation developed is easily
calculated on a pocket calculator, and is more accurate than earlier
approximations.",
}

@ARTICLE{Ferg86:Computation,
AUTHOR="M. J. Ferguson",
TITLE="Computation of the Variance of the Waiting Time for Token Rings",
JOURNAL=ieeejsac,
PAGES="775-782",
YEAR=1986,
REFERENCES=12,
KEYWORDS="Token ring; waiting time; distribution; variance",
ABSTRACT="The main result in the paper is a simple expression for the
variance of the waiting time for a token ring with an infinite number of
stations, nonsymmetric Poisson traffic, deterministic ring delays, and
virtually identical service distributions. The exact equations for
obtaining the variance of the waiting time for arbitrary traffics and
service densities are found.",
}

@INBOOK{Kell86:LAN,
AUTHOR="K. H. Kellermayr",
TITLE="{LAN-Planungs-} und Bewertungsaspekte",
BOOKTITLE="Springers Angewandte Informatik: Lokale Computernetze -LAN-",
PUBLISHER="Springer Verlag",
PAGES="193-204",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="LAN; design; performance evaluation; survey",
ABSTRACT="This article is the ninth chapter of the book Lokale
Computernetze (LAN) about aspects of design and valuation. The valuating
LANs under the aspects of performance, cost, quality and strategy.",
}

@ARTICLE{Kimu86:Diffusion,
AUTHOR="G. Kimura and Yutaka Takahashi",
TITLE="Diffusion Approximation for a Token Ring System with
Nonexhaustive Service",
JOURNAL=ieeejsac,
VOLUME=4,
NUMBER=6,
PAGES="794-801",
YEAR=1986,
REFERENCES=22,
KEYWORDS="Performance evaluation; token ring; approximation",
ABSTRACT="The paper derives approximation formulas for a token ring
system with nonexhaustive service, which is commonly used in LANs. In
order to obtain performance measures, the token ring system is regarded
as a multiqueue model with cyclic service. The approximation formula
obtained here is evaluated by comparing it to simulation results as well
as to other results presented in the literature.",
}

@ARTICLE{Mitc86:End,
AUTHOR="L. C. Mitchell and D. A. Lide",
TITLE="End-To-End Performance Modeling of Local Area Networks",
JOURNAL=ieeejsac,
VOLUME=4,
NUMBER=6,
PAGES="957-985",
YEAR=1986,
REFERENCES=46,
KEYWORDS="Modeling; LAN; queueing network; survey; case study",
ABSTRACT="A generic modeling framework for synthesizing existing
modeling techniques into a hierarchical structure for representing the
end-to-end path between subscriber devices on LANs is presented. A
survey of existing LAN models is given. The methodology is described and
a case study is presented.",
}

@MISC{Shri86:Robust,
AUTHOR="S. Shrivastava",
TITLE="Robust Distributed Systems",
BOOKTITLE="Resilient Computing Systems",
EDITOR="T. W. Anderson",
PUBLISHER="John Wiley and Sons, Inc.",
VOLUME=1,
YEAR=1986,
}

@ARTICLE{Ackr86:Approximate,
AUTHOR="M. H. Ackroyd",
TITLE="Approximate Characterisation of Nonstationary Discrete Time
{G/G/1} Systems",
JOURNAL=pe,
VOLUME=6,
NUMBER=2,
PAGES="117-124",
YEAR=1986,
REFERENCES=9,
KEYWORDS="Discrete time analysis",
}

@BOOK{Affl86:Kolloquium,
AUTHOR="L. Afflerbach and J. Lehn",
TITLE="Kolloquium über Zufallszahlen und Simulationen",
ISBN="3-519-02624-4",
PUBLISHER="Teubner",
ADDRESS="Stuttgart, Germany",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="random number generation; simulation",
ABSTRACT="Gleichverteilte Zufallszahlen; nicht-gleichverteilte
Zufallszahlen; Simulationen in verschiedenen Forschungsbereichen;
Simulationsstudien bei Übertragungssystemen",
}

@PHDTHESIS{Al86:Interconnection,
AUTHOR="N. Al-Holou",
TITLE="Interconnection networks of multiprocessor systems: general
simulation and performance analysis",
SCHOOL="University of Dayton",
ADDRESS="Dayton, Ohio",
PAGES=170,
YEAR=1986,
REFERENCES=60,
KEYWORDS="Multiprocessor system; interconnection network; simulation;
SLAM",
}

@ARTICLE{Albi86:Delays,
AUTHOR="S. L. Albin",
TITLE="Delays for Customers from Different Arrival Streams to a Queue",
JOURNAL=ms,
VOLUME=32,
PAGES="329-340",
YEAR=1986,
REFERENCES=20,
KEYWORDS="Queueing system; Superposition; Analysis",
}

@ARTICLE{Appl86:Traffic,
AUTHOR="J. M. Appleton",
TITLE="Traffic analysis of a token ring {PBX}",
JOURNAL=ieeecom,
VOLUME="COM-34",
PAGES="417-422",
YEAR=1986,
KEYWORDS="Performance evaluation; approximation; simulation; LAN; PABX;
token ring",
}

@ARTICLE{Arch86:Cache,
AUTHOR="J. Archibald and J.-L. Baer",
TITLE="Cache coherence protocols: evaluation using a multiprocessor
simulation model",
JOURNAL=tocs,
VOLUME=4,
NUMBER=4,
PAGES="273-298",
YEAR=1986,
REFERENCES=16,
KEYWORDS="Cache memory; multiprocessor system; simulation; performance
evaluation",
}

@ARTICLE{Armb86:Application,
AUTHOR="H. Armbrüster",
TITLE="Application of future broadband services",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
PAGES="429-437",
YEAR=1986,
KEYWORDS="B-isdn",
}

@PHDTHESIS{Arpi86:Parallel,
AUTHOR="D. A. Arpin",
TITLE="A parallel processor for the solution of large, sparse symmetric
linear systems",
SCHOOL="University of Washington",
ADDRESS="Washington, DC",
PAGES=300,
YEAR=1986,
REFERENCES=49,
KEYWORDS="Parallel computing; linear equation",
}

@ARTICLE{Badr86:Adaptive,
AUTHOR="Hussein Badr and D. Gelernter and S. Podar",
TITLE="An adaptive communications protocol for network computers",
JOURNAL=pe,
VOLUME=6,
NUMBER=1,
PAGES="35-51",
YEAR=1986,
REFERENCES=19,
KEYWORDS="Communication protocol; communication network; simulation;
computer network; reconfigurable network",
ABSTRACT="We study the performance of a new network communication
protocoldesigned specifically for network computers-collections of
memory-disjoint computer nodes intended to function as single machines.
Staged circuit switching is intended to combine the benefits of circuit
switching at low traffic loads with the benefits of message switching at
heavy loads, and to serve, in addition, as the basis for communication
systems that continually reconfigure",
}

@ARTICLE{Bic86:Learning,
AUTHOR="J. Bic and J. P. Gilbert",
TITLE="Learning from {AI:} new trends in database technology",
JOURNAL=ieeecomp,
PAGES="44-55",
YEAR=1986,
REFERENCES=19,
KEYWORDS="Survey; information system; artificial intelligence",
ABSTRACT="A number of novel approaches demonstrate that artificial
intelligence research is strongly influencing the development of new
generations of data management systems. (1) the incorporation of more
semantic modeling capabilities into database models. (2) the development
of better user enviroments, which include user-friendly interface and
supports different user views of the content and organization of the
data.",
}

@MISC{Bopp86:Zeitdiskrete,
AUTHOR="M. Böpple",
TITLE="Zeitdiskrete Analyse von Warteschlangensystemen mit zyklischer
Abfertigung und allgemeinen Ankunftsprozessen",
PUBLISHER="Institut f. Nachrichtenvermittlung und Datenverarb. Uni
Stuttgart",
ADDRESS="Stuttgart",
YEAR=1986,
KEYWORDS="Discrete time analysis",
}

@TECHREPORT{Brun86:Methoden,
AUTHOR="G. Brune",
TITLE="Über Methoden zur Überlastabwehr in Vermittlungssystemen mit zwei
Prioritätsklassen und unterschiedlicher Leitungsreservierung",
TYPE="Forschungsbericht",
INSTITUTION="Universität Dortmund, Lehrstuhl für Elektronische Systeme
und Vermittlungstechnik",
ADDRESS="Dortmund, Germany",
NUMBER=5,
PAGES=93,
YEAR=1986,
LANGUAGE="German",
REFERENCES=47,
KEYWORDS="Overload control; priority; queueing system",
}

@ARTICLE{Buck86:Zur,
AUTHOR="R. Buck-Emden",
TITLE="Zur optimalen Paketgröße in Rechnernetzen mit Paketvermittlung",
JOURNAL=aninf,
PAGES="118-123",
YEAR=1986,
LANGUAGE="German",
REFERENCES=13,
KEYWORDS="digital network; packet switching; packet length; network
delay",
ABSTRACT="Für rechnernetze mit Paketvermittlung wird ein adaptives
Berechnungsverfahren angegeben, das es erlaubt, in Abhängigkeit von der
aktuellen Netzbelastung die (sub-) optimale Paketgrösse für die im Netz
ausgetauschten Pakete zu ermitteln. Optimierungsziel ist dabei eine
möglichst geringe mittlere Nachrichtenverweilzeit. For a packet switched
computer network a procedure is considered to calculate the optimum
packet size for packet.",
}

@INPROCEEDINGS{Budr86:QPSX,
AUTHOR="Zigmantas L. Budrikis and J. Hullet and R. Newman and D.
Economou and  others",
TITLE="{QPSX:} A Queue Packet and Synchronous Circuit Exchange",
BOOKTITLE=iccc,
PUBLISHER="North-Holland",
ADDRESS="Munich",
PAGES="288-293",
YEAR=1986,
REFERENCES=8,
KEYWORDS="MAN; QPSX; DQDB; hybrid switching",
}

@INPROCEEDINGS{Bura86:Protocol,
AUTHOR="W. Burakowski and D. Bursztynowski and J. Lubacz",
TITLE="Protocol {HDLC-ABM:} Traffic Considerations Given Error Dependent
Channel",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="549-554",
YEAR=1986,
REFERENCES=11,
KEYWORDS="HDLC; ARQ; performance evaluation",
ABSTRACT="The purpose of the paper is to study the traffic performance
of the HDLC-ABM,2 protocol assuming dependent-error channel model.
Numerical results (analytical and simulation) are presented to evaluate
the impact of correlation of errors on the protocol's performance
characterized by maximum throughput and mean transfer time.",
}

@ARTICLE{Cant86:Information,
AUTHOR="J. Cantor and Anthony Ephremides and D. Horton",
TITLE="Information Theoretic Analysis for a General Queuing system at
equilibrium with Application to Queues in Tandem",
JOURNAL=acta,
VOLUME=23,
PAGES="657-678",
YEAR=1986,
REFERENCES=27,
KEYWORDS="Queueing system",
}

@ARTICLE{Chen86:Linear,
AUTHOR="Chi-Ming Chen",
TITLE="Linear dependencies in linear feedback shift registers",
JOURNAL=ieeetc,
VOLUME="C-",
PAGES="1086-1088",
YEAR=1986,
REFERENCES=12,
KEYWORDS="shift register sequences; reliability",
ABSTRACT="The probability of lineat dependence among $k$ bit positions
of a subset of $k$ bits in a maximum length shift register sequence is
an outstanding problem. In this correspondence, we derive a formula for
the calculation of the probability.",
}

@INPROCEEDINGS{Chra86:SDL,
AUTHOR="C. Chraibi and O. Rafiq and R. Castanet",
TITLE="{SDL} as a Testing Language",
BOOKTITLE=iccc,
PUBLISHER="North-Holland",
ADDRESS="München",
PAGES="502-506",
YEAR=1986,
REFERENCES=29,
KEYWORDS="Protocol testing",
}

@ARTICLE{Cimi86:Connecting,
AUTHOR="L. Ciminiera and A. Serra",
TITLE="A Connecting Network with Fault Tolerance Capabilities",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=6,
PAGES="578-580",
YEAR=1986,
REFERENCES=15,
KEYWORDS="Interconnection Network",
}

@ARTICLE{Coll86:Initializing,
AUTHOR="B. J. Collings and G. B. Hembree",
TITLE="Initializing {GFSR} pseudorandom number generators",
JOURNAL=jacm,
VOLUME=33,
PAGES="706-711",
YEAR=1986,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Conw86:RECAL,
AUTHOR="A. E. Conway and Nicolaos D. Georganas",
TITLE="{RECAL} - a new efficient algorithm for the exact analysis of
multiple-chain closed queueing networks",
JOURNAL=jacm,
VOLUME=33,
PAGES="768-791",
YEAR=1986,
KEYWORDS="Queueing system; MVA",
}

@INPROCEEDINGS{Dane86:Experience,
AUTHOR="A. Danet and J. M. Simon",
TITLE="Experience of a Second Generation Routing Algorithm in
{TRANSPAC}",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="446-450",
YEAR=1986,
REFERENCES=3,
KEYWORDS="TRANSPAC; packet switching; network; routing algorithm",
ABSTRACT="The paper describes the principles of the routing algorithm,
the difficulties and methods of the change-over which took place in
1984, the operational advantages and performances experienced during two
years of operation.",
}

@INPROCEEDINGS{Dani86:Functional,
AUTHOR="W. Daniel and H. Friedel and R. Lehnert and W. Lemppenau and P.
Tran-Gia",
TITLE="Functional testing and testing under load conditions of real-time
software in {SPC} switching systems",
BOOKTITLE="6th international conference on software engineering in
telecommunication switching systems (SETSS86)",
ADDRESS="Eindhoven",
YEAR=1986,
REFERENCES=5,
KEYWORDS="Environment simulation; test tool; UNES; universal environment
simulator",
}

@PHDTHESIS{DaRe86:Interconnected,
AUTHOR="M. Da Re",
TITLE="Performance evaluation of interconnected token-ring local area
networks",
SCHOOL="Florida Atlantic University",
ADDRESS="Boca Raton, Florida",
PAGES=98,
YEAR=1986,
REFERENCES=21,
KEYWORDS="LAN; token ring; gateway; performance evaluation; end-to-end
delay; approximation",
}

@ARTICLE{Davi86:Karmarker,
AUTHOR="M. David and K. Karmarker and  others",
TITLE="The Karmarker algorithm: adding wings to linear programming",
JOURNAL=attr,
PAGES=7,
YEAR=1986,
KEYWORDS="Linear programming; algorithm",
}

@BOOK{Deas86:X,
AUTHOR="R. J. Deasington",
TITLE="{X.25} Explained: protocols for packet switching networks",
EDITION="2nd ed.",
ISBN="0-7458-0110-2",
PUBLISHER="Ellis Horwood Ltd Publishers",
ADDRESS="Chichester",
PAGES=131,
YEAR=1986,
REFERENCES=16,
KEYWORDS="Packet switching; X.25; survey; reference",
ABSTRACT="Compact but good handbook.",
}

@MISC{Debu86:Switching,
AUTHOR="P. L. Debuysscher and J. G. Bauwens and M. de Somer",
TITLE="Switching system",
PUBLISHER="European patent application 0 231 967 20.01.87 priority
24.01.86 BE 2060910",
ADDRESS="Antwerp",
PAGES=12,
YEAR=1986,
KEYWORDS="ATM; switching system",
}

@MISC{Deci86:Special,
AUTHOR="M. Decina and Wesley M. Gifford and S. Potter and A. A. Robrock
and  others",
TITLE="Special issue on {ISDN}",
PUBLISHER="ieeejsac",
VOLUME="SAC-4",
PAGES="313-424",
YEAR=1986,
KEYWORDS="Digital network; isdn",
ABSTRACT="This special isdn-issue is devoted to international standards
and trials and is composed of invited papers only.",
}

@ARTICLE{Pryc86:Reference,
AUTHOR="M. de Prycker",
TITLE="Reference Models for a Fast Packet Based Network",
JOURNAL=comcom,
VOLUME=9,
NUMBER=6,
PAGES="299-302",
YEAR=1986,
REFERENCES=9,
KEYWORDS="ATM",
}

@MISC{Dias86:Distributed,
AUTHOR="Daniel M. Dias and M. Kumar and Y.-C. L. Lien and K. Maruyama",
TITLE="Distributed voice-data switching on multi-stage interconnection
networks",
PUBLISHER="European Patent Application 0 243 692 priority 28.04.86 US
856321",
ADDRESS="Armonk, NY",
PAGES=21,
YEAR=1986,
KEYWORDS="Switching network; packet switching; ATM",
}

@ARTICLE{Dinn86:Karmarker,
AUTHOR="N. Dinn and K. Karmarker and  others",
TITLE="Karmarker algorithm enables interactive planning of networks",
JOURNAL=attr,
PAGES=3,
YEAR=1986,
KEYWORDS="Network planning; interactive; Linear programming; algorithm",
}

@INPROCEEDINGS{Dinn86:IFROPS,
AUTHOR="N. Dinn and L. P. Sinha and J. L. Hammond Jr and R. S.
Libenschek",
TITLE="{IFROPS} - International Facilities Relief Optimization Planning
System",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
VOLUME=3,
PAGES="0871-0876 (25.5)",
YEAR=1986,
REFERENCES=5,
KEYWORDS="Network planning",
ABSTRACT="The problem of planning international transmission facilities
is addressed. As an example, some of the key planning issues are
identified relative to the Pacific basin planning problem. A planning
model and an algorithmic approach are identified, and the results are
compared with earlier capabilities.",
}

@ARTICLE{Dorf86:Concept,
AUTHOR="G. Dörfel",
TITLE="The concept of the $m\times n$ feedback {SR} generator",
JOURNAL=aeu,
VOLUME=40,
PAGES="213-218",
YEAR=1986,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Duda86:Diffusion,
AUTHOR="A. Duda",
TITLE="Diffusion approximation for time-dependent queueing systems",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="905-918",
YEAR=1986,
REFERENCES=53,
KEYWORDS="Diffusion approximation; time dependent queueing system;
GI/GI/1; transient diffusion model; adaptive routing",
}

@ARTICLE{Effe86:OSI,
AUTHOR="W. Effelsberg and A. Fleischmann",
TITLE="Das {OSI-Referenzmodell} für offene Systeme und seine sieben
Schichten",
JOURNAL=infspec,
NUMBER=9,
PAGES="280-299",
YEAR=1986,
LANGUAGE="German",
REFERENCES=32,
KEYWORDS="Protocol engineering",
}

@ARTICLE{Eklu86:Channel,
AUTHOR="B. Eklundh",
TITLE="Channel Utilization and Blocking Probability in a Cellular Mobile
Telephone System with Directed Retry",
JOURNAL=ieeecom,
VOLUME="COM-34",
PAGES="329-337",
NOTE="also in Proc. 11th ITC, Kyoto, Japan, 1985",
YEAR=1986,
KEYWORDS="Mat",
ABSTRACT="directed retry: capacity dependant base station selection",
}

@ARTICLE{Ensl86:Special,
AUTHOR="P. F. Reynolds Jr",
TITLE="Special issue: {ICCC}",
JOURNAL=cnis,
VOLUME="nov",
PAGES="207-275",
YEAR=1986,
KEYWORDS="Special issue; computer network; reliability; legal
restriction; conference report",
ABSTRACT="Special issue on ICCC. Includes a comprehensive review of
alltalks held in all sessions of ICCC, besides several keynote
addresses.",
}

@TECHREPORT{Ever86:Integrated,
AUTHOR="David Everitt",
TITLE="Performance evaluation of integrated services on a multicellular
mobile radiotelkphone network",
INSTITUTION="Telecom Australia, switching and signalling branch",
NUMBER=125,
YEAR=1986,
KEYWORDS="Mat",
}

@ARTICLE{Fey86:Hilbert,
AUTHOR="P. Fey",
TITLE="Die Hilbert-Transformation in der Elektrotechnik",
JOURNAL=nte,
VOLUME=6,
PAGES="337-",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Mathematics; Hilbert transform",
}

@INPROCEEDINGS{Fink86:Contribution,
AUTHOR="B. Fink and Ulrich Killat and J. Sobolewski",
TITLE="A contribution to the end-to-end performance in local area
networks",
BOOKTITLE=iccc,
EDITOR="P. J. Kühn",
PUBLISHER="North-Holland",
ADDRESS="Munich, Germany",
PAGES="567-571",
YEAR=1986,
REFERENCES=2,
KEYWORDS="Theory; LAN; protocol; simulation; end-to-end delay; logical
link control; media access control; reaction time; access protocol",
}

@INPROCEEDINGS{Fisc86:Protocol,
AUTHOR="W. Fischer and E. H. Göldner",
TITLE="Performance of the D-Channel Protocol - A Simulation Study",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="612-618",
YEAR=1986,
KEYWORDS="ISDN; simulation; D-channel",
ABSTRACT="Nicht kopiert",
}

@ARTICLE{Fish86:Exhaustive,
AUTHOR="G. S. Fishman and L. R. Moore",
TITLE="An exhaustive analysis of multiplicative congruential random
number generators with modulus 2**31 - 1",
JOURNAL="SIAM Journal Science statistics computing",
VOLUME=7,
NUMBER=1,
PAGES="24-45",
YEAR=1986,
REFERENCES=29,
KEYWORDS="random number generation; linear congruential generator;
statistical test",
ABSTRACT="The paper presents an exhaustive search to find optimal full
period multipliers for the multiplicative congruential random number
generation with prime modulus 2**31 - 1. Here a multiplier is said to be
optimal if the distance between adjacent parallel hyperplanes on which
k-tupels lie does not exceed the minimal achievable distance by more
than 25 percent for k=2..6. This criterion is considerably more
stringent than prevailing standards",
}

@ARTICLE{Flet86:Queueing,
AUTHOR="G. Y. Fletcher and Harry Perros and W. J. Stewart",
TITLE="A queueing network model of a circuit switching scheme in a
integrated services environment",
JOURNAL=ieeecom,
VOLUME="COM-34",
PAGES="25-30",
YEAR=1986,
REFERENCES=18,
KEYWORDS="Numerical result; iterative method; MX/M/N/S; Performance
evaluation; utilization; queue length; model; integrated network",
ABSTRACT="A closed cyclic queueing system with multiple classes is
analyzed numerically. The queueing system was originally motivated by
aneed to model circuit switching traffic in a data multiplexing scheme
which provides both circuit and switching capabilities. The queueing
system consistis of two nodes, a primary and a secondary node. Customers
in the primary node may require a random number of servers
simultaneously. The secondary node simply provide",
}

@ARTICLE{Foth86:Sprach,
AUTHOR="E. Foth",
TITLE="Sprachübertragung in lokalen Paketnetzen",
JOURNAL=nte,
ADDRESS="Berlin",
VOLUME=36,
NUMBER=12,
PAGES="448-452",
YEAR=1986,
LANGUAGE="German",
REFERENCES=28,
KEYWORDS="LAN; Voice/data integration",
}

@INPROCEEDINGS{Free86:OSI,
AUTHOR="D. Freestone",
TITLE="{OSI} Architecture - A Mathematical Framework",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="485-490",
YEAR=1986,
REFERENCES=7,
KEYWORDS="Protocol",
ABSTRACT="This paper presents a mathematical framework for the
architecture of Open Systems Interconnection (OSI). It uses a branch of
mathematics rather than any particular Formal Description Technique
(FDT), but sketches how translations could be made into certain FDTS. An
outline of the mathematical style is given, together with example
descriptions and a proof. We believe that this approach is novel and
that it can give important insights and benefi",
}

@ARTICLE{Gali86:Efficient,
AUTHOR="Z. Galil",
TITLE="Efficient Algorithms for Finding Maximum Matching in Graphs",
JOURNAL=acmcs,
VOLUME=18,
NUMBER=1,
PAGES="23-37",
YEAR=1986,
REFERENCES=23,
KEYWORDS="Algorithm; Theory; Verification; Graph Theory",
}

@INPROCEEDINGS{Gamb86:High,
AUTHOR="D. Gamberger",
TITLE="High-Speed Routing Algorithms based on Integer Residue Number
Arithmetic",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="637-642",
YEAR=1986,
REFERENCES=8,
KEYWORDS="Routing algorithm",
ABSTRACT="In this paper a possibility of increasing execution speed of
the optimization algorithms for routing in message-switched networks,
using integer arithmetic instead of floating point arithmetic is
considered. Especially, the use of the integer arithmetic based on the
residue number system, which leads directly to parallelism in the
arithmetic operation execution is analysed. The use of the integer
arithmetic introduces some new problems into alg",
}

@INPROCEEDINGS{Gerl86:Integrated,
AUTHOR="M. Gerla and R. A. Pazos",
TITLE="Design of integrated packet and circuit switching networks",
BOOKTITLE=globecom,
VOLUME=3,
PAGES="1589-1593",
YEAR=1986,
REFERENCES=6,
KEYWORDS="Hybrid system; Analysis",
}

@ARTICLE{Ghos86:Parallel,
AUTHOR="R. K. Ghosh and  others",
TITLE="Parallel algorithm for shortest paths",
JOURNAL="IEE Proceedings, Part E",
VOLUME=133,
NUMBER=2,
PAGES="87-92",
YEAR=1986,
REFERENCES=6,
KEYWORDS="Routing algorithm; SIMD",
}

@ARTICLE{Gigl86:Lower,
AUTHOR="J. Giglmayr",
TITLE="On the lower and upper bound for the steady-state availability of
systems",
JOURNAL=ntzarchiv,
VOLUME=8,
NUMBER=4,
PAGES="87-90",
YEAR=1986,
REFERENCES=6,
KEYWORDS="Reliability; availability",
}

@ARTICLE{Gigl86:Repair,
AUTHOR="J. Giglmayr",
TITLE="On the repair of two classes of components",
JOURNAL=ntzarchiv,
VOLUME=8,
NUMBER=2,
PAGES="45-47",
YEAR=1986,
REFERENCES=47,
KEYWORDS="Reliability; availability",
}

@ARTICLE{Gone86:Fast,
AUTHOR="P. Gonet",
TITLE="Fast Packet Approach to Integrated Broadband Networks",
JOURNAL=comcom,
VOLUME=9,
NUMBER=6,
PAGES="292-298",
YEAR=1986,
REFERENCES=8,
KEYWORDS="BISDN; ATM",
}

@INPROCEEDINGS{Gonz86:Global,
AUTHOR="O. Gonzalez Soto and J. M. Sarandeses",
TITLE="Global simulation for packet mode network analysis",
BOOKTITLE="3rd International Network Symposium",
PAGES="108-111",
YEAR=1986,
REFERENCES=9,
KEYWORDS="Simulation; packet switching; communication network",
}

@INPROCEEDINGS{Gord86:Examples,
AUTHOR="R. L. Gordon and E. A. MacNair and Peter D. Welch and K. D.
Gordon and  others",
TITLE="Examples of using the research queueing package modeling
environment {(RESQME)}",
BOOKTITLE="winter simulation conference",
PAGES="494-503",
YEAR=1986,
REFERENCES=29,
KEYWORDS="Queueing system; MVA; simulation; computer animation; RESQ;
research queueing package",
}

@ARTICLE{Gorg86:Optimal,
AUTHOR="C. Görg",
TITLE="Evaluation of the optimal {SRPT} strategy with overhead",
JOURNAL=ieeecom,
VOLUME="COM-34",
PAGES="338-344",
YEAR=1986,
REFERENCES=12,
KEYWORDS="Queueing system; preemptive priority; SRPT; shortest remaining
processing time",
}

@PHDTHESIS{Guer86:Queuing,
AUTHOR="R. Guérin",
TITLE="Queuing and traffic in cellular radio",
SCHOOL="California Institute of Technology",
ADDRESS="Pasadena, California",
YEAR=1986,
KEYWORDS="MAT; queueing system",
}

@ARTICLE{Haas86:Regenerative,
AUTHOR="P. J. Haas and G. S. Shedler",
TITLE="Regenerative stochastic Petri nets",
JOURNAL=pe,
ISBN="0166-5316",
VOLUME=6,
PAGES="189-204",
YEAR=1986,
REFERENCES=18,
KEYWORDS="Computer network; protocol; probability; random process;
Simulation; Application; regenerative simulation; SPN; stochastic Petri
net; semi Markov process",
ABSTRACT="The stochastic Petri net (SPN) model is well suited to formal
representation of concurrence, synchronization, and communication. The
marking process of a SPN is defined in terms of a general state space
Markov chain which describes the net at successive transition firing
times. The conditions established ensure that the marking process of an
SPN is a regenerative process and expected time between regeneration
points is finite.",
}

@BOOK{Hamm86:Local,
AUTHOR="J. L. Hammond and Peter O'Reilly",
TITLE="Performance of local computer networks",
ISBN="0-201-11530-1",
PUBLISHER="Addison Wesley",
ADDRESS="Reading, Massachusetts",
PAGES=411,
YEAR=1986,
KEYWORDS="LAN; queueing system; simulation",
}

@ARTICLE{Harr86:Enhanced,
AUTHOR="P. G. Harrison",
TITLE="An enhanced approximation by pair-wise analysis of servers for
time delay distributions in queueing networks",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=1,
PAGES="54-61",
YEAR=1986,
REFERENCES=21,
KEYWORDS="Approximation; method; queueing approximation; performance
evaluation; time in system; incremental algorithm",
ABSTRACT="An approximation for the distribution of time delays
experiencedby a customer in a network of queues is presented. We also
prove that the correltaion between the sojourn times at successive
servers on a customer's path in a closed aueueing networkwith
exponential servers is negative. The new approach taken here considers
succesive pairs of servers in a customer's path, thequeue joined on
arrival at the second having length dependent on",
}

@PHDTHESIS{Hong86:Traffic,
AUTHOR="D. Hong",
TITLE="Traffic modeling and performance analysis for cellular mobile
radio communications",
SCHOOL="State University of New York at Stony Brook",
ADDRESS="New York",
YEAR=1986,
KEYWORDS="MAT; handover",
}

@ARTICLE{Hous86:Modeling,
AUTHOR="C. E. Houstis and M. Wescott",
TITLE="Modeling and analysis of a communication switching processor",
JOURNAL=pe,
VOLUME=6,
NUMBER=1,
PAGES="11-19",
YEAR=1986,
REFERENCES=11,
KEYWORDS="Queueing system; time in system; computer network; switching
type; switching system; network design; M/G/1",
ABSTRACT="A communication switching processor is modeled as an m/g/1
queueing system with a processor sharing service discipline.
Messagesarrive at the processor according to a poisson stochastic
process. The service requirements of a message consist of various
communication functions performed at the processor and are organizedinto
a set of tasks. Each task service time is a random variablefrom a
general distribution. Tasks are assigned prescribed prior",
}

@ARTICLE{Hwan86:Nonblocking,
AUTHOR="F. K. Hwang and A. Jajszczyk",
TITLE="On nonblocking multiconnection networks",
JOURNAL=ieeecom,
VOLUME="COM-34",
PAGES="1038-1041",
YEAR=1986,
REFERENCES=10,
KEYWORDS="Switching network; Clos",
}

@ARTICLE{Jobk86:Berechnung,
AUTHOR="S. Jobke",
TITLE="Über die Berechnung von Netzknoten in {TDMA-Netzen} mit
Burst-Verkehr",
JOURNAL=ntzarchiv,
VOLUME=8,
NUMBER=6,
PAGES="147-153",
NOTE="ITC 11 paper",
YEAR=1986,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Switching; queueing system",
ABSTRACT="This paper deals with a queueing problem in a special time
division network with multiple access and transmitted receiver address
where all subscribers are connected to a branched network.  In the nodes
of the network, arriving information blocks which can not be transmitted
immediately can be stored.  The topic of the paper is the calculation of
the loss probability in the nodes of such TDMA networks.",
}

@ARTICLE{Jone86:Empirical,
AUTHOR="D. W. Jones",
TITLE="An empirical comparison of priority-queue and event-set
implementations",
JOURNAL=cacm,
VOLUME=29,
PAGES="300-311",
YEAR=1986,
REFERENCES=25,
KEYWORDS="Queueing system; priority; event set; simulation",
}

@INPROCEEDINGS{Juch86:NETCON,
AUTHOR="H. J chter and R. Lehnert",
TITLE="{NETCON} - an integrated tool for planning and configuration of
packet switching networks",
BOOKTITLE=iccc,
ADDRESS="München",
YEAR=1986,
REFERENCES=5,
KEYWORDS="Network planning; packet switching; switching system",
}

@INPROCEEDINGS{Karj86:Formal,
AUTHOR="Guenter Karjoth",
TITLE="On the Formal Specification of Protocols in Distributed
Databases",
BOOKTITLE=iccc,
PUBLISHER="North Holland",
ADDRESS="München",
PAGES="479-484",
YEAR=1986,
REFERENCES=13,
KEYWORDS="Protocol engineering; protocol specification",
ABSTRACT="The inherent complexity of distributed database protocols
demand for a formal treatment to insure that their definition is
complete and unambigious. In order to initiate system developers in the
use of formal techniques this paper first gives an introduction to
Milner's CCS, an algebra where processes interact via synchronized
communication. From a distributed database protocol which is robust in
the face of site crashes and communication outa",
}

@ARTICLE{Karm86:Karmarkar,
AUTHOR="N. K. Karmarkar and  others",
TITLE="The Karmarkar algorithm: adding wings to linear programming",
JOURNAL=attr,
YEAR=1986,
KEYWORDS="Mathematics; linear programming; network planning",
}

@ARTICLE{Kata86:Study,
AUTHOR="T. Katayama and S. Sumita and H. Inamori",
TITLE="Study on traffic design methods for resource sharing in
integratedservices networks",
JOURNAL=recl,
VOLUME=34,
PAGES="529-536",
YEAR=1986,
REFERENCES=19,
KEYWORDS="Queueing system; traffic model; service characterization",
}

@ARTICLE{Kawa86:Individual,
AUTHOR="K. Kawashima and J. Matsuda and Tadahiro Yokoi",
TITLE="Individual loss probabilities in an integrated services network",
JOURNAL=recl,
ADDRESS="Houston, Texas",
VOLUME=34,
PAGES="555-560",
YEAR=1986,
REFERENCES=8,
KEYWORDS="Loss system; overflow traffic; ISDN",
ABSTRACT="Application: INS in Japan J. Matsuda at IND in Stuttgart in
1987",
}

@ARTICLE{Kekr86:Three,
AUTHOR="H. B. Kekre and A. Kumar",
TITLE="Performance evaluation of three-stage Clos networks by
simulation",
JOURNAL="Journal of the Institution of Electronics and Telecommunication
Engineers",
PAGES="58-62",
YEAR=1986,
REFERENCES=4,
KEYWORDS="Switching network",
}

@TECHREPORT{Klei86:Bedienungssysteme,
AUTHOR="R. Kleinewillinghöfer-Kopp",
TITLE="Bedienungssysteme mit Poissonschen Gruppenankünften und
Belegungsbeschränkungen",
INSTITUTION="ftz",
ADDRESS="Darmstadt",
NUMBER="FI 032 TB 23",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Queueing system; ISDN",
}

@ARTICLE{Knei86:Zuverl,
AUTHOR="S. Kneip",
TITLE="Zuverlässigkeit von Nachrichtenübertragungssystemen",
JOURNAL=fernmeldepraxis,
VOLUME=11,
PAGES="413-427",
YEAR=1986,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="Reliability; availability",
ABSTRACT="Es werden die mathematisch exakten Formeln zur Berechnung der
Zuverlässigkeitskenngrössen von Nachrichtenübertragungssystemen
beschrieben und anhand einer Analogie die Möglichkeit zur Umrechnung der
Verfügbarkeit des Gesamtsystems auf die Verfügbarkeit eines einzelnen
Kanals erläutert.",
}

@ARTICLE{Knes86:Two,
AUTHOR="Ch. Knessl and  others",
TITLE="Two parallel queues with dynamic routing",
JOURNAL=ieeecom,
VOLUME="COM-34",
PAGES="1170-1175",
YEAR=1986,
KEYWORDS="Queueing system; dynamic routing",
}

@ARTICLE{Krit86:Model,
AUTHOR="P. S. Kritzinger",
TITLE="A Performance Model of the {OSI} Communication Architecture",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="554-563",
YEAR=1986,
REFERENCES=21,
KEYWORDS="OSI; performance evaluation",
}

@INPROCEEDINGS{Krum86:Problem,
AUTHOR="H. Krumm and O. Drobnik",
TITLE="Problem-Oriented Logical Specifications of Communication Services
and Protocols",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="474-478",
YEAR=1986,
REFERENCES=14,
KEYWORDS="Protocol engineering",
ABSTRACT="In this paper the language CSL (Communication Service
Specification Language) for the logical specification of communication
services and protocols is proposed. CSL consists of a first-order
logical language extended by meta-operators. They facilitate to keep the
formulation of problem-oriented specification compact and easy to read
as well. The semantics of CSL is defined on a general event-oriented
modeling-concept. The modeling-concept",
}

@PROCEEDINGS{Kuhn86:Proc,
TITLE="iccc",
EDITOR="P. J. Kühn",
PUBLISHER="North Holland",
ADDRESS="Munich, Germany",
YEAR=1986,
KEYWORDS="computer communication; performance evaluation",
}

@ARTICLE{Kuma86:Unbuffered,
AUTHOR="M. Kumar and J. Robert Jump",
TITLE="Performance of Unbuffered Shuffle-Exchange Networks",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=6,
PAGES="573-577",
YEAR=1986,
REFERENCES=9,
KEYWORDS="Interconnection Network; Analysis",
}

@INPROCEEDINGS{Laza86:Dynamic,
AUTHOR="V. G. Lazarev and T. P. Ponomareva",
TITLE="Dynamic Flow and Overload Control in a Packet Switching Network",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="654-658",
YEAR=1986,
REFERENCES=6,
KEYWORDS="Virtual channel; adaptive routing; flow control",
ABSTRACT="This paper deals with a dynamic congestion control including
an adaptive routing and a flow control in packet switching networks with
the virtual circuits. A technique of an adaptive routing and a call
request packets (CRP) flow control using two-level automata is
considered. The technique of the dynamic congestion control is given for
the following system characteristics: - adaptive routing anf flow
control, - throughput of the packet",
}

@ARTICLE{Lea86:Load,
AUTHOR="C. Lea",
TITLE="The load sharing Banyan network",
JOURNAL=ieeetc,
VOLUME="C-35",
PAGES="1025-1034",
YEAR=1986,
REFERENCES=15,
KEYWORDS="Switching network; Banyan network; performance evaluation;
ATM",
}

@INPROCEEDINGS{Lede86:Video,
AUTHOR="S. Lederman",
TITLE="Video-On-Demand --- A Traffic Model and {GOS} Technique",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
PAGES="676-683",
YEAR=1986,
REFERENCES=6,
KEYWORDS="Traffic Model; Queueing system; Analysis",
}

@PHDTHESIS{Lee86:Realistic,
AUTHOR="John Lee",
TITLE="A realistic approach to the design of fault tolerant
multi-processing computer systems",
SCHOOL="Northwestern university",
ADDRESS="Evanston, Illinois",
PAGES=292,
YEAR=1986,
REFERENCES=29,
KEYWORDS="Multiprocessor system; fault tolerance",
}

@PHDTHESIS{Lesz86:Modellierungs,
AUTHOR="M. Leszak",
TITLE="Modellierungs- und Simulationsinstrumentarium für
fehlertoleranteverteilte Systeme angewendet auf verteilte Datenbanken",
SCHOOL="Technical University Berlin, FB Informatik, D83",
ADDRESS="Berlin, Germany",
PAGES=347,
YEAR=1986,
LANGUAGE="German",
REFERENCES=140,
KEYWORDS="Modeling; performance evaluation; TPN; timed Petri net; fault
tolerance; database; simulation",
ABSTRACT="Modellierungswerkzeug DAEMON",
}

@ARTICLE{Levy86:Queue,
AUTHOR="H. M. Levy and L. Kleinrock",
TITLE="A queue with starter and a queue with vacations: delay analysis
bydecomposition",
JOURNAL=or,
VOLUME=14,
PAGES="426-436",
YEAR=1986,
REFERENCES=20,
KEYWORDS="Queueing system; vacation system; single server",
}

@ARTICLE{Mach86:Individual,
AUTHOR="F. Machihara and Y. Usui and Yutaka Takahashi",
TITLE="Individual overflow processes from {M1,} {M2/M1,} {M2/S/S} loss
system",
JOURNAL=recl,
VOLUME=34,
PAGES="561-567",
YEAR=1986,
REFERENCES=17,
KEYWORDS="Queueing theory; overflow traffic; loss system",
}

@ARTICLE{Mars86:Statistics,
AUTHOR="W. T. Marshall and Samuel P. Morgan",
TITLE="Statistics of Data Traffic on a Local Area Network",
JOURNAL=atttj,
ADDRESS="Murray Hill, NJ",
PAGES="1-34",
YEAR=1986,
REFERENCES=21,
KEYWORDS="Measurement; LAN; data traffic; terminal; histogram; file
transfer; user model; time sharing; diskless workstation",
}

@INPROCEEDINGS{Medi86:Virtual,
AUTHOR="J. S. Meditch and D. H.-L. Yin",
TITLE="Performance analysis of virtual time {CSMA}",
BOOKTITLE=infocom,
ADDRESS="Miami, Fl.",
PAGES="242-251",
YEAR=1986,
REFERENCES=26,
KEYWORDS="CSMA; carrier sense multiple access; performance evaluation",
}

@INPROCEEDINGS{Milc86:NETDA,
AUTHOR="D. Milch and S. L. Hantler and H. R. Gail",
TITLE="{NETDA:} A Design and Analysis Tool for {SNA} Computer Networks",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
VOLUME=3,
PAGES="1577-1583 (44.3)",
YEAR=1986,
REFERENCES=9,
KEYWORDS="Network planning",
ABSTRACT="We describe NETDA, a tool used for the design and analysis of
System Network Architecture (SNA) backbone networks. After presenting an
overview of NETDA, we discuss three problems which arise in the design
of SNA networks and the algorithms implemented in NETDA to solve them.",
}

@ARTICLE{Misr86:Distributed,
AUTHOR="J. Misra",
TITLE="Distributed discrete event simulation",
JOURNAL=acmcs,
VOLUME=18,
PAGES="39-65",
YEAR=1986,
REFERENCES=26,
KEYWORDS="Discrete event simulation; distributed simulation; deadlock",
ABSTRACT="Traditional discrete-event simulations employ an inherently
sequential algorithm in practice, simulations of large systems alimited
by this sequentiality, because only a modest number of ecan be
simulated. Distributed discrete-event simulation (carriedon a network of
processors with asynchronous message-communicaticapabilities) is
proposed as an alternative; it may provide bettperformance by
partitioning the simulation among the component",
}

@ARTICLE{Mitr86:Asymptotic,
AUTHOR="D. Mitra and J. McKenna",
TITLE="Asymptotic expansions for closed Markovian networks with
state-dependent service rates",
JOURNAL=jacm,
VOLUME="jul",
PAGES="568-592",
YEAR=1986,
REFERENCES=27,
KEYWORDS="Method; closed queueing network; decomposition; state
dependent service; performance evaluation",
ABSTRACT="A method is presented for calculating the partition function,
and from it, performance measures, for closed Markovian
stochasticnetworks with queuing centers in which the service or
processingrate depends on the center's state or load. The analysis on
which this method is based is new and a major extension of our earlier
work on load-independent queuing networks. The method gives asymptotic
expansions for the partition function in powers of 1/n",
}

@INPROCEEDINGS{Newm86:Distributed,
AUTHOR="R. Newman and J. Hullet",
TITLE="Distributed Queueing: A Fast and Efficient Packet Access Protocol
for {QPSX}",
BOOKTITLE=iccc,
PUBLISHER="North-Holland",
ADDRESS="Munich",
PAGES="294-299",
YEAR=1986,
REFERENCES=7,
KEYWORDS="MAN; QPSX; DQDB; hybrid switching; access protocol",
}

@ARTICLE{Anon86:ISDN,
AUTHOR="Anonymous",
TITLE="{ISDN} Europe 86 conference report",
JOURNAL=cnis,
PAGES="183-189",
YEAR=1986,
KEYWORDS="ISDN; conference report",
ABSTRACT="The first pan-European conference on ISDN. Pertinent issues
includes the technolgy, economics, government policies, implementation,
equipment, but, above all, the perspectives of the user who will be
asked to purchase the equipment and services.",
}

@ARTICLE{Ohar86:Traffic,
AUTHOR="K. Ohara and G. Kimura and T. Katayama",
TITLE="Traffic study of loss systems for one-way and two-way calls",
JOURNAL=recl,
VOLUME=34,
PAGES="537-544",
YEAR=1986,
REFERENCES=6,
KEYWORDS="Queueing system; server hunting strategy; broadband; service
characterization",
}

@MISC{Ohns86:Broad,
AUTHOR="H. Ohnsorge and H. Armbrüster and M. Kurachi and D. Haupt and 
others",
TITLE="Broad band communications systems",
PUBLISHER="IEEE J-SAC",
VOLUME="SAC-",
PAGES="425-648",
YEAR=1986,
KEYWORDS="Special issue; broadband; communication system",
ABSTRACT="This special issue on broad band communication systems deals
with the following topics: services, components, transmission,
switching, architectures, world wide system activities, terminals and
impacts.",
}

@INPROCEEDINGS{Pach86:Comparison,
AUTHOR="A. R. Pach",
TITLE="A performance comparison of random access packet-switched systems
with an intelligent central node",
BOOKTITLE="New communications services: A challenge to computer
technology (North Holland)",
PAGES="631-636",
YEAR=1986,
REFERENCES=9,
KEYWORDS="ATM; performance evaluation; packet switching; random",
}

@INPROCEEDINGS{Peru86:Prospect,
AUTHOR="G. Perucca",
TITLE="Prospect of research on integrated switching of voice, data and
video",
BOOKTITLE="RIENA joint conference",
ADDRESS="Rome",
PAGES="26-33",
YEAR=1986,
KEYWORDS="BISDN; ATM; traffic model",
}

@ARTICLE{Posp86:Basisanschlu,
AUTHOR="R. Pospischil and W. Thoma",
TITLE="Der Basisanschluß im {Breitband-ISDN}",
JOURNAL=ntz,
VOLUME=39,
NUMBER=12,
PAGES="810-816",
YEAR=1986,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="BISDN; design; access protocol",
}

@ARTICLE{Rafi8607:Experimental,
AUTHOR="O. Rafiq and C. Chraibi and R. Castanet",
TITLE="Experimental Testing of Transport Protocol",
JOURNAL=ccr,
VOLUME=16,
NUMBER=4,
PAGES="23-33",
MONTH="July/August",
YEAR=1986,
REFERENCES=20,
KEYWORDS="Protocol testing",
ABSTRACT="This paper descibes the interactive testing of ISO transport
protocol we carried out by using the so-called astride technique.  The
transport protocol class tested is Class 2.  So far more than two
hundred testing cases have been designed and applied.  The testing
design approach is based on empirical principles somewhat similar to
those used in compiler validation.  Testing results are discussed.",
}

@ARTICLE{Ragh86:Reliability,
AUTHOR="C. S. Raghavendra and S. V. Makam",
TITLE="Reliability Modeling and Analysis of Computer Networks",
JOURNAL=ieeer,
VOLUME="R-35",
NUMBER=2,
YEAR=1986,
KEYWORDS="computer network; availability; reliability; steady state
availability",
}

@INPROCEEDINGS{Rodo86:Express,
AUTHOR="A. Rodolfo and R. A. Pazos",
TITLE="Express pipe network design",
BOOKTITLE="Zuerich Seminar on digital communications",
ADDRESS="Zürich",
PAGES="61-68",
YEAR=1986,
REFERENCES=22,
KEYWORDS="Integrated network; packet switching; circuit switching;
packet delay; design",
}

@ARTICLE{Rose86:OSI,
AUTHOR="Marshall T. Rose and D. E. Cass",
TITLE="{OSI} transport services on top of the {TCP}",
JOURNAL=cnis,
PAGES="159-173",
YEAR=1986,
REFERENCES=32,
KEYWORDS="Osi; ccitt; protocol; map; service level",
ABSTRACT="It is desirable to offer the higher level services (i.e.,
session and above) in networks based on the arpa protocols, without
disrupting existing facilities. It is also desirable to develop
expertise with iso and ccit protocols while utilizing a robust set of
transport services. Finally, given the probable, long-term dominance of
the international standards, it is desirable to design a graceful
transition strategy from networks based on",
}

@ARTICLE{Schr86:Statistical,
AUTHOR="F. Schreiber",
TITLE="Statistical determination of unknown transition parameters in
Markow chains",
JOURNAL=aeu,
VOLUME=40,
PAGES="59-62",
YEAR=1986,
REFERENCES=17,
KEYWORDS="Statistics; Bayes statistics",
}

@ARTICLE{Schr86:Measurement,
AUTHOR="F. Schreiber",
TITLE="Measurement of the correlation coefficient of the 2-node Markov
chain",
JOURNAL=aeu,
VOLUME=40,
PAGES="402-405",
YEAR=1986,
REFERENCES=9,
KEYWORDS="Statistics; Bayes statistics",
}

@PHDTHESIS{Schw86:Verkehrstheoretische,
AUTHOR="J. Schweitzer",
TITLE="Verkehrstheoretische Modelle zur Flußregelung auf der Basis
lastabhängiger Gebühren",
SCHOOL="Universität des Saarlandes",
ADDRESS="Saarbrücken",
PAGES=164,
YEAR=1986,
LANGUAGE="German",
REFERENCES=45,
KEYWORDS="Queueing system; traffic model; switching system; telephony",
}

@INPROCEEDINGS{Selg86:Flow,
AUTHOR="J. Selga",
TITLE="Flow-Control Method for Packet Networks",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="625-630",
YEAR=1986,
REFERENCES=17,
KEYWORDS="Packet switching; flow control; virtual channel",
ABSTRACT="A new approach to Flow-Control in Packet Switching Networks is
proposed. It is based on a new definition of congestion in data
networks. The basic idea is to search for methods that operate the
network at a constant level of congestion, while having the desirable
properties of being fair and decentralizable. A particular Flow-Control
method that keeps the congestion constant is shown to be fair, in the
sense of assigning to any user a minimu",
}

@ARTICLE{Serv86:Queues,
AUTHOR="L. D. Servi",
TITLE="{D/G/1} queues with vacations",
JOURNAL=or,
VOLUME=34,
PAGES="619-629",
YEAR=1986,
REFERENCES=16,
KEYWORDS="Queueing system; vacation system; D/G/1; deterministic
traffic",
}

@PHDTHESIS{Sudh86:Modelle,
AUTHOR="H.-D. Südhofen",
TITLE="Modelle für Benutzergruppen zur Beschreibung von
Datenverkehrsflüssen in Kommunikationssystemen",
SCHOOL="RWTH Aachen",
ADDRESS="Aachen",
PAGES=162,
YEAR=1986,
LANGUAGE="German",
REFERENCES=107,
KEYWORDS="Traffic measurement; traffic model; approximation",
}

@BOOK{Kauf86:Lokale,
AUTHOR="F.-J. Kauffels",
TITLE="Lokale Netze. Systeme für den
Hochleistungs-Informationstransfer",
ISBN="3-481-33812-0",
PUBLISHER="Müller R.",
ADDRESS="Köln, Germany",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="LAN; survey",
ABSTRACT="Datenübertragung in Lokalen Netzen; Vermittlungstechniken und
Netztopologien; Systeme für Lokale Netze; Standards für Lokale Netze;
LAN-Strukturen bei IBM und Digital Equipment; Glossar",
}

@ARTICLE{Tasa86:Dynamic,
AUTHOR="S. Tasaka",
TITLE="Dynamic Behavior of a {CSMA-CD} System with a Finite Population
of Buffered Users",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="576-586",
YEAR=1986,
KEYWORDS="LAN; CSMA/CD; performance evaluation; finite population",
ABSTRACT="In packet broadcast networks with buffered users, queues of
packets at the users interfere with each other through a shared
broadcast channel. Therefore, it is difficult to analyze the performance
of such systems by classical queueing theory. This paper provides an
approximate performance analysis of a slotted nonpersistent CSMA-CD
system with a finite number of users, each having abuffer of finite
capacity.",
}

@ARTICLE{Onoz86:Effect,
AUTHOR="Y. Onozato and Jia Liu and S. Shimamoto",
TITLE="Effect of Propagation Delays on {ALOHA} Systems",
JOURNAL=cn,
VOLUME=12,
PAGES="329-337",
YEAR=1986,
REFERENCES=23,
KEYWORDS="ALOHA; performance evaluation; queueing theory; random access;
propagation delay",
ABSTRACT="Effect of propagation delays on the steady state behavior in
ALOHA systems is investigated. The basic model is introduced and
analyzed in line with catastrophe theory. The bifurcation set is given
explicitly, its analysis shows that propagation delays stabilize the
system.",
}

@ARTICLE{Pang86:Approximate,
AUTHOR="Joseph Pang and R. W. Donaldson",
TITLE="Approximate Delay Analysis and Results for Asymmetric
Token-Passing and Polling Networks",
JOURNAL=ieeejsac,
VOLUME=4,
NUMBER=6,
PAGES="783-793",
YEAR=1986,
REFERENCES=15,
KEYWORDS="Polling; approximation; performance evaluation; delay
throughput characteristics; Markov chain",
ABSTRACT="The authors develop an analytic approximation which
demonstrates the effects of system parameters on delay-throughput
performance, that becomes exact for symmetric loading. Actual results
are presented. Included is a procedure to upperbound the error of
approximation.",
}

@ARTICLE{Taki86:Polling,
AUTHOR="T. Takine and Yutaka Takahashi and Toshiharu Hasegawa",
TITLE="Performance Analysis of a Polling System with Single Buffers and
Its Application to Interconnected Networks",
JOURNAL=ieeejsac,
VOLUME=4,
NUMBER=6,
PAGES="802-812",
YEAR=1986,
REFERENCES=8,
KEYWORDS="Performance evaluation; polling; throughput; waiting time;
distribution; analysis; numerical evaluation",
ABSTRACT="The article evaluates the performance of a polling system with
single buffers. Throughput and mean waiting time are given as well as an
analysis of the probability distribution.",
}

@ARTICLE{Wieb86:Virtual,
AUTHOR="G. Wieber",
TITLE="Performance Analysis of a Virtual Circuit Protocol with Local
Control",
JOURNAL=pe,
VOLUME=6,
PAGES="175-187",
YEAR=1986,
REFERENCES=15,
KEYWORDS="Performance evaluation; packet switching; virtual channel;
blocking; queueing system; analysis",
ABSTRACT="A queuing network model for a virtual circuit with local
buffer size constrains and blocking is derived and analyzed. The
analysis is based on the decomposition of the fixed virtual route into
its individual links. A modified rejection probability, introduced to
describe the behavior at the interface more accurately, supports the
results.",
}

@ARTICLE{Yoko86:Dynamic,
AUTHOR="T. Yokohira and T. Nishida and H. Miyahara",
TITLE="Analysis of Dynamic Behavior in p-persistent {CSMA/CD} using Cusp
Catastrophe",
JOURNAL=cn,
VOLUME=12,
PAGES="277-289",
YEAR=1986,
REFERENCES=16,
KEYWORDS="CSMA/CD; performance evaluation; arrival process;
retransmission control; analysis",
ABSTRACT="The dynamic behavior of p-persistent CSMA/CD is considered
through application of the cusp catastrophe. The system performance
according to type of transition of the system state is examined. A
control strategy for avoiding drastic performance deteriorations is
considered, as well as the dependence of the stability of the system
state.",
}

@ARTICLE{Akel86:Optimal,
AUTHOR="R. Akella and P. R. Kumar",
TITLE="Optimal Control of Production Rate in a Failure Prone
Manufacturing System",
JOURNAL=ieeeac,
VOLUME="AC-31",
NUMBER=2,
PAGES="116-126",
YEAR=1986,
REFERENCES=10,
KEYWORDS="Manufacturing system; production rate; optimal inventory
level",
ABSTRACT="We address the problem of controlling the production rate of a
fprone manufacturing system so as to minimize the discounted invecost,
where certain cost rates are specified for both positive anegative
inventories, and there is a constant demand rate for thcommodity
produced.",
}

@ARTICLE{Lipp86:Assembly,
AUTHOR="E. H. Lipper and B. Sengupta",
TITLE="Assembly-like queues with finite capacity: bounds, asymptotics
andapproximations",
JOURNAL=qs,
VOLUME=1,
PAGES="67-83",
YEAR=1986,
REFERENCES=8,
KEYWORDS="Manufacturing system; approximation",
ABSTRACT="In this paper we study a queueing model of assembly-like
manufacoperations.  We assume that customers from $n$ classes arrive
according to independent Poisson processes with the same arrival rate
into aserver queueing station where the service times are exponentially
distributed.",
}

@TECHREPORT{Noh86:Machines,
AUTHOR="Y. Noh and B. Herring",
TITLE="Performance Evaluation For Machines in Blocking Series",
INSTITUTION="Department of Industrial Engineering, Auburn University",
ADDRESS="Auburn",
PAGES="12-15",
YEAR=1986,
REFERENCES=15,
KEYWORDS="Manufacturing system; performance evaluation; tandem queue",
}

@INPROCEEDINGS{Chen86:Shortest,
AUTHOR="M.-S. Chen",
TITLE="Shortest Paths in Communication Networks",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
VOLUME=3,
PAGES="1251-1257",
YEAR=1986,
REFERENCES=5,
KEYWORDS="Routing; shortest path; communication network; analysis;
random routing; graph model; probability",
}

@ARTICLE{Lydo86:TEMEX,
AUTHOR="H. Lydorf",
TITLE="{TEMEX} - Ein neuer Fernmeldedienst der Deutschen Bundespost",
JOURNAL="Jahrbuch der Deutschen Bundespost",
ISBN="3 87862 137 10",
PUBLISHER="Verlag für Wissenschaft und Leben, G. Heidecker",
ADDRESS="Bad Windsheim",
VOLUME=37,
PAGES="237-280",
YEAR=1986,
LANGUAGE="German",
REFERENCES=6,
KEYWORDS="Service characterization; overview; remote control;
interface",
}

@ARTICLE{Cant86:Computation,
AUTHOR="P. E. Cantrell",
TITLE="Computation of the Transient {M/M/1} Queue cdf, pdf, and Mean
with Generalized Q-Functions",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=8,
PAGES="814-817",
YEAR=1986,
KEYWORDS="Delay system",
}

@INPROCEEDINGS{Chu86:VLSI,
AUTHOR="Tom Chu and Kwong-Sak Leung",
TITLE="Design of {VLSI} asynchronous {FIFO} queues for packet
communicationnetworks",
BOOKTITLE="International Conference on Parallel Processing",
PAGES="397-400",
YEAR=1986,
KEYWORDS="packet switching",
}

@ARTICLE{Fish86:Asynchronous,
AUTHOR="D. G. Fisher",
TITLE="Asynchronous time division techniques in Broadband
communications",
JOURNAL="Wideband Communications",
PUBLISHER="Online Publications, Pinner UK",
YEAR=1986,
KEYWORDS="packet switching",
}

@INPROCEEDINGS{Hagi86:Slotted,
AUTHOR="H. Hagirahim and J. Hawkins",
TITLE="Performance Evaluations of a Slotted-Frame, Packet-Switched
Integrated Voice and Data Network",
BOOKTITLE="Colloquium on Packet Switching of Digital Speech and Data in
Radio Systems",
VOLUME=97,
PAGES="2.1-2.6",
YEAR=1986,
KEYWORDS="packet switching",
}

@ARTICLE{Hase86:Gruppierung,
AUTHOR="F. G. Hase and E. Hoffmann and G. Wegmann",
TITLE="Gruppierung von Richtungswahlstufen-Prinzipien und ihre
Ausführungim System {ESK} 10 000 {E.}",
JOURNAL="Informationen Fernsprech-Vermittlungstechnik",
PUBLISHER="Siemens-Halske AG",
ADDRESS="München",
NUMBER=1,
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Link system",
}

@ARTICLE{Huan86:Delay,
AUTHOR="JianJang Huang and T. Berger",
TITLE="Delay Analysis of 0.487 Contention Resolution Algorithms",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=9,
PAGES="916-926",
YEAR=1986,
KEYWORDS="packet switching",
}

@PHDTHESIS{Jobk86:Naeherungsverfahren,
AUTHOR="S. Jobke",
TITLE="Über ein Näherungsverfahren zur Berechnung von Netzknoten in
Zeitmultiplexnetzen mit Vielfachzugriff und Burst-Verkehr",
SCHOOL="Universität Dortmund, ESV",
ADDRESS="Dortmund, Germany",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Overload control; flow control; communication network",
}

@ARTICLE{Kawa86:Mixed,
AUTHOR="K. Kawashima",
TITLE="Mixed Reneval and Poisson Input Queueing Model Consisting of Many
Processors and a Finite Waiting Room",
JOURNAL=recl,
VOLUME=34,
NUMBER=4,
PAGES="481-487",
YEAR=1986,
KEYWORDS="Delay system",
}

@ARTICLE{Kott86:Untersuchung,
AUTHOR="S. Kotthoff",
TITLE="Untersuchung des Störungsgeschehens bei unvollkommenen Bündeln in
der Vermittlungstechnik mit Hilfe der Simulation",
JOURNAL=nte,
ADDRESS="Berlin 36 ?",
VOLUME=36,
NUMBER=7,
PAGES="253-255",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Grading",
}

@ARTICLE{ORei86:Data,
AUTHOR="Peter O'Reilly",
TITLE="Performance Analysis of Data in Burst Switching",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=12,
PAGES="1259-1263",
YEAR=1986,
KEYWORDS="Integrated network",
}

@ARTICLE{Okad86:Delay,
AUTHOR="H. Okada",
TITLE="Delay Behavior of Data Traffic in an Integrated {Voice/DATA}
multiplex Structure: Multi-Capacity-Limits {(MCL)} Property",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=3,
PAGES="300-303",
YEAR=1986,
KEYWORDS="Integrated network",
}

@ARTICLE{Para86:Traffic,
AUTHOR="L. M. Paratz",
TITLE="Traffic Theory of Circuit Reservation",
JOURNAL=atr,
VOLUME=20,
NUMBER=2,
PAGES="51-60",
YEAR=1986,
KEYWORDS="Control; overload control",
}

@ARTICLE{Pate86:Small,
AUTHOR="Avnish Patel and M. Purser",
TITLE="The Design of a Small Packet-Switching Node",
JOURNAL=cnis,
VOLUME=11,
PAGES="287-295",
YEAR=1986,
KEYWORDS="packet switching",
}

@ARTICLE{Pilg86:Datenpaketvermittlung,
AUTHOR="J. Pilgerstorfer",
TITLE="Datenpaketvermittlung",
JOURNAL="Elektrotechnik und Maschinenbau",
VOLUME=103,
NUMBER=11,
PAGES="530-534",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="packet switching",
}

@BOOK{Schu86:Verkehrstheorie,
AUTHOR="W. Schuberth",
TITLE="Verkehrstheorie elektronischer Kommunicationssysteme",
PUBLISHER="Dr. Alfred Hüthig Verlag",
ADDRESS="Heidelberg",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Loss system",
}

@ARTICLE{Smor86:Asymtotic,
AUTHOR="A. V. Smorodinskii",
TITLE="Asymtotic distribution of the queue length in a queueing system",
JOURNAL=arc,
VOLUME=47,
NUMBER=2,
PAGES="230-237",
YEAR=1986,
KEYWORDS="Delay system",
}

@INPROCEEDINGS{Tang86:Unified,
AUTHOR="Yarong Tang and S. G. Zaky",
TITLE="A unified queueing model for performance evaluation of local ring
networks",
BOOKTITLE=infocom,
ISBN="1059 8703 037",
PAGES="556-563",
YEAR=1986,
KEYWORDS="Data traffic; computer network",
}

@ARTICLE{Walk86:Lokale,
AUTHOR="B. Walke",
TITLE="Lokale Netze - eine neue Technologie für die digitale
Nachrichtenübermittlung",
JOURNAL=it,
VOLUME=28,
NUMBER=2,
PAGES="74-88",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Data traffic; computer network",
}

@ARTICLE{Zuke86:Queue,
AUTHOR="Moshe Zukerman and I. Rubin",
TITLE="Queue Size and Delay Analysis for a Communication System Subject
to Traffic Activity Mode Changes",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="622-628",
YEAR=1986,
KEYWORDS="Delay system",
}

@INPROCEEDINGS{Addi86:Common,
AUTHOR="S. Addicks and R. N. Nucho and L. E. Rohrbach",
TITLE="Common channel signaling: Keystone of the intelligent network",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
VOLUME=3,
PAGES="50.1 (1-6)",
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Appe86:Signaling,
AUTHOR="H. R. Appenzeller",
TITLE="Signaling system No. 7: {ISDN} user part",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=3,
PAGES="366-371",
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Anon86:Integrated,
AUTHOR="Anonymous",
TITLE="Integrated Services Digital Network",
JOURNAL=atttj,
VOLUME=65,
NUMBER=1,
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Bals86:Synthesis,
AUTHOR="Simonetta Balsamo and G. Iazeolla",
TITLE="Synthesis of queueing networks with block and state-dependent
routing",
JOURNAL="Computer Systems Science and Engineering",
VOLUME=1,
NUMBER=2,
PAGES="99-108",
YEAR=1986,
KEYWORDS="Queueing network; analysis",
}

@INCOLLECTION{Beil86:Measurement,
AUTHOR="H. Beilner",
TITLE="Measurement and simulation",
BOOKTITLE="North Holland Studies in Telecommunication: Teletraffic
Analysis and Computer Performance Evaluation",
PUBLISHER="North Holland, Amsterdam",
PAGES="133-136",
YEAR=1986,
KEYWORDS="Simulation; measurement",
}

@INPROCEEDINGS{Bock86:Universal,
AUTHOR="P. Bocker",
TITLE="Universal communication services in the communication network of
the future",
BOOKTITLE=iccc,
EDITOR="Paul J. Kuehn",
ADDRESS="München, Germany",
PAGES="5-10 (paper 1)",
YEAR=1986,
KEYWORDS="Communication network; ISDN",
}

@INPROCEEDINGS{Bona86:Traffic,
AUTHOR="M. Bonatti and A. Roveri",
TITLE="A traffic model for design choice of {ISDN} system
architectures",
BOOKTITLE="Brussels Specialists Seminar on ISDN Traffic Issues",
PAGES="1-50 (2.1)",
YEAR=1986,
}

@ARTICLE{Bond86:Influence,
AUTHOR="A. B. Bondi and W. Whitt",
TITLE="The influence of service-time variability in a closed network of
queues",
JOURNAL=pe,
VOLUME=6,
NUMBER=3,
PAGES="219-234",
YEAR=1986,
KEYWORDS="Queueing network; analysis",
}

@ARTICLE{Char86:Grade,
AUTHOR="P. Chardaire and M. Lesk",
TITLE="Grade of service and optimization of distributed packet-switched
networks",
JOURNAL=cnis,
VOLUME=12,
NUMBER=3,
PAGES="139-146",
YEAR=1986,
}

@ARTICLE{Chem86:Control,
AUTHOR="Prosper Chemouil and J. Filipiak and P. Gauthier",
TITLE="Analysis and control of traffic routing in circuit-switched
networks",
JOURNAL=cnis,
VOLUME=11,
NUMBER=3,
PAGES="203-217",
YEAR=1986,
}

@ARTICLE{Conw86:New,
AUTHOR="A. E. Conway and Nicolaos D. Georganas",
TITLE="A new method for computing the normalization constant of
multiple-chain queueing networks",
JOURNAL=infor,
VOLUME=24,
NUMBER=3,
PAGES="184-198",
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Cour86:Computable,
AUTHOR="P.-J. Courtois and P. Semal",
TITLE="Computable bounds for conditional steady-state probabilities in
large Markov chains and queueing models",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="926-937",
YEAR=1986,
}

@ARTICLE{Souz86:Calculating,
AUTHOR="E. de Souza and H. R. Gail",
TITLE="Calculating cumulative operational time distributions of
repairable computer systems",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=4,
PAGES="322-332",
YEAR=1986,
}

@TECHREPORT{Souz86:Mean,
AUTHOR="E. de Souza and S. S. Lavenberg",
TITLE="A Mean Value Analysis by Chain Algorithm for Product Form
Queueing Networks",
TYPE="Research Report",
INSTITUTION="IBM",
ADDRESS="Yorktown Heights, New York",
NUMBER="RC-11641",
PAGES="1-16",
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@BOOK{Devr86:Random,
AUTHOR="L. Devroye",
TITLE="Non-Uniform Random Variate Generation",
PUBLISHER="Springer-Verlag",
ADDRESS="New York",
YEAR=1986,
KEYWORDS="random variate generation",
}

@ARTICLE{Devr86:Grid,
AUTHOR="L. Devroye",
TITLE="Grid methods in simulation and random variate generation",
JOURNAL=comp,
VOLUME=37,
NUMBER=1,
PAGES="71-84",
YEAR=1986,
KEYWORDS="random variate generation",
}

@ARTICLE{Devr86:Automatic,
AUTHOR="L. Devroye",
TITLE="An automatic method for generating random variates with a given
characteristic function",
JOURNAL=siapp,
VOLUME=46,
NUMBER=4,
PAGES="698-719",
YEAR=1986,
KEYWORDS="random variate generation",
}

@TECHREPORT{Diet86:Leistungsfaehigkeit,
AUTHOR="W. Dieterle",
TITLE="Über die Leistungsfähigkeit virtueller Datenverbindungen
entsprechend der {CCITT-Empfehlung} {X.25}",
TYPE="Bericht über verkehrstheoretische Arbeiten",
INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung,
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
NUMBER=40,
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Communication network; window mechanism; flow control",
}

@ARTICLE{Dosh86:Queueing,
AUTHOR="B. T. Doshi",
TITLE="Queueing systems with vacations -- a survey",
JOURNAL=qs,
VOLUME=1,
NUMBER=1,
PAGES="29-66",
YEAR=1986,
KEYWORDS="Queueing system; vacation system; analysis",
}

@ARTICLE{Doug86:Common,
AUTHOR="C. J. Dougall",
TITLE="Common channel signalling -- possible future applications",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=36,
NUMBER=3,
PAGES="43-45",
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Dure86:ISDN,
AUTHOR="F. Dure",
TITLE="{ISDN} network architectures for integration of packet
capabilities",
JOURNAL="International ISDN -- Europe",
PUBLISHER="Online Publications",
ADDRESS="London",
VOLUME=1,
PAGES="121-133",
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Eage86:Bound,
AUTHOR="D. L. Eager and K. C. Sevcik",
TITLE="Bound hierarchies for multiple-class queuing networks",
JOURNAL=jacm,
VOLUME=33,
NUMBER=1,
PAGES="179-206",
YEAR=1986,
KEYWORDS="Queueing network; product form",
}

@ARTICLE{Fisc86:Protokolltestger,
AUTHOR="N. Fischer",
TITLE="Das Protokolltestgerät für zentrale Zeichengabekanäle nach
{CCITT} Nr.7 beim Test des Telephone User Part",
JOURNAL="TN-Nachrichten",
VOLUME=88,
NUMBER=88,
PAGES="49-53",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Fund86:Entwicklung,
AUTHOR="O. Fundneider",
TITLE="Die Entwicklung der öffentlichen Nachrichtennetze",
JOURNAL=it,
VOLUME=28,
NUMBER=1,
PAGES="14-22",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Communication network; ISDN",
}

@ARTICLE{Glyn86:Central,
AUTHOR="P. W. Glynn and W. Whitt",
TITLE="A central-limit-theorem version of {$L} {=<} \lambda > {W$}",
JOURNAL=qs,
VOLUME=1,
NUMBER=2,
PAGES="191-215",
YEAR=1986,
KEYWORDS="Queueing theory; Little's formula",
}

@INPROCEEDINGS{Grif86:Service,
AUTHOR="M. C. Griffith and P. S. Budihardjo and M. J. Langlois",
TITLE="800 service central office implementation",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
VOLUME=3,
PAGES="50.2 (1-7)",
YEAR=1986,
KEYWORDS="Switching system; intelligent network",
}

@INCOLLECTION{Herz86:Flexible,
AUTHOR="U. Herzog",
TITLE="Flexible networks of tightly and loosely coupled processors",
BOOKTITLE="North-Holland Studies in Telecommunication",
PUBLISHER="Elsevier Science Publishers",
ADDRESS="Amsterdam",
PAGES="439-446",
YEAR=1986,
}

@INCOLLECTION{Ho86:Equivalent,
AUTHOR="Yu-Chi Ho and P. Q. Yang",
TITLE="Equivalent network, load dependent servers, and perturbation
analysis -- an experimental study",
BOOKTITLE="North-Holland Studies On Telecommunication",
PUBLISHER="Elsevier Science Publishers",
ADDRESS="Amsterdam",
PAGES="171-189",
YEAR=1986,
KEYWORDS="Queueing network; analysis",
}

@INPROCEEDINGS{Hofr86:Two,
AUTHOR="M. Hofri",
TITLE="Two queues and one server with threshold switching",
BOOKTITLE="North-Holland Studies in Telecommunication",
PUBLISHER="Elsevier Science Publishers",
ADDRESS="Amsterdam",
PAGES="409-428",
YEAR=1986,
KEYWORDS="Queueing system; vacation system; analysis",
}

@ARTICLE{Kels86:Planning,
AUTHOR="D. R. Kelso and D. Tong",
TITLE="Network planning, design and implementation of the common channel
signalling network",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=36,
NUMBER=3,
PAGES="35-38",
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS; network planning",
}

@ARTICLE{Kero86:Composite,
AUTHOR="T. Kerola",
TITLE="The composite bound method for computing throughput bounds in
multiple class environments",
JOURNAL=pe,
VOLUME=6,
NUMBER=1,
PAGES="1-9",
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Koen86:Comments,
AUTHOR="E. Koenigsberg",
TITLE={Comments on "On normalizing constants in queueing networks" by
{P.} {G.} Harrison},
JOURNAL=or,
VOLUME=34,
NUMBER=2,
PAGES=330,
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@INCOLLECTION{Kuhn86:Modelling,
AUTHOR="P. J. Kühn",
TITLE="Modelling of new services in computer and communication
networks",
BOOKTITLE="Computer Networking and Performance Evaluation",
EDITOR="T. Hasegawaw and Christopher Carothers",
PUBLISHER="North-Holland, Amsterdam",
PAGES="283-303",
YEAR=1986,
}

@INPROCEEDINGS{Kuro86:Graphics,
AUTHOR="James F. Kurose and K. D. Gordon and R. L. Gordon and E. A.
MacNair and  others",
TITLE="A graphics-oriented modeler's workstation environment for the
{RESearch} Queueing Package {(RESQ)}",
BOOKTITLE=fjcc,
EDITOR="H. S. Stone",
ADDRESS="Dallas, Texas",
PAGES="719-728",
YEAR=1986,
KEYWORDS="Computer tool; performance evaluation",
}

@INPROCEEDINGS{McGo86:Common,
AUTHOR="R. A. McGowan",
TITLE="Common channel signaling gets services to the customers",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
VOLUME=3,
PAGES="50.3 (1-3)",
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Mill86:Management,
AUTHOR="G. Millstead",
TITLE="Network management of the common channel signalling network",
JOURNAL="Telecommunication Journal of Australia",
VOLUME=36,
NUMBER=3,
PAGES="39-41",
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@INPROCEEDINGS{Morg86:Capabilities,
AUTHOR="O. Morgenroth and H.-J. Rothamel and U. Wieland",
TITLE="Capabilities of a modern {ISDN} system",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="11-16 (A1.2)",
YEAR=1986,
KEYWORDS="ISDN",
}

@INCOLLECTION{Mura86:Mean,
AUTHOR="M. Murata and H. Takagi",
TITLE="Mean waiting times in nonpreemptive priority {M/G/1} queues with
server switchover times",
BOOKTITLE="North-Holland Studies in Telecommunication",
PUBLISHER="Elsevier Science Publishers, Amsterdam",
VOLUME=7,
PAGES="395-407",
YEAR=1986,
KEYWORDS="Queueing system; priority; analysis",
}

@INPROCEEDINGS{Ong86:Protocol,
AUTHOR="Lyndon Ong",
TITLE="Protocol interworking for {ISDN} services",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
PAGES="50.6 (1-5)",
YEAR=1986,
KEYWORDS="ISDN",
}

@INCOLLECTION{Poti86:Markovian,
AUTHOR="D. Potier and M. Veran",
TITLE="The Markovian solver of {QNAP2} and examples",
BOOKTITLE="Computer Networking and Performance Evaluation",
EDITOR="T. Hasegawa and Christopher Carothers",
PUBLISHER="North-Holland, Amsterdam",
PAGES="259-279",
YEAR=1986,
KEYWORDS="Computer tool; performance evaluation",
}

@INCOLLECTION{Reis86:Communication,
AUTHOR="M. Reiser",
TITLE="Communication-system models embedded in the {OSI-reference}
model, a survey",
BOOKTITLE="Computer Networking and Performance Evaluation",
EDITOR="T. Hasegawa and Christopher Carothers",
PUBLISHER="North-Holland, Amsterdam",
PAGES="1-27",
YEAR=1986,
}

@ARTICLE{Rose86:ISDN,
AUTHOR="K.-H. Rosenbrock",
TITLE="{ISDN} -- diensteintegrierendes digitales Fernmeldenetz",
JOURNAL="Unterrichtsblätter der Deutschen Bundespost",
VOLUME=39,
NUMBER=9,
PAGES="371-391",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="ISDN",
}

@ARTICLE{Scha8603:Cutoff,
AUTHOR="R. E. Larson and C. Schaack",
TITLE="An N-server cutoff priority queue",
JOURNAL=or,
VOLUME=34,
NUMBER=2,
PAGES="257-266",
MONTH="March/April",
YEAR=1986,
KEYWORDS="Queueing system; priority; analysis",
}

@INPROCEEDINGS{Smit86:Experience,
AUTHOR="C. U. Smith",
TITLE="Experience with tools for software performance engineering",
BOOKTITLE="Modelling Techniques and Tools for Performance Analysis 85",
EDITOR="N. A. Ata",
PUBLISHER="North-Holland, Amsterdan",
PAGES="29-40",
YEAR=1986,
LANGUAGE="English",
KEYWORDS="Computer tool; performance evaluation",
}

@INPROCEEDINGS{Stan86:Modelling,
AUTHOR="D. A. Stanford",
TITLE="Modelling priority queuing characteristics in approximate
analytical tools for open queuing networks",
BOOKTITLE="Modelling Techniques and Tools for Performance Analysis 85",
EDITOR="Stan86:Modelling",
PUBLISHER="North-Holland, Amsterdam",
PAGES="131-143",
YEAR=1986,
LANGUAGE="English",
KEYWORDS="Queueing network; analysis",
}

@ARTICLE{Stec86:Nonconcavity,
AUTHOR="K. E. Stecke",
TITLE="On the nonconcavity of throughput in certain closed queueing
networks",
JOURNAL=pe,
VOLUME=6,
NUMBER=4,
PAGES="293-305",
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@TECHREPORT{Stre86:Family,
AUTHOR="J. C. Strelen",
TITLE="A Family of Heuristic Algorithms for Closed Product-Form Queueing
Networks",
TYPE="Technical Report",
INSTITUTION="Computer Science, University of Bonn",
ADDRESS="Bonn",
NUMBER="II/86/3",
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@INCOLLECTION{As86:Transient,
AUTHOR="H. van As",
TITLE="Transient queueing analysis of a two-level global congestion
control mechanism",
BOOKTITLE="Computer Networking and Performance Evaluation",
EDITOR="T. Hasegawa and Christopher Carothers",
PUBLISHER="North-Holland, Amsterdam",
PAGES="423-435",
YEAR=1986,
}

@INCOLLECTION{Dore86:Approximate,
AUTHOR="J. van Doremalen and J. Wessels and R. Wijbrands",
TITLE="Approximate analysis of priority queueing networks",
BOOKTITLE="North-Holland Studies in Telecommunication",
EDITOR="O. J. Boxma",
PUBLISHER="North-Holland, Amsterdam",
VOLUME=7,
PAGES="117-131",
YEAR=1986,
KEYWORDS="Queueing network; analysis",
}

@ARTICLE{Wenz86:Zeichengabesystem,
AUTHOR="G. Wenzel",
TITLE="Zeichengabesystem {ZGS} Nr. 7 im {ISDN}",
JOURNAL="TN-Nachrichten",
ADDRESS="Frankfurt, Germany",
NUMBER=88,
PAGES="43-48",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Signalling; common channel; CCS",
}

@BOOK{Wirt86:Algorithmen,
AUTHOR="Niklaus Wirth",
TITLE="Algorithmen und Datenstrukturen mit Modula-2",
PUBLISHER="Teubner",
ADDRESS="Stuttgart",
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Algorithm; data structure; Modula-2",
}

@INPROCEEDINGS{N86:Intermedia,
AUTHOR="N. Merowitz",
TITLE="Intermedia - The Architecture and Construction of an {O-O}
Hypermedia System",
BOOKTITLE="OOPSLA",
PAGES="186-201",
YEAR=1986,
KEYWORDS="multimedia",
}

@BOOK{Mala86:Monte,
AUTHOR="Fla. Malabar",
TITLE="Monte carlo optimization, simulation, and sensitivity of queuing
networks: Rubinstein, Reuven {Y.}",
ISBN="0-89464-764-4",
PUBLISHER="J. Wiley",
NOTE="Reprint of original edition",
YEAR=1986,
KEYWORDS="queue; queuing theory; Monte Carlo method; book",
}

@TECHREPORT{Blac86:Eden,
AUTHOR="A. Black and E. D. Lazowska and J. D. Noe and J. Sanislo",
TITLE="The Eden Project: A Final Report",
INSTITUTION="University of Washington, Seattle, WA",
NUMBER="TR 86-11-01",
YEAR=1986,
}

@MISC{Burr86:Variable,
AUTHOR="J. W. Burren and C. J. Adams and H. Pitura and David Tennenhouse
and I. Leslie",
TITLE="Variable Data Rate Channel for Digital Network",
NOTE="UK Patent Application No. 8618424, London. (Also subject of
further UK, US, pand European patents.)",
YEAR=1986,
}

@ARTICLE{Cane8607:Hints,
AUTHOR="F. Caneschi",
TITLE="Hints for the Interpretation of the {ISO} Session Layer",
JOURNAL=ccr,
VOLUME=16,
NUMBER=4,
PAGES="34-72",
MONTH="July/August",
YEAR=1986,
REFERENCES=6,
ABSTRACT="This work originated from discussions on the interpretation of
the ISO 8327 Session Protocol and the ISO 8326 Session Service.  The
author, who participated in the development of the above mentioned
documents, discovered that many who attempted a thorough reading of
them, either for implementing the Session layer or for a better
understanding of the protocol, had a number of questions regarding the
interpretation of the documents. There are two principal reasons for
these difficulties.  First, the state table description of the protocol
in Appendix A of ISO 8326 and ISO 8327 is not formal, and thus subject
to different interpretations.  Second, there are actions which are not
explained in Appendix A, but rather are described in the text.  This
means that even after having solved all questions related to Appendix A,
one cannot be sure that an implementation is in fact correct. This paper
is intended as an aid in interpreting the documents, and to correlate
the plain text description to the state table description.",
}

@TECHREPORT{Geih86:Distributed,
AUTHOR="Kurt Geihs and H. Eberle and B. Schoener and M. Seifert",
TITLE="Distributed Object Sharing in Heterogeneous Environments",
INSTITUTION="IBM European Networking Center",
NUMBER="43.8610",
YEAR=1986,
}

@INPROCEEDINGS{Glig86:New,
AUTHOR="V. D. Gligor and  others",
TITLE="A New Security Testing Method and its Application to the Secure
Xenix Kernal",
BOOKTITLE="IEEE Symposium on Security and Privacy",
ADDRESS="Oakland, CA",
PAGES="40-58",
YEAR=1986,
}

@INPROCEEDINGS{Glig86:Secure,
AUTHOR="V. D. Gligor and  others",
TITLE="On the Design and the Implementation of Secure Xenix
Workstations",
BOOKTITLE="IEEE Symposium on Security and Privacy",
ADDRESS="Oakland, CA",
PAGES="102-117",
YEAR=1986,
}

@TECHREPORT{Goul86:Reading,
AUTHOR="A. Gould and L. Alfaro and V. Barnes and R. Finn and N.
Grischkowsky and A. Minuto",
TITLE="Reading is Slower from {CRT} Displays than from Paper: Some
Experiments that Fail to Explain Why",
INSTITUTION="IBM Research Division",
NUMBER="RC 11709 \#52588",
YEAR=1986,
}

@TECHREPORT{D86:Reading,
AUTHOR="J. D. Gould and  others",
TITLE="Reading from {CRT} Displays can be as Fast as Reading from
Paper",
TYPE="IBM Research Report",
INSTITUTION="IBM Research Division",
NUMBER="RC-12083",
YEAR=1986,
}

@INBOOK{Gree86:Sharp,
AUTHOR="A. G. Greenberg and J. Goodman",
TITLE="Sharp Approximate Models of Adaptive Routing in Mesh Networks",
PUBLISHER="Elsevier Science Publishers",
PAGES="255-270",
YEAR=1986,
}

@TECHREPORT{ISO86:Protocol,
AUTHOR="I. S. O",
TITLE="Protocol for Providing the Connectionless-Mode Network Service",
INSTITUTION="International Organization for Standardization",
NUMBER="DIS8473",
YEAR=1986,
}

@PHDTHESIS{Mogu86:Representing,
AUTHOR="J. C. Mogul",
TITLE="Representing Information About Files",
SCHOOL="Standford University",
YEAR=1986,
}

@MISC{Wesc86:Ultra,
AUTHOR="Jill Wescott",
TITLE="Ultra High Speed Networks",
CHAPTER=6,
PUBLISHER="BBN Laboratories, Inc.",
ADDRESS="Cambridge, MA",
NUMBER="P86-CISD-042",
PAGES="6.1-6.77",
YEAR=1986,
}

@ARTICLE{Wils86:See,
AUTHOR="D. R. Wilson and Ross Anderson and D. D. Clark",
TITLE="See-Through Security -- A New Approach for Authenticating End
Users in an Open Network",
JOURNAL="MISWeek",
YEAR=1986,
}

@ARTICLE