@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{Witt8604:Moving,
AUTHOR="M. Witt",
TITLE="Moving from {DoD} to {OSI} Protcols: A First Step",
JOURNAL=ccr,
VOLUME=16,
NUMBER=2,
PAGES="2-7",
MONTH="April/May",
YEAR=1986,
REFERENCES=6,
ABSTRACT="Recently, there has been a great deal of interest in the
possibility that the U.S. Department of Defense might transition to the
use of the OSI Protocol Standards.  There are many difficult issues
involved in such a transition.  This paper takes a brief look at the
general issues involved and then proposes a first step toward OSI
compatibility--the ability for DoD and OSI protocols to coexist on the
same network.  This is achieved through the implementation of a
''Dual-IP Gateway'', which supports both the DoD and OSI Internet
Protocols.",
}

@ARTICLE{John86:Reliability,
AUTHOR="Marjory Johnson",
TITLE="Reliability Mechanisms of the {FDDI} High Bandwidth Token Ring
Protocol",
JOURNAL=cnis,
VOLUME=11,
NUMBER=2,
PAGES="121-131",
YEAR=1986,
}

@TECHREPORT{Humb86:Distributed1,
AUTHOR="Pierre A. Humblet and Stuart R. Soloway",
TITLE="Distributed Algorithms for Data Networks - Part 1",
INSTITUTION="Codex Corporation",
YEAR=1986,
}

@TECHREPORT{Humb86:Distributed2,
AUTHOR="Pierre A. Humblet and Stuart R. Soloway",
TITLE="Distributed Algorithms for Data Networks - Part 2",
INSTITUTION="Codex Corporation",
YEAR=1986,
}

@BOOK{Cole86:Computer,
AUTHOR="Randolph E. Cole",
TITLE="comcom",
EDITION="2nd",
PUBLISHER="Macmillan",
ADDRESS="London",
YEAR=1986,
}

@TECHREPORT{Crow86:CMOS,
AUTHOR="Jon Crowcroft",
TITLE="{CMOS} Organisation",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1997,
YEAR=1986,
}

@TECHREPORT{Crow86:Protocol,
AUTHOR="Jon Crowcroft",
TITLE="Protocol implementations for {CMOS}",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1998,
YEAR=1986,
}

@TECHREPORT{Crow86:Gateway,
AUTHOR="Jon Crowcroft and M. Riddoch",
TITLE="Gateway Address Resolution Protocol",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1964,
YEAR=1986,
}

@BOOK{Hopp86:Local,
AUTHOR="Andrew Hopper",
TITLE="Local Area Network Design",
PUBLISHER="Addison-Wesley",
YEAR=1986,
}

@ARTICLE{Besa86:Statistical,
AUTHOR="J. Besag",
TITLE="On the statistical analysis of dirty pictures",
JOURNAL=jrss,
VOLUME=48,
PAGES="259-302",
YEAR=1986,
ABSTRACT="A continuous 2D region is partioned into a fine rectangular
array of sites or pixels, each pixel having a particular colour
belonging to a prescribed finite set. The true colouring of the region
is unknown but, associated with each pixel, there is a possibly
multivariate record which conveys imperfect information about its colour
according to a known statistical model. The aim is to reconstruct the
true scene with additional knowledge that pixels close together tend to
have the same or similar colours. In this paper it is assumed that the
local characteristics of the true scene can be represented by a non
degenerate Markhov random field. Such information can be combined with
the record by Bayes theorem and the true scene can be estimated
according to standard criteria. However, the computational burden is
enormous and the reconstruction may reflect undesirable large scale
properties of the random field. Thus, a simple, itterative method of
reconstruction is proposed, which does not depend on these large scale
characteristics. The method is illustrated by computer simulations in
which the original scene is not directly related to the assumed random
field. Some implications, including parameter estimation, are discussed.
Potential applications are mentioned briefly.",
}

@ARTICLE{Cann8606:Computational,
AUTHOR="F. J. Canny",
TITLE="A computational approach to edge detection",
JOURNAL=ieeepami,
VOLUME=8,
NUMBER=6,
PAGES="679-698",
YEAR=1986,
ABSTRACT="This paper describes a computational approach to edge
detection. The success of the approach depends on the definition of a
comprehensive set of goals for the computation of edge points. Thes
goals must be precise enough to delimit the desired behavior of the
detector while making minimul assumptions about the form of the
solution. We define detection and localisation criteria for a class of
edges, and present matamatical forms for these criteria as functionals
on the operator impulse response. A third criteria is then added to
ensure that the detector has only one resonse to a single edge. We use
the criteria in numerical optimisation to derive detectors for several
common image features, including step edges. On speciialising the
analysis to step edges we find that there is a natural uncertainty
principle between detection and localisation performance, which are the
two main goals. With this principle we derive a single operator shape
which is optimal at any scale. The optimal detector has a single
approcimate implementation in which edges are marked at maxima in
gradient magnitude in a Gaussian smoothed image. We extend this simple
detector using operators of several widths to cope with different signal
to noise ratios in the image. We present a genreal method called feature
synthesis for the fine to coarse integration of information from
operators at different scales. Finally we show that step edge detector
performance improves considerably as the operator point spread function
is extended along the edge. This detection scheme uses several elongated
operators at each point, and the directional operator outputs are
integrated with the gradient maximum detector.",
}

@INPROCEEDINGS{Clac86:Four,
AUTHOR="C. Clack and S. K. Jones",
TITLE="The four-stroke reduction engine",
BOOKTITLE="ACM Conference on LISP and functional programming",
ADDRESS="Boston, Massachusetts",
YEAR=1986,
ABSTRACT="Functional languages are widely claimed to be amenable to
concurrent execution by multiple processors. This paper presents an
algorithm for the parallel graph reduction of a functional program. The
algorithm supports transparent management of parallel tasks with no
explicit communication between processors.",
}

@INPROCEEDINGS{Clar86:Learning,
AUTHOR="P. F. Clark and T. Niblett",
TITLE="Learning {IF} {THEN} rules in noisy domains",
BOOKTITLE="Conference on AI Methods in Statistics",
PAGES="84-97",
YEAR=1986,
ABSTRACT="Automatic rule induction systems for inducing classifcation
rules from examples have already proved valuable as tools for assisting
in the task of knowledge acquistion for expert systems. For the
practical application of such induction systems, they should induce
rules which both classify new examples accurately, and are easily
comprehensible for the purposes of verification and explanation. In
particular, they should be tolerant of noise and inadequacies of the
description language used by the expert, as occur in many real-world
induction problems. This paper presents a description and empirical
evaluation of an induction system CN2, designed with the aim of inducing
short, simple, comprehensible rules in domains where problems of poor
description language and/or noise may be present. The CN2 algorithm uses
a likelihood ratio statistic as heuristic estimate of when to terminate
search for rules. In the first part of the paper the CN2 algorithm is
described, and in the second part an experimental comparison of CN2 with
other induction algorithms in 2 real-world medical domains is
presented.",
}

@BOOK{Fors86:Machine,
AUTHOR="R Forsyth and R. Rada",
TITLE="Machine Learning, Applications in Expert Systems and Information
Retrieval",
PUBLISHER="Ellis Horwood Ltd",
YEAR=1986,
KEYWORDS="Genetic algorithms",
}

@BOOK{Fros86:Knowledge,
AUTHOR="R. L. Frost",
TITLE="Introduction to knowledge based systems",
PUBLISHER="Collins",
YEAR=1986,
}

@INPROCEEDINGS{Gold86:Tail,
AUTHOR="D. Goldberg",
TITLE="A tail of two problems: Broad and efficient optimisation using
genetic algorithms",
BOOKTITLE="Computer simulation summer conference",
ADDRESS="Reno, Nevada",
PAGES="44-48",
YEAR=1986,
}

@ARTICLE{Gref8601:Optimisation,
AUTHOR="J. J. Grefenstette",
TITLE="Optimisation of control parameters for genetic algorithms",
JOURNAL=ieeesmc,
VOLUME=16,
NUMBER=1,
PAGES="122-128",
YEAR=1986,
ABSTRACT="The task of optimising a complex system presents at least two
levels of problems for the system designer. First a class of
optimisation algorithms must be chosen that is suitable for application
to the system. Second, various parameter of the optimisation algorithm
need to be tuned for efficience. A class of adaptive search procedures
called GAs has been used to optimise a wide variety of complex systems.
GAs are applied to the second level task of identifying efficient GAs
for a set of numerical optimisation problems. The results are validated
on an image registration problem. GAs are show to be effective for both
levels of the systems optimisation problem.",
}

@INPROCEEDINGS{Gref86:Approaches,
AUTHOR="J. J. Grefenstette and C. B. Pettey",
TITLE="Approaches to machine learning with genetic algorithms",
BOOKTITLE="International Conference on Systems, Man and Cybernetics",
PAGES="55-60",
YEAR=1986,
ABSTRACT="GAs have been shown to provide efficient adaptive search of
complex spaces. This paper describes two approaches to applying GAs to
the task of learning sets of rules for solving sequential tasks. A new
system is described which combines these 2 approaches to solve a
navigation task for a simulated robot.",
}

@INCOLLECTION{Hara86:Statistical,
AUTHOR="R. M. Haralick",
TITLE="Statistical image texture analysis",
BOOKTITLE="Handbook of pattern recognition and image processing",
EDITOR="T. Y. Young and K S Fu",
PUBLISHER="Academic Press",
YEAR=1986,
}

@ARTICLE{Hara8606:Context,
AUTHOR="R. M. Haralick and H. Joo",
TITLE="A Context Classifier",
JOURNAL="IEEE Transactions on Geoscience and remote sensing",
VOLUME=24,
NUMBER=6,
YEAR=1986,
}

@INCOLLECTION{Hart86:Machine,
AUTHOR="A. Hart",
TITLE="Machine induction",
BOOKTITLE="Chap 8 in Knowledge Acquisition for Expert Systems",
PUBLISHER="Cogan-Page",
PAGES="109-133",
YEAR=1986,
ABSTRACT="Simple description of classifier trees. Advocates pruning.",
}

@ARTICLE{Hill8612:Data,
AUTHOR="W. D. Hillis and G. L. Steele",
TITLE="Data parallel algorithms",
JOURNAL=cacm,
VOLUME=29,
NUMBER=12,
PAGES="1170-1183",
YEAR=1986,
ABSTRACT="Parallel computers with tens of thousands of processors are
typically programmed in data parallel style, as opposed to the control
parallel style used in multiprocessing. The success of data parallel
algorithms - even on problems that at first glance seem inherently
serial-suggests that this style of programmimg has much wider
applicability than was previously thought.",
}

@ARTICLE{Jeff86:Optimization,
AUTHOR="W. Jeffrey and R. A. Rosner",
TITLE="Optimization algorithms : simulated annealing and neural network
processing",
JOURNAL=astro,
VOLUME=310,
PAGES="473-481",
YEAR=1986,
ABSTRACT="We develop and compare 2 algorithms which have been previously
used for discrete optimization : simulated annealing and neural network
processing. We demonstrate how these algorithms can be used to find
global extrema of functions, while avoiding trapping in local extrema.
In the standard treatment of neural network processors, only quadratic
and linear terms in the function variables are included in the objective
functions. We extend this traditional approach to show how constraints
not expressable in quadratic and linear terms (eg entropy) can be
incorporated into the function to be minimised. We also demonstrate the
efficiency of our implementation of neural net processing and show how
its speed advantage over more traditional optimisation techniques (even
when implemented on serial processors) is related to its convergence
properties. An important application of our results is in the
interpretation of remote sensing data, since typoical indirect sensing
problems can be easily cast into the language of optimistation theory;
the methods presented here have the particular ability to solve ill
posed inversion problems. The algorithms described here have been
implemented on a serial processor but are cast in a form which is
ideally suited for parallel processing.",
}

@ARTICLE{Kitt86:Compatability,
AUTHOR="J. Kittler and J. Foglein",
TITLE="On compatability and support functions in probabilistic
relaxation",
JOURNAL="CVGIP",
VOLUME=34,
PAGES="257-267",
YEAR=1986,
ABSTRACT="In this paper a close relationship between probabilistic
relaxation and a compound statistic decision rule is established. This
relationship exposes a number of problems associated with the heuristic
compatibility and support functions. It is discussed how the choice of
these functions should depend on the type of contextual information to
be exploited (spatial relationship between objects, correlation of
observations). A number of examples of compatibility and support
functions corresponding to specific contextual decision rules are given.
Assumes class probs sum 1. Some assumptions seem dubious.",
}

@ARTICLE{Kitt8601:Minimum,
AUTHOR="J. Kittler and J. Illingworth",
TITLE="Minimum error thresholding",
JOURNAL=pattern,
VOLUME=19,
NUMBER=1,
PAGES="41-47",
YEAR=1986,
ABSTRACT="A computationally efficient solution to the problem of a
minimum error thresholding is derived under the assumption of object and
pixel grey level values being normally distributed. The method is
applicable in multithreshold selection. Finding the best point in a
bimodal histogram.",
}

@ARTICLE{Koo8603:Improved,
AUTHOR="J. A. Y. Koo and M. Kim",
TITLE="An improved hybrid classifier",
JOURNAL=remote,
VOLUME=7,
NUMBER=3,
PAGES="471-476",
YEAR=1986,
}

@TECHREPORT{Leav86:Hough,
AUTHOR="V. F. Leavers and Jill Boyce",
TITLE="An implementation of the Hough transform using a linear array
processor in conjunction with a {PDP/11} microprocessor",
TYPE="Report",
INSTITUTION="NPL",
NUMBER="DITC 74/86",
YEAR=1986,
ABSTRACT="The Hough transform has been implemented using a LAP in
conjunction with a PDP/11 micro-computer. The image framestore is used
as a 256x256 accumulator table. The benefits are shown to be considered
in that the need for a substantial core memory normally associated with
the generation of Hough accumulators is precluded. The fine resolution
available in Hough space has made it possible to identify the shape of
the maxima which correspond to straight line segments in image space.
Theoretical considerations have led to the exploitation of this
characteristic shape, that of a 'butterfly', to construct a filter
capable of automatically locating the maxima corresponding to straight
line segments. It is shown that the binary relations of connectedness
and parallelism may be extracted and used to formulate a 2D model of an
object. It is suggested that an extension of the treatment to a pair of
stereo images will provide sufficient information with which to
formulate a 3D model of an object.",
}

@TECHREPORT{Leav86:Automatic,
AUTHOR="V. F. Leavers and Jill Boyce",
TITLE="Automatic shape parametrisation in machine vision",
TYPE="Report",
INSTITUTION="NPL",
NUMBER="DITC 79/86",
YEAR=1986,
ABSTRACT="A fully automatic, computational method is proposed which will
allow the extraction of parameters characterising various shape
primitives in the image space from their shape indicative distributions
in a 2D parametric transform space. Uses Hough transforma and the LAP.",
}

@ARTICLE{Li8603:Tree,
AUTHOR="Xiao Li and R. C. Dubes",
TITLE="Tree classification design with a permutation statistic",
JOURNAL=pattern,
VOLUME=19,
NUMBER=3,
PAGES="229-235",
YEAR=1986,
ABSTRACT="This paper proposes a permutation statistic as a basis for
designing binary tree classifiers of D- dimensional patterns. The
statistic permits an objective and easily interpreted evaluation of a
(feature, threshold) pair that is the core of the design paradigm. It
has a known distribution that is independent of the number of training
patterns. After defining the permutation statistic and explaining its
properties the paper proposes the design procedure where by each non
terminal node is assigned a feayure and threshold on that feature. The
design procedure is demonstrated on 6 test sets and compared to designs
based on mutual information.",
}

@INPROCEEDINGS{Lubi86:Data,
AUTHOR="D. Lubinsky and D. Pregibon",
TITLE="Data analysis as search",
BOOKTITLE="Conference on AI Methods in Statistics",
PAGES="1-17",
YEAR=1986,
ABSTRACT="Describes a system to provide on-line assistance to a data
analyst (TESS).",
}

@INCOLLECTION{Maso86:Knowledge,
AUTHOR="D. C. Mason and D. G.and Cross Corr and D. Hogg and A. Tailor",
TITLE="Knowledge based segmentation of remotely sensed images",
BOOKTITLE="Mapping from Modern Imagery",
PUBLISHER="International Society for Photogrametry and Remote Sensing,
and the RSS",
PAGES="501-510",
YEAR=1986,
ABSTRACT="The paper describes progress on a UK Alvey project to develope
a system for k-b segmentation and interpretation of RS images. The
knowledge used may be about the types of structure to be expected within
the scene and their relationships, and other data sets such as existing
map data or previous classifications. A major objective is to increase
substantially the accuracy to which the image is classified. A further
use could be to update the existing map data as a result of the
segmentation.",
}

@TECHREPORT{Mich86:AQ15,
AUTHOR="R. S. Michalski and I. Mozetic and J. P. Hong and N. Lavrac",
TITLE="The {AQ15} inductive learning system: an overview and
experiments.",
TYPE="Proc. IMAL",
INSTITUTION="Universite de Paris-sud",
ADDRESS="Orsay",
YEAR=1986,
}

@ARTICLE{Nalw8606:Detecting,
AUTHOR="V. S. Nalwa and T. O. Binford",
TITLE="On detecting edges",
JOURNAL=ieeepami,
VOLUME=8,
NUMBER=6,
PAGES="699-714",
YEAR=1986,
ABSTRACT="An edge in an image corresponds to a discontinuity in the
intensity surface of the underlying scene.  It can be approximated by a
piecewise straight curve composed of edgels, ie short, linear edge
elements, each characterised by a direction and a position.  The
appraoch to edgel detection here is to fit a series of 1-D surfaces to
each window (kernal of the operator) and accept the surface description
which is adiquate in the least squares sense and has the fewest
parameters.  (A 1-D surface is one which is constant along some
direction.) The TANH is an adiquate basis for the step edge and its
combinations are adequate for the roof edge and the line edge.  The
proposed method of step edgel detection is robust with respect to noise;
for (stepsize/sigmaNoise) $>= 2.5$, it has sub-pixel position
localisation (sigmaPosition $< 1/3$) and an angular localisation better
than 10 degrees; further it is designed to be insensitive to smooth
shading.  These results are demonstrated by some simple analysis,
statistical data, and edgel images.  Also included is a coaparison of
performance on a real image, with a ty pical operator (difference of
Gaussians).  The results indicat that the proposed operator is superior
with respect to detection, localisation and resolution.",
}

@INCOLLECTION{Otto86:Propagation,
AUTHOR="G. P. Otto",
TITLE="Propagation in cellular arrays",
BOOKTITLE="Cellular Logic Image Processing",
EDITOR="M. J. B. and T. J. Duff",
PUBLISHER="Academic Press",
PAGES="41-68",
YEAR=1986,
ABSTRACT="A special feature which distinguishes the CLIP4 array from
others of its kind is a provision for the global propagation of data
through the array. The operations which permit this fast passage of data
through distances of many pixels help to overcome one of the fundemental
limitations inherent in locally connected networks of processors. They
are therefore of considerable importance but are unfortunately, amongst
the most difficult functions to understand. A substatial part of Paul
Otto's thesis 'Algorithms for image processing on the CLIP4 cellular
array processor' is concerned with the understanding and use of these
global propagation operators. The material in this chapter is drawn from
various sections of his thesis and presents a coherent description of 2
important functions of this type namely counting and object labelling.",
}

@BOOK{Peac86:Knowledge,
AUTHOR="G. Peacegood",
TITLE="A knowledge based system for the automatic recognition of linear
features in Landsat images",
PUBLISHER="School of Computing and Geography, Kingston Polytechnic",
YEAR=1986,
ABSTRACT="An evaluation of progress towards the production of a
knowledge based system for the identification of linear features in
satellite images is presented. Attention is focused on the low level
processes involved in feature extraction rather than the higher level
processes involved in feature recognition. A number of edge detection
algorithms have been tested, and the results from these are compared. In
addition, the low level processes of relaxation, edge thinning and
linking, and edge and line representation are discussed. A suitable
system for producing edge and line descriptions, as input to the short
term memory of a knowledge based system for the dual purpose of linking
line fragments to enhance segmentation results and interpreting the
results, is described. A description of the proposed architecture for
the higher level knowledge based system is also presented.",
}

@ARTICLE{Pear86:Fusion,
AUTHOR="J. Pearl",
TITLE="Fusion, propogation and structuring in belief networks",
JOURNAL=ai,
VOLUME=29,
PAGES="241-288",
YEAR=1986,
ABSTRACT={Belief networks are directed acyclic graphs in which the nodes
represent proportions (or variables), the arcs signify direct
dependencies between the linked propositions, and the strengths of these
dependencies are quantified by conditional probabilities. A network of
this sort can be used to represent the generic knowledge of a domain
expert, and it turns into a computational architecture if the links are
used not merely for storing factual knowledge but also for directing and
activating the data flow in the computations which manipulate this
knowledge. The first part of the paper deals with the task of fusing and
propagating the impacts of new information through the networks in such
a way that, when equilibrium is reached, each proposition will be
assigned a measure of belief consistent with the axioms of probability
theory. It is shown that if the network is singly connected (eg
tree-structured), then probabilities can be updated by local propagation
in an isomorphic network of parallel and autonomous processors and that
the impact of new information can be imparted to all propositions in
time proportional to the longest path in the network. The second part of
the paper deals with the problem of finding a tree-structured
representation for a collection of probabilistically coupled
propositions using auxillary (dummy) variables, colloquially called
{"}hidden cases{"}. It is shown that if such a tree-structured
representation exists, then it is possible to uniquely uncover the
topology of the tree by observing pairwise dependencies among the
available propositions (ie the leaves of the tree). The entire tree
structure, including the strengths of all internal relationships, can be
reconstructed in time proportional to $n\log n$, where $n$ is the number
of leaves},
}

@BOOK{Plum86:NPL,
AUTHOR="A. P. Plummer",
TITLE="The {NPL} Linear Array Processor: technical details",
PUBLISHER="NPL DITC",
YEAR=1986,
}

@ARTICLE{Quin8601:Induction,
AUTHOR="J. R. Quinlan",
TITLE="Induction of decision trees",
JOURNAL="Machine Learning",
VOLUME=1,
NUMBER=1,
PAGES="81-106",
YEAR=1986,
ABSTRACT="The technology for building KDSs by inductive inference from
exampoles has been demonstrated successfully in several practical
applications. This paper summarises an approach to synthesising decision
trees that has been used in a variety of systems, and it describes 1
such system, ID3 in detail. Results from recent studies show ways in
which the methodoloy can be modified to deal with information that is
noisy and/or incomplete. A reported shortcoming of the basic algorithm
is discussed and 2 means of overcoming it are compared. The paper
concludes with illustrations of current research directions.",
}

@BOOK{Rich86:Artificial,
AUTHOR="E. Rich",
TITLE="Artificial Intelligence",
PUBLISHER="McGraw-Hill",
YEAR=1986,
}

@ARTICLE{Rose86:Picture,
AUTHOR="A Rosenfeld",
TITLE="Picture processing",
JOURNAL="CVGIP",
YEAR=1986,
ABSTRACT="A huge list of references",
}

@ARTICLE{Shoz86:Edge,
AUTHOR="A. Shozaki",
TITLE="Edge detection using etropy operator",
JOURNAL="CGVIP",
VOLUME=36,
PAGES="1-9",
YEAR=1986,
}

@ARTICLE{Stan8612:Memory,
AUTHOR="C. Stanfill and D L Waltz",
TITLE="Toward memory-based reasoning",
JOURNAL=cacm,
VOLUME=29,
NUMBER=12,
PAGES="1213-1228",
YEAR=1986,
ABSTRACT="The intensive use of memory to recall specific episodes from
the past - rather than rules - should be the foundation of machine
reasoning.",
}

@ARTICLE{Turn8612:Overview,
AUTHOR="D. Turner",
TITLE="An overview of Miranda",
JOURNAL="Sigplan Notices",
VOLUME=21,
NUMBER=12,
PAGES="158-160",
YEAR=1986,
ABSTRACT="Miranda is an advanced functional programming system which
runs under UNIX. The purpose of this article is to give an overview of
Mirandas main features. The topics we shall discuss are : basic ideas;
the Miranda programming environment; guarded equations and block
structure; pattern matching; currying and higher order functions; ZF
expressions; lazy evaluation and infinite lists; polymorphic strong
typing; user defined types; type synonyms; abstract data types; separate
compilation and linking; current implementation status.",
}

@INPROCEEDINGS{Zhou86:Induction,
AUTHOR="H. Zhou and J. J. Grefenstette",
TITLE="Induction of finite automata by genetic algorithms",
BOOKTITLE="International Conference on Systems, Man and Cybernetics",
PAGES="170-174",
YEAR=1986,
ABSTRACT="The construction of finite automata with $n$ states from
examples is known to be an NP-complete problem. This paper deals with
the conceptual learning problem of constructing the finite automaton
with fewest states intended by the teacher rather than just any finite
state automaton which accurately satisfies the examples. The process of
learning is formulated as a search based on incomplete information for
finite automata equivalent to the language specified by some regular
expression. The goal of thi sresearch is to show the robustness and
effectiveness of genetic algorithms as adaptive search methods.",
}

@BOOK{Mosz86:Executing,
AUTHOR="B. Moszkowski",
TITLE="Executing Temporal Logic Programs",
PUBLISHER="CUP",
YEAR=1986,
}

@ARTICLE{Clar86:Automatic,
AUTHOR="Edmund M. Clarke and E. A. Emerson and A. P. Sistla",
TITLE="Automatic verification of finite-state concurrent systems using
temporal logic specifications",
JOURNAL=toplas,
VOLUME=8,
PAGES="244-263",
YEAR=1986,
}

@INPROCEEDINGS{Fuji86:Tokio,
AUTHOR="M. Fujita and S. Kono and H. Tanaka and T. Moto-Oka",
TITLE="Tokio: logic programming language based on temporal logic and its
compilation to Prolog",
BOOKTITLE="3rd International Conference on Logic Programming",
SERIES="LNCS",
PUBLISHER="Springer Verlag",
VOLUME=225,
PAGES="695-709",
YEAR=1986,
}

@BOOK{Bach86:Design,
AUTHOR="Maurice J. Bach",
TITLE="The Design of the Unix Operating System",
ISBN="0-13-201799-7",
PUBLISHER="Prentice-Hall",
ADDRESS="Englewood Cliffs, New Jersey",
YEAR=1986,
KEYWORDS="Unix; operating system",
}

@BOOK{Bhat86:Study,
AUTHOR="U. Narayan Bhat",
TITLE="A Study of the Queueing Systems {$M/G/1$} and {$GI/M/1$}",
SERIES="Lecture Notes in Operations Research and Mathematical
Economics",
PUBLISHER="Springer-Verlag",
ADDRESS="Berlin",
YEAR=1986,
KEYWORDS="queueing theory",
}

@ARTICLE{Irwi8601:Multiply,
AUTHOR="D. Irwin",
TITLE="A Multiply-and-Accumulate Selection Algorithm for Dynamic Entropy
Coding",
JOURNAL=ccr,
VOLUME=16,
NUMBER=1,
PAGES="5-12",
MONTH="January/February",
YEAR=1986,
REFERENCES=5,
}

@ARTICLE{Ross8601:Proposal,
AUTHOR="Giuseppe Federico Rossi and C. Garavaglia",
TITLE="A Proposal for an Improved Network Layer of a {LAN}",
JOURNAL=ccr,
VOLUME=16,
NUMBER=1,
PAGES="13-17",
MONTH="January/February",
YEAR=1986,
REFERENCES=3,
KEYWORDS="distributed systems; local networks; network layer; multicast-
oriented services",
}

@ARTICLE{Stal8601:Annotated,
AUTHOR="W. Stallings",
TITLE="An Annotated Bibliography on {ISDN}",
JOURNAL=ccr,
VOLUME=16,
NUMBER=1,
PAGES="18-31",
MONTH="January/February",
YEAR=1986,
REFERENCES=121,
}

@ARTICLE{Medi8604:Extended,
AUTHOR="M. Medina and T. I. Maude and H. Smith",
TITLE="An Extended {X.400} Architectural Model",
JOURNAL=ccr,
VOLUME=16,
NUMBER=2,
PAGES="8-14",
MONTH="April/May",
YEAR=1986,
ABSTRACT="This paper proposes an extension of the MOTIS model with a
Directory Service (DS), a Storage Service (SS), and with Group
Communication facilities. This extension has been structured into two
sublayers. 1) User Agent Sublayer, which performs the tasks needed to
provide the user with the access to all the services, along with group
communication facilities.  2) Service Agent Sublayer, which performs the
tasks needed to provide the services.  Some of the services are provided
off line, like the message transfer, and others on line, like the
directory. (This may vary due, for example, to the different urgency of
requests, and the number of Communicating Entities-CEs- involved in its
execution.)    The services are provided by following a distributed
strategy, i.e. with more than one service agent able to provide the
service in cooperation with others.  Group Communication has also been
modelled as a distributed service.  Several group agents may cooperate
in the distribution of information to widely dispersed users.",
}

@ARTICLE{Kova8607:Versus,
AUTHOR="L. Kovacs and A. Ercsenyi",
TITLE="Specification versus Implementation based on Estelle",
JOURNAL=ccr,
VOLUME=16,
NUMBER=4,
PAGES="4-22",
MONTH="July/August",
YEAR=1986,
REFERENCES=14,
ABSTRACT="The main problems of the ESTELLE communication protocol
specification language are discussed by analyzing the present version of
the ISO draft proposal language definition.  Two different directions of
the future development of ESTELLE are proposed.  The first is the
creation of the exact, formal semantic definition.  The second direction
of the language development leads to the high-level implementation
languages.  The separability technique (separate compilation ) which can
be used in the case of ESTELLE documents is investigated and a different
structuring principle is suggested.  The inner contradiction of the
module instantiation is revealed and the construction of an alternative
specification is suggested.  The ESTELLE process concept is compared
with an implementation process concept. Analyzing the structure of the
protocol specifications it is pointed out that some implementation
considerations are smuggled into the protocol specifications described
in ESTELLE.",
}

@ARTICLE{Viny8610:Waiting,
AUTHOR="J. Vinyes-Sanz and J. Riera-Garcia",
TITLE="Waiting Times in a Transport Protocol Entity Scheduler",
JOURNAL=ccr,
VOLUME=16,
NUMBER=5,
PAGES="4-12",
MONTH="October/November",
YEAR=1986,
REFERENCES=11,
}

@BOOK{Mars86:Models,
AUTHOR="J. Ajmone Marsan and G. Balbo and G. Conte",
TITLE="Performance Models of Multiprocessor Systems",
PUBLISHER="MITP",
YEAR=1986,
}

@BOOK{Lamp86:Document,
AUTHOR="Leslie Lamport",
TITLE="A Document Preparation System {LATEX}",
PUBLISHER="Addison-Wesley",
YEAR=1986,
}

@PHDTHESIS{Berr86:Time,
AUTHOR="O. Berry",
TITLE="Performance Evaluation of the Time Warp Distributed Simulation
Mechanism",
SCHOOL="University of Southern California",
YEAR=1986,
}

@BOOK{Aho86:Compilers,
AUTHOR="A. V. Aho and R. Sethi and J. D. Ullman",
TITLE="Compilers: Principles, Techniques, and Tools",
SERIES="Addison-Wesley series in computer science",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1986,
}

@INCOLLECTION{Dani86:User,
AUTHOR="Penny J. Daniels",
TITLE="The User Modelling Function of an Intelligent Interface for
Document Retrieval Systems",
BOOKTITLE="Intelligent Information Systems for the Information Society",
EDITOR="Bertram C. Brookes",
PUBLISHER="Elsevier Science Publishers",
ADDRESS="New York",
PAGES="162-176",
YEAR=1986,
}

@INCOLLECTION{Bate86:Exploratory,
AUTHOR="Marcia J. Bates",
TITLE="An Exploratory Paradigm for Online Information Retrieval",
BOOKTITLE="Intelligent Information Systems for the Information Society",
EDITOR="Bertram C. Brookes",
PUBLISHER="Elsevier Science Publishers",
ADDRESS="New York",
PAGES="91-99",
YEAR=1986,
}

@ARTICLE{Bati8604:Comparative,
AUTHOR="C Batini and M. Lenzerini and S. Navathe",
TITLE="A Comparative Analysis of Methodologies of Database Schema
Integration",
JOURNAL=acmcs,
VOLUME=18,
NUMBER=4,
PAGES="323-364",
YEAR=1986,
}

@BOOK{Papa86:Theory,
AUTHOR="C. H. Papadimitriou",
TITLE="The Theory of Database Concurrency Control",
PUBLISHER="CSPRESS",
YEAR=1986,
KEYWORDS="Concurrency Control; Database",
}

@INPROCEEDINGS{Pu86:Regeneration,
AUTHOR="C. Pu and J. D. Noe and A. Proudfoot",
TITLE="Regeneration of Replicated Objects: A Technique and Its Eden
Implementation",
BOOKTITLE="2nd International Conference on Data Engineering",
NOTE="also University of Washington TR CSD 85-04-02",
YEAR=1986,
}

@INPROCEEDINGS{Jone86:Concurrent,
AUTHOR="D. W. Jones",
TITLE="Concurrent Simulation : An Alternative to Distributed
Simulation",
BOOKTITLE=wsc,
PAGES="417-423",
YEAR=1986,
}

@INPROCEEDINGS{Uyar86:Optimal,
AUTHOR="M. Ü. Uyar and A. Dahbura",
TITLE="Optimal Test Sequence Generation for Protocols: The Chinese
Postman Algorithm Applied to {Q.931}",
BOOKTITLE=globecom,
PUBLISHER="IEEE Press",
PAGES="68-72",
YEAR=1986,
}

@INPROCEEDINGS{Favr86:Automatic,
AUTHOR="J. P. Favreau and J. R. Linn",
TITLE="Automatic Generation of Test Scenario Skeletons from Protocol
Specifications written in Estelle",
BOOKTITLE="6th International Symposium on Protocol Specification,
Testing and Verification",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
YEAR=1986,
}

@INPROCEEDINGS{Meer86:Derivation,
AUTHOR="J. de Meer",
TITLE="Derivation and validation of test Scenario Based on the Formal
Specification Language {LOTOS}",
BOOKTITLE="6th International Symposium on Protocol Specification,
Testing and Verification",
SERIES="IFIP Transactions",
PUBLISHER="North-Holland",
YEAR=1986,
}

@INPROCEEDINGS{Acce86:Mach,
AUTHOR="M. Acceta and R. Baron and W. Bolosky and D. Golub and Richard
F. Rashid and A. Tevanian and M. Young",
TITLE="Mach: A new kernel foundation for Unix development.",
BOOKTITLE="USENIX Summer Conference",
YEAR=1986,
}

@INPROCEEDINGS{Thal86:Data,
AUTHOR="M. Thaler and George S. Moschytz",
TITLE="A Data Flow Mthod for Programming a Highly Prallel Signal
Processor",
BOOKTITLE="Digital Communications International Seminar, Zuerich",
EDITOR="A. Kuendig and R. Hartman",
PAGES="219-224",
YEAR=1986,
KEYWORDS="Dataflow; resequencing; OR; kill; scheduling",
}

@MASTERSTHESIS{Böpp86:Zeitdiskrete,
AUTHOR="M. Böpple",
TITLE="Zeitdiskrete Analyse von Warteschlangensystemen mit zyklischer
Abfertigung und allgemeinen Ankunftsprozessen",
SCHOOL="Institut für Nachrichtenvermittlung und Datenverarbeitung,
Universität Stuttgart",
ADDRESS="Stuttgart, Germany",
YEAR=1986,
KEYWORDS="Discrete time analysis",
}

@PHDTHESIS{Brun86:Über,
AUTHOR="G. Brune",
TITLE="Über Methoden zur Überlastabwehr in Vermittlungssystemen mit zwei
Prioritätsklassen und unterschiedlicher Leitungsreservierung",
SCHOOL="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{Drfe86:Concept,
AUTHOR="G. Dörfel",
TITLE="The concept of the m.n feedback {SR} generator ...",
JOURNAL=aeu,
ADDRESS="Germany",
VOLUME=40,
PAGES="213-218",
YEAR=1986,
KEYWORDS="Shift register sequences",
}

@ARTICLE{Garz86:Discrete,
AUTHOR="R. F. Garzia",
TITLE="Discrete-event simulation",
JOURNAL=ieeespec,
VOLUME=23,
PAGES="32-36",
YEAR=1986,
KEYWORDS="Simulation; overview; PC; computer animation; workstation",
}

@INPROCEEDINGS{Krus86:Distribution,
AUTHOR="C. Kruskal and M. Snir and A. Weiss",
TITLE="The distribution of waiting times in clocked multistage
interconnection networks",
BOOKTITLE="International Conference on Parallel Processing",
ADDRESS="St. Charles, USA",
PAGES="12-19",
YEAR=1986,
REFERENCES=18,
KEYWORDS="Multistage interconnection network; waiting time; analysis;
simulation",
}

@ARTICLE{Anon8604:Special,
AUTHOR="Anonymous",
TITLE="Special issue on fault-tolerant computing",
JOURNAL=ieeetc,
VOLUME="C-36",
NUMBER=4,
PAGES="285-388",
YEAR=1986,
KEYWORDS="Special issue; communication network; data structure; fault
tolerance; system design",
}

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

@INPROCEEDINGS{Buze86:Modeling,
AUTHOR="J. P. Buzen",
TITLE="Design of modeling tools for computer capacity planning",
BOOKTITLE="Modelling Techniques and Tools for Performance Analysis 85",
EDITOR="N. A. Ata",
PUBLISHER="North-Holland",
ADDRESS="Netherlands",
PAGES="7-11",
YEAR=1986,
LANGUAGE="English",
KEYWORDS="Computer tool; performance evaluation",
}

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

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

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

@INPROCEEDINGS{Ahlb86:Frekvenstilldelnings,
AUTHOR="L. Ahlberg",
TITLE="Frekvenstilldelnings - Principer",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=27,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="mobile radio; cellular system",
ABSTRACT="Eftersom efterfrågan på mibiltelefontjänster bara ökar, pågår
ständigt försök att höja mobiltelefonsystemens kapacitet. Då
frekensutrymmet för mobiltelefoni är starkt begränsat söker man istället
bättre utnyttja de frekvenser som finns tillgängliga. Första steget i
denna riktning var en cellstruktur med fix frekvenstilldelning. I en
sådan delas ett område in i celler med tillhörande basstationer. Varje
basstation tilldela",
}

@ARTICLE{Akim86:Mean,
AUTHOR="H. Akimaru and A. Kagechika and H. Takahashi",
TITLE="Mean and Variance of Overflow Traffic for Time Dependent Inputs",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=3,
PAGES="238-243",
YEAR=1986,
KEYWORDS="overflow traffic",
}

@ARTICLE{Albi86:Approximation,
AUTHOR="S. L. Albin and Shi Kai",
TITLE="Approximation for the Departure Process of a Queue in a Network",
JOURNAL=navres,
VOLUME=33,
PAGES="129-143",
YEAR=1986,
KEYWORDS="Approximation; queueing network; process",
}

@ARTICLE{Alde86:ISDN,
AUTHOR="H. Aldermeshlan",
TITLE="{ISDN} Standards Evolution",
JOURNAL=atttj,
VOLUME=65,
NUMBER=1,
PAGES="19-25",
YEAR=1986,
KEYWORDS="ISDN; standardization",
}

@INPROCEEDINGS{Ande86:Beregning,
AUTHOR="A. H. Andersen and H. K. Andersen",
TITLE="Beregning av sperr i et flyplassnett basert på en kombinasjon av
simulering og analytiske modeller",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=16,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Loss probability",
ABSTRACT={Det er gjort beregninger på er et stjernenett bestående av
sperrfrie aksess-svitsjer og en sperrfri gruppe-svitsj. Antall
abonnenter pr aksess-svitsj er lavt. Trafikken som genereres pr abonnent
er imidlertid meget stor og den består av en kombinasjon av forskjellige
trafikktyper. Hovedtyngden av trafikken genereres av 10 operat rer pr
aksess-svitsj. Operat renes trafikk består av "semipermanente" samband
mot radioer hvor},
}

@INPROCEEDINGS{Ande86:Omstillingen,
AUTHOR="M. M. Andersen",
TITLE="Omstillingen er klar..",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=28,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="History; traffic engineering",
ABSTRACT="Dansk Telehistorie og det statslige tilsyns placering.",
}

@ARTICLE{Anto8604:Hierarchical,
AUTHOR="C. J. Antonelli and R. A. Volz and T. Mudge",
TITLE="Hierarchical decomposition and simulation of manufacturing cells
using {ADA}",
JOURNAL="Simulation",
VOLUME=46,
NUMBER=4,
PAGES="141-152",
YEAR=1986,
KEYWORDS="Simulation; manufacturing system; ADA",
ABSTRACT="FMS",
}

@ARTICLE{Appe86:Network,
AUTHOR="J. J. Appel",
TITLE="Network Operations - a Major Opportunity in Evolving Digital
Networks",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=1,
PAGES="39-42",
YEAR=1986,
KEYWORDS="network operating system; digital network; network",
}

@INPROCEEDINGS{Arvi86:Results,
AUTHOR="X. Arvidsson",
TITLE="Some Results on the Performance of a Link with State Protection",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=25,
YEAR=1986,
KEYWORDS="modeling; protection; IPP; performance evaluation; performance
measure",
ABSTRACT="In this report, we model and analyse links with a state
protection system that at random will accept or reject a request, with
the probability of accepting depending on the call type and the present
number of circuits occupied. Under the assumption that each type of call
can be regarded as generated from a seperate, independent source of
Poissonian or IPP-type we are able of calculating two performance
measures which are",
}

@INPROCEEDINGS{Asge86:Dimensionering,
AUTHOR="C. Asgersen",
TITLE="Dimensionering af digitalt net med sikkerhedsstruktur",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=7,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Digital network; network design; reliability; network
management",
ABSTRACT="Indlægget omhandler en dimensineringsmetode, til anvendelse
ved den netstruktur, der er beskrevet i KTAS digitalplan nr.2.",
}

@TECHREPORT{Asmu86:Heavy,
AUTHOR="S. Asmussen",
TITLE="The Heavy Traffic Limit of a Class of Markovian Queueing Models",
INSTITUTION="Institute of Mathematical Statistics, University of
Copenhagen",
ADDRESS="Denmark",
PAGES=8,
YEAR=1986,
KEYWORDS="Heavy load; heavy traffic approximation; markovian queueing
system; queueing system; queueing theory",
}

@TECHREPORT{Asmu86:Ruin,
AUTHOR="S. Asmussen",
TITLE="On Ruin Problems and queues of Markov-Modulated {M/G/1} Type",
INSTITUTION="Institute of mathematical Statistics, University of
Copenhagen",
PAGES=35,
YEAR=1986,
KEYWORDS="M/g/1; markovian queueing system; modulation theory;
MMPP/G/1",
}

@ARTICLE{Avel86:Algorithms,
AUTHOR="O. Avellaneda",
TITLE="Algorithms improve cellular traffic handling",
JOURNAL="Telesis",
VOLUME=13,
NUMBER=4,
PAGES="33-39",
YEAR=1986,
KEYWORDS="mobile radio",
}

@INPROCEEDINGS{Bard86:Expert,
AUTHOR="Y. Bard",
TITLE="Expert System Applications in System Modelling",
BOOKTITLE="Teletraffic Analysis and Computer Performance Evaluation",
EDITOR="O. J. Boxma and J. W. Cohen and H. Tijms",
PAGES="463-475",
YEAR=1986,
KEYWORDS="Expert system; modeling",
}

@INPROCEEDINGS{Blvi86:Forecasting,
AUTHOR="E. Bolviken and E. Damsleth",
TITLE="Forecasting Traffic Matrices by Kalman Filtering",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=18,
YEAR=1986,
KEYWORDS="Traffic engineering; forecasting; Kalman filter; traffic
matrix; modeling; Kruithof's projection method",
ABSTRACT="It is suggested that the class of Dynamic Linear Models and
their recursive handling by the Kalman filter provides a powerful new
tool for traffic matrix forecasting. Emphasis in this paper is on
modelling. A model for random, linear growth is developed as a
multivariate description of the whole network, and discussed in relation
to Kruithof's procedure. It is argued that such multivariate models may
produce parsimonious",
}

@INPROCEEDINGS{Bnde86:Planlægning,
AUTHOR="H. Bondergaard",
TITLE="Planlægning af Signalsystem Nr. 7 Net i Danmark",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=12,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Signalling; signalling protocoL",
ABSTRACT="Det signalsystem nr. 7, der blev sat i drift i december 1984
med 5200 abonnenter, er baseret på CCITT's gulbog af 1981 med tilf jelse
af forskellige nationale signaler. Message Transfer Part MTP er uden
nationale tilf jelser, medens Telephone User Part TUP har nationale
signaler for databeskyttelse, trunk offering og omdirigering.
Signalsystemet dækker pr. 1. juli 1986 57.000 abonnenter fordelt på 36
digitale gruppevælger",
}

@ARTICLE{Boek8601:Number,
AUTHOR="J. C. A. Boekhorst",
TITLE="On the Number of Crosspoints in Rearrangeable Clos Networks",
JOURNAL="Trends in Telecommunications",
PUBLISHER="AT\&T and Philips Telecommunications B.V",
ADDRESS="Netherlands",
VOLUME=2,
NUMBER=1,
PAGES="42-49",
YEAR=1986,
KEYWORDS="switching network; tutorial; Rearrangement",
}

@INPROCEEDINGS{Bott86:Analyse,
AUTHOR="R. Bottheim",
TITLE="Analyse av Linjesvitsjede Nett Som Benytter adaptiv Ruting",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=13,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Adaptive routing",
ABSTRACT="Det har i l pet av de siste årene utviklet seg nye muligheter
for utnyttelsen av de linjesvitsjede nettene. H ykapasitets
signaleringsforbindelser og datamaskinstyrte telefonsentraler har åpnet
for nye og mer avanserte rutingsystemer.",
}

@ARTICLE{Bran86:Stochastic,
AUTHOR="A. Brandt",
TITLE="The Stochastic Equation Y(n+1)=A(n)Y(n)+B(n) with Stationary
Coefficients",
JOURNAL=aap,
VOLUME=18,
PAGES="211-220",
YEAR=1986,
KEYWORDS="stochastic differential equation; ergodicity; model",
ABSTRACT="Stationary solution; Uniform strong law of large numbers",
}

@ARTICLE{Bran86:Property,
AUTHOR="A. J. Branford",
TITLE="On a Property of Finite-State Birth and Death Processes",
JOURNAL=jap,
VOLUME=23,
PAGES="859-866",
YEAR=1986,
KEYWORDS="hyperexponential; overflow; polynomial; orthogonal
polynomials",
ABSTRACT="A simple proof is given of the result that the 'overflow' from
a finite-state birth and death process is a renewal stream characterized
by hyperexponential inter-event times.  Our structure is utilized to
give a converse result that any hyperesponential renewal stream can be
so produced as the overflow from a finite-state birth and death
process.",
}

@ARTICLE{Buza86:Queueing,
AUTHOR="J. A. Buzacott",
TITLE="On Queueing Network Models of Flexible Manufacturing Systems",
JOURNAL=qs,
VOLUME=1,
NUMBER=1,
PAGES="5-27",
YEAR=1986,
KEYWORDS="Queueing Network; Manufacturing System",
}

@ARTICLE{Buza86:Flexible,
AUTHOR="J. A. Buzacott and D. D. Yao",
TITLE="Flexible Manufacturing Systems: A Review of Analytical Models",
JOURNAL=ms,
VOLUME=32,
NUMBER=7,
PAGES="890-905",
YEAR=1986,
KEYWORDS="flexible manufacturing system; FMS; production system;
analytical model; production planning; production control",
ABSTRACT="This paper reviews recent work on the development of
analytical models of Flexible Manufacturing Systems (FMSs).  The
contributions of each of the groups concerned with model development are
summarized and an assessment is made of the strenghts and the weaknesses
of its modelling approach.  A number of directions in which models
require extension are outlined, in particular the",
}

@ARTICLE{Carm86:Erlang,
AUTHOR="D. G. Carmichael",
TITLE="{Erlang} Loading Models in Earthmoving",
JOURNAL=ces,
VOLUME=3,
NUMBER=3,
PAGES="118-124",
YEAR=1986,
KEYWORDS="Traffic Analysis; Telephony",
}

@ARTICLE{Chan86:Spectrum,
AUTHOR="G. K. Chan and S. A. Mahmoud",
TITLE="A Spectrum-Efficient Interference-Free Frequency Allocation
Scheme for a Cellular Radio System",
JOURNAL=ieeevt,
VOLUME="VT-35",
NUMBER=1,
PAGES="15-21",
YEAR=1986,
KEYWORDS="Cellular System; Channel Assignment",
}

@ARTICLE{Chan86:Study,
AUTHOR="Madhavi Chandra",
TITLE="A Study of Multiple Finite-Source Queueing Models",
JOURNAL=jors,
VOLUME=37,
NUMBER=3,
PAGES="275-283",
YEAR=1986,
KEYWORDS="Finite Source; Queueing System; Comparison",
}

@ARTICLE{Cox86:Virtual,
AUTHOR="D. R. Cox and V. Isham",
TITLE="The Virtual Waiting-Time and Related Processes",
JOURNAL=aap,
VOLUME=18,
PAGES="558-573",
YEAR=1986,
KEYWORDS="Takacs",
ABSTRACT="Takács process; Shot-noise process; Soil moisture model",
}

@ARTICLE{Croo86:Three,
AUTHOR="J. G. Crookes and D. W. Balmer and S. T. Chew and R. J. Paul",
TITLE="A Three-Phase Simulation System Written in Pascal",
JOURNAL=jors,
VOLUME=37,
NUMBER=6,
PAGES="603-618",
YEAR=1986,
KEYWORDS="Simulation Model; PASCAL",
}

@ARTICLE{Dall86:Modelling,
AUTHOR="Y. Dallery",
TITLE="On Modelling Flexible Manufacturing Systems Using Closed Queueing
Networks",
JOURNAL="Large Scale Systems",
VOLUME=11,
PAGES="109-119",
YEAR=1986,
KEYWORDS="Manufacturing system; closed queueing network",
ABSTRACT="FMS",
}

@ARTICLE{Davi86:Improved,
AUTHOR="B. R. Davis",
TITLE="An Improved Importance Sampling Method for Digital Communication
System Simulations",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=7,
PAGES="715-719",
YEAR=1986,
REFERENCES=5,
KEYWORDS="Importance Sampling; Communication Network",
}

@ARTICLE{Dequ8602:Popularization,
AUTHOR="C. Dequan and J. Lei and P. Chungmin",
TITLE="Popularization of Management Science in China",
JOURNAL="Interfaces",
VOLUME=16,
NUMBER=2,
PAGES="2-9",
YEAR=1986,
KEYWORDS="Survey",
ABSTRACT="China",
}

@TECHREPORT{Some86:Building,
AUTHOR="M. de Somer",
TITLE="Building a Mathematical Model Describing the Behaviour of a
Variable Bitrate Switching Network",
INSTITUTION="Bell Tel. Manufacturing Company, Advanced Research Center",
ADDRESS="Antwerp, Belgium",
PAGES=27,
YEAR=1986,
KEYWORDS="Mathematical Model; Variable Rate; Switching Network; Traffic
Theory",
}

@ARTICLE{Devr86:Algorithms,
AUTHOR="L. Devroye",
TITLE="The Analysis of Some Algorithms for Generating Random Variates
with a Given Hazard Rate",
JOURNAL=navres,
VOLUME=33,
PAGES="281-292",
YEAR=1986,
KEYWORDS="Random Variate; Algorithm; Analysis",
}

@ARTICLE{Doga86:Shared,
AUTHOR="Y. N. Doganata",
TITLE="A Shared Algorithm for a Trunked Mobile System",
JOURNAL=ieeevt,
VOLUME="VT-35",
NUMBER=3,
PAGES="93-99",
YEAR=1986,
KEYWORDS="Mobile Radio",
}

@ARTICLE{Doug86:Queueing,
AUTHOR="D. E. Douglas",
TITLE="Queueing Analysis Techniques Measure Random Wait Time",
JOURNAL="Industrial Engineering",
VOLUME=17,
NUMBER=6,
PAGES="26-29",
YEAR=1986,
KEYWORDS="Queueing theory; Measurement Method; Waiting Time; Time Random
Variable",
}

@INPROCEEDINGS{Dzio86:Adaptive,
AUTHOR="Z. Dziong and L. Reneby",
TITLE="Analysis of Adaptive Routing Networks Using the Equivalent Path
Method",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=9,
YEAR=1986,
KEYWORDS="Adaptive Routing; Circuit Switching; GOS; Analytical Model",
ABSTRACT="The paper presents a new approach for determining node-to-node
grade of service for circuit switched networks with adaptive routing.
The approach is based on a decomposition of the global analysis into a
set of path analysis problems which are solved by means of the
equivalent path method (EPM). It is pointed out that the correlation
between the stream offered to an alternative path and the path's state
should be taken in",
}

@INPROCEEDINGS{Eklu86:Load,
AUTHOR="B. Eklundh and J. Karlsson",
TITLE="Load Sharing in a Cellular Mobile Telephone System - Blocking
Probabilities and Channel Utilization",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=20,
YEAR=1986,
KEYWORDS="Mobile Radio; Telephony; Cellular System; Load Sharing;
Blocking; Channel Utilization",
ABSTRACT="A load sharing facility, which enabels subscribers in a mobile
telephone system to look for free radio channels in more than one cell,
is investigated with respect to blocking probability and channel
utilization. An iterative procedure is devised, by means of which the
dependencies among cells can be illustrated. This procedure makes use of
Markov model, and proves to be quite accurate for the situations under
study. Anal",
}

@INPROCEEDINGS{Eklu86:Dimensioneringsfrågor,
AUTHOR="B. Eklundh and B. Stavenow",
TITLE="Dimensioneringsfrågor i ett mobilt {ISDN}",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=14,
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Mobile Radio; ISDN; System Evaluation",
ABSTRACT="Mobiltelefoni har under de senaste åren haft en
explosionsartad utveckling. För tio år sedan visste de flesta människor
inte vad mobiltelefoni innebar, och ännu färre hade någonsin kommit i
kontakt med ett sådant system. I dag är situationen en helt annan.
Mobiltelefoni finns på ett flertal platser på jorden, och de nordiska
länderna har i mycket haft en roll som banbrytare och det nordiska
mobiltelefonsystemet NMT är i d",
}

@ARTICLE{Elld8601:Trafikutbildning,
AUTHOR="A. Elldin",
TITLE="Trafikutbildning, en lönsam investering",
JOURNAL=ericssonr,
ADDRESS="Stockholm, Sweden",
NUMBER=1,
PAGES="24-31",
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Ccitt",
ABSTRACT="Tetrapro; Codevtel; ITU; Developing Countries",
}

@INCOLLECTION{Elza86:Kinship,
AUTHOR="M. S. Elzas",
TITLE="The Kinship Between Artificial Intelligence, Modelling \&
Simulation: An Appraisal",
BOOKTITLE="Modelling and Simulation Methodology in the Artificial
Intelligence Era",
EDITOR="M. S. Elzas and T. I. Ören and B. P. Zeigler",
PUBLISHER="North-Holland",
PAGES="3-13",
YEAR=1986,
KEYWORDS="Artificial Intelligence; Modeling; Simulation",
}

@INCOLLECTION{Elza86:Applicability,
AUTHOR="M. S. Elzas",
TITLE="The Applicability of Artificial Intelligence Techniques to
Knowledge Representation in Modelling and Simulation",
BOOKTITLE="Modelling and Simulation Methodology in the Artificial
Intelligence Era",
EDITOR="M. S. Elzas and T. I. Ören and B. P. Zeigler",
PUBLISHER="North-Holland",
PAGES="19-40",
YEAR=1986,
KEYWORDS="Artificial Intelligence; Modeling; Simulation",
}

@INPROCEEDINGS{Espv86:Opplæringsprogram,
AUTHOR="O. Espvik",
TITLE="Opplæringsprogram for teknisk/ konomisk planlegging -
nettplanlegging",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=16,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Network Planning",
ABSTRACT="Denne artikkelen omtaler et opplæringsprogram for teknisk/
konomisk planleggingsmetodikk under utvikling ved det norske Televerket.
Det gj res rede for opplæringens målsetting, struktur og
ambisjonsnivå.",
}

@ARTICLE{Fali86:Waiting,
AUTHOR="G. I. Falin",
TITLE="On the Waiting Time Process in a Single-line Queue with Repeated
Calls",
JOURNAL=jap,
VOLUME=23,
PAGES="185-192",
YEAR=1986,
KEYWORDS="call reattempt; number of retrials",
}

@ARTICLE{Fali86:Single,
AUTHOR="G. I. Falin",
TITLE="Single-Line Repeated orders Queueing Systems",
JOURNAL="Optimization",
VOLUME=17,
NUMBER=5,
PAGES="649-667",
YEAR=1986,
KEYWORDS="call reattempt; single server; queue length; waiting time;
busy period; limit theorem; interdeparture time; monotony; inequality;
persistent; network design; heterogeneous traffic; group arrival;
monotonicity properties; persistence function; outcoming calls;
heterogeneous calls; Waiting places",
ABSTRACT="In this paper we give main results for queueing systems with
repeated calls obtained up till now only for single-line queueing
systems.",
}

@ARTICLE{Fers86:Bedienungstheorie,
AUTHOR="F. Ferschl",
TITLE="Bedienungstheorie: Tendenzen und neuere Entwicklungen",
JOURNAL=ors,
PAGES="1-24",
YEAR=1986,
KEYWORDS="survey; queueing theory",
ABSTRACT="This paper gives some information concerning recent
developments of queueing theory.  In view of the enormous extent of this
field we proceed not systematically but by significant examples.  From
the area of special techniques three are presented briefly:  piecewise
deterministic Markow processes, reversible Markov chains and marked
point processes.  As a general strategy approximation methods receive
still growing in",
}

@ARTICLE{Flem8603:How,
AUTHOR="P. Fleming and J. J. Wallace",
TITLE="How not to Lie with Statistics: the Correct way to Summarize
Benchmark Results",
JOURNAL=cacm,
VOLUME=29,
NUMBER=3,
PAGES="218-221",
YEAR=1986,
KEYWORDS="Measurement; Statistics; Benchmark; Geometric Distribution",
ABSTRACT="Using the arithmetic mean to summarize normalized benchmark
results leads to mistaken conclusions that can be avoided by using the
preferred method: the geometric mean.",
}

@ARTICLE{Fost8601:Expert,
AUTHOR="W. Foster",
TITLE="Expert Systems for Industrial Applications - Part 2",
JOURNAL="Simulation",
VOLUME=46,
NUMBER=1,
PAGES="27-30",
YEAR=1986,
KEYWORDS="Simulation; Expert System; Survey",
}

@ARTICLE{Fred86:Modeling,
AUTHOR="A. Fredericks",
TITLE="Performance Analysis Modeling for Manufacturing Systems",
JOURNAL=atttj,
VOLUME=65,
NUMBER=4,
PAGES="25-34",
YEAR=1986,
KEYWORDS="Performance evaluation; manufacturing system; modeling;
analysis; theory",
}

@ARTICLE{Gall86:Multi,
AUTHOR="I. D. Gallagher",
TITLE="Multi-service networks",
JOURNAL="British Telecom Technology Journal",
VOLUME=4,
NUMBER=1,
PAGES="43-49",
YEAR=1986,
KEYWORDS="ATM",
ABSTRACT="To accomodate the uncertain requirements of future public
communications, a network with a high degree of flexibility is
necessary.  One method of obtaining flexibility and supporting the
divergent needs of video, voice and data services is to use fast packet
switching.  An implementation of this technique under particular
investigation is a network using switching and transmission based on the
Orwell protocol.",
}

@INPROCEEDINGS{Gerl86:Routing,
AUTHOR="M. Gerla",
TITLE="Routing and Flow Control in {ISDN's}",
BOOKTITLE=iccc,
PAGES="643-647",
YEAR=1986,
KEYWORDS="Communication Network; ISDN; Flow Control; Routing",
}

@ARTICLE{Gigl8612:Petri,
AUTHOR="J. Giglmayr",
TITLE="A Petri Net Approach to the control Unit of a Broadband Switching
System",
JOURNAL=ntzarchiv,
ADDRESS="Germany",
VOLUME=8,
NUMBER=12,
PAGES="317-325",
YEAR=1986,
KEYWORDS="Switching System; Broadband; Modeling; Petri Net; Stochastic
Process; Control; Control Variable",
ABSTRACT="In the present paper the traffic within the control unit of a
broadband switching system is modelled by a stochastic Petri net. In
particular, random switches included in this Petri net concept are
applied to model the separation of signaling data according to the type
of service requested by the subscribers, and the multiple use of the
picture phone during a telephone session is modelled by correlated
parallel paths in t",
}

@ARTICLE{Gray8606:Contrasting,
AUTHOR="P. Gray and Israel Borovits",
TITLE="The Contrasting Roles of Monte Carlo Simulation and Gaming in
Decision Support Systems",
JOURNAL="Simulation",
VOLUME=47,
NUMBER=6,
PAGES="233-239",
YEAR=1986,
KEYWORDS="decision theory; Monte Carlo simulation",
ABSTRACT="Gaming; interactive simulation; IFPS",
}

@ARTICLE{Gray86:Queueing,
AUTHOR="W. I. Gray and M. Scott",
TITLE="A Queueing Model with Bonus Service for Certain Customers",
JOURNAL="Applied Math. Modelling",
VOLUME=10,
PAGES="241-245",
YEAR=1986,
KEYWORDS="queueing theory; priority; management; bonus service",
}

@INPROCEEDINGS{Grne86:Karakterisering,
AUTHOR="K. Gr ne",
TITLE="Karakterisering af mobil radiotelefon trafik ved hjælp af
Cox.fordelinger",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=16,
YEAR=1986,
KEYWORDS="Mobile Radio; Traffic Engineering; Arrival Process",
ABSTRACT="I denne note beskrives en metode til estimation af ankomst og
holdetidsfordelinger for trafik genereret af mobile abonnenter i et
radiotelefonsystem.",
}

@ARTICLE{Guia86:Maximum,
AUTHOR="S. Guiasu",
TITLE="Maximum Entropy Condition in Queueing Theory",
JOURNAL=jors,
VOLUME=37,
NUMBER=3,
PAGES="293-301",
YEAR=1986,
KEYWORDS="Queueing System; Entropy",
}

@INPROCEEDINGS{Halg86:Future,
AUTHOR="C. Halgreen",
TITLE="Future Structure of the Danish Telephone Network",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=11,
YEAR=1986,
KEYWORDS="Planning; Forecasting; Existing Network; Telephony",
ABSTRACT="Contents: 1).Background 2).Purpose 3).Elements and topology
4).Ruting Roules 5).Measuring and Forecasts 6).Dimensioning Rules
7).Facility Demands",
}

@ARTICLE{Harv86:Expert,
AUTHOR="J. T. Harvey",
TITLE="Expert Systems: An Introduction",
JOURNAL=ec,
VOLUME=60,
NUMBER=2,
PAGES="100-108",
YEAR=1986,
KEYWORDS="Survey; Expert System; Tutorial",
}

@INPROCEEDINGS{Haug86:Evolution,
AUTHOR="R. B. Haugen and E. Lykke Jensen",
TITLE="The Evolution Towards an Integrated Network: A Challenge to
Traffic Research and Network Planning",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="Forecasting; Planning; Integrated Network; Network Planning;
Traffic Prediction; ISDN",
ABSTRACT="A prerequisite for the ISDN idea is the introduction of
(dedicated) digital networks for telephony and data. Hence, in fact we
may say that the ISDN idea goes back to 1969 when the CCITT
recommendations for 2M bit/s and 1,5M bit/s PCM-systems were agreed
upon.",
}

@ARTICLE{Heat86:Adequacy,
AUTHOR="D. C. Heath and P. Sanchez",
TITLE="On the Adequacy of Pseudo-Random Number Generators (Or: How Big a
Period do We Need)?)",
JOURNAL=orl,
VOLUME=5,
NUMBER=1,
PAGES="3-6",
YEAR=1986,
KEYWORDS="Simulation; simulation method; Monte Carlo simulation; RNG;
random number generation",
}

@INPROCEEDINGS{Hein86:Alt,
AUTHOR="P. Hein",
TITLE="Alt er poesi undtagen poesi som er en kliché",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=4,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Survey; History",
ABSTRACT="History",
}

@ARTICLE{Herr8605:Simulation,
AUTHOR="B. Herring and W. Prather",
TITLE="A simulation model for analyzing service times in a rotational
position sensing disk system",
JOURNAL="Simulation",
VOLUME=46,
NUMBER=5,
PAGES="185-191",
YEAR=1986,
KEYWORDS="disk; simscript",
ABSTRACT="Data-driven",
}

@ARTICLE{Huan86:Flexible,
AUTHOR="P. Y. Huang",
TITLE="Flexible Manufacturing Systems: An Overview and Bibliography",
JOURNAL="Production and Inventory Management - Third Quarter",
PAGES="80-90",
YEAR=1986,
KEYWORDS="Manufacturing system; bibliography",
ABSTRACT="FMS",
}

@ARTICLE{Jage86:Continued,
AUTHOR="A. A. Jagers and E. A. Van Doorn",
TITLE="On the Continued {Erlang} Loss Function",
JOURNAL=orl,
VOLUME=5,
NUMBER=5,
PAGES="43-46",
YEAR=1986,
KEYWORDS="Erlang B formula; ERT method; convexity",
}

@INPROCEEDINGS{Jens86:Information,
AUTHOR="A. Jensen",
TITLE="Information og Samfund",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=4,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Information theory",
ABSTRACT="History",
}

@ARTICLE{Kari8603:Packet,
AUTHOR="M. R. Karim",
TITLE="Packet Communications on a Mobile Radio Channel",
JOURNAL=atttj,
VOLUME=65,
NUMBER=3,
PAGES="12-19",
YEAR=1986,
KEYWORDS="Mobile radio",
}

@ARTICLE{Kave8612:Maximum,
AUTHOR="Mohsen Kavehrad and M. Joseph",
TITLE="Maximum Entropy and the Method of Moments in Performance
Evaluation of Digital Communications Systems",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=12,
PAGES="1183-1189",
YEAR=1986,
KEYWORDS="Communication system; performance evaluation",
}

@ARTICLE{Kawa86:Queueing,
AUTHOR="K. Kawashima",
TITLE="Queueing Analysis for Input Regulation Method Employing Periodic
Monitoring and Control",
JOURNAL=ejor,
VOLUME=23,
PAGES="100-107",
YEAR=1986,
KEYWORDS="queueing system; Markov process; communication; performance
evaluation",
}

@ARTICLE{Kell8601:Auto,
AUTHOR="F. P. Kelly",
TITLE="On Auto-repeat Facilities and Telephone Network Performance",
JOURNAL=jrss,
ADDRESS="Great Britain",
VOLUME=48,
NUMBER=1,
PAGES="123-132",
YEAR=1986,
KEYWORDS="Telephony",
}

@ARTICLE{Kerc8601:Impact,
AUTHOR="E. J. H. Kerckhoffs and G. C. Vansteenkiste",
TITLE="The Impact of Advanced Information Processing on Simulation - An
Illustrative Review",
JOURNAL="Simulation",
VOLUME=46,
NUMBER=1,
PAGES="17-26",
YEAR=1986,
KEYWORDS="Simulation method",
}

@INPROCEEDINGS{Kilk86:Method,
AUTHOR="K. Kilkki",
TITLE="A Method to Compare Traffic Distributions",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=10,
YEAR=1986,
KEYWORDS="Stochastic process",
ABSTRACT="In this paper a method is examined, which can be used to
compare traffic distributions. The method is based on the well-known
formula of state dependent traffic. In this method it is supposed that
state probabilities are known on the bases of traffic model, simulation
or measurement. The arrival intensities can be calculated of these
probabilities, when holding times are exponentially distributed.",
}

@INPROCEEDINGS{Knut86:Modellering,
AUTHOR="A. Knutsson",
TITLE="Modellering av Dynamiska Trafiksystem med Martingalmetoden",
BOOKTITLE="NTS-6",
ADDRESS="Copenhagen, Denmark",
PAGES=16,
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Martingale",
}

@ARTICLE{Kong8601:Traffic,
AUTHOR="L. Kong and M. Akiyama",
TITLE="Traffic Analysis of a Database Controlled Telecommunications
Network System",
JOURNAL="The Transactions of the IECE of Japan",
ADDRESS="Japan",
VOLUME="E69",
NUMBER=1,
PAGES="21-28 (paper 18)",
YEAR=1986,
KEYWORDS="Network management; database",
ABSTRACT="This paper describes the outline of a database controlled
telecommunications network system and analyzes its traffic handling
characteristics using basic models. In this system, control is carried
out by regional control centers each having a copy of the network
information stored in its database. Calls are screened at the
originating office to prevent those with little or no possibility of
completion from entering the ne",
}

@ARTICLE{Krai86:Bandwidth,
AUTHOR="B. Kraimeche and M. Schwartz",
TITLE="Bandwidth Allocation Strategies in Wide-Band Integrated
Networks",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="869-878",
YEAR=1986,
KEYWORDS="multiserver",
ABSTRACT="A common digital transmission facility in a wide-band
integrated service digital network (ISDN) provides shared access to a
community of heterogeneous users.  Traffic demands from these users vary
in their arrival rate, their service time, and their bit rate.  In order
for this type of communication system to handle its traffic demands with
heigh efficiency and flexibility, a close control of access to the
shared bandwidth",
}

@ARTICLE{Ksen8604:Stokastiske,
AUTHOR="B. Ksendal",
TITLE="Stokastiske Differensiallikninger: Hva, Hvorfor og Hvordan?",
JOURNAL="Normat",
ADDRESS="Denmark",
NUMBER=4,
PAGES="137-145",
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Stochastic system",
ABSTRACT="Oeksendal",
}

@ARTICLE{Kuba8606:Reliability,
AUTHOR="P. Kubat",
TITLE="Reliability Analysis for Integrated Networks with Application to
Burst Switching",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="564-568",
YEAR=1986,
KEYWORDS="Burst switching; reliability",
}

@ARTICLE{Kura86:Second,
AUTHOR="M. Kuramoto and M. Shinji",
TITLE="Second Generation Mobile Radio Telephone System in Japan",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=2,
PAGES="16-21",
YEAR=1986,
KEYWORDS="mobile radio",
}

@TECHREPORT{Lars86:PC,
AUTHOR="R. E. Larson and O. B. G. Madsen",
TITLE="A {PC-Oriented} Interactive Tool for Finding Efficient Solutions
to Emergency Planning Problems",
INSTITUTION="IMSOR and MIT",
ADDRESS="Lyngby, Denmark",
PAGES=48,
YEAR=1986,
KEYWORDS="Queueing theory",
}

@INPROCEEDINGS{Lars86:En,
AUTHOR="A. Larsson and D. Rapp",
TITLE="En Approximativ Metod för Analys av Paketförmedlande Datanät med
End-To-End Flödeskontroll",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=6,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Packet switching",
ABSTRACT="This paper presents an approximate method by which performance
measures can be calculated in packet switching networks with end-to-end
window flow control. The network is modelled as a finite queueing
network, where each class represents a virtual channel. Unlike ordinary
finite networks each class has an external queue where customers are
placed if the class is full, i.e. no customer may be blocked. By using
the notion o",
}

@ARTICLE{Lee86:Elements,
AUTHOR="Wenke Lee",
TITLE="Elements of Cellular Mobile Radio Systems",
JOURNAL=ieeevt,
VOLUME="VT-35",
NUMBER=2,
PAGES="48-56",
YEAR=1986,
KEYWORDS="frequency distribution",
}

@INPROCEEDINGS{Leij86:Abonnent,
AUTHOR="H. Leijon",
TITLE="Abonnent- och Trafikprognosticering",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=7,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Forecasting",
ABSTRACT="Kontinuerlig tillgång på kvalitativt tillfredsställande
abonnent- och trafikprognoser är av avgörande betydelse för en
framgångsrik planering av telekommunikationsnätet. En viktig del av
prognosticeringens aktiviteter i dess mest avancerade from går ut på att
avslöja ochhelst kvantitativt uttrycka en tillräckligt stor och relevant
del av det komplicerade samspelet mellan utvecklingen av
telekommunikationsbehovet och andra",
}

@INPROCEEDINGS{Lind86:Kösystem,
AUTHOR="G. Lind",
TITLE="Kösystem med Markov-Beroende Sekvenser",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=5,
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Switching system",
ABSTRACT="Det är av stort intresse att studera hur beroenden mellan
ankomstavstånd och/eller betjäningstider påverkar köprocesser, bl a vid
modelleringen av uppförandet hos styrsystem i
telekommunikationssystem.",
}

@INPROCEEDINGS{Lind86:Planering,
AUTHOR="P. Lindberg",
TITLE="Planering av Tillförlitligheten i ett Digitalt Riksnät",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Traffic measurement",
ABSTRACT="Med en ekonomisk värdering av trafikstörningar kan man på ett
enkelt sätt ta hänsyn till tillförlitlighet vid planeringen av olika
delar av nätet. Synsättet innebär att samhällskostnaderna vid ett fel
värderas till en viss kostnad per spärrad erlangtimme. Tillämpningen av
detta illustreras med realistiska exempel. Sålunda visas att ett
fullständigt skydd med reservomkoppling är mycket fördelaktigt i de
centrala delarna av",
}

@ARTICLE{Loft86:Graph,
AUTHOR="V. Lofti and Sunil Sarin",
TITLE="A Graph Coloring Algorithm for Large Scale Scheduling Problems",
JOURNAL="Computers and Operations Research",
VOLUME=13,
NUMBER=1,
PAGES="27-32",
YEAR=1986,
KEYWORDS="graph marking algorithm; frequency distribution; graph
coloring",
}

@INPROCEEDINGS{Mkel86:Rapport,
AUTHOR="M. Mäkelä",
TITLE="Rapport Beträffande Träffpunkt-Servicen på Helsingfors
Telefonförenings Område",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=13,
YEAR=1986,
LANGUAGE="Finnish",
}

@INPROCEEDINGS{Mapp86:Priority,
AUTHOR="G. E. Mapp and David R. Manfield",
TITLE="Performance Analysis of Priority Polling Systems with Complex
Cycles",
BOOKTITLE=iccc,
ADDRESS="Munich, Germany",
PAGES="583-588",
YEAR=1986,
KEYWORDS="Polling; priority",
}

@ARTICLE{McCa8604:Operations,
AUTHOR="C. J. McCallum",
TITLE="Operations research in Manufacturing",
JOURNAL=atttj,
VOLUME=65,
NUMBER=4,
PAGES="4-16",
YEAR=1986,
KEYWORDS="Manufacturing system; performance evaluation; survey",
}

@ARTICLE{Miku86:DynaT,
AUTHOR="J. J. Mikulski",
TITLE="{DynaT*A*C} Cellular Portable Radiotelephone System Experience in
the {U.S.} and the {UK}",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=2,
PAGES="40-46",
YEAR=1986,
KEYWORDS="mobile radio",
}

@ARTICLE{Mose8612:Integration,
AUTHOR="J. G. Moser",
TITLE="Integration of Artificial Intelligence and Simulation in a
Comprehensive Decision-Support System",
JOURNAL="Simulation",
VOLUME="4?",
NUMBER=12,
PAGES="223-229",
YEAR=1986,
KEYWORDS="Simulation; expert system",
}

@INPROCEEDINGS{Mysk86:Approksimasjoner,
AUTHOR="A. Myskja and S. Vedeld",
TITLE="Approksimasjoner for Beregning av Ventetid ved {GI/G/1} K
system",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=10,
YEAR=1986,
LANGUAGE="Norwegian",
KEYWORDS="Gi/g/1",
ABSTRACT="K system GI/G/1 har ingen kjent generell l sning, men l sning
finnes i en rekke spesielle tilfelle. Noen approksimasjoner er
foreslått, for det meste basert på de f rste to momenter i ankomst- og
betjeningsprosessene.",
}

@ARTICLE{Nede8604:Bernoulli,
AUTHOR="J. Nedelman and T. Wallenius",
TITLE="Bernoulli Trials, Poisson Trials, Surprising Variances, and
Jensen's Inequality",
JOURNAL="The American Statistician",
VOLUME=40,
NUMBER=4,
PAGES="286-289",
YEAR=1986,
KEYWORDS="Stochastic theory; sums of random variables; concave
functions; convex functions; CR",
ABSTRACT="Let X be the number of successes in n independent dichotomous
trials.  Among all sets of success probabilities (p1, ..., pn) with a
given average p\_, X has amximal variance when p1 = p2 = ...  = pn =
p\_. Many authors have called this fact surprising.  We suggest how to
exploit the surprise to lead first-year probability students through a
discussion about",
}

@ARTICLE{Neut86:Caudal,
AUTHOR="M. F. Neuts",
TITLE="The Caudal Characteristic Curve of Queues",
JOURNAL=aap,
VOLUME=18,
PAGES="221-254",
YEAR=1986,
KEYWORDS="Queueing theory",
}

@ARTICLE{Neut86:New,
AUTHOR="M. F. Neuts",
TITLE="A New Informative Embedded Markov Renewal Process for the
{PH/G/1} Queue",
JOURNAL=aap,
VOLUME=18,
PAGES="553-557",
YEAR=1986,
KEYWORDS="Queueing theory",
}

@INPROCEEDINGS{Niel86:Estimation,
AUTHOR="B. F. Nielsen",
TITLE="Estimation af Parameterværdier i Coxfordelinger til
Trafikanalyse",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=13,
YEAR=1986,
KEYWORDS="Traffic source model",
ABSTRACT="Coxfordelinger bliver ofte brugt til at modellere fordelinger
der er mere generelle end eksponentialfordelingen. Problemt med
estimation af parameterværdier i Coxfordelinger er blevet behsndlet af
adskillige forfattere. Dette indlæg beskriver et antal forskellige
algoritmer samt visse generelle principper ved estimation i
Coxfordelinger.",
}

@INPROCEEDINGS{Nils86:Practical,
AUTHOR="A. Nilsson and A. Anzaloni",
TITLE="Practical Aspects on the Design of Packet Radio Systems",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=10,
YEAR=1986,
KEYWORDS="Packet radio",
ABSTRACT="Some pratical aspects on the design of packet radio systems
are presented in this paper. The effect on the effective transmission
capacity due to the access methods used are discussed, including the
effects generated by the fact that typical radios have a non-zero switch
over time from receiving to transmitting mode. The impact of modulation
and error control schemes are also presented. It is shown that not only
the acces",
}

@ARTICLE{Nish8601:Approximate,
AUTHOR="T. Nishida and M. Murata and H. Miyahara and K. Takashima",
TITLE="An Approximate Analysis of a Prioritized Token Passing Method in
Ring-Shaped Local Area Networks",
JOURNAL="The Transactions of the IECE of Japan",
ADDRESS="Japan",
VOLUME="E69",
NUMBER=1,
PAGES="29-39",
YEAR=1986,
KEYWORDS="LAN; token passing",
ABSTRACT="We present a net access protocol with priority functions in a
ring-shaped local area network utilizing the token passing method. This
protocol provides an asynchronous TDMA scheme to the terminals with the
low class traffic, and the terminals with the high class traffic can
transmit their messages between the consecutive transmissions of low
class traffic. The protocol is shown to be effective for the environment
where mu",
}

@ARTICLE{OKee8601:Simulation,
AUTHOR="R. O'Keefe",
TITLE="Simulation and Expert Systems - A Taxonomy and Some Examples",
JOURNAL="Simulation",
VOLUME=46,
NUMBER=1,
PAGES="10-16",
YEAR=1986,
KEYWORDS="Simulation method; expert system",
}

@ARTICLE{Hoks86:Bounds,
AUTHOR="P. Hokstad",
TITLE="Bounds for the Mean Queue Length of the M/K2/m Queue",
JOURNAL=ejor,
VOLUME=23,
PAGES="108-117",
YEAR=1986,
KEYWORDS="Queueing system; M/EK/N; approximation",
}

@INPROCEEDINGS{Olss86:Impact,
AUTHOR="E. Olsson and A. Rudberg",
TITLE="Impact of Fiber Optic Technology and High Capacity Switches on
Metropolitan Network Structure",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=8,
YEAR=1986,
KEYWORDS="Network planning; MAN",
ABSTRACT="To fully exploit the possibilities with the new switching and
transmission network components becoming available, it is important to
realise the interdependence between such factors as traffic routing,
fiber optical systems and network availability. This paper will discuss
these relationships. Different network structures will be evaluated,
with special emphasis on a simple routing strategy where all traffic is
carried on",
}

@ARTICLE{Onvu86:Equivalences,
AUTHOR="R. O. Onvural and Harry Perros",
TITLE="On Equivalences of Blocking Mechanisms in Queueing Networks with
Blocking",
JOURNAL=orl,
VOLUME=5,
NUMBER=6,
PAGES="293-297",
YEAR=1986,
KEYWORDS="exponential queueing network; blocking; finite queue",
ABSTRACT="In this paper, we obtain equivalencies between the most
commonly used blocking mechanisms considered in the literature in
connection with queueing networks with blocking.",
}

@INPROCEEDINGS{Ormh86:Simulering,
AUTHOR="T. Ormhaug",
TITLE="Simulering av Anropsbehandling i System {ITT} 1240",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Norwegian",
KEYWORDS="Switching system; simulation",
ABSTRACT="Det er utviklet en simuleringsmodell (SIMKON) for
kontrolldelen i system ITT 1240. Formålet har vært å studere grade of
service, målt ved oppsettingstider for anrop, kapasitet, ved gitte
servickrav, og systemets overbelastningskontroll. Modellen vil i f rste
omgang bli brukt i forbindelse med de pågaende akseptpr ver av ITT 1240
i Norge. Modellen skal verifiseres mot målinger utf rt på testsentraler,
for så å kunne brukes",
}

@INPROCEEDINGS{Parv86:Stability,
AUTHOR="A. Parviala",
TITLE="The Stability of Daily Telephone Traffic Intensity Profiles and
Its Influence on Measurement Routines",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=4,
YEAR=1986,
KEYWORDS="Traffic measurement",
ABSTRACT="In the telephone traffic technology the intensity measurements
are carried out for dimensioning purposes and for operational uses of
the network. There are several traffic measurement routines, differing
from each other by the length of daily measurement period or by the
amount or the handling of the collected measurement data. The rational
choice between different measurement routines depends strongly on the
stability of",
}

@ARTICLE{Pasu86:Pi,
AUTHOR="S. Pasupathy",
TITLE="Pi, Primes, and Probability",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=3,
PAGES="61-62",
YEAR=1986,
KEYWORDS="simulation; pi; Buffon",
}

@INPROCEEDINGS{Pete86:Utkast,
AUTHOR="X. Peterson",
TITLE="Utkast Till Framtida Nätutformning",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=4,
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Network planning",
ABSTRACT="Televerket har tillsatt en arbetsgrupp, Dirigeringsutskottet.
Denna har till uppgift att ta fram förslag till dels digitalt målnät för
Sverige dels riktlinier för övergångsskedet från dagens nät till det
digitala. Det vi siktar på är ett helt digitalt nät i början av
2000-talet.",
}

@INPROCEEDINGS{Pett86:Simulator,
AUTHOR="H. Pettersen and P. T. Huth and T. Ormhaug",
TITLE="Simulator for Trafikkregulering i Telenett",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Norwegian",
KEYWORDS="Routing; simulation",
}

@INPROCEEDINGS{Pior86:Procedure,
AUTHOR="M. Pioro and B. Wallström",
TITLE="A Procedure for One-Hour Optimization of Non-Hierarchical Circuit
Switched Networks",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=19,
YEAR=1986,
KEYWORDS="Network planning; nonhierarchical network",
ABSTRACT="In the paper we deal with the problem of optimizing
non-hierarchical networks with fixed sequences of alternative choices in
the cases of coincident traffic busy hours. A procedure for solving this
problem is described and discussed. This procedure can be used in the
designing process of a real network, as well as to evaluate possible
benefits from introducing non-hierarchical routing in telephone networks
with coincident",
}

@INPROCEEDINGS{Piri86:Optimal,
AUTHOR="A. Pirinen and K. Rahko",
TITLE="On Optimal Dimensioning of a Route Based on the Operational
Standpoint and Moe's Principle",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="Network planning; routing",
ABSTRACT="In this paper we study optimal dimensioning of a teletraffic
route. We shall propose a new method to find the optimum number of
lines. The method applies both to Poisson and non-Poisson traffic in a
loss system of the full availablity. The actual assumption of the
traffic is the traffic intensity function of a discrete or continuous
distribution of occupied lines is known. Moreover we have to be aware of
the costs of new",
}

@ARTICLE{Prel86:MATS,
AUTHOR="H. G. Preller and W. Koch",
TITLE="{MATS-E,} an Advanced 900 {MHz} Cellular Radio Telephone System:
Description, Performance, Evaluation, and Field Measurements",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=2,
PAGES="30-39",
YEAR=1986,
KEYWORDS="mobile radio",
}

@INPROCEEDINGS{Rahk86:Stellan,
AUTHOR="K. Rahko",
TITLE="Stellan Ekberg",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="History",
ABSTRACT="History",
}

@INPROCEEDINGS{Rahk86:Traffic,
AUTHOR="K. Rahko and S. Hertzberg",
TITLE="A Traffic Measurement Course in the {TETRAPRO} Project held in
Finland",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="Traffic measurement",
ABSTRACT="As a part on the Teletraffic Engineering Training Project
(TETRAPRO) of the ITU the ministery for Foreign Affairs of Finland
arranged a pilot course on Traffic Measurement. The course was held at
the Helsinki University of Technolo in the Laboratory of
Telecommunication Switching and Information Technology between August 19
and September 13, 1985. The course was attended by 16 students from 10
developing countries. ITU ha",
}

@INPROCEEDINGS{Rait86:Polling,
AUTHOR="T. Raith and P. Tran-Gia",
TITLE="Performance Analysis of Polling Mechanisms with Receiver
Blocking",
BOOKTITLE=iccc,
ADDRESS="München, Germany",
PAGES="577-582",
YEAR=1986,
KEYWORDS="Polling; performance evaluation",
}

@ARTICLE{Rals86:Discrete,
AUTHOR="A. Ralston",
TITLE="Discrete Mathematics: The New Mathematics of Science",
JOURNAL="American Scientist",
VOLUME=74,
PAGES="611-618",
YEAR=1986,
KEYWORDS="Mathematics",
}

@ARTICLE{Rama86:General,
AUTHOR="V. Ramaswami and G. Latouche",
TITLE="A General Class of Markov Processes with Explicit
Matrix-Geometric Solutions",
JOURNAL=ors,
PAGES="209-218",
YEAR=1986,
KEYWORDS="Matrix geometric method",
}

@INPROCEEDINGS{Ramb86:Dimensionering,
AUTHOR="M. Ramberg and E. Hovstad",
TITLE="Dimensionering av Signaleringsnett",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Danish",
ABSTRACT="Televerket i Norge planlegger og dimensjonerer for tiden et
nett for signaleringssystem nr.7, som skal brukes for signalering mellom
offentlige digitale sentraler (System12). Signaleringsnettet blir i
prinsippet et eget pakkesvitsjet datanett innen telenettet med egen
nettstruktur og egne dirigeringsprinsipper. Til dimensjoneringen er det
utviklet en egen dimensjoneringsprosedyre. Hovedstrukturen i denne er at
antall kana",
}

@INPROCEEDINGS{Rapp86:Mean,
AUTHOR="D. Rapp",
TITLE="Mean-Value Analysis of Mixed Muli-Class Product-Form Queueing
Networks",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="Queueing network; product form",
ABSTRACT="Product-form Queueing Network Models are considered. The so
called Mean-Value Analysis for closed queueing networks is extended to
mixed networks which allow open, semi-closed and closed classes. Also
approximative algorithms for queueing network are extended to mixed
networks. We demonstrate how open, semi-closed and closed classes are
each others limit.",
}

@INPROCEEDINGS{Rapp86:Approximate,
AUTHOR="D. Rapp and M. Nilsson",
TITLE="Approximate Algorithms for Queueing Networks with Priorities",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="Queueing network; priority",
ABSTRACT="This report presents approximate methods foe calculating
performance measures in priority queueing networks. They may be open,
closed or semi-closed(finite). A method based on a virtual server
technique by JS Kaufman is adopted. It combines principles for open
single-server priority systems with the methods for product-form
queueing networks. The method is primarily developed for networks with
preemptive-resume priorities",
}

@INPROCEEDINGS{Rasm86:Nogle,
AUTHOR="C. Rasmussen",
TITLE="Nogle Problemer ved Beskrivelse af reservationssystemer",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Danish",
ABSTRACT="Ved almindelig telefontrafik vil den sidst ankommende samtale
have laveste prioritet: den vil blive afvist, hvis der ikke er
tilstrækkelig kappacitet. Tillades reservation, tabes denne egenskab
idet prioriteten nu ikke længere afhænger af, hvornår samtalen begynder,
men af, hvornår den er reserveret. Dette giver anledning til problemer,
bl.a. vil nu afvisningssandsynlighed afhænge af samtalelængden. Nogle
fors g på behand",
}

@ARTICLE{Redm8602:Teletraffic,
AUTHOR="F. J. Redmill",
TITLE="Teletraffic Engineering",
JOURNAL="Telecommunication Journal",
VOLUME=53,
NUMBER=2,
PAGES="83-90",
YEAR=1986,
KEYWORDS="Traffic engineering",
}

@INPROCEEDINGS{Rene86:Loss,
AUTHOR="L. Reneby",
TITLE="Loss Calculations in Non-hierarchical Networks Using State
Protection",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="Nonhierarchical network",
ABSTRACT="In circuit switched telecommunication networks, either
hierarchical or non-hierarchical, one normally needs to prevent an
unlimited access for some traffic streams to all the available paths in
the network. In hierarchical networks the main purpose is to restrict
access to tandem circuits for traffic streams overflowing from high loss
routes, in order to equalize congestion between these streams and
traffics without acces",
}

@ARTICLE{Roca8601:ISDN,
AUTHOR="R. T. Roca",
TITLE="{ISDN} Architecture",
JOURNAL=atttj,
VOLUME=65,
NUMBER=1,
PAGES="5-17",
YEAR=1986,
KEYWORDS="ISDN",
}

@MASTERSTHESIS{Säll86:Kanaltilldelningsprinciper,
AUTHOR="K. Sällberg",
TITLE="Kanaltilldelningsprinciper och överlagrade cellmönster i ett
cellindelat digitalt mobiltelefonsystem",
TYPE="Diploma thesis",
SCHOOL="Lunds Tekniske Högskola",
ADDRESS="Lund, Sweden",
PAGES=52,
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="mobile radio",
}

@ARTICLE{Scha86:Two,
AUTHOR="R. A. Schassberger",
TITLE="Two Remarks on Insensitive Stochastic Models",
JOURNAL=aap,
VOLUME=18,
PAGES="791-814",
YEAR=1986,
KEYWORDS="queueing network; Markov chain; generalized semi Markov
process; partial balance",
ABSTRACT="This paper contains two contributions to the insensitivity
theory for generalized semi-Markov schemes, namely (1) a detailed
account of a close relationship between insensitivity schemes and
partially balanced discrete-state Markov chains, and (2) an extension of
the notion of an insensitive scheme in order to incorporate
insensitivity phenomena not previously covered.",
}

@ARTICLE{Seel8601:Algorithm,
AUTHOR="L. P. Seelen",
TITLE="An algorithm for {PH/PH/c} Queues",
JOURNAL=ejor,
VOLUME=23,
NUMBER=1,
PAGES="118-127",
YEAR=1986,
KEYWORDS="Queueing theory; PH/PH/N",
}

@ARTICLE{Seki8602:Detachable,
AUTHOR="S. Seki and N. Kanmuri and A. Sasaki",
TITLE="Detachable Unit Service in 800 {MHz-Band} Cellular Radiotelephone
System",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=2,
PAGES="47-52",
YEAR=1986,
KEYWORDS="Mobile radio",
}

@INPROCEEDINGS{Sren86:Protection,
AUTHOR="F. M. S rensen and H. Pedersen",
TITLE="Protection Switching for 140 Mbit/s Transmission Systems",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
KEYWORDS="Network management",
ABSTRACT="Telecom Denmark and NKT Electronics are in cooperation
developing a switching system to be used for the protection of the
transmission network. The paper describes the planning of the protection
network and the switching system.",
}

@ARTICLE{Spin86:German,
AUTHOR="K. Spindler",
TITLE="The German Cellular Radiotelephone System C",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=2,
PAGES="22-29",
YEAR=1986,
KEYWORDS="mobile radio",
}

@INPROCEEDINGS{Stav86:Paketväljare,
AUTHOR="B. Stavenow and B. Eklundh",
TITLE="Paketväljare och paketförmedling - en studie av groundläggande
egenskaper",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=20,
YEAR=1986,
LANGUAGE="Swedish",
ABSTRACT="Paketförmedlingsprincipen används traditionellt i olika typer
av datanät. Förespråkarna för denna förmedlingsprincip påstår att
tekniken går att generalisera och skulle därmed gå att applicera även
för transport av andra typer av information med mycket varierande
egenskaper och krav, typ tal, HIFI-1jud, facsimile,
punkt-till-punkt-video och TV-broadcasting. De försök som har gjorts,
att i ett och samma paketförmedlingsnät",
}

@ARTICLE{Step8604:Increasing,
AUTHOR="S. N. Stepanov",
TITLE="Increasing the Efficiency of Numerical Methods for Models with
Repeat Calls",
JOURNAL="Problems of Information Transmission",
VOLUME=22,
NUMBER=4,
PAGES="313-26",
YEAR=1986,
KEYWORDS="Call reattempt",
}

@INPROCEEDINGS{Stor86:Prognosemodeller,
AUTHOR="K. Stordahl",
TITLE="Prognosemodeller for Nettplanlegging",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Network planning; forecasting",
ABSTRACT="I dette foredraget vil det bli gitt en oversikt over ulike
prognosemodeller som brukes til nettplanlegging. Det er naturlig å
skille mellom aggregerte prognoser og punkt til punkt prognoser. Et
annet aentralt problem som oppstår, er konsistensen mellom punkt til
punkt prognosene og de aggregerte prognosene.",
}

@INPROCEEDINGS{Stro86:ISDN,
AUTHOR="D. Stroh",
TITLE="{ISDN} - The Deutsche Bundespost's response to the
telecommunication requirements of tomorrow",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES="2.4.1-25",
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Sumi8603:Approximation,
AUTHOR="S. Sumita",
TITLE="Approximation for Loss Systems with Batch Input",
JOURNAL="The Transactions of the IECE of Japan",
ADDRESS="Japan",
VOLUME="E69",
NUMBER=3,
PAGES="177-179",
YEAR=1986,
KEYWORDS="multi-slot connection; multi-slot traffic",
ABSTRACT="This letter presents an approximation method for calculating
the blocking probabilities of loss systems with batch input.  Using this
method, a batch stream can be treated in the same manner as an overflow
stream because both streams can be characterized by common parameters:
the offered load and peakedness.",
}

@ARTICLE{Sumi8605:Application,
AUTHOR="S. Sumita",
TITLE="An Application of the Conservation Law to Analyzing Single Server
Queueing Systems with Two Independent Input Streams",
JOURNAL="The Transactions of the IECE of Japan",
ADDRESS="Japan",
VOLUME="E69",
NUMBER=5,
PAGES="628-637",
YEAR=1986,
KEYWORDS="Queueing system; single server",
}

@ARTICLE{Suri8602:Variable,
AUTHOR="R. Suri and Gregory W. Diehl",
TITLE="A Variable Buffer-Size Model and Its Use in Analyzing Closed
Queueing Networks with Blocking",
JOURNAL=ms,
VOLUME=32,
NUMBER=2,
PAGES="206-224",
YEAR=1986,
KEYWORDS="Closed queueing network",
ABSTRACT="FMS",
}

@INPROCEEDINGS{Svin86:Kostnader,
AUTHOR="I. Svinnset",
TITLE="Kostnader ved Utbygging av Kabelfjernsynsnett. En Parameterisk
Modell",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Network planning",
ABSTRACT="I denne artikkelen betraktes en kostnadsmodell for
kabelfjernsynsnett basert på dagens teknologi. Det vil si standard
treavgreinet koaksialkabelnett, eventuelt med en liten stjerne
(mini-stjerne) ytterst mot abonnentene. Modellen er anvendt i et
prosjekt nedsatt av Teledirektoratet for utarbeidelse av en
hovednettplan for telematikknettet. I dette prosjektet ble modellen
brukt til å anslå kostnader ved utbygging av lokaln",
}

@ARTICLE{Syka86:Capacity,
AUTHOR="E. Sykas",
TITLE="On the Capacity Assignment Problem in Packet-Switching Computer
Networks",
JOURNAL="Applied Math. Modelling",
VOLUME=10,
PAGES="346-356",
YEAR=1986,
KEYWORDS="Packet switching; resource allocation",
}

@ARTICLE{Taka8601:Diffusion,
AUTHOR="H. Takahashi and H. Akimaru",
TITLE="A Diffusion Model for Queues in Randomly Varying Environment",
JOURNAL="The Transactions of the IECE of Japan",
ADDRESS="Japan",
VOLUME="E69",
NUMBER=1,
PAGES="13-20",
YEAR=1986,
KEYWORDS="Queueing system; diffusion approximation",
ABSTRACT="Consider the diffusion approximation for queues in randomly
varying environment. The environmental variations may be the changes of
arrival rates and/or changes of service rates caused by changes in
message transmission under occasional crisis. The problem is to seek the
queue size distribution conditional on the process being under different
environment. The problem arises, for example, when we consider the delay
distrib",
}

@INPROCEEDINGS{Tidb86:Analysering,
AUTHOR="S.-E. Tidblom and K. Lindberger",
TITLE="Analysering av ett pollingsystem inom Videotex i syfte att
dimensionera buffertar",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
YEAR=1986,
LANGUAGE="Swedish",
KEYWORDS="Polling system",
ABSTRACT="Datavisionstjänsten, eller Videotex som det numera
heter,innebär att en ansluten kund kan ringa ett speciellt nummer och
via en knappsats begära att få en viss bild exponerad på sin mottagare.
Bilderna fjnns lagrade i en datavisionsdator och berör varierande
områden tex de senaste väderutsikterna, bokning av en resa etc. Ibland
händer det att en begärd bild ej finns lagrad i datavisionsdatorn.
Bildbegäran placeras då i en",
}

@ARTICLE{Tijm86:Simple,
AUTHOR="H. Tijms and A. M. Eikeboom",
TITLE="A Simple Technique in Markovian Control with Applications to
Resource Allocation in Communication Networks",
JOURNAL=orl,
VOLUME=5,
NUMBER=1,
PAGES="25-32",
YEAR=1986,
KEYWORDS="Markov process; control; resource allocation; communication
network; Markovian control",
}

@ARTICLE{Todo8603:Formal,
AUTHOR="R. Todorov and K. T. Atanassov",
TITLE="Formal Communication in Science: A Model Based on Generalized
Nets",
JOURNAL="Scientometrics",
VOLUME=9,
NUMBER="3-4",
PAGES="177-185",
YEAR=1986,
KEYWORDS="Communication network; Petri net; generalized nets",
ABSTRACT="A schematic overview of the formal communication process is
first presented.  Emphasis is placed only on the specific functions and
participants required to transfer article manuscripts from the author to
the reader of scientific journals.  For the description of this process
a mathematical model based on generalised nets (GN) is then proposed.
some advantages of the GN as compared to other models are",
}

@ARTICLE{Tolm8602:Queueing,
AUTHOR="A. L. Tolmachev",
TITLE="Queueing Networks with Regenerating Trajectories",
JOURNAL="Problems of Information Transmission",
ADDRESS="SU",
VOLUME=22,
NUMBER=2,
PAGES="125-132",
YEAR=1986,
KEYWORDS="Queueing network",
}

@INCOLLECTION{VanD86:Insensitivity,
AUTHOR="N. Van Dijk and H. Tijms",
TITLE="Insensitivity in Two-Node Blocking Models with Applications",
BOOKTITLE="Teletraffic Analysis and Computer Performance Evaluation",
EDITOR="O. J. Boxma and J. W. Cohen and H. Tijms",
PUBLISHER="North-Holland",
ADDRESS="Netherlands",
PAGES="329-340",
YEAR=1986,
KEYWORDS="multiserver",
ABSTRACT="As generalization of Engset models, we study two-node cyclic
queueing networks with job-type depending blocking protocols.  The joint
steady-state distribution of the queue sizes for the various job-types
is shown to be insensitive and to have a product form.  It is shown also
that the call congestion of a job when requesting service at a next node
is insensitive.  Moreover, if a job can be blocked only at one",
}

@ARTICLE{Hoor86:Numerical,
AUTHOR="M. van Hoorn",
TITLE="Numerical Analysis of Multi-Server Queues with Deterministic
Service and Special Phase-Type Arrivals",
JOURNAL=zor,
ADDRESS="Germany",
VOLUME=30,
PAGES="A15-A28",
YEAR=1986,
KEYWORDS="Queueing system",
}

@TECHREPORT{Virt86:Partial,
AUTHOR="J. T. Virtamo",
TITLE="Partial Sharing Access Control Policy in Switching Two Different
Traffic in an Integrated Network",
INSTITUTION="Telecommunications laboratory, Technical Research Centre of
Finland",
NUMBER=846017,
PAGES=25,
YEAR=1986,
KEYWORDS="multiserver",
}

@ARTICLE{Weis86:New,
AUTHOR="A. Weiss",
TITLE="A New Technique for Analyzing Large Traffic Systems",
JOURNAL=aap,
VOLUME=18,
PAGES="506-532",
YEAR=1986,
KEYWORDS="Importance sampling; standard deviation; large deviations;
extreme values",
}

@ARTICLE{Whit86:Stochastic,
AUTHOR="W. Whitt",
TITLE="Stochastic Comparisons for non-Markov Processes",
JOURNAL=mor,
VOLUME=11,
NUMBER=4,
PAGES="608-618",
YEAR=1986,
KEYWORDS="comparison; stochastic process; Markov process; queueing
theory; blocking; stochastic order; stochastic dominance; stochastic
monotonicity",
}

@ARTICLE{Wong8607:Response,
AUTHOR="J. W. Wong and Mahmoud Ammar",
TITLE="Response Time Performance of Videotext Systems",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=7,
PAGES="1174-1180",
YEAR=1986,
KEYWORDS="Video service; performance evaluation; response time; Boning
Feng",
ABSTRACT="Videotext is an interactive information system which provides
a variety of services to its users.  Examples of such services are
information retrieval, software distribution, transaction processing,
and message handling.  An important aspect of the quality of service
experienced by a videotext user is the response time.  We consider the
use of mixed individual/broadcast delivery to enhance the response time
perf",
}

@ARTICLE{Yone8605:Comparison,
AUTHOR="K. Yoneda and S. Kojima",
TITLE="A Comparison of Mean Value Analysis Approximation Algorithms",
JOURNAL="The Transactions of the IECE of Japan",
ADDRESS="Japan",
VOLUME="E69",
NUMBER=5,
PAGES="593-596",
YEAR=1986,
KEYWORDS="MVA; approximation; comparison",
}

@ARTICLE{Yunu86:Simple,
AUTHOR="M. N. Yunus",
TITLE="A Simple Derivation of an Approximation to the Transient Blocking
Probability in a Loss System",
JOURNAL=aap,
VOLUME=18,
PAGES="862-863",
YEAR=1986,
KEYWORDS="time dependent queueing system; Erlang B formula",
ABSTRACT="We present a simple derivation for an approximation to the
transient blocking probability of an M/M/n loss system.",
}

@INCOLLECTION{Zeig86:System,
AUTHOR="B. P. Zeigler",
TITLE="System Knowledge: A Definition and its Implications",
BOOKTITLE="Modelling and Simulation Methodology in the Artificial
Intelligence Era",
EDITOR="M. S. Elzas and T. I. Ören",
PUBLISHER="North-Holland",
PAGES="15-17",
YEAR=1986,
KEYWORDS="Expert system; simulation",
}

@INPROCEEDINGS{Jaco86:Conny,
AUTHOR="C. Jacobaeus",
TITLE="Conny Palm-Föregångsman Inom Trafikforsking",
BOOKTITLE="NTS 6",
ADDRESS="Copenhagen, Denmark",
PAGES=7,
YEAR=1986,
LANGUAGE="Danish",
KEYWORDS="Traffic engineering; history",
ABSTRACT="History",
}

@BOOK{Amos86:Bedienungstheorie,
AUTHOR="N. N. Amossowa and H. Gillert and U. K chler and J. D. Maximow",
TITLE="Bedienungstheorie - Eine EinfÜhrung",
ISBN="3-322-00309-4",
PUBLISHER="BSB B.G. Teubner Verlagsgesellschaft",
ADDRESS="Leipzig, Germany",
PAGES=254,
YEAR=1986,
LANGUAGE="German",
REFERENCES=24,
KEYWORDS="Queueing theory; survey",
ABSTRACT="Aufgabenstellung der Bedienungstheorie; Elemente der
Wahrscheinlichkeitstheorie; Stochastische Prozesse; Grundbegriffe der
Bedienungstheorie; Einfache Bedienungsmodelle (Geburts- und
Todesprozesse); Modelle mit Gruppenank nften bzw. Gruppenbedienung;
Einige allgemeinere Bedienungsmodelle; Bedienungsmodelle in der
Lagerhaltung",
}

@BOOK{Stro86:C,
AUTHOR="B. Stroustrup",
TITLE="The {C++} Programming Language: 1st edition",
ISBN="0-201-12078-X",
PUBLISHER="Addison-Wesley",
ADDRESS="Reading, Massachusetts",
YEAR=1986,
KEYWORDS="C++; object-oriented programming; programming language",
}

@ARTICLE{Ston8601:Case,
AUTHOR="Michael Stonebraker",
TITLE="A Case for Shared Nothing",
JOURNAL="Database Engineering",
VOLUME=9,
NUMBER=1,
YEAR=1986,
}

@INPROCEEDINGS{Dewi86:GAMMA,
AUTHOR="D. DeWitt and R. Gerber and G. Graefe and M. Heytens and K.
Kumar and M. Muralikrishna",
TITLE="{GAMMA:} A High Performance Dataflow Database Machine",
BOOKTITLE="VLDB Conference",
PAGES="228-240",
YEAR=1986,
}

@INPROCEEDINGS{Lehm86:Query,
AUTHOR="T. J. Lehman and M. Carey",
TITLE="Query Processing in Main Memory Database Management Systems",
BOOKTITLE="ACM SIGMOD Conference on Management of Data",
YEAR=1986,
}

@ARTICLE{Vick86:Evolution,
AUTHOR="R. Vickers and T. Vilmansen",
TITLE="The Evolution of Telecommunications Technology",
JOURNAL=ieeeproc,
VOLUME=74,
NUMBER=9,
PAGES="1231-1245",
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Conw86:Efficient,
AUTHOR="A. E. Conway and Nicolaos D. Georganas",
TITLE="An Efficient Algorithm for Semi-Homogeneous Queuing Network
Models",
JOURNAL=per,
VOLUME=14,
NUMBER=1,
PAGES="92-99",
YEAR=1986,
REFERENCES=28,
KEYWORDS="Homogeneous network; queueing network; analysis; algorithm",
ABSTRACT="The authors enveloped an algorithm for exact analysis of
semi-homogeneous queuing networks, based on equations which form the
foundation of RECAL. The algorithm may be situated between the
algorithms of Balbo and the general purpose algorithms, both in terms of
its generality and efficiency.",
}

@ARTICLE{Brow86:Future,
AUTHOR="T. E. Browne",
TITLE="Network of the Future",
JOURNAL=ieeeproc,
VOLUME=74,
NUMBER=9,
PAGES="1222-1231",
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Falc86:Telecommunications,
AUTHOR="W. E. Falconer and J. A. Hooke",
TITLE="Telecommunications Services in the Next Decade",
JOURNAL=ieeeproc,
VOLUME=74,
NUMBER=9,
PAGES="1246-1261",
YEAR=1986,
REFERENCES=6,
KEYWORDS="ISDN",
}

@ARTICLE{Sevc86:Cycle,
AUTHOR="K. C. Sevcik and Marjory Johnson",
TITLE="Cycle Time Properties of the {FDDI} Token Ring Protocol",
JOURNAL=per,
VOLUME=14,
NUMBER=1,
PAGES="109-110",
YEAR=1986,
REFERENCES=3,
KEYWORDS="FDDI; cycle time; token ring; protocol",
ABSTRACT="The article gives a brief overview of how the 'timed token'
protocols works.",
}

@ARTICLE{Marg8601:History,
AUTHOR="Phil Margolis",
TITLE="The History of {UNIX}",
JOURNAL="Dec Pro Extra",
PAGES="10-15",
MONTH=jan,
YEAR=1986,
KEYWORDS="UNIX; history of computing",
ABSTRACT="If UNIX and C are bedfellows, the DEC hardware is surely the
bed in which they lie. Ever since its birth on a rusty PDP-7, UNIX has
shared a special relationship with DEC machinery.",
}

@INCOLLECTION{Shac8601:Blend,
AUTHOR="B. Shackel",
TITLE="The Blend System - Plans for the study of some electronic
journals",
BOOKTITLE="BLEND--5: The Computer Human Factors Journal",
EDITOR="B. Shackel and J. Florentin and P. E. Wright",
PUBLISHER="Library and Information Research Report",
ADDRESS="Department of Human Sciences, University of Technology,
Loughborough, UK",
MONTH=jan,
YEAR=1986,
KEYWORDS="human factor; computer conferencing; electronic journals",
ABSTRACT="The plans and initial progress are described for a three-year
experimental program organized jointly by the two Universities as the
Birmingham and Loughborough Electronic Network Development (BLEND). The
aims are to assess the cost, efficiency and subjective impact of such a
system, and to explore and evaluate alternative forms of user
communication through and electronic journal and information network.
Using a host computer at Birmingham University, a community of initially
about 50 scientists (the Loughborough Information Network Community -
LINC) will be connected through the public telephone network to explore
various types of electronic journal. The concept of the electronic
journal involves using a computer to aid the normal procedures whereby
an article is written, refereed, accepted and ``published.'' The subject
of this experimental journal will be ``Computer Human Factors.'' Each
member will contribute at least one research article and one shorter
note in each year of the project, and will also use other forms of
communication such as newsletters, annotated abstracts, workshop
conferences, cooperative authorship, etc. Throughout the project
relevant data will be gathered to enable the assessment of system and
user performance, cost, usefulness, and acceptability.",
}

@ARTICLE{Bell8601:Review,
AUTHOR="Paul R. Bell and K. Jabbour",
TITLE="Review of Point-to-Point Network Routing Algorithms",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=1,
PAGES="34-38",
MONTH=jan,
YEAR=1986,
}

@ARTICLE{Robe8601:Self,
AUTHOR="T. G. Robertazzi and P. E. Sarachik",
TITLE="Self-Organizing Communication Networks",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=1,
PAGES="28-33",
MONTH=jan,
YEAR=1986,
KEYWORDS="routing",
}

@ARTICLE{Sher8601:X,
AUTHOR="M. H. Sherif and G. L. Hoover and R. P. Wiederhold",
TITLE="{X.25} Conformance Testing -- a Tutorial",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=1,
PAGES="16-27",
MONTH=jan,
YEAR=1986,
REFERENCES=25,
KEYWORDS="Protocol testing",
}

@ARTICLE{Whit8601:Deciding,
AUTHOR="W. Whitt",
TITLE="Deciding which Queue to Join: Some Counterexamples",
JOURNAL=or,
VOLUME=34,
NUMBER=1,
PAGES="55-62",
MONTH=jan,
YEAR=1986,
REFERENCES=31,
KEYWORDS="Load Sharing; Analysis; Queueing system",
}

@INPROCEEDINGS{Bach8601:Simulationsprogramm,
AUTHOR="A. Bächle",
TITLE="Simulationsprogramm zur Analyse von Realzeitsystemen und zum
Protokollentwurf",
BOOKTITLE="Workshop ``System- und Anwendungs-Software in der
Nachrichtentechnik''",
ADDRESS="Frankfurt, Germany",
MONTH=jan,
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Simulation; MODULA-2; protocol engineering",
}

@ARTICLE{Mats8601:IMS,
AUTHOR="K. Matsushita and T. Kobayashi and S. Hashimoto and H. Hayashi
and  others",
TITLE="2400 {IMS} {CCITT} No. 7 common channel interoffice signaling
system feature transparency network",
JOURNAL="NEC Research and Development",
NUMBER=80,
PAGES="62-69",
MONTH=jan,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Kles8601:Overview,
AUTHOR="R. W. Klessig",
TITLE="Overview of Metropolitan Area Networks",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=1,
PAGES="9-15",
MONTH=jan,
YEAR=1986,
REFERENCES=24,
KEYWORDS="MAN; overview",
ABSTRACT="This paper presents an overview of Metropolitan Area Networks
(MANs), by defining a MAN, and then reviewing a large sample of
technical approaches to MANs.",
}

@MASTERSTHESIS{Gibs8601:Computation,
AUTHOR="James C. Gibson",
TITLE="Computation Management In A Single Address Space System",
SCHOOL="Massachusetts Institute of Technology",
ADDRESS="Cambridge, MA",
MONTH=jan,
YEAR=1986,
}

@TECHREPORT{Amer8601:Local,
AUTHOR="P. D. Amer",
TITLE="Local Area Broadcast Network Measurement: Traffic
Characterisation",
TYPE="Technical Report",
INSTITUTION="Dept of Computer and Information Sciences, University of
Delaware",
NUMBER="86-12",
MONTH=jan,
YEAR=1986,
}

@TECHREPORT{Brit8601:British,
AUTHOR="British Telecom",
TITLE="British Telecom's Message Handling System Functional Profile
(Provisional)",
TYPE="BT Report",
INSTITUTION="British Telecom",
MONTH=jan,
YEAR=1986,
}

@TECHREPORT{Crow8601:Ethernet,
AUTHOR="Jon Crowcroft",
TITLE="{?MOS} Ethernet Drivers",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1832,
MONTH=jan,
YEAR=1986,
}

@ARTICLE{Yum8602:Resequencing,
AUTHOR="Takshing P. Yum and Tin-Yee Ngai",
TITLE="Resequencing of Messages in Communication Networks",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=2,
PAGES="143-149",
MONTH=feb,
YEAR=1986,
KEYWORDS="communication network; resequencing; queueing theory;
performance evaluation",
ABSTRACT="In this paper, the authors study a message resequencing
problem in a store-and-forward computer network where messages may go
out of order while traversing logical channels. The logical channels are
assumed to consist of multiple physical links which may be of different
capacities. A message is dispatched to the fastest available link.
Resequencing methods suggested by Bharath-Kumar and Kermani
(resequencing at the channel level and resequencing at the virtual
circuit level) are investigated for this link selection rule. The
analysis is done on a two-node network connected by multiple links. The
source node together with the set of outgoing links are modeled an an
$M/M/m$ queue with servers of different rates. The resequencing delay
distribution and the average resequencing delay are derived. On multihop
networks, the effect of message length, link numbers, link service
rates, and the resequencing methods on resequencing delay are
investigated by simulation.",
}

@ARTICLE{Culn8602:Intellectual,
AUTHOR="Mary Culnan",
TITLE="The Intellectual Structure of Management Information Systems,
1972--1982: A Co-citation Analysis",
JOURNAL=ms,
VOLUME=32,
NUMBER=2,
PAGES="289-301",
MONTH=feb,
YEAR=1986,
LANGUAGE="English",
KEYWORDS="management information systems; MIS",
}

@TECHREPORT{Cher8602:Decentralized,
AUTHOR="D. R. Cheriton and T. P. Mann",
TITLE="A Decentralized Naming Facility",
INSTITUTION="Computer Science Department, Stanford University",
ADDRESS="Stanford, CA",
MONTH=feb,
YEAR=1986,
}

@ARTICLE{Gogu8602:Reusing,
AUTHOR="J. A. Goguen",
TITLE="Reusing and Interconnecting Software Components",
JOURNAL=ieeecomp,
VOLUME=19,
NUMBER=2,
PAGES="16-28",
MONTH=feb,
YEAR=1986,
}

@TECHREPORT{ECMA8602:Domain,
AUTHOR="ECMA TC32",
TITLE="Domain Specific Part of Network Layer Addresses",
TYPE="Final draft ECMA standard",
INSTITUTION="ECMA TC32",
MONTH=feb,
YEAR=1986,
}

@ARTICLE{Heat8602:Simplified,
AUTHOR="S. Heatley",
TITLE="A Simplified Discrete Event Simulation Model for an {IEEE} 802.3
Local Area Network",
JOURNAL="National Bureau of Standards",
MONTH=feb,
YEAR=1986,
}

@ARTICLE{Herl8602:Quorum,
AUTHOR="M. Herlihy",
TITLE="A Quorum-Concensus Replication Method for Abstract Data Types",
JOURNAL=tocs,
VOLUME=4,
NUMBER=1,
PAGES="32-53",
MONTH=feb,
YEAR=1986,
}

@ARTICLE{Jose8602:Low,
AUTHOR="T. A. Joseph and K. Birman",
TITLE="Low Cost Management of Replicated Data in Fault-Tolerant
Distributed Systems",
JOURNAL=tocs,
VOLUME=4,
NUMBER=1,
PAGES="54-70",
MONTH=feb,
YEAR=1986,
}

@INCOLLECTION{SunM8602:External,
AUTHOR="{Sun Microsystems}",
TITLE="External Data Representation Protocol Specification",
BOOKTITLE="Networking on the Sun Workstation",
PUBLISHER="Sun Microsystems Inc",
MONTH=feb,
YEAR=1986,
KEYWORDS="XDR; presentation layer",
ABSTRACT="Part no. 800-1324-03, revision B",
}

@ARTICLE{Sand8602:Near,
AUTHOR="T. Sanderson and S. Ho and N. Heijden and E. Jabs and Jr.
Green",
TITLE="Near-realtime data transmission during the {ICE} comet
Giacobini-Zinner encounter",
JOURNAL="ESA Bulletin",
PUBLISHER="European Space Administration",
VOLUME=45,
NUMBER=21,
PAGES="21-23",
MONTH=feb,
YEAR=1986,
KEYWORDS="Unix; real-time; operating system; astronomy",
}

@TECHREPORT{Leve8602:Software,
AUTHOR="N. Leveson",
TITLE="Software Safety: Why, What, and How",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-86-04",
PAGES=69,
MONTH=feb,
YEAR=1986,
ABSTRACT="Software safety issues become important when computers are
used to control real-time, safety-critical processes. This survey
attempts to explain why there is a problem, what the problem is, and
what is known about how to solve it. Since this is a relatively new
software research area, emphasis is placed on delineating the
outstanding issues and research areas.",
}

@ARTICLE{Smit8602:Independent,
AUTHOR="C. U. Smith",
TITLE="Independent General Principles for Constructing Responsive
Software Systems",
JOURNAL=tocs,
VOLUME=4,
NUMBER=1,
PAGES="1-31",
MONTH=feb,
YEAR=1986,
}

@ARTICLE{Jenn8602:Computer,
AUTHOR="Dennis M. Jennings and Lawrence H. Landweber and I. Fuchs and D.
Farber and Richard W. Adrion",
TITLE="Computer Networking for Scientists",
JOURNAL="Science",
DAYS=28,
MONTH=feb,
YEAR=1986,
}

@INPROCEEDINGS{Gone8603:Asynchronous,
AUTHOR="P. Gonet and Pierre Adam and J.-P. Coudreuse",
TITLE="Asynchronous Time Division Switching: The Way to Flexible
Broadband Communication Networks",
BOOKTITLE="International Seminar",
PUBLISHER="North Holland/IEEE",
ADDRESS="Zürich, Switzerland",
PAGES="141-148 (D.5)",
MONTH=mar,
YEAR=1986,
KEYWORDS="BISDN; ATD",
}

@INPROCEEDINGS{Muis8603:Experiments,
AUTHOR="Richard W. Muise and T. J. Schonfeld and G. H. Zimmerman I. I.
I",
TITLE="Experiments in Wideband Packet Technology",
BOOKTITLE="International Seminar",
PUBLISHER="North-Holland/IEEE",
ADDRESS="Zürich",
PAGES="135-139",
MONTH=mar,
YEAR=1986,
KEYWORDS="packet voice",
ANNOTE="See also \cite{Srir8803:Traffic, Heff8609:Markov, Drav8904:End,
Srir8609:Characterizing } T1-system with packet voice (ADPCM with
silence detection and bit-dropping) and data; buffered Banyan switch
with single buffers.  Both switch and multiplexer may drop bits for
overload control.  Summarizes simulation and analysis results.",
}

@ARTICLE{Groe8603:Conversion,
AUTHOR="Inge Groenbaek",
TITLE="Conversion Between the {TCP} and {ISO} Transport Protocols as a
Method of Achieving Interoperability Between Data Communications
Systems",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=2,
PAGES="288-296",
MONTH=mar,
YEAR=1986,
KEYWORDS="network interconnection; transport protocol; TCP; OSI",
}

@ARTICLE{Bast8603:Einchip,
AUTHOR="J. Baston and A. Kohl",
TITLE="Einchip-Steuerbaustein für Omninet",
JOURNAL="Elektronik",
VOLUME=5,
PAGES="135-139",
MONTH=mar,
YEAR=1986,
LANGUAGE="German",
KEYWORDS="LAN; survey; architecture",
ABSTRACT="The article introduces the new one-chip control block for
Omninet by Corvus Systems Inc. The internal architecture, two block
diagrams, a survey about the operations set and the possible network
applications are given.",
}

@ARTICLE{Kafk8603:G,
AUTHOR="G. Kafka",
TITLE="G/NET-das universelle {LAN} für die Bürokommunikation",
JOURNAL="Elektronik",
VOLUME=5,
PAGES="120-128",
MONTH=mar,
YEAR=1986,
LANGUAGE="German",
REFERENCES=2,
KEYWORDS="PC; LAN; ISO reference model; gateway",
ABSTRACT="The article introduces G/NET, a complete solution for
networking with PCs. After comparing the Gateway Network Architecture
(GNA) to the +RMRK+ ISO reference model, the network access method is
described, then local bridges, gateways and G/NET specifications are
explained.",
}

@ARTICLE{Deak8603:Economical,
AUTHOR="I. Deak",
TITLE="The economical method for generating random samples from discrete
distributions",
JOURNAL=toms,
VOLUME=12,
NUMBER=1,
PAGES="34-36",
MONTH=mar,
YEAR=1986,
KEYWORDS="random variate generation",
}

@TECHREPORT{Hahn8603:Round,
AUTHOR="E. L. Hahne and Robert Gallager",
TITLE="Round Robin Scheduling for Fair Flow Control in Data
Communication Networks",
TYPE="LIDS-P",
INSTITUTION="Massachusetts Institute of Technology",
ADDRESS="Cambridge, MA",
NUMBER=1537,
MONTH=mar,
YEAR=1986,
}

@TECHREPORT{BBN8603:Butterfly,
AUTHOR="B. B. N",
TITLE="Butterfly Parallel Processor: Overview",
INSTITUTION="BBN Laboratories Inc.",
NUMBER=6148,
MONTH=mar,
YEAR=1986,
}

@INPROCEEDINGS{Cole8603:OSI,
AUTHOR="Randolph E. Cole and P. J. Lloyd",
TITLE="{OSI} Transport Protocol",
BOOKTITLE="Conference Open Systems",
ADDRESS="London",
PAGES="33-43",
MONTH=mar,
YEAR=1986,
KEYWORDS="OSI; TP4; TCP",
}

@INPROCEEDINGS{Jain8603:Divergence,
AUTHOR="Raj Jain",
TITLE="Divergence of Timeout Algorithms for Packet Retransmissions",
BOOKTITLE="5th Annual International Phoenix Conference on Computers and
Communications",
ADDRESS="Scotsdale, Arizona",
PAGES="174-179",
MONTH=mar,
YEAR=1986,
}

@TECHREPORT{Lini8603:Transition,
AUTHOR="P. F. Linington",
TITLE="Transition to {OSI} Standards",
TYPE="Report of the Academic Community OSI Transition Group (Draft for
Comment)",
INSTITUTION="JNT",
MONTH=mar,
YEAR=1986,
KEYWORDS="ISO",
}

@TECHREPORT{Razo8603:Guided,
AUTHOR="R. R. Razouk",
TITLE="A Guided Tour of {P-NUT} (Release 2.1)",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-86-05",
PAGES=31,
MONTH=mar,
YEAR=1986,
ABSTRACT="P-NUT is a suite of tools for constructing and analyzing Petri
Net models. The tools have been developed at UCI to aid researchers in
applying Petri Nets to the design of concurrent hardware/software. The
tools support state-space analysis, simulation, performance evaluation
and verification. While the tools are useful in their current state, the
P-NUT system is just beginning to achieve its overall objective of
aiding in the design of complex distributed real-time systems. This
report provides a guided tour of the tools for researchers who are
interested in exploring P-NUT's capabilities.",
}

@ARTICLE{Misr8603:Distributed,
AUTHOR="J. Misra",
TITLE="Distributed Discrete-Event Simulation",
JOURNAL=acmcs,
VOLUME=18,
NUMBER=1,
PAGES="39-65",
MONTH=mar,
YEAR=1986,
}

@ARTICLE{Perr8603:Approximate,
AUTHOR="Harry Perros and T. Altiok",
TITLE="Approximate Analysis of Open Networks of Queues with Blocking:
Tandem Configurations",
JOURNAL=ieeese,
VOLUME="SE-12",
NUMBER=3,
PAGES="450-462",
MONTH=mar,
YEAR=1986,
KEYWORDS="Tandem",
}

@ARTICLE{Morr8603:Andrew,
AUTHOR="Joel Morris and M. Satyanarayanan and M. Conner and J. A. Howard
and D. Rosenthal and F. Smith",
TITLE="Andrew: A Distributed Personal Computing Environment",
JOURNAL=cacm,
VOLUME=29,
NUMBER=3,
PAGES="184-201",
MONTH=mar,
YEAR=1986,
}

@TECHREPORT{Will8603:GEM,
AUTHOR="G. Williams and P. M. Nanninga and J. Richard Davis",
TITLE="{GEM:} A Micro-computer based expert system for geographic
domains",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-01",
MONTH=mar,
YEAR=1986,
}

@INPROCEEDINGS{Sait8603:Study,
AUTHOR="Y. Saito and S. Sakito and S. Morita and A. Asano and M.
Okayasu",
TITLE="A study on Broadband Time-Division Switch",
BOOKTITLE="Zurich Seminar on Digital Communications",
ISBN="3 72681 1496 0",
ADDRESS="Zürich, Switzerland",
PAGES="101-108",
MONTH=mar,
YEAR=1986,
REFERENCES=3,
KEYWORDS="Broadband; switching system; case study; TDM",
}

@ARTICLE{Schw8603:1chipnet,
AUTHOR="S. Schwarz",
TITLE="1chipnet kontra Ethernet für kleine und grosse Rechner",
JOURNAL="Elektronik",
VOLUME=5,
PAGES="141-144",
DAYS=5,
MONTH=mar,
YEAR=1986,
LANGUAGE="German",
REFERENCES=5,
KEYWORDS="LAN; CSMA/CD; Ethernet; comparison",
ABSTRACT="The article introduces the 1chipnet, a LAN based on only one
chip, the line driver, that is able to connect microcomputers as well as
mainframes. Using CSMA/CD, it has, due to its intelligent commands, the
same data rate as Ethernet, being much cheaper. For MAP solutions the
equivalent ring network 1chipring with tokenpassing is defined.",
}

@INPROCEEDINGS{Kuro8604:Distributed,
AUTHOR="James F. Kurose and S. Singh",
TITLE="A Distributed Algorithm for Optimum Static Load Balancing in
Distributed Computer Systems",
BOOKTITLE=infocom,
EDITOR="B. Gavish and B. W. Stuck and S. J. Yuill",
ORGANIZATION="IEEE",
ADDRESS="Miami, Florida",
PAGES="458-467",
MONTH=apr,
YEAR=1986,
KEYWORDS="routing",
ANNOTE="gradient-based",
}

@INPROCEEDINGS{ORei8604:Burst,
AUTHOR="Peter O'Reilly",
TITLE="Burst and Fast-Packet Switching: Performance Comparisons",
BOOKTITLE=infocom,
PAGES="653-666",
MONTH=apr,
YEAR=1986,
KEYWORDS="burst switching; fast packet switching",
}

@INPROCEEDINGS{Schu8604:DSP,
AUTHOR="Henning Schulz-Rinne",
TITLE="The {DSP} Workbench: Modeling Parallel Architectures as
Concurrent Processes",
BOOKTITLE=icassp86,
ORGANIZATION="IEEE",
ADDRESS="Tokyo, Japan",
PAGES="54.9.1-54.9.4",
MONTH=apr,
YEAR=1986,
KEYWORDS="interprocess communication; simulation; digital signal
processing",
}

@INPROCEEDINGS{Zuke8604:Multi,
AUTHOR="Moshe Zukerman and I. Rubin",
TITLE="On Multi-Channel Queueing Systems with Fluctuating Parameters",
BOOKTITLE=infocom,
ORGANIZATION="IEEE",
ADDRESS="Miami, Florida",
PAGES="600-608",
MONTH=apr,
YEAR=1986,
KEYWORDS="queueing theory; M/M/K; z-transform",
ANNOTE="$M/M/K$ model with two modes for arrival and service rate;
holding time in each mode is exponential. Derives $z$-transform of
queues size steady state distribution.",
}

@INPROCEEDINGS{Ali8604:Re,
AUTHOR="A. M. K. Mehmet and C. M. Woodside",
TITLE="Analysis of re-assembly buffer requirements in a packet voice
network",
BOOKTITLE=infocom,
ORGANIZATION="IEEE",
ADDRESS="Bal Harbour (Miami), Florida",
PAGES="233-238",
MONTH=apr,
YEAR=1986,
KEYWORDS="packet voice; voice playout",
ABSTRACT="A packet voice receiver for voice channels carried on a data
network must compensate for random network delays by buffering packets
before delivery. The distribution of buffer size depends on the voice
reconstruction protocol used in the receiver. This paper analyzes a
protocol which waits for late packets, due to Barberis and Pazzaglia.
The results include nonstationary buffer length distribution and mean
values, as a function of time in the talkspurt. These results may be
used in the design of a packet voice receiver.",
ANNOTE="The first packet in a talkspurt is delayed a fixed amount of
time, then the receiver waits for subsequent packets and delays
subsequent packets as necessary. This compensates for fast first
packets.",
}

@INPROCEEDINGS{Botr8604:Stereophonic,
AUTHOR="Radamis Botros and Onsy Abdel-Alim and Peter Damaske",
TITLE="Stereophonic speech teleconferencing",
BOOKTITLE=icassp,
ORGANIZATION="IEEE",
ADDRESS="Tokyo, Japan",
VOLUME=2,
PAGES="1321-1324 (26.6)",
MONTH=apr,
YEAR=1986,
KEYWORDS="speech transmission; audioconferencing; teleconferencing",
ABSTRACT="Speech intelligibility in monophonic loudspeaking telephones
has been subject to some limitations from both the transmission medium
and room acoustics. The medium has a limited bandwidth in addition to
inherent noise and distortions. Room acoustics usually add the undesired
impurities of the ``rain-barrel effect'', reverberance and background
noise to direct speech signals. Binaural listening offsets many of these
effects, enhancing speech intelligibility. In this work, a stereophonic
conference telephone has been designed and tested. The test results
showed the feasibility of talker localization and improvements in talker
identification. If two or more persons are talking simultaneously, the
stero telephone makes it possible to concentrate with less strain on one
of the talkers. Speech intelligibility was found to be higher with the
stereophonic telephone.",
}

@INPROCEEDINGS{Yasu8604:Echo,
AUTHOR="Hiroshi Yasukawa and Masakazu Nishino and Kaoru Ishimaru and
Hideyo Murakami",
TITLE="Echo return loss required for acoustic echo cancellerbased on
subjective assessment",
BOOKTITLE=icassp,
ORGANIZATION="IEEE",
ADDRESS="Tokyo, Japan",
VOLUME=2,
PAGES="1309-1312 (26.3)",
MONTH=apr,
YEAR=1986,
KEYWORDS="teleconferencing; echo cancellation",
ABSTRACT="In wideband audio teleconference systems, speech quality may
be degraded due to acoustic echo in the conference room. Echo control
devices such as an echo canceller can be used to improve the speech
quality. This paper describes echo return loss required for acoustic
echo cancellers based on subjective assessment. In particular for talker
echo, subjective evaluation was pursued using a simulated wideband audio
teleconference system constructed in our laboratory. Test conditions
were combinations of transmission delay and insertion loss against echo
path. The thresholds of detectable and/or objectionable echoes based on
subjective evaluation are clarified. A 50 db insertion loss is required
to make 200 ms echoes undetectable. For 60 ms, about 31 dB are
sufficient to make echoes unobjectionable.",
}

@INPROCEEDINGS{Hsin8604:New,
AUTHOR="To R. Hsing",
TITLE="A new adaptive summing technique for audio teleconferencing",
BOOKTITLE=icassp,
ORGANIZATION="IEEE",
ADDRESS="Tokyo, Japan",
VOLUME=2,
PAGES="1325-1328 (26.7)",
MONTH=apr,
YEAR=1986,
KEYWORDS="teleconferencing; speech transmission",
ABSTRACT="The paper proposes adaptive weighting selection for direct
summation of both $\mu$-law and adaptive PCM companders. It can
dynamically adjust the summed signal for multiple concurrent speakers.
The weighting factors for each speaker are automatically determined by
the ratio between instantaneous energy of each speaker and the total
instantaneous (amplitude squared) of all speakers.",
ANNOTE="Can be done much more readily by table lookup.",
}

@ARTICLE{Kim8604:Dynamic,
AUTHOR="Byung G. Kim and Donald F. Towsley",
TITLE="Dynamic Flow Control Protocols for Packet-Switching Multiplexers
Serving Real-Time Multipacket Messages",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=4,
PAGES="348-356",
MONTH=apr,
YEAR=1986,
REFERENCES=19,
KEYWORDS="flow Control; packet switching; protocol; queueing system",
ANNOTE="This paper proposes three dynamic flow control protocols for a
multiplexer handling packetized real-time data, in an attempt to provide
flexibility to the multiplexer operation and at the same time to satisfy
strict delay constraints imposed on real-time data. Queueing analyses of
the protocols as well as simulation results are presented.",
}

@INPROCEEDINGS{Coud8604:Asynchronous,
AUTHOR="J.-P. Coudreuse and P. Boyer",
TITLE="Asynchronous time-division techniques for real-time {ISDN's}",
BOOKTITLE="Séminaire International sur les réseaux temps réel",
ADDRESS="Bandol",
PAGES="1-17",
MONTH=apr,
YEAR=1986,
REFERENCES=9,
KEYWORDS="ATM; performance evaluation",
ABSTRACT="This paper presents the main features of ATD. It describes the
mechanisms affecting the time behaviour of the network and givesat last
first results from an evaluation. Although the experimentation concerns
a public broadband network, mechanisms and evaluation results could be
applied to a private network structure including enhanced LAN's and
PABX's functions.",
}

@ARTICLE{Rein8604:Implementierung,
AUTHOR="J. Reinhart and C. Serrano",
TITLE="Implementierung eines Daten-Cache für die 68000er Familie",
JOURNAL=design_elekt,
ADDRESS="München",
NUMBER=9,
MONTH=apr,
YEAR=1986,
LANGUAGE="German",
KEYWORDS="Cache memory; microprocessor; MC68000",
}

@TECHREPORT{Delp8604:Memnet,
AUTHOR="G. S. Delp and D. Farber",
TITLE="Memnet: An Experiment in High Speed Memory Mapped Local Network
Interfaces",
INSTITUTION="University of Delaware, Delaware",
NUMBER="85-11-1R",
MONTH=apr,
YEAR=1986,
}

@TECHREPORT{Salm8604:Experience,
AUTHOR="M. Salmony",
TITLE="Experience in the Design of a Transport System for Heterogeneous
Environment",
INSTITUTION="IBM Networking Centre",
ADDRESS="Tiergartenstrasse 15, 6900 Heidelberg, Germany",
NUMBER=8601,
MONTH=apr,
YEAR=1986,
}

@TECHREPORT{Baca8604:Admiral,
AUTHOR="B. Bacarisse",
TITLE="Admiral Remote Procedure Call: User Guide for Release 2 and 3",
TYPE="Internal note",
INSTITUTION="Department of Computer Science, University College London",
NUMBER="IN-1936",
MONTH=apr,
YEAR=1986,
KEYWORDS="Rpc",
}

@ARTICLE{Sche8604:X,
AUTHOR="R. Scheifler and Jim Gettys",
TITLE="The X Window System",
JOURNAL=tog,
VOLUME=5,
NUMBER=2,
PAGES="79-109",
MONTH=apr,
YEAR=1986,
ABSTRACT="The first published description of X. Although it discusses
X10, it is still one of the most comprehensive overviews of X. An
updated X11 version is reportedly being written by Jim Gettys.",
}

@INPROCEEDINGS{Birr8604:Global,
AUTHOR="A. D. Birrell and B. W. Lampson and R. M. Needham and M. D.
Schroeder",
TITLE="A Global Authentication Service without Global Trust",
BOOKTITLE="IEEE Security and Privacy Symposium",
PAGES="223-230",
MONTH=apr,
YEAR=1986,
}

@ARTICLE{Hoop8604:Strategy,
AUTHOR="J. W. Hooper",
TITLE="Strategy-Related Characteristics of Discrete-Event Languages and
Models",
JOURNAL="Simulation",
PAGES="153-159",
MONTH=apr,
YEAR=1986,
KEYWORDS="discrete event simulation; simulation language; scheduling;
event sequencing; process interaction; simulation; database",
ABSTRACT="Activity scanning; Event scheduling; Simulation methodologies;
World view",
}

@INPROCEEDINGS{Kuro8605:Microeconomic,
AUTHOR="James F. Kurose and R. Simha",
TITLE="A Microeconomic Approach to Optimal File Allocation",
BOOKTITLE=dcs,
ORGANIZATION="IEEE",
ADDRESS="Cambridge, Massachusetts",
PAGES="28-35",
MONTH=may,
YEAR=1986,
KEYWORDS="distributed systems; distributed algorithms; file allocation;
resource allocation; optimization",
ANNOTE="derivative-based algorithm; see also
\cite{Kuro8905:Microeconomic}",
}

@INPROCEEDINGS{Mala8605:Speech,
AUTHOR="H. J. F. Malavazi and Jr. Santos and A. S. Pires and E. de
Castro and J. S. Yamamoto and D. J. S. Conti and G. Kanno and A. R.
Vivaldi",
TITLE="Speech detector for a {DSI} system",
BOOKTITLE="IEEE Custom Integrated Circuits Conference",
ORGANIZATION="IEEE",
ADDRESS="Rochester, New York",
PAGES="189-193",
MONTH=may,
YEAR=1986,
KEYWORDS="silence detection; digital speech interpolation; DSI",
ABSTRACT="The implementation of an efficient speech detector for a 60
channel DSI equipment, MCP-60A, developed by TELEBRAS is presented. It
accepts two PCM-30 streams which are processed in time sharing mode and
delivers the information concerning to the activity of those input
channels. To perform this function 3 IC's were designed using a CMOS-3
micron full custom process with a total of 30,000 transistors including
4.5 kilobits of dynamic RAM.",
ANNOTE="uses envelope variation and zero crossing rate; hangover
dependent on talkspurt duration; provides offset compensator;
first-order IIR filter with 10/20 Hz cutoff for energy estimation",
}

@ARTICLE{Blaz8605:Scheduling,
AUTHOR="Jacek Blazewicz and Mieczyslaw Drabowski and J. Weglarz",
TITLE="Scheduling Multiprocessor Tasks to Minimize Schedule Length",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=5,
PAGES="389-393",
MONTH=may,
YEAR=1986,
}

@ARTICLE{Ross8605:FDDI,
AUTHOR="Floyd E. Ross",
TITLE="{FDDI} --- a tutorial",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=5,
PAGES="10-17",
MONTH=may,
YEAR=1986,
KEYWORDS="FDDI; tutorial",
ABSTRACT="The fiber distributed data interface (FDDI) is a proposed
American National Standard for 100 Mb/s token ring using an optical
fiber medium. This article discusses this interface in detail.",
}

@ARTICLE{Chou8605:Functional,
AUTHOR="Jin-Jye Chou and Ing-Rong Horng",
TITLE="On a functional approximation for inversion of Laplace transforms
via shifted Chebyshev series",
JOURNAL="International Journal of Systems Science",
VOLUME=17,
NUMBER=5,
PAGES="735-739",
MONTH=may,
YEAR=1986,
KEYWORDS="Laplace transform; inversion; numerical methods; Chebychev
series",
ABSTRACT="A functional representation for inversion of the Laplace
transform of a function is considered. The function is given as a
shifted Chebyshev series expansion. Using special operational
properties, each Laplace transform is converted into a set of
simultaneous linear algebraic equations that are then easily solved to
give the coefficients of the Chebyshev series. The method is simple and
very suitable for computer programming. Applications to rational and
irrational Laplace transforms are presented to demonstrate the
satisfactory results that the method provides.",
}

@INPROCEEDINGS{Holt8605:Characteristics,
AUTHOR="J. M. Holtzman",
TITLE="Characteristics of Superpositions of Traffic Streams",
BOOKTITLE="Brussels Specialists Seminar on ISDN Traffic Issues",
ADDRESS="Brussels",
MONTH=may,
YEAR=1986,
REFERENCES=33,
KEYWORDS="Superposition; Traffic Model; Analysis; Simulation",
}

@ARTICLE{Hoym8605:Tree,
AUTHOR="K. P. Hoyme and S. C. Bruell and P. V. Afshari and R. Y. Kain",
TITLE="A tree-structured mean value analysis algorithm",
JOURNAL=tocs,
VOLUME=4,
NUMBER=2,
PAGES="178-185",
MONTH=may,
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@INPROCEEDINGS{LeGa8605:CCITT,
AUTHOR="P. Le Gall",
TITLE="{CCITT} studies on {ISDN} traffic engineering",
BOOKTITLE="Brussels Specialists Seminar on ISDN Traffic Issues",
ADDRESS="Brussels",
PAGES="1-6 (1.1)",
MONTH=may,
YEAR=1986,
KEYWORDS="ISDN; traffic engineering; standardization",
}

@INPROCEEDINGS{Medi8605:Traffic,
AUTHOR="M. Medina and R. Tudela and O. Gonzalez Soto and T. Gomez
Borja",
TITLE="Traffic characterization for {ISDN} planning studies",
BOOKTITLE="Brussels Specialists Seminar on ISDN Traffic Issues",
ADDRESS="Brussels",
PAGES="1-14 (2.2)",
MONTH=may,
YEAR=1986,
KEYWORDS="ISDN; network planning",
}

@INPROCEEDINGS{Moda8605:Considerations,
AUTHOR="A. R. Modarressi and R. A. Skoog",
TITLE="Performance considerations of signaling networks in an {ISDN}
environment",
BOOKTITLE="Brussels Specialists Seminar on ISDN Traffic Issues",
ADDRESS="Brussels",
PAGES="1-19 (3.2)",
MONTH=may,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS; performance evaluation",
}

@ARTICLE{Schl8605:Overview,
AUTHOR="G. G. Schlanger",
TITLE="An overview of signaling system No. 7",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=3,
PAGES="360-365",
MONTH=may,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@INPROCEEDINGS{Woel8605:Object,
AUTHOR="Kim Woelk and W. J. Luther",
TITLE="An Object-Oriented Approach to Multimedia Databases",
BOOKTITLE="ACM SIGMOD Conference on Management of Data",
MONTH=may,
YEAR=1986,
KEYWORDS="multimedia",
}

@ARTICLE{Barn8605:Practical,
AUTHOR="D. H. Barnes and R. Macdonald",
TITLE="A Practical Distributed Secure System",
JOURNAL="Journal of the Institution of Electronic and Radio Engineers",
VOLUME=56,
NUMBER=5,
PAGES="192-196",
MONTH=may,
YEAR=1986,
}

@ARTICLE{Fitz8605:Integration,
AUTHOR="R. Fitzgerald and Richard F. Rashid",
TITLE="The Integration of Virtual Memory Management and Interprocess
Communication in Accent",
JOURNAL=tocs,
VOLUME=4,
NUMBER=2,
PAGES="147-177",
MONTH=may,
YEAR=1986,
}

@ARTICLE{Kron8605:VAX,
AUTHOR="N. P. Kronenberg and H. M. Levy and W. D. Strecker",
TITLE="{VAXclusters:} A Closely-Coupled Distributed System",
JOURNAL=tocs,
VOLUME=4,
NUMBER=2,
PAGES="130-146",
MONTH=may,
YEAR=1986,
}

@UNPUBLISHED{Luck8605:Interpretation,
AUTHOR="G. L. Luckenbaugh and  others",
TITLE="Interpretation of the Bell-LaPadula Model in Secure Xenix",
NOTE="IBM Corporation",
MONTH=may,
YEAR=1986,
}

@ARTICLE{Belk8605:Direct,
AUTHOR="B. Belkhouche and J. E. Urban",
TITLE="Direct Implementation of Abstract Data Types from Abstract
Specifications",
JOURNAL=ieeese,
VOLUME="SE-12",
PAGES="649-661",
MONTH=may,
YEAR=1986,
}

@TECHREPORT{Crow8605:Monitoring,
AUTHOR="Jon Crowcroft",
TITLE="Performance Monitoring of the Admiral {Internet}",
TYPE="Admiral Note",
INSTITUTION="UCL",
NUMBER="A.345",
MONTH=may,
YEAR=1986,
}

@TECHREPORT{Crow8605:Distributed,
AUTHOR="Jon Crowcroft",
TITLE="A Distributed Application Level Traffic Generator",
TYPE="Admiral Note",
INSTITUTION="UCL",
NUMBER="A.347",
MONTH=may,
YEAR=1986,
}

@TECHREPORT{Crow8605:Concurrency,
AUTHOR="Jon Crowcroft",
TITLE="Concurrency in Distributed Systems",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1898,
MONTH=may,
YEAR=1986,
}

@TECHREPORT{Lloy8605:Ministry,
AUTHOR="P. J. Lloyd and Jon Crowcroft",
TITLE="Ministry of Defence Research Contract 2047/0107: Annual Report
for 1985",
TYPE="Technical Report",
INSTITUTION="UCL",
NUMBER=118,
MONTH=may,
YEAR=1986,
}

@TECHREPORT{Baba8605:Reliable,
AUTHOR="Ozalp Babaoglu and Rogerio Drummond and Patrick Stephenson",
TITLE="Reliable Broadcast Protocols and Network Architecture: Tradeoffs
and Lower Bounds",
INSTITUTION="Cornell University, Computer Science Department",
NUMBER="TR86-754",
PAGES=20,
MONTH=may,
YEAR=1986,
ABSTRACT="Reliable Broadcast is a mechanism by which a processor in a
distributed system disseminates a value to all other processors in the
presence of both communication and processor failures. Protocols to
achieve Reliable Broadcast are at the heart of most fault-tolerant
applications. We characterize the execution time of Reliable Broadcast
protocols as a function of the properties of the underlying
communication network. The class of networks considered includes
familiar communication structures such as fully-connected point-to-point
graphs, linear chains, rings, broadcast networks (such as Ethernet) and
buses. We derive a protocol that implements Reliable Broadcast for any
member within this class. We present a novel proof technique to obtain
lower bound results for Reliable Broadcast in this environment. This
proof technique is based on graph mappings. The hardware-software
tradeoffs that are revealed between performance, resiliency and network
cost offer many new alternatives previously not considered in designing
fault-tolerant systems.",
}

@INPROCEEDINGS{Come8605:Tilde,
AUTHOR="D. Comer and T. P. Murtaugh",
TITLE="The Tilde File Naming Scheme",
BOOKTITLE="6th International Conference on Distributed Computing
Systems",
ADDRESS="Cambridge, Massachusetts",
PAGES="509-514",
MONTH=may,
YEAR=1986,
}

@INPROCEEDINGS{Guse8605:Election,
AUTHOR="Riccardo Gusella and Stephano Zatti",
TITLE="An Election Algorithm for a Distributed Clock Synchronization
Program",
BOOKTITLE=dcs,
ADDRESS="Boston",
PAGES="464-371",
MONTH=may,
YEAR=1986,
KEYWORDS="Tempo",
}

@INPROCEEDINGS{Culp8605:Cellular,
AUTHOR="G. D. Culp",
TITLE="Cellular Intersystem Handoff: Creating Transparent Boundaries",
BOOKTITLE="36th Vehicular Technology Conference",
PAGES="304-310",
MONTH=may,
YEAR=1986,
KEYWORDS="mobile radio",
}

@ARTICLE{LeBo8605:BCMP,
AUTHOR="Jean-Yves Le Boudec",
TITLE="A {BCMP} extension to multiserver stations with concurrent
classes of customers",
JOURNAL=per,
VOLUME=14,
NUMBER=1,
PAGES="78-91",
MONTH=may,
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Stre8605:Generalization,
AUTHOR="J. C. Strelen",
TITLE="A generalization of mean value analysis to higher moments: Moment
analysis",
JOURNAL=per,
VOLUME=14,
NUMBER=1,
PAGES="129-140",
MONTH=may,
YEAR=1986,
KEYWORDS="Queueing network; product form; analysis",
}

@ARTICLE{Taka8605:Queueing,
AUTHOR="H. Takagi and M. Murata",
TITLE="Queueing analysis of nonpreemptive reservation priority
discipline",
JOURNAL=per,
VOLUME=14,
NUMBER=1,
PAGES="237-244",
MONTH=may,
YEAR=1986,
KEYWORDS="Queueing system; priority; analysis",
}

@ARTICLE{Smit8605:Optical,
AUTHOR="S. D. Smith",
TITLE="Optical Bistability; Photonic Logic and Optical Computation",
JOURNAL=aopt,
VOLUME=25,
PAGES="1550-1564",
DAYS=15,
MONTH=may,
YEAR=1986,
}

@INPROCEEDINGS{Ades8606:Protocols,
AUTHOR="Stephen Ades and Roy Want and Roger Calnan",
TITLE="Protocols for Real Time Voice Communication on a Packet Local
Network",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="525-530 (17.1)",
MONTH=jun,
YEAR=1986,
KEYWORDS="packet voice; playout synchronization; local area networks;
PLL",
ABSTRACT="There is currently much interest in alternative architectures
and networks forthe provision of integrated services. A project at the
University Computer Laboratory has been investigating integrated
services provision in a local area context using a slotted ring; the
scope of this work ranges widely from protocol design for simultaneous
transport of voice, data and images to user-level integrated services
facilities, e.g., multimedia editors and image manipulation. This paper
addresses the lowest level -- simultaneous transmission of voice and
data on one network. In particular, since our network is packet based
whereas traditional voice-carrying networks have been circuit switched,
it considers the design of protocols for packet voice to produce delays
no greater than those in current circuit-switched PABXs --- a capability
without which packet systems simply are not practical for general use.
Our work on packet-based protocols has been fuelled by the fact that
commonly accepted telecommunication approaches to voice/data transport
are based on assumptions, from some time ago, that bandwidth is
expensive and that its usage must be maximized and optimized. These
assumptions are no longer true within current local area network
technology.",
ANNOTE="Presents detailed description of packet voice on a 100 Mbits/s
slotted ring.  2 ms packets without silence suppression and silence
fill-in.  Discusses circular buffering, 8 kHz synchronization with slow
adjustment (packet-PLL).  Argues against silence suppression under
normal circumstances to prevent change in background noise during
silence periods; mark silence for storage or WAN applications.  Packets
carry sequence numbers, but no time stamps.  Delays set amount $j$ after
receival of first packet.  Cites study that bursts of missing packet
occurring up to 1\% are not noticeable as long as bursts are less than 4
ms.",
}

@INPROCEEDINGS{Boel8606:Overload,
AUTHOR="R. Boel and J. van Schuppen",
TITLE="Overload Control for Switches of Communication Systems --- a
Two-Phase Model for Call Request Processing",
BOOKTITLE="Teletraffic Analysis and Computer Performance Evaluation",
EDITOR="O. J. Boxma and J. W. Cohen and H. Tijms",
ORGANIZATION="International Teletraffic Council",
PUBLISHER="North Holland",
ADDRESS="Amsterdam, The Netherlands",
PAGES="209-224",
MONTH=jun,
YEAR=1986,
KEYWORDS="congestion control; call admission",
ANNOTE="call admittance for SPC switches.",
}

@INPROCEEDINGS{Clar8606:Preemptive,
AUTHOR="Loren Clare and I. Rubin",
TITLE="Preemptive Buffering Disciplines for Time-Critical Sensor
Communications",
BOOKTITLE=icc,
ORGANIZATION="IEEE",
ADDRESS="Toronto, Canada",
PAGES="904-909",
MONTH=jun,
YEAR=1986,
KEYWORDS="queueing theory",
ANNOTE="See also \cite{Rubi88:Analysis}. Slotted, discrete-time
single-server system with batch arrivals and deterministic service.
Preemptive buffering (PB) removes customer with longest wait and admits
new arrival. FCFS and LCFS (LIFO), compared with non-preemptive FCFS.
Minimum mean waiting time for non-lost packets is obtained using
LCFS/PB. Unconditional expectation of any convex function of the waiting
time is minimized using FCFS/PB and maximized using LCFS/NPB. Shows
examples for geometrically distributed batches.",
}

@ARTICLE{Dosh8606:Overload,
AUTHOR="B. T. Doshi and H. Heffes",
TITLE="Overload Performance of Several Processor Queueing Disciplines
for the {M/M/1} Queue",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="538-546",
MONTH=jun,
YEAR=1986,
KEYWORDS="queueing theory; FIFO blocking (finite buffer); FIFO pushout:
oldest customer replaced; LIFO pushout; FIFO timeout (customer leaves
after deterministic waiting time); LIFO timeout",
ABSTRACT="In a variety of overload queueing systems (e.g., an overloaded
call processing system), long delays can result either in poor service
given to the customer or in customers, unknown to the system, turning
``bad.'' For example, in a switching system, long dial tone delays can
result in customers initiating dialing before receiving dial tone. In
this case the system will not receive all the digits and an unsuccessful
call results. This can lead to the system expending real time on
unsuccessful services and, therefore, reduces the effective throughput.
Thus, there is a need for control schemes which reduce the load offered
to the processor by selectively refusing service to some customers in
such a way as to keep delays, for those customers which are selected for
service, small. This fact has been recognized and has led to improved
strategies for local switches. In this paper we analyze and compare the
performance of various queueing and service disciplines for an $M/M/1$
queue. We consider LIFO and FIFO schemes with customer rejection
mechanisms corresponding to pushing out or timing out older customers in
queue. Delay distributions for served customers are obtained and
comparisons based upon throughput-delay tradeoffs are presented. For the
situation where customers can turn ``bad'' at a random time after their
arrival, we compare the throughput of good customers. The results
presented are a mixture of classical results, which are briefly stated,
and new results which are developed in more detail. The numerical
results show a dramatic effect of the queueing and service disciplines
on the overload performance and a strong dependence of the throughput of
successful services on the mechanism for customers turning ``bad''.
Although results are obtained for a single server queue, they can be
used to approximately analyze overload control schemes which control
access to distributed systems.",
}

@INPROCEEDINGS{Kell8606:Blocking,
AUTHOR="F. P. Kelly",
TITLE="Blocking and Routing in Circuit-Switched Networks",
BOOKTITLE="Teletraffic Analysis and Computer Performance Evaluation",
EDITOR="O. J. Boxma and J. W. Cohen and H. Tijms",
ORGANIZATION="International Teletraffic Council",
PUBLISHER="North Holland",
ADDRESS="Amsterdam, The Netherlands",
PAGES="37-45",
MONTH=jun,
YEAR=1986,
KEYWORDS="queueing theory",
}

@ARTICLE{Lee8606:Study,
AUTHOR="Hwang-Soo Lee and Chong Kwan Un",
TITLE="A Study of On-Off Characteristics of Conversational Speech",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=6,
PAGES="630-637",
MONTH=jun,
YEAR=1986,
KEYWORDS="packet voice",
ABSTRACT="The on-off statistics of conversational speech have been
investigated using a large database of 50 min of telephone speech. Based
on the measurement results of on-off patterns, probability density
functions of silence and talkspurt durations are modeled approximately
by two weighted geometric functions. Then, for any value of hangover or
fill-in, speech parameters such as speech activity, average silence, and
talkspurt durations are calculated using the fitted probability density
function of silence durations and compared to those measured. Directly
measured values of speech parameters and thos calculated agree closely
for a practical range of hangover and fill-in time. For a large hangover
time greater than 200 ms, silences and talkspurts can be fit by a
constant-plus-exponential distribution and an exponential distribution,
respectively. With both large hangover and fill-in values, the talkspurt
model agrees closely with the measured data, but the silence model does
not agree as closely as the talkspurt model.",
}

@INPROCEEDINGS{Tran8606:Discrete,
AUTHOR="P. Tran-Gia",
TITLE="Discrete-Time Analysis for the Interdeparture Distribution of
{GI/G/1} Queues",
BOOKTITLE="Teletraffic Analysis and Computer Performance Evaluation",
EDITOR="O. J. Boxma and J. W. Cohen and H. Tijms",
ORGANIZATION="International Seminar at the Centre for Mathematics and
Computer Sciences (CWI)",
ADDRESS="Amsterdam, The Netherlands",
PAGES="341-357",
MONTH=jun,
YEAR=1986,
REFERENCES=40,
KEYWORDS="queueing system; discrete time analysis",
ABSTRACT="The class of GI/G/1 queues with discrete-time distributions of
arrival and service processes is considered. This type of models arise
out of measurements in the form of histograms or in modelling approaches
of time-slotted systems, packet switching systems, etc.. Using known
discrete-time algorithms for the calculation of the waiting time
distribution function, a new numerical analysis method for the idle
period and the output process is presented in this paper, whereby the
distribution of the interdeparture time is obtained. The method
described is based on the evaluation of discrete convolution operations
using fast convolution algorithms, e.g., the fast Fourier transform, in
conjunction with the concept of virtual unfinished work. In order to
illustrate the use of the method, numerical examples are given for
different types of input and service processes.",
}

@ARTICLE{As8606:Transient,
AUTHOR="H. van As",
TITLE="Transient analysis of Markovian queueing systems and its
application to congestion-control modeling",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="891-904",
MONTH=jun,
YEAR=1986,
REFERENCES=13,
KEYWORDS="Transient analysis; Markovian queueing system; congestion
control; modeling; packet switching; Runge-Kutta procedure",
}

@ARTICLE{Land8606:Research,
AUTHOR="Lawrence H. Landweber and Dennis M. Jennings and I. Fuchs",
TITLE="Research computer networks and their interconnection",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=6,
PAGES="5-17",
MONTH=jun,
YEAR=1986,
REFERENCES=17,
KEYWORDS="computer network; survey; bibliography",
ABSTRACT="The article gives an overwiew over most computer networks for
research purposes existing in usa and europe like csnet, earn etc.",
}

@ARTICLE{Karv8606:Integrated,
AUTHOR="D. Karvelas and A. Leon-Garcia",
TITLE="Performance of Integrated Packet Voice/Data Token-Passing Rings",
JOURNAL=ieeejsac,
VOLUME=4,
NUMBER=6,
PAGES="823-832",
MONTH=jun,
YEAR=1986,
REFERENCES=4,
KEYWORDS="Performance evaluation; packet voice; LAN; token ring; packet
switching",
ABSTRACT="The paper presents performance results that indicate that
packetized voice service can be provided on a token-passing ring without
adversely affecting the performance of data traffic. This is
accomplished by introducing a relatively mild priority structure.",
}

@TECHREPORT{Cher8606:Software,
AUTHOR="D. R. Cheriton and G. A. Slavenburg and P. D. Boyle",
TITLE="Software-Controlled Caches in the {VMP} Multiprocessor",
INSTITUTION="13th Symposium on Computer Architecture",
MONTH=jun,
YEAR=1986,
}

@ARTICLE{Hu8606:Gateway,
AUTHOR="W. Hu",
TITLE="Design and Implementation of a Gateway Between Two Electronic
Mail Systems",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=6,
PAGES="18-23",
MONTH=jun,
YEAR=1986,
}

@INPROCEEDINGS{Evan8606:Notifier,
AUTHOR="Steve Evans",
TITLE="The Notifier",
BOOKTITLE="Summer USENIX Conference",
ADDRESS="Atlanta, Georgia",
PAGES="344-354",
MONTH=jun,
YEAR=1986,
REFERENCES=5,
KEYWORDS="operating systems; event handling; windowing systems;
notifier",
ABSTRACT="The notifier is an event-driven dispatcher. It is a
general-purpose library package for distributing events to a collection
of clients within a process. The notifier detects events that its
clients have expressed an interest in and dispatches these events to the
proper clients, queuing clients processing so that clients respond to
relevant events in a predictable order. The paper motivates the design
of the notifier and describes the flavor of the programming interface to
it.",
}

@INPROCEEDINGS{Suzu8606:Real,
AUTHOR="T. Suzuki and Hideo Taniguchi and Hisayasu Takada",
TITLE="A Real-Time Electronic Conferencing System based on Distributed
{UNIX}",
BOOKTITLE="Summer USENIX Conference",
ORGANIZATION="Usenix",
PAGES="189-199",
MONTH=jun,
YEAR=1986,
KEYWORDS="electronic conferencing; distributed UNIX; CSCW",
ABSTRACT="This paper describes a real-time electronic conferencing
service constructed on a distributed UNIX operating system. In this
conferencing service, identical contents are displayed in windows on
each participant's workstation and updated simultaneously. Using shared
windows, any services which run on standard UNIX are available without
any modification. Basic mechanisms to support the conferecning
environment are studied and implemented in the distributed UNIX. It has
been developed on the basis of UNIX system V by networking the file
system and introducing network directories which utilize the
broadcasting ability of LAN. The conferencing service has already been
constructued and evaluated in a real machine environment.",
}

@TECHREPORT{Suda8606:Multi,
AUTHOR="T. Suda",
TITLE="Issues in Multi-Media Information Networks",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-86-08",
PAGES=20,
MONTH=jun,
YEAR=1986,
ABSTRACT="In an integrated service environment, where users exchange
various types of aural and visual information, networks should appear
friendly to its users providing tools for management of multi-media
information. Networks should also efficiently satisfy diverse
performance requirements of different information being exchanged. In
this paper we present new architecture for integrated service networks
being investigated and developed by the Distributed Computation and
Communication Group at the Department of Computer Science in the
Columbia University. Research efforts are devoted to developing both (1)
document management software to allow users to manipulate and relate
text/graphics/ voice information in a dynamic way, and (2) a tree
network architecture for reliable and efficient exchange of multi-media
information.",
}

@MASTERSTHESIS{Feld8606:Flocks,
AUTHOR="Robert E. Felderman",
TITLE="Flocks of Birds as a Paradigm for Distributed Systems",
SCHOOL="University of California, Los Angeles",
ADDRESS="Computer Science Department UCLA Los Angeles, CA 90024-1596",
MONTH=jun,
YEAR=1986,
}

@INPROCEEDINGS{Agar8606:ATUM,
AUTHOR="A. Agarwal and R. L. Sites and M. Horowitz",
TITLE="{ATUM:} A New Technique for Capturing Address Traces Using
Microcode",
BOOKTITLE="13th Annual Symposium on Computer Architecture",
PUBLISHER="IEEE",
PAGES="pp. 119-127",
MONTH=jun,
YEAR=1986,
}

@TECHREPORT{Schr8606:VLSI,
AUTHOR="H. Schröder",
TITLE="{VLSI} - Sorting Evaluated Under the Linear Model",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-03",
MONTH=jun,
YEAR=1986,
}

@TECHREPORT{Bacc8606:Series,
AUTHOR="François Baccelli and W. A. Massey",
TITLE="Series-Parallel, Fork-Join Queueing Networks and Their Stochastic
Ordering",
TYPE="Rapport de Recherche",
INSTITUTION="INRIA",
ADDRESS="France",
NUMBER=534,
PAGES=18,
MONTH=jun,
YEAR=1986,
KEYWORDS="Queueing network",
ABSTRACT="We define a new class of queueing systems that are formed by
combining series and Fork-Join networks.  For such networks, we derive
bounds on the moments of the total delay to traverse such networks, for
both transient and stationary case.  We accomplish this by generalizing
both Loynes increasing schema and the convex ordering theorem.  These
results have applications to flexible manufacturing and parallel
processing.",
}

@INPROCEEDINGS{Taji8606:Flexible,
AUTHOR="J. Tajima and K. Imamura",
TITLE="Flexible-Channel-Assigned High-Capacity Mobile Communication
Systems",
BOOKTITLE=icc,
ADDRESS="Toronto, Canada",
PAGES="3.4.1-6",
MONTH=jun,
YEAR=1986,
KEYWORDS="Mobile radio; MAT",
}

@INPROCEEDINGS{Fros8606:Hybrid,
AUTHOR="Victor S. Frost and K. S. Shanumgan",
TITLE="Hybrid Approaches to Network Simulation",
BOOKTITLE=icc,
ADDRESS="Toronto, Canada",
PAGES="8.6.1-7",
DAYS=22,
MONTH=jun,
YEAR=1986,
KEYWORDS="Simulation; Communication Network; Hybrid Simulation",
}

@INPROCEEDINGS{Ko8606:New,
AUTHOR="C. C. Ko and K. M. Lye",
TITLE="A New Priority Multi-channel {CSMA/CD} Protocol",
BOOKTITLE=icc,
ADDRESS="Toronto, Canada",
PAGES="5.2.1-5",
DAYS=22,
MONTH=jun,
YEAR=1986,
KEYWORDS="LAN; CSMA/CD",
}

@INPROCEEDINGS{Glyn8607:Monte,
AUTHOR="P. W. Glynn and J. L. Sanders",
TITLE="Monte Carlo Optimization of Stochastic Systems: Two New
Approaches",
BOOKTITLE="ASME International Computers in Engineering Conference",
EDITOR="Gopal D. Gupta and K. S. Ahluwalia and Christopher Carothers",
ORGANIZATION="ASME",
ADDRESS="Chicago, Illinois",
PAGES="219-223",
MONTH=jul,
YEAR=1986,
KEYWORDS="perturbation analysis",
}

@ARTICLE{Bate8607:Media,
AUTHOR="Richard Bates and Paul Abramson and Franc Noel",
TITLE="Media for voice-data integration",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=7,
PAGES="13-17",
MONTH=jul,
YEAR=1986,
KEYWORDS="speech transmission; cable",
ABSTRACT="Some general historical perspectives, followed by a review of
the important transmission parameters for selecting media, a discussion
of the various cable designs, and finally, a systems example is given to
illustrate voice-data integration. --- Discusses integration on the same
cable, but not within the same switch.",
}

@ARTICLE{Bast8607:Voice,
AUTHOR="Michel Bastian",
TITLE="Voice-data integration: an architecture perspective",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=7,
PAGES="8-12",
MONTH=jul,
YEAR=1986,
KEYWORDS="packet voice; speech transmission; circuit switching",
ABSTRACT="Compares circuit and packet switching for voice and data.",
}

@ARTICLE{Ibe8607:Protocols,
AUTHOR="Oliver C. Ibe and David T. Gibson",
TITLE="Protocols for integrated voice and data local area networks",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=7,
PAGES="30-36",
MONTH=jul,
YEAR=1986,
KEYWORDS="packet voice; token ring",
ABSTRACT="Distributed transmission protocols for voice on token-ring
networks are considered. Uses a reservation bit in the packet header
that prevents data stations from seizing the token. The token carries
the number of currently active stations.",
}

@TECHREPORT{Woel8607:Storage,
AUTHOR="Woelk and  others",
TITLE="Storage Structures for an Object-Oriented Multimedia Database",
TYPE="MCC Technical Report",
INSTITUTION="MCC",
NUMBER="DB-205-86",
MONTH=jul,
YEAR=1986,
KEYWORDS="multimedia",
}

@UNPUBLISHED{Cher8607:UIO,
AUTHOR="D. R. Cheriton",
TITLE="{UIO:} A Uniform {I/O} System Interface for Distributed Systems",
NOTE="Stanford University",
MONTH=jul,
YEAR=1986,
}

@ARTICLE{Cheu8607:Site,
AUTHOR="D. Cheung and T. Kameda",
TITLE="Site Optimal Termination Protocols for a Distributed Database
Under Network Partitioning",
JOURNAL=acmosrev,
VOLUME=20,
NUMBER=3,
PAGES="17-27",
MONTH=jul,
YEAR=1986,
}

@TECHREPORT{Finn8607:Application,
AUTHOR="Gregory G. Finn",
TITLE="The Application of Cartesian Routing to Networks of Irregular and
Unstable Topology",
INSTITUTION="University of Southern California-Information Services
Institute",
ADDRESS="4676 Admiralty Way, Marina del Rey, CA 90292",
NUMBER="SRNTN-45",
MONTH=jul,
YEAR=1986,
}

@TECHREPORT{Finn8607:Routing,
AUTHOR="Gregory G. Finn",
TITLE="Routing and Addressing Problems in Large Metropolitan Scale
Internetworks",
INSTITUTION="USC-Information Sciences Institute",
ADDRESS="Marina del Ray, CA",
NUMBER="SRNTN 44",
MONTH=jul,
YEAR=1986,
}

@ARTICLE{Lamp8607:Byzantine,
AUTHOR="Leslie Lamport and P. M. Melliar-Smith",
TITLE="Byzantine Clock Synchronization",
JOURNAL=acmosrev,
VOLUME=20,
NUMBER=3,
PAGES="10-16",
MONTH=jul,
YEAR=1986,
}

@TECHREPORT{Crow8607:CN,
AUTHOR="Jon Crowcroft",
TITLE="{CN} Probe for 4.2 Unix",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1999,
MONTH=jul,
YEAR=1986,
}

@TECHREPORT{Euro8607:ECMA,
AUTHOR="European Computer Manufacturer's Association",
TITLE="{ECMA} Distributed Application Support Environment",
INSTITUTION="European Computer Manufacturer's Association",
NUMBER="ECMA TC32-TG2/86/61",
MONTH=jul,
YEAR=1986,
KEYWORDS="Dase",
}

@TECHREPORT{Mera8607:ADMIRAL,
AUTHOR="Madjid Merabti",
TITLE="{ADMIRAL} {Internet} Performance Results",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1989,
NOTE="ADMIRAL Project Report A.374",
MONTH=jul,
YEAR=1986,
}

@ARTICLE{Gold8607:Image,
AUTHOR="M. Goldberg and Hung-Min Sun",
TITLE="Image Sequence Coding Using Vector Quantization",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=7,
PAGES="703-710",
MONTH=jul,
YEAR=1986,
KEYWORDS="video compression; vector quantization",
}

@ARTICLE{Klei8607:Selecting,
AUTHOR="J. P. Kleijnen",
TITLE="Selecting Random Number Seeds in Practice",
JOURNAL="Simulation",
PAGES="15-17",
MONTH=jul,
YEAR=1986,
KEYWORDS="Rng",
}

@ARTICLE{Anon8607:Stratacom,
AUTHOR="Anonymous",
TITLE="Stratacom, Inc. Introduces `Packetized Voice System'",
JOURNAL="Communications Week",
VOLUME=2,
DAYS=14,
MONTH=jul,
YEAR=1986,
}

@INPROCEEDINGS{Frie8608:Real,
AUTHOR="Edward M. Friedman and Chaim Ziegler",
TITLE="Real-time voice communications over a token-passing ring local
area network",
BOOKTITLE=sigcomm,
ORGANIZATION="ACM",
ADDRESS="Stowe, Vermont",
PAGES="52-57",
NOTE="Also in Computer Communication Review (ACM CCR) 16(3), Aug, 1986",
MONTH=aug,
YEAR=1986,
REFERENCES=15,
KEYWORDS="packet voice; local area network",
ABSTRACT="This paper describes an implementation of a real-time,
packetized voice communication system over a personal computer (PC)
based token-passing ring local area network. System configuration and
operation are presented. The system implements real-time conversational
transmission of voice packets between two stations on the network. An
analysis is shown to calculate the maximum number of two way
conversations that can be handled by the system without any
reconstitution delay. The receiver is frozen whenever packet loss
occurs.",
ANNOTE="no silence detection",
}

@INPROCEEDINGS{Cher8608:VMTP,
AUTHOR="D. R. Cheriton",
TITLE="{VMTP:} A Transport Protocol for the Next Generation of
Communication Systems",
BOOKTITLE=sigcomm,
ORGANIZATION="ACM",
ADDRESS="Stowe, Vermont",
PAGES="406-415",
NOTE="also in Computer Communications Review, 16 (3), August 1986",
MONTH=aug,
YEAR=1986,
REFERENCES=13,
KEYWORDS="transport protocol; VMTP",
ABSTRACT="The Versatile Message Transaction Protocol {(VMTP)} is a
transport-level protocol designed to support remote procedure call,
multicast, and real-time communication. The protocol is designed for
efficient page-level network file access in particular.",
ANNOTE="Also in Computer Communication Review (ACM CCR) 16(3), Aug,
1986",
}

@INPROCEEDINGS{Zhan8608:TCP,
AUTHOR="L. Zhang",
TITLE="Why {TCP} Timers Don't Work Well",
BOOKTITLE=sigcomm,
ORGANIZATION="ACM",
ADDRESS="Stowe, Vermont",
PAGES="397-405",
MONTH=aug,
YEAR=1986,
KEYWORDS="transport protocol; TCP; timer dimensioning",
}

@ARTICLE{Stri8608:Estimation,
AUTHOR="Robin N. Strickland and M. R. Gerber",
TITLE="Estimation of ship profiles from a time sequence of
forward-looking infrared images",
JOURNAL=opteng,
VOLUME=25,
NUMBER=8,
PAGES="995-1000",
MONTH=aug,
YEAR=1986,
}

@ARTICLE{Mill8608:Prediction,
AUTHOR="K. Mills and M. Wheatley and S. Heatley",
TITLE="Prediction of transport protocol performance through simulation",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="75-83",
NOTE="sigcomm",
MONTH=aug,
YEAR=1986,
REFERENCES=19,
KEYWORDS="Simulation; throughput; response time; LAN; OSI; protocol
performance; five layer simulation model; protocol",
ABSTRACT="A five layer simulation model of OSI protocols is described
and applied to predict transport performance on a local area network
(LAN).  Emphasis is placed on time-critical applications typical of a
small, flexible manufacturing system.  The results predict that, with
current technology, OSI protocols can provide 1.6 Mbps throughput,
one-way delays between 6 and 10 ms, and response time between 15 and 25
ms.  The results also indicate that CSMA/CD is a reasonable access
method for time-critical applications on small, factory LANs, if loads
of less than 40\% are anticipated.  For loads between 40\% and 70\%, a
token passing access method provides better performance for
time-critical applications.",
ANNOTE="OSI protocols can reach a throughput of 1.5 Mb/s, response times
of 15-25 ms and one-way delays of 6-10 ms.",
}

@ARTICLE{Suh8608:Fiber,
AUTHOR="S. Y. Suh and S. W. Granlund and S. S. Hegde",
TITLE="Fiber-Optic Local Area Network Topology",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=8,
PAGES="26-31",
MONTH=aug,
YEAR=1986,
REFERENCES=13,
KEYWORDS="LAN; topology; fiber optics; bus; star",
ABSTRACT="The article reviews the fundamental limitations of fiber optic
links in the LAN environment and addresses criteria for selecting a
suitable topology for a fiber optic based LAN. The centralized wiring
topology is shown to be sufficiently flexible and well suited to fiber
optic based LAN architectures.",
}

@INPROCEEDINGS{WEdm8608:Butterfly,
AUTHOR="Winston Edmond and Steven Blumenthal and A. Echenique and S.
Storch and T. Calderwood and T. Rees",
TITLE="The Butterfly Satellite {IMP} for the Wideband Packet Satellite
Network",
BOOKTITLE=sigcomm,
ORGANIZATION="ACM",
ADDRESS="Stowe, Vermont",
PAGES="194-203",
MONTH=aug,
YEAR=1986,
}

@ARTICLE{Lazo8608:File,
AUTHOR="E. D. Lazowska and J. L. Zahorjan and D. R. Cheriton and W.
Zwaenepoel",
TITLE="File Access Performance of Diskless Workstations",
JOURNAL=tocs,
VOLUME=4,
NUMBER=3,
PAGES="238-268",
MONTH=aug,
YEAR=1986,
}

@ARTICLE{Mean8608:Formal,
AUTHOR="B. Meandzija",
TITLE="A Formal Method for Composing a Network Command Language",
JOURNAL=ieeese,
VOLUME="SE-12",
NUMBER=8,
PAGES="860-865",
MONTH=aug,
YEAR=1986,
}

@PHDTHESIS{Ng8608:Long,
AUTHOR="P. Ng",
TITLE="Long Atomic Computations",
SCHOOL="Massachusetts Institute of Technology",
ADDRESS="Cambridge, MA",
NUMBER="TR 377",
MONTH=aug,
YEAR=1986,
ABSTRACT="Distributed computing systems are becoming commonplace and
offer interesting opportunities for new applications.  In a practical
system, the problems of synchronizing concurrent computations and
recovering from failures must be dealt with effectively.  Atomicity has
been suggested as a tool that masks concurrency and failures from the
users of a system.  With synchronization and recovery mechanisms, atomic
computations appear to execute indivisibly.  This dissertation addresses
the issues in implementing long atomic computations, such as
computations that last for hours or even days.  Long computations make
synchronization more difficult because their execution is more
overlapped.  They are also more likely to encounter failures in their
execution.  Three issues are: 1.  Should long computations be executed
automatically?  Or should atomicity be replaced with other correctness
criteria to increase the concurrency of a system?  2.  If long atomic
computations can be implemented practically, are implementation
paradigms that application programmers can follow to simplify the
programming effort?  3.  How can long atomic computations be made
resilient to transient failures?  This dissertation shows that by using
the semantics of an application, a system that supports atomic
computations can be made as concurrent as other systems that do not.
Since atomicity is easier to understand than other correctness criteria,
systems that support long atomic computations are preferable.  Using the
semantics of an application requires application-dependent
synchronization and recovery code, which can be complicated.  and
introduce subtle errors easily.  Several synchronization and recovery
paradigms are investigated in this dissertation.  The paradigms divide
synchronization and recovery into levels so that the task at each level
is simpler.  A programming interface that hides the concurrency control
algorithm used by a system implementation is also presented.  Finally,
this dissertation discusses the use of checkpoints and buffered messages
to increase the resilience of long atomic computations.",
URL="http://ana-www.lcs.mit.edu/anaweb/abstracts/tr-377.html",
}

@ARTICLE{Kill8608:THORN,
AUTHOR="S. E. Kille",
TITLE="{THORN} (The Obviously Required Nameserver",
JOURNAL="IES News",
PUBLISHER="Esprit",
VOLUME=5,
MONTH=aug,
YEAR=1986,
}

@TECHREPORT{Hugh8608:Multicast,
AUTHOR="L. Hughes",
TITLE="A Multicast Transmission Taxonomy",
INSTITUTION="Newcastle University",
NUMBER=221,
PAGES="1-15",
MONTH=aug,
YEAR=1986,
KEYWORDS="Multicast addressing",
ABSTRACT="The main idea of the paper is to look at the different ways
multicast packets can be addressed (individual vs. group addresses,
single vs. multiple addresses) and how the need to translate addresses
e.g. from group to individuals influences the number of packets required
for each multicast.",
}

@TECHREPORT{Birm8608:Programming,
AUTHOR="K. Birman and T. A. Joseph and Frank B. Schmuck and Patrick
Stephenson",
TITLE="Programming with Shared Bulletin Boards in Asynchronus
Distributed Systems",
INSTITUTION="Cornell University, Computer Science Department",
NUMBER="TR86-772",
PAGES=37,
NOTE="Revised December 1986",
MONTH=aug,
YEAR=1986,
ABSTRACT="We consider loosely coupled distributed computing systems in
which processes interact through shared resources, which are modeled as
bulletin boards. The first part of the paper formalizes the notion of
consistent behavior when unreliable processes concurrently access a
bulletin board. This model is interesting both as a tool for showing the
correctness of a board implementation and also because it provides a
mechanism for reasoning about consistency in distributed systems, which
was previously lacking. The remainder of the paper discusses software
techniques for implementing consistent bulletin boards in a network of
processors lacking shared memory. Applications for our approach range
from asynchronous interprocess communication to mechanisms for achieving
mutual exclusion, deadlock detection and for building distributed
database systems.",
}

@ARTICLE{Fole8608:Current,
AUTHOR="J. S. Foley and Y. Weon-Yoon",
TITLE="The Current Status of {MAP}",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="6-12",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=5,
ABSTRACT="MAP is a standard computer networking discipline and a unified
set of communications protocols which make it possible to implement a
vendor independent network of computers. MAP provides a complete service
to the user or application program.  The major facilities, file
transfer, process to process messaging, inter-machine messaging, and
directory service are supported.  Virtual terminal protocol support is
planned for the near future. MAP is a subset of the internationally
agreed Open Systems Interconnection computer networking architecture,
protocols and supporting standards. The MAP subset of OSI Protocols was
originally selected by General Motors and has been agreed by a MAP Task
Force comprised of nearly 100 user and vendor corporations. MAP
specifications are also agreed by the NBS/OSI Implementor's workshop,
indicating that the MAP specifications are OSI compatible. The MAP
System and Protocol are described here in sufficient detail to permit
the reader to gain a general undertanding of MAP against a background of
OSI fundamentals.  The future growth trends for MAP conclude this
paper.",
}

@ARTICLE{Piat8608:State,
AUTHOR="T. F. Piatkowski",
TITLE="The State of the Art in Protocol Engineering",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="13-18",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=12,
}

@ARTICLE{Lam8608:Protocol,
AUTHOR="S. S. Lam",
TITLE="Protocol Conversion--Correctness Problems",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="19-29",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=17,
ABSTRACT="Consider the problem of providing a logical channel for
message exchange between two user processes in a network environment. 
When is protocol conversion needed? To answer this question, we first
define a model of layered architectures.  Specifically, three stepwise
refinement rules are given.  Any architectures that can be obtained by a
sequence of applications of the stepwise refinement rules is said to be
well-structured.  We show that this class of well-structured
architectures has several correctness properties.  It is also very
general and includes many well-known networking and internetworking
architectures in the literature.  Logical connectivity in such an
architecture is defined recursively.  As a result, to determine if a
logical channel can be provided between two user processes, it it
sufficient to examine peer protocols specified for each level of the
architectures's hierarchy of processes one at a time.  Thus the original
problem reduces to the problem of determining if a set of processes will
interoperate. When protocol conversion is needed to achieve
interoperability between processes that implement different protocols,
how should it be done? How does one prove that a conversion is correct? 
What is meant by a correct conversion?  We propose the use of
projections and image protocols (previouly developed by Lam and Shanker
for protocol verification ) for specifying conversions and for reasoning
about the correctness of conversions.  Given two processes implementing
different protocols P and Q, our objective is to find the largest
protocol that is an image protocol of P as well as Q.  The correctness
of the conversion is a consequence of the correctness properties of
image protocols. There are several open problems.  Most importantly,
heuristics are used for finding the necessary image protocol for
conversion. Alhtough, an image protocol common to both P and Q can
always be found, it may not be easy to find one with useful
functionality.  There are also some implementation and design issues to
be addressed, such as the construction of converters that are
transparent and converters that add functionality  to an image protocol
common to P and Q.",
}

@ARTICLE{Okum8608:Formal,
AUTHOR="K. Okumura",
TITLE="A Formal Protocol Conversion Method",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="30-37",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=6,
ABSTRACT="The need for the protocol conversion has been recognized with
the proliferation of heterogeneous networks.  From a formal viewpoint,
we regard that problem as generating a protocol which satisfies the
properties of the conversion.  In this paper, we prove that, one can
determine whether a converter exists, for some protocol classes, given
protocols in the form of communicating finite automata.  Moreover, we
give a construction method for such a converter for those classes, and
derive an upper bound of the computational complexity of the
construction algorithm.",
}

@ARTICLE{Kore8608:Model,
AUTHOR="Z. Koren and I. Chlamtac and A. Ganz",
TITLE="A Model for Evaluating Demand Assignment Protocols with Arbitrary
Workloads",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="40-44",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=9,
ABSTRACT="Demand assignment protocols have been implemented in a large
number of operational LANs.  However, the analytic models for protocol
evaluation currently capture only a limited range of LAN operational
circumstances.  In this paper we present an analytic tool for evaluating
fair and prioritized demand assignment protocols with a relatively
general workload model.  We consider arbitrary and station dependent
message size distributions and arrival rates. This allows the modeling
of LANs with heterogeneous workloads, thus permitting a larger
correspondence between the modeled system and the real life network.",
}

@ARTICLE{Vo8608:Implementing,
AUTHOR="T. Vo-Dai",
TITLE="Implementing Priorities in Multiaccess Protocols for Optical
Fiber-Based Local Area Networks",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="45-51",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=11,
ABSTRACT="Most recently proposed optical fiber-based architectures may
be considered as different implementations of the basic round-robin
transmission service in different topologies using special signal
patterns or events to achieve the effect of the token passing protocol. 
Prioritizing the transmission of various data and control messages is
necessary for time- critical applications (e.g. in data sensor or
process control applications). Some extensions of the basic CSMA-CD
protocol to handle packet priorities have been proposed for
bidirectional channels but prioritized multiaccess protocols taking
advantage of the unidirectional property of optical channels do not
appear to be widely available yet.  The main thrust of this paper is to
propose some distributed prioritized multiaccess protocols for twin-bus
optical channels.  We will introduce two prioritized protocols: one uses
the token packet to convey and enforce priorities and the other employs
time-outs to achieve prioritization.  our protocols require only
backlogged stations to be active.",
}

@ARTICLE{Rego8608:Comparison,
AUTHOR="V. Rego and H. D. Hughes",
TITLE="A Comparison of Two Token-Passing Bus Protocols",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="58-66",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=17,
ABSTRACT="A well known disadvantage of standard token-passing in ring
and bus networks is the waste of channel bandwidth often seen in lightly
loaded or asymmetric systems.  It is possible to make use of the
broadcast mechanism in token bus systems to distribute nearly up-to-date
information about the state of individual stations to the entire system.
 One such scheme involves the determination of a randomly varying set of
more active stations.  These stations are given a chance for form a
second logical ring above the standard logical ring that characterizes
the token bus.  The transmission cycles of the system can thus be made
to alternate between standard token-passing and transmission cycles, and
the cycles of token-passing and transmission within the logical ring of
more active stations.   We assume that each station makes at most one
transmission when given the chance to transmit.  For Poisson arrivals
and otherwise general input distributions, the cycle-time distribution
of the token is  derived for each kind of cycle.  An important random
variable is the random token turnaround time seen by individual
stations.  For lightly loaded station this time tends to be larger than
for heavily loaded stations.  The distribution of this random time,
simple performance measures, and a comparative measure of stability,
showing the adaptive scheme to be more stable than the standard, are
obtained.",
}

@ARTICLE{Korb8608:Command,
AUTHOR="John T. Korb and C. E. Wills",
TITLE="Command Execution in a Heterogeneous Environment",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="68-74",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=13,
ABSTRACT="As a user's computing environment grows from a single
time-shared host to a network of specialized and general-purpose
machines, the capability for the user to access all of these resources
in a consistent and transparent manner becomes disirable.  Instead of
viewing commands as binary files, we expect the user to view commands as
services provided by servers in the network.  The user interacts with a
personal workstation that locates and executes services on his behalf. 
Executing a single service provided by any server in the network is
useful, but the user would also like to combine services from different
machines to perform complex computations.  To porvide this facility we
expand on the UNIX notion of pipes to a generalized pipeline machanism
containing services from a variety of servers.  In this paper we explain
the merits of a multi-machine pipeline for solving problems of accessing
services in a heterogeneous environment.  We also give a design and
performance evaluation of a general machanism for multi-machine pipes
using the DARPA UDP and TCP protocol.",
}

@ARTICLE{Shan8608:Verified,
AUTHOR="A. U. Shankar",
TITLE="A Verified Sliding Window Protocol with Variable Flow Control",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="84-91",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=12,
ABSTRACT="We present a verified sliding winodw protocol which uses
modulo-N sequence numbers to achieve reliable flow-controlled data
transfer between a source and a destination.  Communication channels are
assumed to lose, duplicate and reorder messages in transit.  The
destination's data needs are represented by a receive window whose size
can vary with time.  The destination entity uses acknowledgment messages
to inform the source entity of the current receive window size and the
sequence number of the data word next expected.  The source entity
responds by sending segments of data words that lie within the allowed
window.  Each data segment is accompanied by an identifying sequence
number and the size of the data segment.  The destination entity also
uses selective acknowledgment and selective reject messages to inform
the source entity of the reception or lack of reception, respectively,
of out-of-sequence data segments.  Thus, this protocol is a proper
extension of the Arpanet's TCP.  We have obtained the minimum value of N
that ensures correct data transfer and flow control, in terms of the
minimum message transmission time, the maximum message life-time, the
maximum receive window size.  The protocol imposes no constraints on the
retransmissions of messages or on the data segment sizes; thus, any
retransmission policy that optimizes the protocol's performance can be
used.",
}

@ARTICLE{Lin8608:Modeling,
AUTHOR="H.-A. Lin",
TITLE="Modeling a Transport Layer Protocol Using First-Order Logic",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="92-100",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=17,
ABSTRACT="We use a hybrid model based on the first-order logic to
specify and verify a transport layer protocol.  In this model we specify
a protocol as a set of state machines.  Time expressions are used to
describe the temporal relations of transitions.  Given the specification
of a protocol, we verify its properties by logical deduction.  Reasoning
techniques such as decomposition and abstraction are used to reduce the
verification complexity. The transport protocol consists of an active
process, a passive process, and two communication channels.  Each of
these components is specified by this model.  An outline of verification
of this protocol is given.",
}

@ARTICLE{Lage8608:Voice,
AUTHOR="J. de Lagemaat and Joan Daemen and I. G. Niemegeers",
TITLE="Voice Transmission in a Priority {CSMA/CD} {LAN:} An Efficient
Protocol Using Hybrid Switching",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="102-110",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=14,
ABSTRACT="The integration of voice and data transmission on a CSMA/CD
LAN with message priority and deterministic collision resolution is
studies.  As a result an efficient Stream Traffic Protocol using hybrid
switching and implicit token passing is designed.  The performance of
the protocol both for voice and data is analyzed using a discrete event
simulation model.  The protocol increases the system capacity for voice
while the strict real-time constraints for its transmission are still
met.  It supports a number of subscribers comparable with the equivalent
to the capacity of a small PABX, with a good performance for data.  The
work  is part of an overall project of an integrated services LAN
offring ISDN S-interfaces.",
}

@ARTICLE{Shar8608:Framed,
AUTHOR="S. M. Sharrock and K. Maly and S. Ghanta and H. C. Du",
TITLE="A Framed Movable-Boundary Protocol for Integrated Voice/Data in a
{LAN}",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="111-119",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=24,
ABSTRACT="A new, fully-distributed protocol for integrated voice/data
traffic in  a local-area, random-access broadcast network is described. 
The protocol introduces a movable voice-data boundary to framed
TDMA/CSMA and eliminates the requirement of system-wide synchronized
clocks.  The movable boundary is a major advantage in any system where
fluctuations in voice and data loads are expected because assignment of
idle capacity from one traffic class to the other increases the
utilization of the channel.  The protocol provides collision-free
virtual circuits for voice and periods of non-persistent CSMA/CD for
data traffic and call establishment, and can support multi-party calls
as well as two-way conversations.  The protocol allows variable-size
voice packets that have very low overhead and variable-size data 
packets that may be much longer than voice packets.  This is of
significant practical advantage over previous work, which has required
fixed-size voice and/or data packets, or voice packets with high
overhead.  A method of dynamically controlling the movable boundary to
balance the voice and data traffic is also proposed.",
}

@ARTICLE{Borg8608:Voice,
AUTHOR="F. Borgonovo and E. Cadorin and L. Fratta and M. Pezze",
TITLE="Voice and Data Performance Measurements in L-Express Net",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="120-125",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=6,
ABSTRACT="L-Express is a protocol for Local Area Networks based on a
single bus topology.  It utilizes a simple and effective virtual token
access scheme which provides ordered and collision-free transmission.
This paper presents results of measurements performed to investigate in
details the behavior of the L-Express protocol under different network
speeds, configurations and traffic environments.  The measurements are
obtained using a mix of simulation and field tests on a network
prototype.  Voice and integration of voice and data are also taken into
account. The results indicate a good behavior (compared with Ethernet)
for small size networks (500m) and low data rates (10 Mb/s) as well as
for large size networks (5000m) and high data rates (100Mb/s).",
}

@ARTICLE{Agui8608:Architecture,
AUTHOR="Lorenzo Aguilar and J. J. Garcia-Luna-Aceves and D. M. Moran and
Earl Craighill and R. Brungardt",
TITLE="An Architecture for a Multimedia Teleconferencing System",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="126-136",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=15,
ABSTRACT="We present an object-oriented architecture for a
computer-based, real-time, multimedia conferencing system.  This
architecture divides the system into five functional areas: a multimedia
shared workspace, a user interface,  conference management,
communications, and an information base. The structure and operation of
the first four areas are modeled with object-based concepts that address
design requirements identified during the development of a
proof-of-concept prototype, that preceded the architecture
specification. The shared workspace, the most important component, is
thoroughly discussed; the other components support its realization.  The
modeling of workspace entities emphasizes their aggregation into
composed entities and the homogeneous handling of several data media. 
The user interface manages uniformly the man-machine interaction for
both local and remote user actions. Conference management deal with
session establishment, participation, and control of multiple media
floors.  The communication functions replicate user actions over
workspace objects in all hosts participating in a conference, matching
traffic types with transmission services in the process.",
}

@ARTICLE{Bave8608:Tier,
AUTHOR="Z. Bavel and J. Grzymala-Busse and Y. Hsia and R.
Mancisidor-Landa",
TITLE="Tier Automation Representation of Communication Protocols",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="138-147",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=9,
ABSTRACT="The tier automation is presented as a model for communication
protocols.  Several advantages of the model are cited, among which are
universality of representation and manupulability.  A scheme for using
the tier automation to model specific distributed architectures and
their protocols is described.  The scheme is then used on a sample
protocol and a transmission session with the sample protocol as
exhibited.",
}

@ARTICLE{Boch8608:Deriving,
AUTHOR="Gregor V. Bochmann and R. Gotzhein",
TITLE="Deriving Protocol Specifications from Service Specifications",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="148-156",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=12,
ABSTRACT="The service concept has acquired an increasing level of
recognition by protocol designers.  Being an architectural concept, the
service concept influences the methodology applied to service and
protocol definition.  Since the protocol is seen as the logical
implementation of the service, one can ask the question whether it is
possible to formally derive the specification of a protocoproviding a
given service. This paper addresses this question and presents an
algorithm for deriving a protocol specification from a given service
specification .  It is assumed that services are described by
expressions including operators for sequence, parallelism and
alternatives and primitive service interactions.  The expression
defining the service is the basis for the protocol derivation process. 
The presented algorithm fully automates the derivation process. Future
work focus on the inclusion of parameters and the optimization of
traffic between protocol entities.",
}

@ARTICLE{Rama8608:Petri,
AUTHOR="C. V. Ramamoorthy and Y. Yaw",
TITLE="A Petri Net Reduction Algorithm for Protocol Analysis",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="157-166",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=19,
ABSTRACT="Petri net is a powerful model for analyzing communication
protocols because they share many common properties.  Currently,
protocol analysis suffers the state explosion problem especially for
error-recoverable protocols and multi-party protocols.  Protocol
synthesis relieves this problem by generating new and complicated
protocols from simple subsets of the protocol models.  Reduction
analysis provides theoretical ground for correct synthesis or expansion.
 Thus, reduction is a very important research area.  In this paper,we
present a general Petri net reduction algorithm that reduces the number
of states while preserving all desirable and undesirable properties.  To
the best of our knowledge, this is the first general Petri net reduction
algorithm for protocol analysis.  We first present and extend Dong's
definition of WBMs to include more subnets as WBMs.  To render the
reductions automated, a new concept of simple well-behaved modules
(SWBMs) is introduced.  Recursively performing reductions of SWBMs,
complicated WBMs can be reduced.  A main program is written to implement
this recursive procedure. The problem is then reduced to finding
conditions for SWBMs.  We do this by processing from simpler SWBMs to
more complicated ones, i.e., from single-arc ones to multi-arcs ones. 
Finally, we demonstrate the usefulness of this algorithm by applying it
to the state exploration in protocol synthesis. Other applications such
as error detection, performance evaluation, and software engineering
will be discussed in future.",
}

@ARTICLE{Bria8608:Structure,
AUTHOR="J. P. Briand and M. C. Fehri and L. Logrippo and A. Obaid",
TITLE="Structure of a {LOTOS} Interpreter",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="167-175",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=20,
ABSTRACT="LOTOS is an executable specification language for protocols
and services currently being standardized within ISO.  It is based on an
extended version of Milner's Calculus of Communicating System (CCS) and
ACT ONE Abstract Data Type formalism.  After a brief introduction to
LOTOS, we give here an account of a prototype LOTOS interpreter, which
includes an interactive system that allows the user to direct the
execution of a specification.  The interpreter was implemented in
YACC/LEX, C, and Prolog. The discussion includes the following topics:
syntax and static semantics analysis; translation from LOTOS external
format to internal representation ; evaluation of Abstract Data Type
value expressions and CCS* clauses.",
}

@ARTICLE{Chla8608:Frequency,
AUTHOR="I. Chlamtac and A. Ganz",
TITLE="Frequency-Time Controlled {(FTC)} Networks for High Speed
Communication",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="178-185",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=16,
ABSTRACT="The development of ''very high speed'' networks is being
motivated by emerging applications and is therefore attracting
increasing attention.  As demonstrated in the past, in conventional high
speed systems the high ratio between the end-to-end propagation delay
and the message transmission time severely restricts the system
performance.  Thus the increase in channel bandwidth may be accompanied
by only a marginal increase in actual system capacity.  In this paper we
propose a network architecture which eliminates this problem by
introducing a combined Frequency--Time Division based control of the
high speed channel.  We consider the implementation characteristics of
the resulting multichannel system and show that the design of protocols
in these systems is subject to unique channel control penalties. 
Specifically, we show that in addition to the relatively high cost of
channel sensing, the allocation of channel on a demand assignment basis
is hindered in the multichannel configuration by the time penalty
involved in locating an idle channel and by practical limitations of
multichannel node interface design. We therefore introduce a new class
of ''allocation'' protocols in which the channel access is obtained 
without the aforementioned penalties.  The allocation protocols build on
message source and destination oriented transmission rights allocation,
taking into account the implementation aspects of multichannel networks.
 We show that the class of ''multichannel allocation'' protocols covers
the whole range of random access to fixed channel access control
policies and introduce an analytic approach for a uniform analytic
treatment.  The analysis demonstrates the potential for a significant
improvement in the system capacity and the average message delay, when
compared to a conventional single (undivided) channel system.",
}

@ARTICLE{Baum8608:Satellite,
AUTHOR="D. Baum",
TITLE="Performance Analysis of a Satellite Communications Backchannel
Architecture",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="186-193",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=14,
ABSTRACT="The definition of a backchannel architecture for open systems
interconnection over satellite links has been the subject of the
SENS-project. The new proposal is based on existent international
standards and uses the options of the ISO-class 4 transport layer
protocol in order to enclose in level 4 data link control functions for
unidirectional satellite links following the rules of the IBM-checkpoint
protocol.  This paper provides performance values of the SENS
architecture in comparison with those of common satellite communication
systems.  With means of elementary probability theorectical methods an
approximate analysis of the IBM-checkpoint protocol is accomplished. 
The results show that for large amounts of data the new architecture
proves to be best suited for cost efficient use of public satellite data
links.",
}

@ARTICLE{Edmo8608:Butterfly,
AUTHOR="Winston Edmond and Steven Blumenthal and A. Echenique and S.
Storch and T. Calderwood and T. Rees",
TITLE="The Butterfly Satellite {IMP} for the Wideband Packet Satellite
Network",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="194-203",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=11,
ABSTRACT="Multiprocessor computer systems have proven efficient as high
performance switching nodes in packet switched data communications
networks. They are  well suited to performing the required queueing,
routing, and scheduling tasks, and can scale upward to provide higher
system throughput when combined with software that exploits the
parallelism provided by the hardware.  This paper describes the packet
switch used in the DARPA Wideband Packet Satellite Network and the
Butterfly Multiprocessor on which it is based.",
}

@ARTICLE{Farb8608:Closer,
AUTHOR="D. Farber and G. M. Parulkar",
TITLE="A Closer Look at Noahnet",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="204-213",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=7,
ABSTRACT="Noahnet is a robust, highly available, high bandwidth local
area network (LAN) architecture, in the implementation phase at the
University of Delaware.  Noahnet uses a distributed switch-oriented node
topology, a flooding approach for message routing, and high bandwidth
communication media. The purpose of this paper is to consider some of
the important issues in detail such as: the various ways flood control
can be implemented; their relative advantages/disadvantages; the
functions of a node; and one possible implementation of a node in
Noahnet.  Expected performance of the Noahnet in comparison to Ethernet
and token ring networks is also discussed. Though Noahnet uses more
complex structure and protocol, we demonstrate that the overhead of
using flooding in Noahnet is mininal and that a Noahnet node
implementation is very simple and inexpensive.  The paper concludes that
Noahnet provides features such as robustness, high availability, high
throughput, and high communication bandwidth at almost no additional
cost.",
}

@ARTICLE{Liu8608:Conformity,
AUTHOR="Nelson X. Liu and Minkui Liu",
TITLE="Conformity Analysis for Communication Protocols",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="216-226",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=15,
ABSTRACT="In this paper we propose a methodology for conformity analysis
of communication protocols.  By conformity analysis it is meant to
demonstrate that a protocol does indeed provide the service for which it
is intended.  We specify both a protocol and its service by a CSP
(Communicating Sequential Processes) based language.  To perform the
conformity analysis we develop a transformation system to extract from a
CSP process the communication sequences that may arise during its
execution, and to express these sequences in terms of behavior
expressions in CCS (Calculus of Communicating Systems).  By performing
algebraic manipulations and the equivalence proof on these expressions,
we can show that the external behavior of a protocol conforms to its
intended service.  A version of the Alternating Bit Protocol is used to
demonstrate the feasibility of the methodology.",
}

@ARTICLE{Rama8608:Synthesis,
AUTHOR="C. V. Ramamoorthy and Y. Yaw and R. Aggarwal and J. Song and W.
T. Tsai",
TITLE="Synthesis of Two-Party Error-Recoverable Protocols",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="227-235",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=13,
ABSTRACT="We have developed a correct, general, and efficient procedure
of synthesizing two-party error-recoverable protocols for noisy channels
where messages could be lost, corrupted, and/or missequenced.  The state
explosion problem has been tackled by synthesizing the error-recoverable
protocol (ERP) from its noiseless local entity model using certain
rules.  This reduction arises from the approaches of local modeling and
elaboration.  We expect that these two approaches will also play a major
role in tackling the complexity problems in designing multi-party
protocols.  Measures of efficiency and functionality improvements have
been discussed.",
}

@ARTICLE{Sari8608:Formal,
AUTHOR="B. Sarikaya and Gregor V. Bochmann and M. Maksud and J. M.
Serre",
TITLE="Formal Specification-Based Conformance Testing",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="236-240",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=15,
ABSTRACT="The paper discusses the use of formal specifications for
conformance testing of OSI protocols and divides the discussion in two
parts: test design and tester design.  A draft standard formal
specification of the Class 4 transport protocol in Estelle is taken as
the starting point for test design.  The test design technique used to
derive a conformance test suite is semi-formal based in part on the
formal specification and also the informal specification.  The tests
obtained are expressed in natural language.  In the tester design part,
we discuss the distributed test architecture of ISO and give the
detailed designs of upper and lower testers.  It is shown that, in
testing Class 4 transport implementations, a parametrized protocol
implementation approach in the lower tester design, renders the tests
easier to implement.",
}

@ARTICLE{Ural8608:Interactive,
AUTHOR="H. Ural and R. Short",
TITLE="An Interactive Test Sequence Generator",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="241-250",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=16,
ABSTRACT="The interactive test sequence generator (ITSG) is a software
tool which provides the capacity of generating test sequences from logic
specifications in an interactive manner.  A logic specification is a
collection of Horn clauses coded in Prolog describing the externally
observable behavior of a system.  ITSG facilitates a controlled
traversal of the execution paths described by a logic specification and
is written in C\_Prolog running under UNIX 4.2 on Vas 750. In this
paper, first the form of logic specifications is described and an
outline of a logic specification for a protocol entity (i.e., protocol
specification ) is presented.  Then ITSG is introduced and its
functionality is explained.  As well, the possible usage of ITSG in
constructing conformance test suites for protocol implementation testing
is discussed and a simple scenario for developing a conformance test
suite is presented.",
}

@ARTICLE{Estr8608:Inter,
AUTHOR="D. Estrin",
TITLE="Inter-Organization Networks: Implications of Access Control
Requirements for Interconnection Protocols",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="254-264",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=18,
ABSTRACT="When two or more distinct organizations interconnect their
internal computer networks they form an Inter-Organization Network
(ION). IONs support the exchange of cad/cam data between manufactures
and subcontractors, software distribution from vendors to users,
customer input to suppliers' order-entry systems, and the shared use of
expensive computational resources by research laboratories, as example. 
This paper analyzes the technical implications of interconnecting
networks across organization boundaries. After analyzing the
organization contexts in which IONs are used, we demonstrate that such
interconnections are not satisfied by traditional network design
criteria of connectivity and transparency.  To the contrary, a primary
high-level requirement is access control, and participating
organizations must be able to limit connectivity and make network
boundaries visible.  We describe a scheme based on non-discretionary
control which allows interconnecting organization to combine gateway,
network, and system-level mechanisms to enforce cross-boundary control
over invocation and information flow, while minimizing interference with
internal operations. Access control requirements such as these impose
new requirements on the underlying interconnection protocols.  We
demonstrate such alternative interconnection protocols that support
loose coupling across administrative boundaries and that accommodate the
necessary control mechanisms.  Message- based gateways that support
non-real-time invocation of services (e.g., file and print servers,
financial transactions, VLSI design tools, etc. ) are a promising basis
for such loose couplings.",
}

@ARTICLE{Sans8608:Extending,
AUTHOR="R. D. Sansom and D. P. Julin and Richard F. Rashid",
TITLE="Extending a Capability Based System into a Network Environment",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="265-274",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=11,
ABSTRACT="The Mach operating system supports secure local communication
within one node of a distributed system by providing protected
communication capabilities called Ports.  The local port-based
communication abstraction can be extended over a network by Network
Server tasks.  The network servers effectively act as local
representatives for remote tasks by implementing an abstraction of
Network Ports.  To extend the security of the port-based communication
abstraction into the network environment, the network servers must
protect both the messages sent over the network to network ports and the
access rights to network ports.  This paper describes in detail the
protocols used by the network servers to support security.",
}

@ARTICLE{Nguy8608:Communication,
AUTHOR="B. Nguyen and R. Rom",
TITLE="Communication Services under {EMCON}",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="275-281",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=6,
ABSTRACT="Hosts are under EMCON condition, short for Emission Control,
when they are prohibited from transmitting any data.  Under such
condition, hosts can only receive data passively and can not acknowledge
any data reception. This unidirectionality of the communication channel
breaks down all currently defined transport protocols.  In this paper,
we present architectural alternatives that would support limited
communication service under such condition and also discuss other open
issues.",
}

@ARTICLE{Good8608:Access,
AUTHOR="M. Goodwin and K. J. McDonell",
TITLE="Access Control for Network Directory Systems",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="282-289",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=11,
ABSTRACT="Directory Systems to support communications networks are
currently the subject of serious international standardization efforts.
The most recent CCITT and ISO proposals for Directory Systems are
summarized, and within this context the requirements for flexible and
robust access control mechanisms are examined.  The existence of varied
access control policies at the international, national and local levels
and the need to maintain the integrity of Directory System information
are identified as major facotrs determining access control procedures. 
Techniques are suggested for access control mechanisms capable of
capturing and enforcing the relevant access control semantics at each
network site.",
}

@ARTICLE{Chan8608:Selective,
AUTHOR="S. R. Chandran and Shu Lin",
TITLE="A Selective Repeat {ARQ} Scheme for Point-to-Multipoint
Communications and Its Throughput Analysis",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="292-301",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=13,
ABSTRACT="Selective repeat automatic-repeat-request (ARQ) schemes with
finite receiver buffer have been studied and analyzed extensively for
point-to-point communications.  In this paper, we propose a selective
repeat ARQ scheme for point-to-multipoint communications where each
receiver has a finite buffer size.  A lower bound on the throughput
efficiency of the proposed scheme is obtained.  Computation of the lower
bound and simulation of the scheme reveal that the ARQ scheme performs
quite satisfactorily, particularly for channels with large round-trip
delay and high data rate like the satellite channel. The proposed scheme
outperforms the full-memory go-back-N scheme proposed by Gopal, et al. 
The scheme seems ideally suited for the case of a satellite operating in
broadcast mode with many receivers.",
}

@ARTICLE{Clar8608:Control,
AUTHOR="Loren Clare",
TITLE="Control Procedures for Slotted Aloha Systems that Achieve
Stability",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="302-309",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=22,
ABSTRACT="A class of slotted ALOHA dynamic control strategies is
considered. These strategies are simple to implement and can yield
lossless and stable operation for arbitrarily large user populations
with aggregate arrival rates below e^-1 packets/slot.  An ergodicity
analysis is given that provides conditions on the system parameters,
such that any specified set of control parameters that satisfies the
given condition is guaranteed to yield stable performance.  The system
state is modelled as a two-dimentional Markov chain that incorporates
the backlog (the number of packets awaiting retransmission) and the
estimate of the backlog.  The geometical concepts are illustrated by
figures corresponding to an example case.  Simulation results are
presented that compare alternative control schemes.",
}

@ARTICLE{Tsai8608:Two,
AUTHOR="D. Tsai and John H. Chang",
TITLE="A Two-Bit Contention-Based {TDMA} Technique for Data
Transmissions",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="310-317",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=10,
ABSTRACT="The performance of a contention-based TDMA technique is
studied in this paper.  The frame structure of the time-axis is similar
to [1] and [2]. The protocols proposed in [1],[2] and here are all
active multiaccess techniques.  The protocol in [1] is contention free
and suitable for heavy traffic while a contention-based protocol
suitable for light traffic is considered in [2].  The protocol to be
studied in this paper is also contention in nature and performs
considerably better than [2].  This protocol is less complicated than
[1] and outperforms [1] unless traffic is very high.  Performance
analysis, both transient and steady-state, have been successfully
completed.  Results obtained include average queue length and packet
delay, etc.  The validity of analysis is also verified by computer
simulations.",
}

@ARTICLE{Lee8608:Reliable,
AUTHOR="D. Lee and K. Chon and C. D. Chung",
TITLE="A Reliable Datagram Protocol on Local Area Networks",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="320-327",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=12,
ABSTRACT="Most of interprocess communications in transaction oriented
distributed systems are based on client-server model, in which one
process communicates with several processes simultaneously.  Datagram
service fits this type of communication rather than virtual circuit
service.  Transaction oriented distributed systems sometimes need to
move large data such as a file or a part of database from a machine to
other.  The reliable delivery is fairly important since an error might
cause retransmission of a whole data.  In this paper, we propose the
efficient mechanism for reliable datagram service, i) the concept of
semi-virtual circuit and ii) the simple error detection and recovery
algorithm based on our existing transport protocol, UDSTP.  We describe
implementation details supporting those facilities and performance
results.",
}

@ARTICLE{Agre8608:Message,
AUTHOR="J. R. Agre",
TITLE="A Message-Based Fault Diagnosis Procedure",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="328-337",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=36,
ABSTRACT="A new diagnostic message protocol that provides fault
diagnosis capabilities for the communications in a distributed system
environment is described.  The protocol is designed to operate in
conjunction with a standard end-to-end communication protocol and uses
special messages to determine the system fault state.  A diagnostic
message is represented using a test dependency model that is derived
from the system topology.  These messages are used by an adaptive
strategy designed to achieve specific objectives such as reduced testing
cost.  Using the test dependency model, a general purpose algorithm is
developed for generating these strategies based on an information theory
criterion.  Specific properties of the protocol are discussed, and
several examples of strategies for a distributed system topology are
provided.",
}

@ARTICLE{Rama8608:Model,
AUTHOR="Kadangode K. Ramakrishnan and J. S. Emer",
TITLE="A Model of File Server Performance for a Heterogeneous
Distributed System",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="338-347",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=21,
ABSTRACT="In this paper, we study the performance characteristics of a
client-server style distributed system by a queueing network model.  The
system being modeled was based on an experimental distributed system
currently being prototyped.  As a specific detailed case study, we have
evaluated the performance of a file server.  A file server is a key
component to achieve the data sharing necessary in a distributed system.
The file server is probably the most heavily used resource of the
distributed system and as a result, its performance is critical to the
success of the system.  The primary goal of the study was to identify
and quantify the effects of the bottlenecks in the server and assess
design alternatives to enhance performance.  In particular, the
improvements due to file caching, outboarding transport functions and
the effect of multiple network interfaces are studied.  We model in
detail the various stages of processing of a request to a file server. 
Parameterization of th model was achieved by initial measurements made
on the prototype system.  An important characteristic modeled was the
buffer overflow from the network interface. This required the
approximate solution of a non-product-form queueing networks.",
}

@ARTICLE{Hac8608:Study,
AUTHOR="A. Hac and T. Johnson",
TITLE="A Study of Dynamic Load Balancing in a Distributed System",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="348-356",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=9,
ABSTRACT="This paper presents a study of a distributed system consisting
of a number of hosts connected by a local area network.  The system
model is based on the LOCUS distributed file system.  The LOCUS file
system allows replicated files, and the synchronization policy is
enforced by the use of the Centralized Synchronization Sites (CSS).  All
requests to open a file for access must be sent to the file's CSS which
checks for access conflicts. Our simulation model allows process
migration.  The focus of this study is on load balancing as applied to
optimal process and read site placement.  An algorithm is proposed that
increase system performance through load balancing.  This algorithm uses
data collected by the system on which to base its decisions.  The
characteristics of the algorithm and their effects on system performance
are analyzed and discussed.",
}

@ARTICLE{Cime8608:Resilient,
AUTHOR="I. A. Cimet and P. R. Kumar",
TITLE="A Resilient Distributed Protocol for Network Synchronization",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="358-367",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=17,
ABSTRACT="We pesent a resilient distributed protocol that enables a
synchronous algorithm to run on an asynchronous network.  The protocol
is resilient in the sense that it can continue providing network
synchronizatioon in the presence of topological changes in the
underlying communication network of a distributed system.  These changes
are caused by link/node failures and recoveries that occur while running
the protocol.  In general, the protocol is a useful tool in the design
of resilient distributed algorithms as it isolates the algorithm from
the characteristics of teh communication network.",
}

@ARTICLE{Walt8608:Tunable,
AUTHOR="B. Walter",
TITLE="A Tunable Protocol for Symmetric Surveillance in Distributed
Systems",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="368-376",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=12,
ABSTRACT="In distribute systems surveillance protocols are used for
monitoring the status of remote sites.  A remote site is regarded as
being available as long as messages are received from this site,
otherwise it is regarded as being unavailable.  If a site becomes
unavailable, this will be reported to other sites and recovery actions
can be initiated.  Using an example it will be shown that in certain
cases it is necessary, that whenever some site S1 detects the
unavailability of some other site S2, within a fixed amount of time S2
must also have detected an unavailability of S1.  Unfortunately, this
cannot be guaranteed by existing surveillance protocols.  Another
problem with existing protocols is, that remote sites are usually
reported as being unavailable after being timed out only once, i.e., the
loss of just one message might cause complete systems to back out. Two
versions of a protocl for so-called symmetric surveillance are
presented. Both guarantee, that if S1 detects the unavailability of S2
at time t0, then S2 (provided that S2 has not crashed) will become aware
of this fact at t1 such that |t1-t0|<$\Delta$.  This property is of
special interest for handling network partitionings.  Additionally, one
of the versions is tunable, i.e., it can be specified, how many timeouts
may occur before a site is regarded as being unavailable.",
}

@ARTICLE{Cido8608:Local,
AUTHOR="I. Cidon and Joseph Jaffe and M. Sidi",
TITLE="Local Distributed Deadlock Detection by Knot Detection",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="377-384",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=15,
ABSTRACT="A distributed algorithm for the detection of deadlocks in
store-and-forward communication networks is presented.  At first, we
focus on a static environment and develop an efficient knot detection
algorithm for general graphs . The knot detection algorithm uses at most
O(n^2+m) messages and O(log(n)) bits of memory to detect all deadlocked
nodes in the static network.  Using the knot detection algorithm as a
building block, a deadlock detection algorithm in a dynamic environment
is developed.  This algorithm has the following properties: it detects
all the nodes which cause the deadlock.  The algorithm is triggered only
when there is a potential for deadlock and only those nodes which are
potentially deadlocked perform the algorithm.  The algoritm does not
affect other processes at the nodes.",
}

@ARTICLE{Flei8608:Distributed,
AUTHOR="B. D. Fleisch",
TITLE="Distributed System V {IPC} in {LOCUS:} A Design and
Implementation Retrospective",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="386-396",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=9,
ABSTRACT="This paper describes new interprocess communications
facilities that have been added to the Locus system.  The facilites
improve Locus's interprocess communication repertoire by providing
distributed support for three separate subsystems from System V UNIX:
messages, semaphores, and shared memory.  Here we describe these
subsystems and their integration into the Locus architecture.",
}

@ARTICLE{Zhan8608:Why,
AUTHOR="L. Zhang",
TITLE="Why {TCP} Timers Don't Work Well",
JOURNAL=ccr,
VOLUME=16,
NUMBER=3,
PAGES="397-405",
NOTE="SIGCOMM Symposium",
MONTH=aug,
YEAR=1986,
REFERENCES=10,
ABSTRACT="Repeated observation of TCP retransmission timer problems
stimulated investigation into the roles and limitations of timers. 
Timers are indispensable tools in building up reliable distributed
systems. However, as the experience with the TCP retransmission timer
has shown, timers have intrinsic limitations in offering optimal
performance.  Any timeout based action is a guess based on incomplete
information, and as such is bound to be non-optimal.  We conclude that,
if we aim at high performance, we should use external events as a first
line of defense against failures, and depend on timers only in cases
where external notification has failed.",
}

@INPROCEEDINGS{Care8608:Object,
AUTHOR="M. Carey and D. DeWitt and J. Richardson and E. Shekita",
TITLE="Object and File Management in the Exodus Extensible Database",
BOOKTITLE="Twelfth International Conference on Very Large Databses",
MONTH=aug,
YEAR=1986,
}

@TECHREPORT{Tzou8608:DASH,
AUTHOR="S-Y. Tzou",
TITLE="{DASH} Nucleus Debugging Tool: A Remote Version of {UNIX} Dbx
Symbolic Debugger",
INSTITUTION="UCB",
NUMBER="Internal report",
MONTH=aug,
YEAR=1986,
}

@TECHREPORT{Garc8608:Reliable,
AUTHOR="H. Garcia-Molina and Robert K. Abbott",
TITLE="Reliable Distributed Database Management",
INSTITUTION="Princeton",
NUMBER="CS-TR-047-86",
MONTH=aug,
YEAR=1986,
KEYWORDS="replication; primary-copy; available copies",
ABSTRACT="Describes two primary copy replication schemes that include
the siteview problem. Recall that replication algorithms must maintain a
consistent view of the working sites. Similarly, during recovery, a
majority of sites must be up to prevent confusion caused by network
partitions. No performance analysis, rather they note the trade off is
between algorithmic complexity and behaviour, not between complexity and
performance.",
}

@INPROCEEDINGS{Tang8608:Processor,
AUTHOR="Peiyi Tang and P.-C. Yew",
TITLE="Processor Self-Scheduling for Multiple-Nested Parallel Loops",
BOOKTITLE="ICPP",
PAGES="528-535",
MONTH=aug,
YEAR=1986,
}

@INPROCEEDINGS{Lamp8608:Designing,
AUTHOR="B. W. Lampson",
TITLE="Designing a Global Name Service",
BOOKTITLE="5th ACM Symposium on the Principles of Distributed
Computing",
PAGES="1-10",
MONTH=aug,
YEAR=1986,
}

@TECHREPORT{Edmo8608:Negation,
AUTHOR="Robert Edmondson",
TITLE="Negation as failure: a proposal to remedy floundering",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-02",
MONTH=aug,
YEAR=1986,
}

@INPROCEEDINGS{Pau86:Intelligent,
AUTHOR="L. F. Pau and J. M. Negret",
TITLE="Intelligent Contents Based Message Routing in Communications
Networks",
BOOKTITLE="NTS-6",
ADDRESS="Copenhagen",
PAGES=23,
MONTH=aug,
YEAR=1986,
KEYWORDS="data communication; routing; distributed database; PROLOG;
natural language analysis; distributed knowledge based system",
ABSTRACT="This paper deals with a system for knowledge based
message/packet routing in application specific closed heterogeneous
networks. First natural language analysis is applied to each message
(structured or not) in view of characterizing it through a set of
semantically derived critically measures; metamorphosis is used. Next, a
route generation algorithm provides",
}

@INPROCEEDINGS{Fowl8608:Complexity,
AUTHOR="Robert Joseph Fowler",
TITLE="The Complexity of Using Forwarding Addresses for Decentralized
Object Finding",
BOOKTITLE="Fifth Annual Symposium on Principles of Distributed
Computing",
PAGES="108-120",
MONTH=aug,
YEAR=1986,
}

@ARTICLE{As8609:Transient,
AUTHOR="H. van As",
TITLE="Transient Analysis of Markovian Queueing Systems and Its
Applications to Congestion-Control Modeling",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="891-904",
MONTH=sep,
YEAR=1986,
}

@ARTICLE{Daig8609:Models,
AUTHOR="J. N. Daigle and Joseph D. Langford",
TITLE="Models for Analysis of Packet Voice Communications Systems",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="847-855",
MONTH=sep,
YEAR=1986,
KEYWORDS="packet voice; talkspurt",
ANNOTE="Assumes exponentially distributed talkspurts and silence
periods; compares SMP, CTMC and fluid-flow (UAS) analysis for delay
distribution in infinite-queue system",
}

@ARTICLE{Heff8609:Markov,
AUTHOR="H. Heffes and David M. Lucantoni",
TITLE="A Markov Modulated Characterization of Packetized Voice and Data
Traffic and Related Statistical Multiplexer Performance",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="856-867",
MONTH=sep,
YEAR=1986,
KEYWORDS="Markov modulated Poisson process; MMPP; on/off source;
multiplexer",
ABSTRACT="We study the performance of a statistical multiplexer whose
inputs consist of a superposition of packetized voice sources and data.
The performance analysis predicts voice packet delay distributions,
which usually have a stringent requirement, as well as data packet delay
distributions. The superposition is approximated by a correlated Markov
modulated Poisson process (MMPP), which is chosen such that several of
its statistical characteristics identically match those of the
superposition. Matrix analytic methods are then used to evaluate system
performance measures. In particular, we obtain moments of voice and data
delay distributions and queue length distributions. We also obtain
Laplace-Stieltjes transforms of the voice and data packet delay
distributions, which are numerically inverted to evaluate tails of delay
distributions. It is shown how the matrix analytic methodology can
incorporate practical system considerations such as finite buffers and a
class of overload control mechanisms discussed in the literature.
Comparisons with simulation show the methods to be accurate. The
numerical results for the tails of the voice packet delay distribution
show the dramatic effect of traffic variability and correlations on
performance.",
}

@INPROCEEDINGS{Pujo8609:Discrete,
AUTHOR="and J. P. Claude and D. Seret",
TITLE="A Discrete Queueing System with a Product Form Solution",
BOOKTITLE="Computer Networking and Performance Evaluation",
EDITOR="T. Hasegawa and T. Takagi and Y. Takahashi",
ORGANIZATION="IFIP WG 7.3",
PUBLISHER="North Holland, Amsterdam",
ADDRESS="Tokyo",
PAGES="139-147",
MONTH=sep,
YEAR=1986,
KEYWORDS="discrete time queue; product form solution",
ANNOTE="Both single and tandem queue, with possibly state-dependent
arrival probabilities. Not more than one customer per slot; both late
and early arrival. Product-form solution.",
}

@ARTICLE{Srir8609:Characterizing,
AUTHOR="K. Sriram and W. Whitt",
TITLE="Characterizing Superposition Arrival Processes in Packet
Multiplexers for Voice and Data",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="833-846",
MONTH=sep,
YEAR=1986,
REFERENCES=48,
KEYWORDS="superposition; traffic model; analysis; simulation",
ABSTRACT="This paper analyzes a model of a multiplexer for packetized
voice and data. A major part of the analysis is devoted to
characterizing the aggregate packet arrival process resulting from the
superposition of separate voice streams. This is done via the index of
dispersion for intervals (IDI), which describes the cumulative
covariance among successive interarrival times. The IDI seems very
promising as a measurement tool to characterize complex arrival
processes. This paper also describes the delays experienced by voice and
data packets in the multiplexer using relatively simple two-parameter
approximations.",
}

@INPROCEEDINGS{Sze8609:Queueing,
AUTHOR="D. Y. Sze",
TITLE="A Queueing Model for Overload Analysis",
BOOKTITLE="Computer Networking and Performance Evaluation",
EDITOR="T. Hasegawa and T. Takagi and Y. Takahashi",
ORGANIZATION="IFIP WG 7.3",
PUBLISHER="North Holland, Amsterdam",
ADDRESS="Tokyo",
PAGES="413-422",
MONTH=sep,
YEAR=1986,
KEYWORDS="queueing theory; FIFO; M/G/c; overload control",
ANNOTE="Poisson first arrivals; probability of failure given by general
pdf, depending on time in queue. Reattempts with constant probability.
Failed attempts require service time.",
}

@ARTICLE{Vite8609:Approximate,
AUTHOR="Audrey M. Viterbi",
TITLE="Approximate Analysis of Time-Synchronous Packet Networks",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="879-890",
MONTH=sep,
YEAR=1986,
ANNOTE="external bulk-Poisson arrivals, infinite buffers; arrivals
modeled as two-state Markov process",
}

@ARTICLE{Mosl8609:Low,
AUTHOR="W. Scott Mosley",
TITLE="Low Bit-Rate Packet Voice Systems",
JOURNAL=telecom,
VOLUME=20,
NUMBER=9,
PAGES="93-98, 108",
MONTH=sep,
YEAR=1986,
KEYWORDS="packet voice",
ANNOTE="High-level description of packet voice. Economic and tariff
considerations.",
}

@ARTICLE{Mudg8609:Multiple,
AUTHOR="T. Mudge and John Hayes and G. D. Buzzard and D. C. Winsor",
TITLE="Analysis of Multiple-Bus Interconnection Networks",
JOURNAL=jpdc,
VOLUME=3,
NUMBER=3,
PAGES="328-343",
MONTH=sep,
YEAR=1986,
}

@ARTICLE{Sass8609:Self,
AUTHOR="Charles de Sassure and David Gerard Kammer",
TITLE="Self Controlled: A Real-Time Expert System for an Autonomous
Mobile Robot",
JOURNAL="Computers in Mechanical Engineering",
VOLUME=5,
NUMBER=2,
PAGES="12-19",
MONTH=sep,
YEAR=1986,
}

@ARTICLE{Fine8609:Packet,
AUTHOR="M. Fine and Fouad A. Tobabri",
TITLE="Packet voice on a local area network with round robin service",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=9,
PAGES="906-915",
MONTH=sep,
YEAR=1986,
KEYWORDS="packet voice; voice-data integration; local area networks;
LAN; round robin",
ABSTRACT="In this paper, we propose a combined voice/data protocol
suitable for multiple access broadcast networks that provide round robin
service to the stations. Such networks are well suited to the
integration of voice and data since they guarantee bounded delay and
provide high utilization even for high bandwidth channels. Using one
such network proposal -- namely Expressnet -- as a representative
scheme, we examine the characteristics of the service that voice traffic
experiences under the voice/data protocol. We show that the access
protocol is able to utilize the channel efficiently to support a large
polpulation of voice sources while maintaining low packet delay and
guaranteeing some prespecified minimum bandwidth for data traffic. In
addition, we show the advantages of silence suppression, i.e.,
discarding speech that constitutes silent periods, and we examine the
cost of overloading the network in terms of the amount of speech
discarded.",
}

@INPROCEEDINGS{Cove8609:Low,
AUTHOR="Michele Covell and Jae Lim",
TITLE="Low data-rate video conferencing",
BOOKTITLE="Visual Communications and Image Processing",
EDITOR="To R. Hsing",
ORGANIZATION="spie",
ADDRESS="Cambridge, Massachusetts",
VOLUME=707,
PAGES="75-82",
MONTH=sep,
YEAR=1986,
KEYWORDS="packet video; video encoding; image processing; low-bitrate
encoding",
ABSTRACT="A feasibility study has been completed on a narrow-band video
conferencing system. Gray-scale images are converted to bi-level images
and further processed to remove inconsistencies within the mappings.
Ordered run-length coding of difference frames is used to update the
areas of the image that are most likely to change and to be perceptually
important first. Sequences of 15 (128x120) bi-level frames/s have been
successfully transmitted at rates hard-limited at 19.2 kbits/s.",
}

@ARTICLE{Jain8609:Packet,
AUTHOR="Raj Jain and Shawn A. Routhier",
TITLE="Packet trains --- measurements and a new model for computer
network traffic",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="986-995",
NOTE="Reprinted in Amit Bhargava, Ed., ``Integrated Broadband
Networks'', Artech House, Norwood, MA, 1990",
MONTH=sep,
YEAR=1986,
KEYWORDS="source model; traffic measurements; local area networks",
ABSTRACT="Traffic measurements on a ring local area computer network at
the Massachusetts Institute of Technology are presented. The analysis of
the arrival pattern shows that the arrival processes are neither Poisson
nor compound Poisson. An alternative model called ``packet train'' is
proposed. In the train model, the traffic on the network consists of a
number of packet streams between various pairs of nodes on the network.
Each node-pair stream (or node-pair process, as we call them) consists
of a number of trains. Each train consists of a number of packets (or
cars) going in either direction (from node A to B or from node B to A).
The intercar gap is large (compared to the packet transmission time) and
random. The intertrain time is even larger. The Poisson and compound
Poisson arrivals are shown to be special cases of the train arrival
model. Another important observation is that the packet arrivals exhibit
a ``source locality''. If a packet is seen on the network going from A
to B, the probability of the next packet going from A to B or from B to
A is very high. Implications of the train arrivals and of source
locality on the design of bridges, gateways, and reservation protocols
are discussed. A number of open problems requiring development of
analysis techniques for systems with train arrival processes are also
described.",
URL="http://www.cis.ohio-state.edu/~jain/papers/train.zip",
}

@ARTICLE{Burr8609:Unison,
AUTHOR="J. W. Burren and P. F. Clark and J. M. Griffiths and A. J.
Hinchley and R. M. Needham",
TITLE="Unison - communications research for office applications=",
JOURNAL="Electronics and power",
PAGES="665-668",
MONTH=sep,
YEAR=1986,
REFERENCES=2,
ABSTRACT="A multimedia '3-M' workstation is defined as requiring 1Mb of
memory, a 1MIPS processor and a 1 megapixel display capable of showing=
two A4 sheets side by side. The Alvey Directorate developed one of the
first primary rate ISDNs in the form of the Alvey High-Speed Network
(AHSN). AHSN runs upto 2Mbit/s providing 30 64kbit/s B-channels and a
64kbit/s D channel, multiplexed into a 2Mbit/s Megastream line.",
}

@INPROCEEDINGS{Kubi8609:ISDN,
AUTHOR="H. Kubicek",
TITLE="{ISDN} - Der Schnelle Brüter der Nachrichtentechnik?",
BOOKTITLE="ISDN Congress",
ADDRESS="Frankfurt",
PAGES="203-222",
MONTH=sep,
YEAR=1986,
LANGUAGE="German",
REFERENCES=28,
KEYWORDS="ISDN",
}

@INPROCEEDINGS{Schr8609:Extended,
AUTHOR="F. Schreiber",
TITLE="The extended Bayes-postulate, its potential effect on statistical
methods and some historical aspects",
BOOKTITLE="international symposium on probability and Bayesian
statistics",
ADDRESS="Innsbruck",
PAGES="423-430",
MONTH=sep,
YEAR=1986,
REFERENCES=20,
KEYWORDS="Statistics; Bayes statistics",
}

@ARTICLE{Shin8609:Quasi,
AUTHOR="B. C. Shin and Chong Kwan Un",
TITLE="Performance Analysis of a Quasi-M/D/1 Cut-Through Switching
Network with Noisy Channels",
JOURNAL=ieeecom,
VOLUME="COM-34",
NUMBER=9,
PAGES="882-889",
MONTH=sep,
YEAR=1986,
REFERENCES=6,
KEYWORDS="Queueing system; M/D/1; cut-through switching",
}

@INPROCEEDINGS{Beck8609:Technical,
AUTHOR="D. Becker",
TITLE="Technical aspects of data communication in the {ISDN}",
BOOKTITLE=iccc,
ADDRESS="München",
PAGES="17-21 (A1)",
MONTH=sep,
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Blyt8609:Approximate,
AUTHOR="C. R. Blyth",
TITLE="Approximate binomial confidence limits",
JOURNAL="Journal of the American Statistical Association",
VOLUME=81,
NUMBER=395,
PAGES="843-855",
MONTH=sep,
YEAR=1986,
KEYWORDS="Simulation; confidence interval",
}

@INPROCEEDINGS{Rous8609:Number,
AUTHOR="D. M. Rouse and R. J. Spires and R. E. Wallace",
TITLE="The Number 2 signal transfer point: An overview of the {AT\\&T}
common channel signaling packet switch",
BOOKTITLE=iccc,
ADDRESS="Munich, Germany",
PAGES="370-374 (B7.4)",
MONTH=sep,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Serv8609:Average,
AUTHOR="L. D. Servi",
TITLE="Average delay approximation of {M/G/1} cyclic service queues with
Bernoulli schedules",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=6,
PAGES="813-822",
MONTH=sep,
YEAR=1986,
KEYWORDS="Queueing system; cyclic service; analysis",
}

@TECHREPORT{Whit8609:Brief,
AUTHOR="W. Whitt",
TITLE="Brief Description of {QNA.}",
INSTITUTION="AT\\&T Bell Laboratories",
ADDRESS="Holmdel, NJ",
MONTH=sep,
YEAR=1986,
KEYWORDS="Queueing network; analysis",
}

@TECHREPORT{Ades8609:Voice,
AUTHOR="Stephen Ades and Daniel C. Swinehart",
TITLE="Voice Annotation and Editing in a Workstation Environment",
INSTITUTION="Xerox PARC",
NUMBER="CSL-86-3",
NOTE="P86-00058",
MONTH=sep,
YEAR=1986,
REFERENCES=21,
KEYWORDS="design; human factors; voice annotation; voice editing;
multi-media documents; workstation applications; office automation",
ABSTRACT="The Xerox Cedar experimental development environment, running
on personal workstations, incorporates a structured document editor,
which is used as the basis of many applications, including programming
and document preparation. A project at the Xerox Palo Alto Research
Center has integrated the telephone into this environment, partly to
afford control over a user's telephone from his workstation and partly
to incorporate recording and playback of voice into the workstation
capability. This paper describes incorporation of voice annotations into
normal documents within this environment. The user interface is designed
to be lightweight and easy to use, since spontaneity in adding voice
annotations is essential. Voice within the document is shown as a
distinctive shape superimposed around a character, so that the
document's visual layout and its content as observed by other programs
(e.g., compilers) are unaffected. Users point at text selections and use
menus to add and listen to voice. Simple voice editing is available:
users can select a voice annotation and open a window showing its sound
profile. Sounds from the same or other voice windows can be cut and
pasted together, and a lightweight ``dictation facility'' that uses a
record/stop/bakup model can be used to record and incorporate new sounds
conveniently. Editing is done largely at the phrase level (never at the
phoneme level), representing the granularity at which editing can be
done fastest and with least effort. The voice itself can be annotated
with text. This and several other features have been designed to add
speed and meaning to the editing process. The dictation facility can
also be used when placing annotations straight into documents. This
paper describes the user interface in detail and explains why we believe
that this unusually lightweight interface is the desired abstraction for
voice in a general purpose workstation. It also discusses the supporting
system capabilities provided in a distributed environment on a local
area network.",
}

@ARTICLE{Jain8609:Modeling,
AUTHOR="Raj Jain and W. Hawe",
TITLE="Performance Analysis and Modeling of Digital's Networking
Architecture",
JOURNAL="Digital Technical Journal",
NUMBER=3,
PAGES="25-34",
MONTH=sep,
YEAR=1986,
}

@INPROCEEDINGS{Budr8609:QPSX,
AUTHOR="Zigmantas L. Budrikis and J. Hullet and R. Newman and D.
Economou and F. M. Fozdar and R. D. Jeffery",
TITLE="{QPSX:} A Queued Packet and Synchronous Circuit Exchange",
BOOKTITLE="8th International Conference on Computer Communication",
EDITOR="P. J. Kühn",
PUBLISHER="North-Holland",
ADDRESS="Munich, Federal Republic of Germany",
PAGES="288-293",
MONTH=sep,
YEAR=1986,
}

@TECHREPORT{Bers8609:Remote,
AUTHOR="B. N. Bershad and D. T. Ching and E. D. Lazowska and J. Sanislo
and M. Schwartz",
TITLE="A Remote Procedure Call Facility for Heterogeneous Computer
Systems",
TYPE="Technical Report",
INSTITUTION="Department of Computer Science, University of Washington",
NUMBER="86-09-10",
MONTH=sep,
YEAR=1986,
KEYWORDS="Rpc",
}

@TECHREPORT{Crow8609:TCP,
AUTHOR="Jon Crowcroft",
TITLE="{TCP/IP} Vendors Conference",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=2011,
MONTH=sep,
YEAR=1986,
}

@INPROCEEDINGS{Karj8609:New,
AUTHOR="Guenter Karjoth",
TITLE="New Communications Services: A Challenge to Computer Technology",
BOOKTITLE="8th International Conference on Computer Communication",
EDITOR="Paul J. Kuehn",
PUBLISHER="North Holland",
ADDRESS="Amsterdam",
PAGES="479-84",
MONTH=sep,
YEAR=1986,
ABSTRACT="The inherent complexity of distributed database protocols
demand for a formal treatment to insure that their definition is
complete and unambiguous. In order to initiate system developers in the
use of formal techniques the author 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 outage a recovery procedure
is described in CCS. Its specification reflects very well the hierarchic
structure of the database system. The underlying network with all
properties relevant for the database is defined. Based on its virtual
circuit service higher level commmunication protocols such as multicast
and circular message passing are established. The election of an unique
successor in the case of the lock handler's outage is described in the
definition of the distributed recovery mechanism.",
}

@INPROCEEDINGS{Wieb8609:Distributed,
AUTHOR="D. Wiebe",
TITLE="A distributed repository for immutable persistent objects",
BOOKTITLE="OOPSLA Object-Oriented Programming Systems, Languages and
Applications. Conference Proceedings",
ADDRESS="Portland, OR, USA",
PAGES="453-65",
NOTE="Published as OOPSLA Object-Oriented Programming Systems, Languages
and Applications. Conference Proceedings, volume 21, number 11",
MONTH=sep,
YEAR=1986,
ABSTRACT="Jasmine is an object-oriented system for
programming-in-the-large. It describes software using system model
objects. These objects are persistent (they have lifetimes of days or
decades) and immutable (since system models act as historical records).
The paper describes JStore, a distributed, replicated repository for
system model objects which provides robust, transactional, write-once
storage. Designs are presented for the serialization, location, and
replication of objects. Description procedures serialize objects for
network transmission and permanent storage. An expanding ring multicast
search algorithm locates saved objects.",
}

@INPROCEEDINGS{Wate8609:Use,
AUTHOR="A. G. Waters",
TITLE="The use of broadcast and multicast techniques on computer
networks",
BOOKTITLE="Conference on Electronic Delivery of Data and Software",
PUBLISHER="IERE (Institute of Electronic and Radio Engineers)",
ADDRESS="London",
PAGES="45-50",
NOTE="Published as Conference on Electronic Delivery of Data and
Software, number Publ. No. 69",
MONTH=sep,
YEAR=1986,
ABSTRACT="Several types of packet network are based on common access to
a shared broadcast channel. However, the broadcast facility is normally
denied to user applications which have been principally confined to
using point-to-point techniques. The paper investigates the
possibilities offered to applications programs by allowing them to
broadcast packets. The transmission of a single message to many
destinations makes economic use of the broadcast channel and allows
novel ways of working. An overview is presented of some techniques which
have been devised to provide applications programs with facilities for
one-to-many or many-to-many communications. Examples of protocols for
file distribution are given. Other application areas are discussed:
including the location of resources, the advertising of facilities and
the dispersal of statistical information.",
}

@ARTICLE{Endr8609:DUAL,
AUTHOR="A. Endrizzi and G. De Grandi and J. Curioni",
TITLE="The {DUAL} {LAN} network communication and synchronisation
services",
JOURNAL="SPIE International Society Optical Engineers (USA)",
ADDRESS="Cambridge, Massachusetts",
VOLUME=715,
PAGES="53-8",
MONTH=sep,
YEAR=1986,
ABSTRACT="The DUAL network offers both conventional (logical lines, X25,
ISO 8802.3) and advanced (multicast, synchronization) services. It is
based on multi-microprocessor nodes interlinked by means of fiber optics
trunks. The DUAL ring is installed in a campus of several km/sup 2/,
interconnecting up to 40buildings and serves as the backbone network for
a number of other networks and as a test bed for the implementation of
'second generation' data transmission and disstributed informatics
services.",
}

@ARTICLE{Alti8609:Open,
AUTHOR="T. Altiok and Harry Perros",
TITLE="Open Networks of Queues with Blocking: Split and Merge
Configurations",
JOURNAL="IIE Transactions",
PAGES="251-261",
MONTH=sep,
YEAR=1986,
KEYWORDS="Open queueing network; blocking; decomposition",
ABSTRACT="Split and merge configurations of open networks of queues with
blocking are analyzed approximately. The approximation procedure
developed decomposes these queue networks into individual queues with
revised queue capacity and revised arrival and service processes. These
individual queues are then analyzed in isolation. The results obtained
seem to have an acceptable error level. Stability conditions for these
two configura",
}

@ARTICLE{Hari8609:Political,
AUTHOR="J. Haring",
TITLE="The Political Economy of Telecommunications Regulation",
JOURNAL=ieeeproc,
VOLUME=74,
NUMBER=9,
PAGES="1262-1273",
MONTH=sep,
YEAR=1986,
REFERENCES=56,
KEYWORDS="ISDN",
}

@INPROCEEDINGS{Rous8609:Number,
AUTHOR="D. M. Rouse and R. J. Spires and R. E. Wallace",
TITLE="The Number 2 signal transfer point: An overview of the {AT\&T}
common channel signaling packet switch",
BOOKTITLE=iccc,
ADDRESS="Munich, Germany",
PAGES="370-374 (B7.4)",
MONTH=sep,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@INPROCEEDINGS{Ades8609:Voice_,
AUTHOR="Stephen Ades and Daniel C. Swinehart",
TITLE="Voice annotation and editing in a workstation environment",
BOOKTITLE="AVIOS (Applications of Voice Input/Output Systems)
Conference",
INSTITUTION="Xerox PARC",
ADDRESS="Alexandria, Virginia",
PAGES="13-28",
DAYS=16,
MONTH=sep,
YEAR=1986,
REFERENCES=21,
KEYWORDS="design; human factors; voice annotation; voice editing;
multi-media documents; workstation applications; office automation",
ABSTRACT="The Xerox Cedar experimental development environment, running
on personal workstations, incorporates a structured document editor,
which is used as the basis of many applications, including programming
and document preparation. A project at the Xerox Palo Alto Research
Center has integrated the telephone into this environment, partly to
afford control over a user's telephone from his workstation and partly
to incorporate recording and playback of voice into the workstation
capability. This paper describes incorporation of voice annotations into
normal documents within this environment. The user interface is designed
to be lightweight and easy to use, since spontaneity in adding voice
annotations is essential. Voice within the document is shown as a
distinctive shape superimposed around a character, so that the
document's visual layout and its content as observed by other programs
(e.g., compilers) are unaffected. Users point at text selections and use
menus to add and listen to voice. Simple voice editing is available:
users can select a voice annotation and open a window showing its sound
profile. Sounds from the same or other voice windows can be cut and
pasted together, and a lightweight ``dictation facility'' that uses a
record/stop/bakup model can be used to record and incorporate new sounds
conveniently. Editing is done largely at the phrase level (never at the
phoneme level), representing the granularity at which editing can be
done fastest and with least effort. The voice itself can be annotated
with text. This and several other features have been designed to add
speed and meaning to the editing process. The dictation facility can
also be used when placing annotations straight into documents. This
paper describes the user interface in detail and explains why we believe
that this unusually lightweight interface is the desired abstraction for
voice in a general purpose workstation. It also discusses the supporting
system capabilities provided in a distributed environment on a local
area network.",
}

@ARTICLE{Grub8610:Quality,
AUTHOR="J. G. Gruber and Elhamy Abdou and Philip Richards and G.
Williams",
TITLE="Quality-of-Service in Evolving Telecommunications Networks",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=7,
PAGES="1084-1089",
MONTH=oct,
YEAR=1986,
KEYWORDS="BISDN",
ABSTRACT="This paper addresses the problem of achieving overall
quality-of-service of telecommunications networks in North America,
following the divestiture of AT\\&T and the resulting competitive
multivendor environment. The paper outlines an approach based on a
top-down process in which quality-of-service is designed into networks
by individual network vendors in cooperation with coordinating standards
bodies, and a bottom-up approach in which quality-of-service is verified
and controlled under actual network operating conditions.",
}

@ARTICLE{Jain8610:Timeout,
AUTHOR="Raj Jain",
TITLE="A Timeout-Based Congestion Control Scheme for Window
Flow-Controlled Networks",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=7,
PAGES="1162-1167",
NOTE="Reprinted in C. Partridge, Ed., ``Innovations in
Internetworking,'' Artech House, Norwood, MA 1988",
MONTH=oct,
YEAR=1986,
KEYWORDS="congestion control",
ABSTRACT="During overload, most networks drop packets due to buffer
unavailability. The resulting timeouts at the source provide an implicit
mechanism to convey congestion signals from the network to the source.
On a timeout, a source should not only transmit the lost packet, but it
should also reduce its load on the network. Based on this realization,
we have developed a simple congestion control scheme using the
acknowledgement timeouts as indications of packet loss and congestion.
This scheme does not require any new message formats, therefore, it can
be used in any network with window flow control, e.g., ARPAnet or ISO.",
}

@ARTICLE{Corb8610:Challenge,
AUTHOR="Charles M. Corbalis",
TITLE="The Challenge of Packet Voice",
JOURNAL=telecom,
VOLUME=20,
NUMBER=10,
PAGES="47-54",
MONTH=oct,
YEAR=1986,
KEYWORDS="packet voice",
ANNOTE="High-level overview; also describes speech detector using
combination of level and stationarity thresholds.",
}

@ARTICLE{Turn8610:New,
AUTHOR="J. S. Turner",
TITLE="New directions in communications (or which way to the information
age?)",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=10,
PAGES="8-15",
MONTH=oct,
YEAR=1986,
KEYWORDS="computer networks; fast packet switching; congestion control;
fast packet switches; network architecture; leaky bucket",
ABSTRACT="Information transport networks should provide a generally
useful set of communication capabilities that can be used as a
foundation on which to build a large class of different applications.
Connections should support a wide range of bandwidths, multi-point and
unicast. Options include multi-rate circuit switching, fast circuit or
burst switching, fast packet switching and packet switching. Effective
congestion control requires several methods, each acting on a different
time scale.",
}

@ARTICLE{Conw8610:Decomposition,
AUTHOR="A. E. Conway and Nicolaos D. Georganas",
TITLE="Decomposition and Aggregation by Class in Closed Queueing
Networks",
JOURNAL=ieeese,
VOLUME=12,
NUMBER=10,
PAGES="1025-1040",
MONTH=oct,
YEAR=1986,
}

@ARTICLE{Davi8610:Review,
AUTHOR="P. J. Davidson",
TITLE="Review of the {CCITT} recommendations for integrated services
digital network",
JOURNAL="British Telecommunication Engineering",
VOLUME=5,
PAGES="202-206",
MONTH=oct,
YEAR=1986,
KEYWORDS="ISDN; standardization",
}

@ARTICLE{Hauz8610:Model,
AUTHOR="B. M. Hauzeur",
TITLE="A Model for Naming, Addressing, and Routing",
JOURNAL=toois,
VOLUME=4,
NUMBER=4,
PAGES="293-311",
MONTH=oct,
YEAR=1986,
}

@ARTICLE{Quar8610:Notable,
AUTHOR="Quarterman86",
TITLE="Notable Computer Networks",
JOURNAL=cacm,
VOLUME=29,
NUMBER=10,
PAGES="932-971",
MONTH=oct,
YEAR=1986,
}

@INPROCEEDINGS{Wood8610:Practical,
AUTHOR="J. Wood",
TITLE="A Practical Distributed Secure System",
BOOKTITLE="2nd International Conference on Secure Communications
Systems",
ORGANIZATION="Royal Signals and Radar Establishment",
ADDRESS="London, England",
MONTH=oct,
YEAR=1986,
}

@TECHREPORT{Manr8610:Directory,
AUTHOR="C. Manros",
TITLE="Directory: the vital support",
TYPE="Electronic Message Systems - ONLINE Conference",
INSTITUTION="ONLINE",
ADDRESS="New york",
PAGES="93-104",
MONTH=oct,
YEAR=1986,
}

@TECHREPORT{Vale8610:User,
AUTHOR="I. Valentine",
TITLE="User Agents in small machines",
TYPE="Electronic Message Systems - ONLINE Conference",
INSTITUTION="ONLINE",
ADDRESS="New York",
PAGES="215-224",
MONTH=oct,
YEAR=1986,
KEYWORDS="p7",
}

@ARTICLE{Gagl8610:Communications,
AUTHOR="R. D. Gaglianello and H. P. Katseff",
TITLE="Communications in Meglos",
JOURNAL=spe,
VOLUME=16,
NUMBER=10,
PAGES="945-63",
MONTH=oct,
YEAR=1986,
ABSTRACT="Meglos provides a user-level, message-based programming
environment for a system of interconnected processors. It allows the
simultaneous execution of a wide range of applications including
real-time control and large-scale computations requiring the
co-operative work of many processors. The communications mechanisms in
Meglos are designed to be easy to use and to provide high performance at
the application level. The communication primitives are based on
symmetric, error-resilient channels that are independently flow
controlled. Two-ended channels between pairs of co-operating processed
provide communications with low latency and high throughput. Multicast
channels are used to send messages efficiently among a large group of
processors in a single operation.",
}

@TECHREPORT{John8610:Software,
AUTHOR="C. W. Johnson and A. J. Quaine",
TITLE="Software Engineering Principles in the Design of a Language for
Computer Aided Learning",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-07",
MONTH=oct,
YEAR=1986,
}

@TECHREPORT{McKa8610:Further,
AUTHOR="Brendan D. McKay and C. W. Johnson and V. Sharma",
TITLE="Further Methods for Detecting Plagiarism in Student Programs",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-06",
MONTH=oct,
YEAR=1986,
}

@TECHREPORT{Stan8610:Graphics,
AUTHOR="Robin B. Stanton and Hugh G. Mackenzie",
TITLE="A Graphics oriented Deductive Planning System",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-05",
MONTH=oct,
YEAR=1986,
}

@TECHREPORT{Will8610:FrameUP,
AUTHOR="G. Williams",
TITLE="FrameUP: A Frames Formalism for Expert Systems",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-04",
MONTH=oct,
YEAR=1986,
}

@INPROCEEDINGS{Conr8610:Distributed,
AUTHOR="S. E. Conry",
TITLE="Distributed Artificial Intelligence in Communications Systems",
BOOKTITLE="Expert Systems in Government Symposium",
ADDRESS="Virginia",
PAGES="286-289",
MONTH=oct,
YEAR=1986,
KEYWORDS="artificial intelligence",
}

@INPROCEEDINGS{Hans8610:Artificial,
AUTHOR="Raymond H. Hanson",
TITLE="Artificial Intelligence in network Managment Systems",
BOOKTITLE="Expert Systems in Government Symposium",
PAGES="291-295",
MONTH=oct,
YEAR=1986,
KEYWORDS="artificial intelligence",
}

@INPROCEEDINGS{Whan8610:Expert,
AUTHOR="K.-Y. Whang and S. Brady and R. S. Gilbert",
TITLE="Expert Systems in Network Management and Control",
BOOKTITLE="Expert Systems in Government",
ADDRESS="McLean, Virginia",
PAGES=290,
MONTH=oct,
YEAR=1986,
KEYWORDS="artificial intelligence",
}

@TECHREPORT{Saue8611:Research,
AUTHOR="C. H. Sauer and Alvin M. Bloom and Paul G. Loewner and E. A.
MacNair and James F. Kurose",
TITLE="The Research Queueing Package Version 2: {CMS} Reference Manual",
INSTITUTION="International Business Machines Corporation",
ADDRESS="Yorktown Heights, New York",
NUMBER="RA139",
MONTH=nov,
YEAR=1986,
}

@INPROCEEDINGS{Noji8611:High,
AUTHOR="S. Nojima and M. Hashimoto and H. Fukuda and E. Tsutsui",
TITLE="High speed packet switching network for multi-media information",
BOOKTITLE="Computer Networking Symposium",
ORGANIZATION="IEEE",
ADDRESS="Washington, D.C.",
PAGES="141-150",
MONTH=nov,
YEAR=1986,
KEYWORDS="packet voice; fast packet switching; integrated services",
ABSTRACT="For several years, research and development has been underway
at Fujitsu laboratories, in the area of high speed packet switching
networks. The result is an integration of multi-media information
network architecture. The architecture has already been applied to the
LAN and is now applicable to wide area corporate networks using newly
developed technologies described in this paper. The most important
technology -- bus matrix switching -- provides quantum leap processing
capacity up to a few Gb/s or several million packets every second,
keeping very low switching delay. The performance evaluation based on
our prototype models are also addressed in detail. For example, voice
delay of less than 20 ms is obtained for five hops communication. The
new technologies will result in much more improvement for computer
networks particularly and will be applicable to realize basic and
broadband ISDN as well.",
}

@ARTICLE{Turn8611:Integrated,
AUTHOR="J. S. Turner",
TITLE="Design of an integrated services packet network",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=8,
PAGES="1373-1380",
MONTH=nov,
YEAR=1986,
KEYWORDS="integrated services; network architecture; fast packet
switching",
ABSTRACT="The integrated services digital network (ISDN) has been
proposed as a way of providing integrated voice and data communications
services on a universal or near-universal basis. In this paper, I argue
that the evolutionary approach inherent in current ISDN proposals is
unlikely to provide an effective long-term solution and I advocate a
more revolutionary approach, based on the use of advanced
packet-switching technology. The bulk of this paper is devoted to a
detailed description of an integrated services packet network (ISPN),
which I offer as an alternative to current ISDN proposals.",
}

@ARTICLE{Spro8611:Reducing,
AUTHOR="Lee Sproull and Sara Kiesler",
TITLE="Reducing Social Context Cues: Electronic Mail in Organizational
Communication",
JOURNAL=ms,
VOLUME=32,
NUMBER=11,
PAGES="1492-1512",
MONTH=nov,
YEAR=1986,
KEYWORDS="CSWC; electronic mail; computer conferencing",
ABSTRACT="This paper examines electronic mail in organizational
communication. Based on ideas about how social context cues within a
communication setting affect information exchange, it argues that
electronic mail does not simply speed up the exchange of information but
leads to the exchange of new information as well. In a field study in a
Fortune 500 company, we used questionnaire data and actual messages to
examine electronic mail communication at all levels of the organization.
Based on hypotheses from research on social communication, we explored
effects of electronic communication related to self-absorption, status
equalization, and uninhibited behavior. Consistent with experimental
studies, we found that decreasing social context cues has substantial
deregulating effects on communication. And we found that much of the
information conveyed through electronic mail was information that would
not have been conveyed through another medium.",
}

@ARTICLE{Chun8611:Taylor,
AUTHOR="Habong Chung and Yongli Sun",
TITLE="Taylor series approach to functional approximation for inversion
of Laplace Transforms",
JOURNAL=elet,
VOLUME=22,
NUMBER=23,
PAGES="1219-1221",
MONTH=nov,
YEAR=1986,
KEYWORDS="control theory; Laplace transform; Taylor series; inverse
Laplace transform",
ABSTRACT="The letter is devoted to a functional approximation for
inversion of the Laplace transform. The function is approximated by a
truncated Taylor series, which is expanded about $t\_0=0$. Utilising a
special transformation, each Laplace transform is converted into a set
of simultaneous linear algebraic equations which are then easily
computed to give the coefficients of the basis function. Two examples
with satisfactory results are given.",
}

@INPROCEEDINGS{Mela8611:Workstation,
AUTHOR="B. Melamed",
TITLE="The performance analysis workstation: an interactive animated
simulation package for queueing networks",
BOOKTITLE=fjcc,
ADDRESS="Dallas, Texas",
PAGES="729-740",
MONTH=nov,
YEAR=1986,
REFERENCES=13,
KEYWORDS="Simulation; computer animation; Q+",
}

@INPROCEEDINGS{Prot8611:Broadband,
AUTHOR="E. Protonotarios and  others",
TITLE="Broadband Communication Networks with Asynchronous Time Division
{(ATD)} Multiplexing and Switching, Part I and {II}",
BOOKTITLE="ISDN Europe",
ADDRESS="Basel",
MONTH=nov,
YEAR=1986,
REFERENCES=14,
KEYWORDS="Analysis; Queueing system",
}

@INPROCEEDINGS{Cheo8611:Signalling,
AUTHOR="H. K. Cheong",
TITLE="Signalling system No. 7: link capacity estimation",
BOOKTITLE="1st Australian Teletraffic Research Seminar",
ADDRESS="Clayton",
PAGES="1-7 (8.3)",
MONTH=nov,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS; performance evaluation",
}

@ARTICLE{Dono8611:Realization,
AUTHOR="D. C. Donohoe and G. H. Johannessen and R. C. Stone",
TITLE="Realization of a signaling system No. 7 network for {AT\\&T}",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=8,
PAGES="1257-1261",
MONTH=nov,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Herr8611:ISDN,
AUTHOR="T. J. Herr and T. J. Plevyak",
TITLE="{ISDN:} The opportunity begins",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=11,
PAGES="6-10",
MONTH=nov,
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Hopp8611:ISDN,
AUTHOR="C. Hoppitt",
TITLE="{ISDN} evolution: From copper to fiber in easy stages",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=11,
PAGES="17-22",
MONTH=nov,
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Tang8611:ISDN,
AUTHOR="W. V. Tang",
TITLE="{ISDN} -- new vistas in information processing",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=11,
PAGES="11-16",
MONTH=nov,
YEAR=1986,
KEYWORDS="ISDN",
}

@ARTICLE{Come8611:Conversation,
AUTHOR="D. Comer and L. L. Peterson",
TITLE="Conversation-Based Mail",
JOURNAL=tocs,
VOLUME=4,
NUMBER=4,
PAGES="299-319",
MONTH=nov,
YEAR=1986,
}

@TECHREPORT{Holl8611:Remote,
AUTHOR="U. Hollberg and H. Schumutz and P. Silberbusch",
TITLE="Remote File Access - A Distributed File System for Heterogeneous
Networks",
INSTITUTION="IBM European Networking Center",
NUMBER="43.8611",
MONTH=nov,
YEAR=1986,
}

@TECHREPORT{Crow8611:Overview,
AUTHOR="Jon Crowcroft",
TITLE="An overview of Network Monitoring and Management at {UCL}",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=1972,
MONTH=nov,
YEAR=1986,
}

@ARTICLE{Jaco8611:Yet,
AUTHOR="V. Jacobson",
TITLE="Yet More on {RTTs}",
JOURNAL="Personal Communication",
MONTH=nov,
YEAR=1986,
}

@TECHREPORT{Lloy8611:Bottleneck,
AUTHOR="P. J. Lloyd",
TITLE="Bottleneck Tests on the {UCL---Goonhilly} Path",
TYPE="Internal Note",
INSTITUTION="UCL",
NUMBER=2051,
MONTH=nov,
YEAR=1986,
}

@INPROCEEDINGS{Liu8611:Session,
AUTHOR="Y. Liu and T. B. Gendreau and C. T. King and L. M. Ni",
TITLE="A session layer design of a reliable {IPC} system in the Unix 4.2
environment",
BOOKTITLE="Computer Networking Symposium",
PUBLISHER="IEEE Compututer Society Press",
ADDRESS="Washington, DC",
PAGES="120-9",
MONTH=nov,
YEAR=1986,
ABSTRACT="A description is given of the design for a universal and
reliabel set of interprocess communication (IPC) services int hte Unix
4.2BSD environment. The universal IPC services include one-to-one and
multicast send, asynchronous and synchronous communication, blocking and
nonblocking receive command, and group manipulation. The networking
facility in Unix 4.2BSD provides users with direct access to the
transport layer, which provides rudimentary IPC services. The lack of a
universal set of IPC services in Unix 4.2BSD makes the development of
distributed algorithms and distributed programming languages difficult.
The authors consider the design of universal IPC services to be session
layer services which provide services to the distributed application
layer and require rudimentary IPC services from the transport layer. The
proposed set of IPC primitives provides reliable service and is
implemented in networked Sun workstations.",
}

@ARTICLE{Thom8611:Finding,
AUTHOR="B. Thompson and W. J. Thompson",
TITLE="Finding rules in data",
JOURNAL=byte,
PAGES="149-158",
MONTH=nov,
YEAR=1986,
KEYWORDS="Classification trees",
}

@TECHREPORT{Suda8611:Packetized,
AUTHOR="T. Suda and T. T. Bradley",
TITLE="Packetized-Voice/Data Integrated Transmission on a Token Passing
Ring Local Area Network",
TYPE="Technical Report",
INSTITUTION="University of California, Irvine, Department of Information
and Computer Science",
NUMBER="ICS-TR-86-22",
PAGES=37,
MONTH=nov,
YEAR=1986,
ABSTRACT="This paper investigates the performance of a token passing
ring network with packetized-voice/data mixed traffic through extensive
simulations. Both data and voice users are modeled in the simulations.
Data users produce bursty traffic. Voice traffic is modeled as having
alternating talkspurts and silences, with generation of voice packets at
a constant rate during talkspurts and no packet generation during
silence periods. The network performance measures obtained include: the
distribution of transmission delays for voice packets, the average
transmission delay and loss probabilities for voice packets, the number
of voice users allowed on a network while satisfying the real-time
constraints of speech, and the average transmission delay for data
packets. Token passing ring local area networks are shown to effectively
handle both voice and data traffic. The effects of system parameters
(e.g., voice packet length, talkspurt/silence length, data traffic
intensity, and limited versus exhaustive service disciplines) on network
performance are discussed.",
}

@TECHREPORT{Neig8611:Substituting,
AUTHOR="Gilbert A. Neiger and S. Toueg",
TITLE="Substituting for Real Time and Common Knowledge in Distributed
Systems",
INSTITUTION="Cornell University, Computer Science Department",
NUMBER="TR86-790",
PAGES=33,
NOTE="Revised July 1987",
MONTH=nov,
YEAR=1986,
ABSTRACT="We study time and knowledge in synchronous and asynchronous
reliable distributed systems. For both types of systems, we describe
clocks that can be used as if they were perfectly synchronized real-time
clocks in the solution of a large class of problems that we formally
characterize. For this same class of problems, we also propose a
broadcast primitive that can be used as if it achieves common knowledge.
Our clocks and broadcast primitive are tools that considerably simplify
the task of designing and proving correct distributed algorithms: the
designer can assume that processors have access to real-time clocks and
the ability to achieve common knowledge. The latter can be used to
implement the abstraction of shared memory.",
}

@ARTICLE{Care8611:Multiversion,
AUTHOR="M. Carey and W. Muhanna",
TITLE="The Performance of Multiversion Concurrency Control Algorithms",
JOURNAL=tocs,
VOLUME=4,
NUMBER=4,
PAGES="338-378",
MONTH=nov,
YEAR=1986,
}

@ARTICLE{Lars8611:Server,
AUTHOR="R. E. Larson and C. Schaack",
TITLE="An N Server Cutoff Priority queue Where Arriving Customers
Request a Random Number of servers",
JOURNAL=ms,
MONTH=nov,
YEAR=1986,
KEYWORDS="Queueing system; cut-off priority",
}

@ARTICLE{Kim8611:Synchronized,
AUTHOR="M. Kim",
TITLE="Synchronized Disk Iterleaving",
JOURNAL=ieeetc,
PAGES="978-988",
MONTH=nov,
YEAR=1986,
}

@TECHREPORT{Park8611:Proving,
AUTHOR="A. Park and K. Balasubramanian",
TITLE="Proving Fault Tolerance in Parallel Secondary Storage Systems",
INSTITUTION="Princeton University, Department of Computer Science",
NUMBER="TR 057-86",
MONTH=nov,
YEAR=1986,
}

@ARTICLE{Dono8611:Realization,
AUTHOR="D. C. Donohoe and G. H. Johannessen and Russell Stone",
TITLE="Realization of a signaling system No. 7 network for {AT\&T}",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=8,
PAGES="1257-1261",
MONTH=nov,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Boeh8612:Standardized,
AUTHOR="Rodney J. Boehm and Yau-Chau Ching and C. George Griffith and
Frederick A. Saal",
TITLE="Standardized Fiber Optic Transmission Systems --- A Synchronous
Optical Network View",
JOURNAL=ieeejsac,
VOLUME="SAC-4",
NUMBER=9,
PAGES="1424-1431",
MONTH=dec,
YEAR=1986,
KEYWORDS="SONET",
ANNOTE="Discusses considerations in standardizing SONET and digital
hierarchy; only reflects actual SONET standard in outline.",
}

@INPROCEEDINGS{Chen8612:Variance,
AUTHOR="R.-G. Cheng",
TITLE="Variance Reduction Methods",
BOOKTITLE=wsc,
EDITOR="James R. Wilson and James O. Henriksen and Stephen D. Roberts",
ADDRESS="Washington, D.C.",
PAGES="60-68",
MONTH=dec,
YEAR=1986,
KEYWORDS="simulation",
ABSTRACT="A computer simulation model is unusual in that the random
error is under the total control of the experimenter. Variance reduction
methods aim to take advantage of this to improve experimental accuracy.
The fundamental ideas behind the most important of these methods will be
described and illustrated with simple examples.",
}

@INPROCEEDINGS{Gopa8612:Simulation,
AUTHOR="P. M. Gopal and Bharath K. Kadaba",
TITLE="A Simulation Study of Network Delay for Packetized Voice",
BOOKTITLE=globecom,
ORGANIZATION="IEEE Communication Society",
ADDRESS="Houston, Texas",
PAGES="932-938 (27.2)",
MONTH=dec,
YEAR=1986,
KEYWORDS="packet voice",
ANNOTE="Tolerable:  end-to-end delay of 300 ms, loss of 1-2\%;
simulation for single- and multi-hop (7 T1 hops) delay 99\% percentile
for PCM/TASI (64 kbps) and ADPCM/non-TASI (32 kbps); fixed packet size",
}

@INPROCEEDINGS{Karo8612:Input,
AUTHOR="Mark Karol and M. G. Hluchyj and Samuel P. Morgan",
TITLE="Input vs. Output Queueing on a Space-Division Packet Switch",
BOOKTITLE=globecom,
ORGANIZATION="IEEE",
ADDRESS="Houston, Texas",
PAGES="659-665",
MONTH=dec,
YEAR=1986,
KEYWORDS="multiplexer; queueing theory; fast packet switch",
ANNOTE="see \cite{Karo87:Input}; relates mean queue size of DT queue
with $N$ Bernoulli sources to that of $M/D/1$",
}

@INPROCEEDINGS{Leon8612:Integrated,
AUTHOR="A. Leon-Garcia and O. S. Aboul-Magd",
TITLE="Performance Analysis of Integrated Voice and Data Tandem Link
Network",
BOOKTITLE=globecom,
ORGANIZATION="IEEE",
ADDRESS="Houston, Texas",
PAGES="944-948",
MONTH=dec,
YEAR=1986,
KEYWORDS="packet voice",
ANNOTE="Tandem link with burst switching, without independence
assumptions. Fluid approximation for average data delay.",
}

@INPROCEEDINGS{Lim8612:Integrated,
AUTHOR="Y. Lim",
TITLE="Performance Analysis of an Integrated Voice and Data {TDM} Link
with Digital Speech Interpolation",
BOOKTITLE=globecom,
ORGANIZATION="IEEE",
ADDRESS="Houston, Texas",
PAGES="960-964 (27.7)",
MONTH=dec,
YEAR=1986,
KEYWORDS="packet voice",
ANNOTE="TDM with movable boundary, solved using matrix-geometric
methods.",
}

@INPROCEEDINGS{Pare8612:Quick,
AUTHOR="Sujay Parekh and J. Walrand",
TITLE="Quick Simulation of Excessive Backlogs in Networks of Queues",
BOOKTITLE=cdc,
ORGANIZATION="IEEE",
ADDRESS="Athens, Greece",
PAGES="979-986",
MONTH=dec,
YEAR=1986,
KEYWORDS="simulation; rare events",
}

@INPROCEEDINGS{Reim8612:Sensitivity,
AUTHOR="M. I. Reiman and A. Weiss",
TITLE="Sensitivity Analysis Via Likelihood Ratios",
BOOKTITLE=wsc,
EDITOR="James R. Wilson and James O. Henriksen and Stephen D. Roberts",
ADDRESS="Washington, D.C.",
PAGES="286-289",
MONTH=dec,
YEAR=1986,
ABSTRACT="The authors present a new method of obtaining derivatives of
expectations with respect to various parameters. For example, if
$\lambda$ is the rate of a Poisson process, $N\_T$ is the number of
Poisson events in $(0, T)$, and $\psi$ is nearly any function of the
sample path (e.g., a performance measure in a queueing network), then we
show that $\frac{d}{d\lambda}E\_\lambda(\psi)=E\_\lambda\left[\left[
\frac{N\_T}{\lambda}-T\right]\psi\right],$ which yields an obvious
algorithm. The authors have proven that the method works for a wide
class of parameters and performance measures in regenerative simulation.
The authors also report on the method's limitations and on some
numerical experiments.",
ANNOTE="Perturbation analysis, simulation, stochastic estimation.",
}

@INPROCEEDINGS{Kapa8612:Wideband,
AUTHOR="A. A. Kapaun and W.-H. F. Leung and Gottfried Luderer and M. J.
Morgan and A. K. Vaidya",
TITLE="Wideband packet access for workstations: integrated
voice/data/image services on the Unix {PC}",
BOOKTITLE=globecom,
ORGANIZATION="IEEE",
ADDRESS="Houston, Texas",
VOLUME=3,
PAGES="1439-1441 (40.6)",
MONTH=dec,
YEAR=1986,
KEYWORDS="packet voice; speech communication",
ABSTRACT="We report on exploratory work to connect the Unix personal
computer --- AT\\&T 3B1 computer --- as a multi-media workstation to an
experimental wideband packet network that supports integrated access and
transport of data, image and interactive voice. An experimental wideband
packet network interface can support many simultaneous multi-media
calls. The purpose of this work is to gain insight into multi-media
network interfaces, including higher-level capabilities; it would also
demonstrate the strengths of the UNIX operating system for integration
of computation and communication.",
ANNOTE="Very high-level description of system.",
}

@ARTICLE{Good8612:Waveform,
AUTHOR="David J. Goodman and Gordon B. Lockhart and Ondria J. Wasem and
Wai-Choong Wong",
TITLE="Waveform substitution techniques for recovering missing speech
segments in packet voice communications",
JOURNAL=ieeeassp,
VOLUME="ASSP-34",
NUMBER=6,
PAGES="1440-1448",
MONTH=dec,
YEAR=1986,
KEYWORDS="packet voice; packet loss; packet substitution",
ABSTRACT="Packet communication systems cannot, in general, guarantee
accurate and prompt delivery of every packet. The effect of network
congestion and transmission impairments on data packets is extended
delay; in voice communications these problems lead to lost packets. When
some speech packets are not available, the simplest response of a
receiving terminal is to substitute silence for the missing speech.
Here, we explore techniques for replacing missing speech with waveform
segments from correctly received packets in order to increase the
maximum tolerable missing packet rate. After presenting a simple formula
for predicting the probability of waveform substitution failure as a
function of packet duration and packet loss rate, we introduce two
techniques for selecting substitution waveforms. One method is based on
pattern matching and the other technique explicitly estimates voicing
and pitch. Both approaches achieve substantial improvements in speech
quality relative to silence substitution. After waveform substitution, a
significant component of the perceived distortion is due to
discontinuities at packet boundaries. To reduce this distortion, we
introduce a simple smoothing procedure.",
}

@ARTICLE{Kama8612:Voice,
AUTHOR="T. Kamae",
TITLE="Voice/data integration in the {INS} model system and local area
networks",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=12,
PAGES="7-15",
MONTH=dec,
YEAR=1986,
KEYWORDS="speech transmission; ISDN; PBX; LAN",
ABSTRACT="Describes ISDN-type applications such as Sketchphone and
videotex (CAPTAIN, PAIRS). Workstations are used as telephone calling
aids to control the PBX.",
}

@ARTICLE{Bran8612:PHILAN,
AUTHOR="J. R. Brandsma and A. A. M. L. Bruekers and J. L. W. Kessels",
TITLE="{PHILAN:} a fiber-optic ring for voice and data",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=12,
PAGES="16-22",
MONTH=dec,
YEAR=1986,
KEYWORDS="speech transmission; LAN; token ring; integrated services",
ABSTRACT="PHILAN is a 20 Mb/s, fiber-optic multichannel ring on which
125 $\mu$s frames are circulating. These frames are subdivided into
fields, each supporting a subring. Most subrings are used as channels,
with capacities that are multiples of 64 kb/s.",
}

@ARTICLE{Case8612:FXNET,
AUTHOR="L. Casey and R. C. Dittburner and N. D. Gamage",
TITLE="{FXNET:} a backbone ring for voice and data",
JOURNAL=ieeecm,
VOLUME=24,
NUMBER=12,
PAGES="23-28",
MONTH=dec,
YEAR=1986,
KEYWORDS="MAN; ring",
ABSTRACT="FXNET is an active fiber optic slotted ring operating at 160
MHz and 80 Mb/s. A maximum of 256 stations can be supported on a ring of
up to 85 km circumference. Reliability is ensured through bypass links
or loopback. FXNET provides both TDM and packet-switched channels.",
}

@ARTICLE{Thom8612:Analytic,
AUTHOR="A. Thomasian and P. Bay",
TITLE="Analytic Queueing Network Models for Parallel Processing of Task
Systems",
JOURNAL=ieeetc,
VOLUME="C-35",
NUMBER=12,
PAGES="1045-1053",
MONTH=dec,
YEAR=1986,
KEYWORDS="parallel computing; model; performance evaluation",
ANNOTE="This paper is concerned with the performance evaluation of a
realistic model of parallel computations. We present an efficient
algorithm to determine the mean completion time and related performance
measures for a task system: a set of task with preceden ce relationships
in their execution sequenc, such that the resulting graph is acyclic. A
queueing network is used to model tasksexecuting on a single or
multicomputer system.",
}

@INPROCEEDINGS{Yin8612:Delay,
AUTHOR="D. H.-L. Yin and J. S. Meditch",
TITLE="Delay analysis of Expressnet with integrated voice/data
services",
BOOKTITLE=globecom,
ORGANIZATION="IEEE",
ADDRESS="Houston, Texas",
PAGES="34-38 (1.7)",
MONTH=dec,
YEAR=1986,
KEYWORDS="local area networks; multiple access; integrated services;
packet voice; bus networks",
ABSTRACT="Expressnet is a high speed Local Area Network capable of
carrying different types of traffic. In this paper, we confine our
attention to voice and data only. A simple access scheme wbich meets the
maximum delay constraint of voice packets is first described. Then, a
queueing model which assesses the delay performance of the scheme is
presented. In our analysis, data packets are assumed to arrive at a data
station according to a Poisson process and a reneval process is used to
approximate packetized voice stream. Approximate formulas for the
Laplace transform of the data delay distribution, and the mean waiting
times are derived explicitly. Numerical results which illustrate the
performance of the system are presented.",
}

@INCOLLECTION{Shac8612:BLEND,
AUTHOR="B. Shackel and D. J. Pullinger and T. I. Maude and W. P. Dodd",
TITLE="The {BLEND-LINC} Project on Electronic Journals after Two Years",
BOOKTITLE="BLEND--5: The Computer Human Factors Journal",
EDITOR="B. Shackel and J. Florentin and P. E. Wright",
PUBLISHER="Library and Information Research Report",
ADDRESS="Dep't of Human Sciences, University of Technology,
Loughborough, UK",
MONTH=dec,
YEAR=1986,
KEYWORDS="computer conferencing; electronic journals",
ABSTRACT="This paper described the progress after 2 years of a 3 1/2
year experimental program organized jointly by the two Universities as
the Birmingham and Loughborough Electronic Network Development (BLEND).
The aims of the program are to explore and evaluate alternative forms of
user communication through and electronic journal and information
network and to assess the cost, efficiency, and subjective impact of
such a system. After summarizing the background leading to this
research, the project is described which involves the development of
various types of ``electronic journal'' with a community of initially
about 50 scientists (the Loughborough Information Network Community -
LINC). Each member will contribute at least one research article and one
shorter note in each year of the project, and will also use other forms
of communication such as newsletters, annotated abstracts, workshop
conferences, cooperative authorship, etc. Considerable problems have
been experienced with the hardware available to LINC members, with
communications equipment, with modifying and developing software to
obtain an acceptable operating system, and with various unexpected
bureaucratic and organizational difficulties. These problems and the
results to date will be reviewed. Nevertheless, more than 20 papers are
in the system and the first number of the ``Computer Human Factors''
experimental electronic journal was open to LINC members on October 1st,
1982.",
}

@ARTICLE{Meek8612:Overview,
AUTHOR="Brock N. Meeks",
TITLE="An Overview of Conferencing Systems",
JOURNAL=byte,
VOLUME=10,
NUMBER=3,
PAGES="169-70,172-176,178,180,182,184",
MONTH=dec,
YEAR=1986,
KEYWORDS="computer conferencing",
ABSTRACT="A ``guided'' tour through several conferencing systems.
Reviews early computer conferencing systems (1971 with EMISARI -
Emergency Management Information System and Reference Index - by Murray
Turoff, Office of Emergency Preparedness). Descriptions of COM (Swedish
National Defense Research Institute starting in 1971); EIES (New Jersey
Institute of Technology, building on experience of EMISARI); PARTI or
PARTICIPATE (initially Participation Systems Inc now NETI, Inc. - by
Harry Stevens and incorporates ideas from several conferencing systems);
NOTEPAD (business oriented from Infomedia by Jacques Vallee); eFORUM
(developed by NETI and relatively new product but not containing
e-mail); COSY (developed by Al Mayer at University of Guelph based on
several different conferencing systems beginning in 1983 - also same as
BIX conferencing run by BYTE magazine); CONFER (Developed at University
of Michigan by Bob Parnes in 1975); AUGMENT (marketed by Tymshare since
1978); and GENIE (Created by Stephen Heitmann but small proprietary
system).",
}

@ARTICLE{Maye8612:Storage,
AUTHOR="Alain Mayer",
TITLE="Storage Architectures: Their Implications for Conferencing
Systems",
JOURNAL=byte,
VOLUME=10,
NUMBER=13,
PAGES="221-234",
MONTH=dec,
YEAR=1986,
KEYWORDS="computer conferencing",
ABSTRACT="Discusses computer conferencing as an example of a specialized
database, using CoSy as the reference system. CoSy was designed from the
perspective of the user first, and the file/database structure second.
The overall file structure sets the tone of all subsequent developments,
as the old data must be upward compatable as new versions of the
conferencing system are implemented. Various options for the basic file
design are discussed and the trade-offs among them are noted. Some brief
comparisons are made between CoSy, PARTI, and COM conferencing systems,
with most detailed points between CoSy and COM. The CoSy system was
developed in UNIX initially, and several UNIX related features are
referenced frequently. The CoSy system in 1985 version on UNIX was about
12,000 lines of C code (including editor).",
}

@INPROCEEDINGS{Heid8612:Statistical,
AUTHOR="P. Heidelberger",
TITLE="Statistical analysis of parallel simulations",
BOOKTITLE=wsc,
ISBN="0-911801-11-1",
ADDRESS="Washington, DC",
PAGES="290-295",
MONTH=dec,
YEAR=1986,
KEYWORDS="Distributed simulation; discrete event simulation; output
analysis; estimation",
ABSTRACT="Statistical issues that arise when discrete event simulations
aron parallel processing computers are dealt with. The
statisticalproperties of estimates obtained by parallel distributed
simulatand parallel independent replications are compared. This
comparishows that, when estimating steady-state quantities, the run
lenthe strength of the initial transient, and the asymptotic varianmust
be taken into account in addition to the parallel processin",
}

@INPROCEEDINGS{Gold8612:Generic,
AUTHOR="R. P. Goldberg",
TITLE="Generic requirements for services in the common channel signaling
network",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
PAGES="50.4 (1-3)",
MONTH=dec,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@INPROCEEDINGS{Maru8612:Common,
AUTHOR="D. J. Marutiak and M. B. Starbuck",
TITLE="{AT\\&T} common channel signaling services and products",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
MONTH=dec,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}

@ARTICLE{Lang8612:Multimedia,
AUTHOR="Peter Langendoerfer and  others",
TITLE="Multimedia Filing and Retrieval Based on Optical and Magnetic
Mass Storage Technology",
JOURNAL="Microprocessing and Microprogramming",
VOLUME="1-5",
PAGES=18,
MONTH=dec,
YEAR=1986,
KEYWORDS="multimedia",
}

@UNPUBLISHED{Kenn8612:Fiber,
AUTHOR="S. Kennedy and Pierre A. Humblet",
TITLE="Fiber Optic Networks of the Future",
NOTE="A White Paper",
MONTH=dec,
YEAR=1986,
}

@INPROCEEDINGS{Kris8612:State,
AUTHOR="K. R. Krishnan and Teunis Ott",
TITLE="State Dependent Routing of Telephone Traffic: Theory and
Results",
BOOKTITLE="25th CDC",
ADDRESS="Athens, Greece",
MONTH=dec,
YEAR=1986,
}

@INPROCEEDINGS{Chan8612:Distributed,
AUTHOR="S. T. Chanson and K. Ravindran",
TITLE="A distributed kernel model for reliable group communication",
BOOKTITLE="Real-Time Systems Symposium",
PUBLISHER="IEEE Computer Society Press",
ADDRESS="Washington",
PAGES="138-46",
MONTH=dec,
YEAR=1986,
ABSTRACT="A kernel model which supports reliable group communication in
a distributed computing environment is presented. New semantic tools
which capture the nondeterminism of the underlying low-level events
concisely are introduced and a process alias-based structuring technique
for the kernel to handle the reliability problems that may arise during
group commmunication is described. The scheme works by maintaining a
close association between group meessages and their corresponding reply
messages. Sample programs illustrate how the semantic tools may be
used.",
}

@TECHREPORT{Lloy8612:End,
AUTHOR="P. J. Lloyd",
TITLE="End to End Protocol Performance over Linked Local Area Networks",
TYPE="Ph.D Thesis",
INSTITUTION="University College London",
ADDRESS="London",
NUMBER=123,
MONTH=dec,
YEAR=1986,
}

@ARTICLE{Veen8612:Dataflow,
AUTHOR="Arthur H. Veen",
TITLE="Dataflow Machine Architecture",
JOURNAL=acmcs,
VOLUME=18,
NUMBER=4,
PAGES="365-396",
MONTH=dec,
YEAR=1986,
KEYWORDS="dataflow",
}

@TECHREPORT{Bren8612:Linear,
AUTHOR="R. P. Brent",
TITLE="A Linear Algorithm for Data Compression",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-10",
MONTH=dec,
YEAR=1986,
}

@TECHREPORT{Schr8612:Systolic,
AUTHOR="H. Schröder",
TITLE="Systolic Arrays versus Instruction Systolic Arrays",
INSTITUTION="Dept. of Computer Science, Australian National University",
ADDRESS="Canberra 0200 ACT, Australia",
NUMBER="TR-CS-86-08",
MONTH=dec,
YEAR=1986,
}

@INPROCEEDINGS{Maxe8612:Linear,
AUTHOR="N. F. Maxemchuk",
TITLE="Linear, Unidirectional Networks and Random Access Strategies in
Fiber-Optic Local Distribution Systems",
BOOKTITLE=globecom,
ADDRESS="Houston, TX, USA",
VOLUME=1,
PAGES="29-33",
MONTH=dec,
YEAR=1986,
REFERENCES=16,
KEYWORDS="Linear network; random access; fiber optics; optimization;
ALOHA; CSMA/CD; shuffle exchange",
}

@INPROCEEDINGS{Maru8612:Common,
AUTHOR="D. J. Marutiak and M. B. Starbuck",
TITLE="{AT\&T} common channel signaling services and products",
BOOKTITLE=globecom,
ADDRESS="Houston, Texas",
MONTH=dec,
YEAR=1986,
KEYWORDS="Signalling; common channel; CCS",
}