@TECHREPORT{ISO87:Information, AUTHOR="I. S. O (International Organization for Standardization)", TITLE="Information Processing Systems -- Open Systems Interconnection: Addendum to Enable Class 4 Operation over Connectionless Mode Network Service", INSTITUTION="ISO", NUMBER="IS 8072/AD2", YEAR=1987, KEYWORDS="transport protocol; connectionless service", } @BOOK{Bert87:Data, AUTHOR="D. P. Bertsekas and Robert Gallager", TITLE="Data Networks", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1987, } @BOOK{Brat87:Guide, AUTHOR="Paul Bratley and B. L. Fox and L. Schrage", TITLE="A Guide to Simulation", EDITION="2nd", ISBN="0-387-96467-3", PUBLISHER="Springer-Verlag", ADDRESS="New York, New York", YEAR=1987, KEYWORDS="Simulation; simulation model; simulation method; RNG; random number testing; output analysis; variance reduction; simulation language", ABSTRACT="Introduction to simulation.", } @ARTICLE{Cao87:Sensitivity, AUTHOR="Xi-Ren Cao", TITLE="Sensitivity Estimates Based on One Realization of a Stochastic System", JOURNAL="Journal of Statistical Computation and Simulation", VOLUME=27, PAGES="211-232", YEAR=1987, KEYWORDS="perturbation analysis", } @INPROCEEDINGS{Coud87:Prelude, AUTHOR="J.-P. Coudreuse and M. Servel", TITLE="Prelude: An Asynchronous Time-Division Switched Network", BOOKTITLE=icc, ORGANIZATION="IEEE", PAGES="22.2.1-22.2.5", YEAR=1987, } @BOOK{Fran87:Feedback, AUTHOR="Gene F. Franklin and J. David Powell and Abbas Emami-Naeini", TITLE="Feedback Control of Dynamic Systems", PUBLISHER="Addison Wesley", ADDRESS="Reading, Massachusetts", YEAR=1987, KEYWORDS="control theory", } @PHDTHESIS{Gong87:Smoothed, AUTHOR="Wei-Bo Gong", TITLE="Smoothed Perturbation Analysis of Discrete-Event Dynamic Systems", SCHOOL="Division of Applied Sciences, Harvard University", ADDRESS="Cambridge, Massachusetts", YEAR=1987, KEYWORDS="perturbation analysis; smoothed perturbation analysis", } @BOOK{Klei87:Statistical, AUTHOR="J. P. Kleijnen", TITLE="Statistical Tools for Simulation Practitioners", ISBN="0-8247-7333-0", PUBLISHER="Marcel Dekker", ADDRESS="New York, New York", YEAR=1987, KEYWORDS="simulation; statistics", } @BOOK{Pegd87:SIMAN, AUTHOR="C. Dennis Pegden", TITLE="Introduction to {SIMAN}", PUBLISHER="Systems Modeling Corporation", ADDRESS="State College, Pennsylvania", YEAR=1987, KEYWORDS="simulation; simulation languages", } @BOOK{Salv87:Handbook, TITLE="Handbook of Human Factors", EDITOR="Gavriel Salvendy", PUBLISHER="Wiley", ADDRESS="New York, New York", YEAR=1987, } @BOOK{Span87:Atlas, AUTHOR="Jerome Spanier and Keith B. Oldham", TITLE="An Atlas of Functions", PUBLISHER="Hemisphere Publishing (Springer)", ADDRESS="London", YEAR=1987, } @INPROCEEDINGS{Ae87:Response, AUTHOR="Tadashi Ae and Masafumi Yamashita and Hiroshi Matsomoto", TITLE="A Response Time Estimation of Real-Time Networks", BOOKTITLE="Real-Time Systems Symposium", PAGES=198, YEAR=1987, } @ARTICLE{Cors87:Bus, AUTHOR="Dante Del Corso", TITLE="Bus Features for Real-Time Environments", JOURNAL="Computer Standards and Interfaces", VOLUME=6, PAGES="17-25", YEAR=1987, } @ARTICLE{Dall87:Deadlock, AUTHOR="W. J. Dally and C. L. Seitz", TITLE="Deadlock-free message routing in multiprocessor interconnection networks", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=5, PAGES="547-53", YEAR=1987, } @ARTICLE{Dijk87:Heuristic, AUTHOR="E. W. Dijkstra", TITLE="A Heuristic Explanation of the Batcher's Baffler", JOURNAL=scp, VOLUME=9, PAGES="213-220", YEAR=1987, } @INPROCEEDINGS{Dist87:Distributed, AUTHOR="Fausto Distante and Vincenzo Piuri", TITLE="Distributed Architecture Design to Match Optimum Process {Allocation:A} Simulated Annealing Approach", BOOKTITLE="Real-Time Systems Symposium", PAGES="114-123", YEAR=1987, } @BOOK{Gehr87:Parallel, AUTHOR="Edward F. Gehringer and D. P. Siewiorek and Zary Segall", TITLE="Parallel Processing, the {CM*} Experience", PUBLISHER="Digital Press", YEAR=1987, } @INPROCEEDINGS{Hous87:Allocation, AUTHOR="C. E. Houstis", TITLE="Allocation of Real-Time Applications to Distributed Systems", BOOKTITLE="International Conference on Parallel Processing", ADDRESS="University Park, Pennsylvania", PAGES="863-866", YEAR=1987, } @INPROCEEDINGS{Leho87:Enhanced, AUTHOR="J. P. Lehoczky and L. Sha and J. K. Strosnider", TITLE="Enhanced Aperidic Responsiveness in Hard Real-Time Environments", BOOKTITLE="Real-Time Systems Symposium", PAGES="261-270", YEAR=1987, } @INPROCEEDINGS{Mok87:Synthesis, AUTHOR="A. K. Mok and Prasanna Amerasinghe and M.-S. Chen and Supoj Sutanthavibul and Kamtom Tantisirivat", TITLE="Synthesis of a Real-Time Message Processing System with Data-Driven Timing Constraints", BOOKTITLE="Real-Time Systems Symposium", PAGES="133-143", YEAR=1987, } @INPROCEEDINGS{Rasm87:MAX, AUTHOR="R. D. Rasmussen and Nikitas Dimopoulos", TITLE="{MAX:} Advanced General Purpose Real-Time Multicomputer for Space Applications", BOOKTITLE="Real Time Systems Symposium", PAGES="70-78", YEAR=1987, } @INPROCEEDINGS{Sha87:Task, AUTHOR="L. Sha and J. P. Lehoczky and Ragunathan Rajkumar", TITLE="Task Scheduling in Distributed Real-Time Systems", BOOKTITLE="IECON: International Conference on Industrial Electronics, Control, and Instrumentation", ADDRESS="New York, New York", PAGES="909-916", YEAR=1987, } @INPROCEEDINGS{Shu87:Gated, AUTHOR="D. B. Shu and J. C. Nash", TITLE="The Gated Interconnection Network for dynamic programming", BOOKTITLE="Concurrent computations: Princeton Workshop on Algorithm, Architecture, and Technology Issues for Models of Concurrent Computation", ADDRESS="New York", VOLUME=1, YEAR=1987, } @INPROCEEDINGS{Stan87:Spring, AUTHOR="John Stankovic and Krithivasan Ramamritham", TITLE="The design of the Spring Kernel", BOOKTITLE="Real-Time Systems Symposium", ADDRESS="IEEE", PAGES="371-382", YEAR=1987, } @INPROCEEDINGS{Wang87:New, AUTHOR="Yixin Wang and Steven E. Butner", TITLE="A New Architecture for Robot Control", BOOKTITLE="IEEE Robotics and Automation Conference", PAGES="664-670", YEAR=1987, } @INPROCEEDINGS{Wils87:Hierarchical, AUTHOR="A. Wilson", TITLE="Hierarchical Cache/Bus Architecture for Shared Memory Multiprocessors", BOOKTITLE="18th International Symposium on Computer Architecture", PAGES="244-252", YEAR=1987, } @INCOLLECTION{Wile87:Barriers, AUTHOR="Joe M. Wiley", TITLE="Barriers to integrating voice and data", BOOKTITLE="Integrating Voice and Data", EDITOR="Ray Sarch", PUBLISHER="McGraw-Hill", ADDRESS="New York, New York", PAGES="22-26", YEAR=1987, KEYWORDS="integrated services", ABSTRACT="A look at integration problems reveals technical and cost obstacles that may never be overcome, plus some narrow applications where the mix appears to be cost-effective.", } @BOOK{Tane87:Operating, AUTHOR="A. S. Tanenbaum", TITLE="Operating systems: design and implementation", ISBN="0-13-637406-9", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1987, KEYWORDS="operating systems; MINIX", } @ARTICLE{Zimm87:Effects, AUTHOR="D. Patrick Zimmerman", TITLE="Effects of Computer Conferencing on the language use of emotionally disturbed adolescents", JOURNAL="Behavior Research Methods, Instruments, and Computers", ADDRESS="University of Chicago, Chicago, Illinois", VOLUME=19, NUMBER=2, PAGES="224-230", YEAR=1987, KEYWORDS="computer-mediated communications; computer conferencing; adolescents", ABSTRACT="This study compared the computer-mediated communications among 18 severely disturbed adolescents with their small-group, face-to-face discussions. A content analysis was performed to explore psychological, interpersonal, and expressive differences between the two communication modes, The findings indicated that computer involvement tended to improve communication in these areas.", } @ARTICLE{Ches87:Large, AUTHOR="D. M. Chess and M. F. Cowlishaw", TITLE="A large-scale computer conferencing system", JOURNAL=ibmsj, ADDRESS="Chess: IBM Research Division, T. J. Watson Research Center, PO Box 218, Yorktown Heights, NY, 10598, Cowlishaw: IBM United Kingdom Ltd, Sheridan House, 41-43 Jewry Street, Winchester, Hants SO23 8RY, England", VOLUME=26, NUMBER=1, PAGES="138-153", YEAR=1987, KEYWORDS="computer conferencing; computer messaging systems", ABSTRACT="This paper discusses the relationships between computer-mediated communications and other forms of communication and describes a particular computer conferencing system in use within IBM. The system described is quite large, with over three thousand contributors and over twenty thousand readers. We discuss the structure of the system, the actions that users can take, and the ways in which the system is being used. Neither the definitions presented nor the system described are intended to be the last, or only, word on the subject; as computer-mediated communications and distribution become more and more important in the business and professional communities, we will need more ways of thinking about communication systems and about information distribution in general.", } @ARTICLE{Lian87:User, AUTHOR="T. C. Liang", TITLE="User Interface Design for Decision Support Systems : A Self-Adaptive Approach", JOURNAL="Information and Management", PUBLISHER="Elsevier Science Publishers BV (North-Holland)", ADDRESS="Department of Accountancy, University of Illinois at Champaign-Urbana, 1206 South 6th Street, Champaign, IL, 61820", VOLUME=12, PAGES="181-193", YEAR=1987, KEYWORDS="user interface design; decision support systems", ABSTRACT="This paper presents a self-adaptive approach to user interface design. The primary philosophy of this design is that the user interface must be aware of the changes in its user's behavior and then adapt to it. Three different default policies are proposed to control the adaption of a user interface: fixed default, dynamic default, and no default. Performance of these policies are compared for various patterns of usage. Mechanisms that determine the optimal default value to reduce the unnecessary effort are also discussed.", } @PHDTHESIS{Wagg87:Explicating, AUTHOR="Michael Douglas Waggoner", TITLE="Explicating Expert Opinion Through A Computer Conferencing Delphi", SCHOOL="The University of Michigan", PAGES=194, YEAR=1987, KEYWORDS="computer conferencing", ABSTRACT="This is a study of the development and implementation of a group decision making system combining a modified Delphi technique and computer conferencing. The study compared the intended and actual behavior of experts who participated in the implementation of this system. The intended behavior was derived from the research literature and from experience dealing with group decision making and computer mediated communication. The actual behavior was derived from systematic observation of the exercise and the post exercise questioning of the participants. The content of the computer conferencing Delphi addressed conditions relating to impacts of technology on K-Adult education as forecasted by a nationally distributed panel of experts. Analyses of the questions guiding the research provide the basis for implications for future practice and directions for further research. Six major findings emerged from this study: (1) The perceived outcome quality is related to the perceived actual effectiveness of the system; (2) There was an inverse relationship between the level of self-ratings by the experts and the experts' satisfaction expressed that the issues were adequately explicated; (3) The clarity with which the process to be followed was communicated was related to the level of satisfaction with the actual effectiveness of the system; (4) The use of pseudonyms as a technique to mask identities of the participants made little difference with regard to the uninhibited expression of their opinion; (5) There does not appear to be a relationship between frequency of participation and these variables: perceived actual effectiveness of the system, or perceived representation of the individual's opinions in the findings of the exercise, or the perceived outcome quality of the exercise; (6) Both elite and non-elite groups found the potential for this system to be greater than was achieved in this particular case. Five areas for future research are discussed: (1) the variables affecting frequency of participation; (2) the use of on line leadership to facilitate the discussion of the group; (3) anonymous conferencing in real time; (4) the use of special purpose groupings of expertise; and (5) the attribution of ideas and their perceived quality.", } @PHDTHESIS{Aste87:Paralanguage, AUTHOR="Janet F. Asteroff", TITLE="Paralanguage in Electronic Mail: A Case Study", SCHOOL="Teachers College, Columbia University", YEAR=1987, KEYWORDS="computer conferencing", ABSTRACT="This study explores the use of paralanguage in electronic mail communication. It examines the use of paralanguage according to the electronic mail and computing experience and technical expertise of 16 library science graduate students who fall into two groups by rank of experience, novice and advanced. These respondents used electronic mail in a non-elective and task-related situation to communicate with their instructor. This case study is based on a multi-level qualitative content analysis of the electronic mail exchanged between the respondents and the instructor, and the attitudes and experiences of the respondents about their use of electronic mail and computers. This research interprets the roles and functions of paralanguage in computer-mediated communication and explores the phenomenon as an indicator of certain kinds of expression. Paralanguage is a component of spoken, written, and electronic communication. It gives to what is being communicated a character over and above that which is necessary to convey meaning in the linguistic or grammatical sense. Paralanguage in electronic mail is positioned between spoken and written paralanguage in its visual and interpretive structures. Electronic paralanguage, a term developed to describe paralanguage in computer-mediated communication, is defined as: features of written language which are used outside of formal grammar and syntax, and other features related to but not part of written language, which through varieties of visual and interpretive contrast provide additional, enhanced, redundant or new meanings to the message. Electronic paralanguage is revealed to be a component of communication which in some situations showed substantial differences by the rank of the respondent, as well as differences in individual behaviors. Novice respondents used more paralanguage in more types of messages than did advanced respondents. Electronic paralanguage also provides a robust picture of the character of communication. The use of exclamation points by novice respondents in task-related messages showed that electronic paralanguage can in certain cases be a general measure of stress and experience, and as well is a precise indicator of different kinds of positive and negative psychological stress.", } @INPROCEEDINGS{Hamm87:Rapidly, AUTHOR="J. L. Hammond and J. D. Spragins", TITLE="Rapidly Reconfiguring Computer Communication Networks---Definition and Major Issues", BOOKTITLE=icc, YEAR=1987, KEYWORDS="routing; reconfiguration", } @INPROCEEDINGS{Garc87:New, AUTHOR="J. J. Garcia-Luna-Aceves", TITLE="A New Minimum-Hop Routing Algorithm", BOOKTITLE=icc, YEAR=1987, KEYWORDS="routing", } @BOOK{Shed87:Regeneration, AUTHOR="G. S. Shedler", TITLE="Regeneration and networks of queues", ISBN="3-540-96425-8", PUBLISHER="Springer-Verlag applied probability series", ADDRESS="Berlin, Germany", PAGES=224, YEAR=1987, REFERENCES=47, } @ARTICLE{Sote87:Multiserver, AUTHOR="W. Sotelo and A. Fikuda", TITLE="On multiserver queue with synchronous Fluctuation of traffic intensity", JOURNAL="Transactions of the IEICE", VOLUME=70, NUMBER=10, PAGES="951-959", YEAR=1987, REFERENCES=10, KEYWORDS="M/m/s; m/m/1", } @ARTICLE{Steh87:Messungen, AUTHOR="J. Stehr and J. Suppan-Borowka", TITLE="Messungen von {TCP/IP-Implementierungen}", JOURNAL=datacom, VOLUME=9, PAGES="166-171", YEAR=1987, REFERENCES=13, KEYWORDS="TCP/IP; measurement; lan; file transfer", } @ARTICLE{Suri87:Infinitesimal, AUTHOR="R. Suri", TITLE="Infinitesimal perturbation analysis for general discrete event systems", JOURNAL=jacm, VOLUME=34, PAGES="686-717", YEAR=1987, REFERENCES=50, KEYWORDS="Performance evaluation; simulation; stochastic analysis", } @ARTICLE{Thal87:Procedural, AUTHOR="N. Magenat-Thalmann and D. Thalmann", TITLE="Procedural animation blocks in discrete simulation", JOURNAL="Simulation", PAGES="102-108", YEAR=1987, REFERENCES=17, KEYWORDS="Computer animation; discrete event simulation; procedural", } @INPROCEEDINGS{Tsut87:Maximum, AUTHOR="E. Tsutsui and H. Fukuda and S. Nojima and M. Hashimoto", TITLE="Evaluation of the maximum packet delay of a high speed packet switch", BOOKTITLE=globecom, PAGES="1876-1880", YEAR=1987, REFERENCES=7, KEYWORDS="ATM; Fast packet switching; bus; matrix; Packet delay", } @ARTICLE{Tsuz87:Configuration, AUTHOR="K. Tsuzuki and Y. Yoshida and T. Ishizuka and M. Anezaki", TITLE="The Configuration of the High Speed Packet Switching System", JOURNAL="Local Communication Systems: LAN and PBX", PAGES="313-327", YEAR=1987, KEYWORDS="ATM", } @INPROCEEDINGS{Vauc87:Process, AUTHOR="J. G. Vaucher and G. Lapalme", TITLE="Process-oriented simulation in {PROLOG}", BOOKTITLE="Conference on Simulation and AI", VOLUME=18, PAGES="41-46", YEAR=1987, REFERENCES=19, KEYWORDS="simulation; PROLOG", } @ARTICLE{Yala87:Characterization, AUTHOR="S. Yalamanchili and J. K. Aggarwal", TITLE="A Characterization and Analysis of Parallel Processor Interconnection Networks", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=6, PAGES="680-691", YEAR=1987, REFERENCES=20, KEYWORDS="Interconnection Network", } @INPROCEEDINGS{Zafi87:Analytical, AUTHOR="M. Zafirovic-Vukotic and I. G. Niemegeers", TITLE="Analytical models of the slotted ring protocols in {HSLANs}", BOOKTITLE="IFIP WG 6.4 Workshop: High Speed Local Area Networks", ADDRESS="Aachen, Germany", YEAR=1987, REFERENCES=19, KEYWORDS="HSLAN; LAN; Slotted ring; Analysis", } @ARTICLE{Zhao87:Partial, AUTHOR="Y. Zhao and E. Gambe", TITLE="Analysis on Partial Overflow Queueing Sysrems with Two Kinds of Call", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=9, PAGES="942-949", YEAR=1987, REFERENCES=12, KEYWORDS="Queueing system; overflow", ANNOTE="In this paper, the traffic model of one kind of the partial overflow system is presented and theoretically analyzed, which has remained unsolved up to today. In the partial overflow systems, the considered overflow traffic stream is a part of the traffic stream overflowing from a common trunks of group with multiinput calls. The systems with two kinds of calls are treated. Both of the two input traffic streams are assumed to follow the Poisson", } @ARTICLE{Zuke87:Queuing, AUTHOR="Moshe Zukerman and I. Rubin", TITLE="Queuing performance of a multi-channel system under bursty traffic conditions and state dependent service rates", JOURNAL=atr, VOLUME=21, NUMBER=2, PAGES="3-16", YEAR=1987, REFERENCES=16, KEYWORDS="Queueing system; multiserver; instationary arrival; state", } @MISC{Balb87:Switching, AUTHOR="G. P. Balboni and G. Giandonato and R. Melen and V. Vercellone", TITLE="Switching element for self-routing multistage packet-switching interconnection networks", ADDRESS="Torino, Italy", PAGES=22, NOTE="European Patent Application 87116945.4", YEAR=1987, KEYWORDS="Packet switching; multistage interconnection network; self", ANNOTE="The switching element for self-routing multistage packet-switching interconnection networks comprises: an input unit, composed of as many sections as the elements input are, each section comprising a FIFO memory for packet buffering, a switch associated with a control unit which, for each packet to be forwarded, sets up the connection requested for that packet between one input andone or more outputs of the element", } @ARTICLE{Bigl87:Bounds, AUTHOR="E. Biglieri and G. Taricco", TITLE="Bounds on the Distribution of a Random Variable whose First Moments are Known", JOURNAL=aeu, VOLUME=41, NUMBER=6, PAGES="330-336", YEAR=1987, REFERENCES=14, KEYWORDS="RV; random Variable; digital communication; distribution", ANNOTE="Several problems in performance evaluation of digital communication systems can be reduced to the computation of the probability that a random variable $X$ takes values in a given interval. In this paper, moment space techniques are used to evaluate sharp upper and lower bounds to the cumulative distribution function of a random variable when only a finite number of its moments is known.", } @ARTICLE{Brad87:Multireject, AUTHOR="Paul T. Brady", TITLE="Performance evaluation of multireject, selective reject, and other protocol enhancements", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=6, PAGES="659-666", YEAR=1987, REFERENCES=15, KEYWORDS="protocol; LAPB; LAPD; X.25", ANNOTE="This study compares the effects on performance of four features of the LAPB and LAPD protocols: multireject, selective reject, the null information frame (NIF) and multiple service access points (SAP's). Results indicate that the current standard LAPB/D protocol with multireject is the preferred protocol.", } @ARTICLE{Daig87:Message, AUTHOR="J. N. Daigle", TITLE="Message Delays with Prioritized {HOLP} and Round-Robin Packet Servicing", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=6, PAGES="609-619", YEAR=1987, REFERENCES=16, KEYWORDS="Packet switching; round robin; HOL priority", ANNOTE="Three disciplines for prioritized transmission of messages in packet switching systems are considered: head-of-the-line (HOL), HOL with message preemption, and prioritized round robin (RR). Preemption of packet transmission is not allowed in any of the disciplines, and the service disciplines of different classes need not be the same.", } @INPROCEEDINGS{Grav87:Behavior, AUTHOR="A. Gravey and Jean Raymond Louvion and P. Boyer", TITLE="Behavior of a discrete-time single server queue with geometric input and fixed service time", BOOKTITLE="3rd International Conference on Data Communication Systems and Their Performance", ADDRESS="Rio de Janeiro, Brazil", PAGES="1-15", YEAR=1987, REFERENCES=15, KEYWORDS="Analysis; discrete time queue; single server; steady state", ANNOTE="We study analytically the behavior of a discrete-time single server queue with fixed service time and a Bernoulli arrival process. The waiting room can be either finite or infinite. We derive the steady-state distributions for the number of customers in sytem and for the unfinished work either at a randomly chosen moment of time or at customer's arrival. We then apply these resultsto find out the overflow probability of an output buffer", } @ARTICLE{Hart87:Response, AUTHOR="P. K. Harter", TITLE="Response Times in Level-Structured Systems", JOURNAL=tocs, VOLUME=5, NUMBER=3, PAGES="232-248", YEAR=1987, REFERENCES=6, KEYWORDS="Analysis; response time; real time", ANNOTE="A method is presented for deriving response-time properties in complex systems with a level structure based on priority. The method involves a level-by-level examination of the system, in which information distilled from each successive level is used to adjust the results for later levels. The results obtained at each level of the system are not affected by later analyses, which obviates having to consider a complex system as a whole.", } @INPROCEEDINGS{Hiro87:Output, AUTHOR="S. Hiroshi", TITLE="The Output Of Loss Systems", BOOKTITLE="Seminar on Queueing Theory and Its Application", ADDRESS="Kyoto, Japan", PAGES="259-283", YEAR=1987, REFERENCES=16, KEYWORDS="output process; loss system; GI/M/S/N; signalling; network", } @ARTICLE{Jajs87:One, AUTHOR="A. Jajszczyk", TITLE="One-Sided Switching Networks Composed of Digital Switching Matrices", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=12, PAGES="1383-1384", YEAR=1987, REFERENCES=10, KEYWORDS="Switching network; nonblocking; rearrangement", ANNOTE="One-sided switching networks composed of uniform digital switching matrices are considered. Such matrices mix in the same integrated circuit or in the same printed circuit board time and space switching. The conditions under which one-sided networks are nonblocking and rearrangeable are discussed.", } @ARTICLE{Kawa87:Prototype, AUTHOR="N. Kawashima and Y. Hirakawa", TITLE="A Prototype Switching System Employing a Matching-Based Language", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=6, PAGES="653-658", YEAR=1987, REFERENCES=11, KEYWORDS="Switching system; performance evaluation; architecture", ANNOTE="This paper describes an experimental switching system employing a nonprocedural language. It presents a study of the appropriate architecture for implementing the language, and examines the system's performance characteristics. Furthermore, it identifies the critical part of the architecture, and provides two strategies for throughput improvement and indicates their effects.", } @ARTICLE{Lim87:Theory, AUTHOR="Jae Lim and S. M. Meerkov", TITLE="Theory of Markovian Access to Collision Channels", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=12, PAGES="1278-1288", YEAR=1987, REFERENCES=34, KEYWORDS="Markov; ALOHA; finite queue; approximation; protocol", ANNOTE="In this paper, a unified, analytical framework for analysis of Markovian access control protocols in collision channels with a finite number of buffered users is presented. The theory developed is based on: 1) an appropriate state-space modeling of a network, 2) the averaging theory for the slow-in-the-average Markov walks used for the local analysis, and 3) an asymptotic large deviations theory used for the global analysis.", } @INPROCEEDINGS{Mach87:Extended, AUTHOR="F. Machihara", TITLE="An Extended Equivalent Random Method for Engineering Networks with Heterogenous Inputs", BOOKTITLE="IFORS Conference", ADDRESS="Buenos-Aires, Argentina", PAGES=16, YEAR=1987, REFERENCES=7, KEYWORDS="Network planning; heterogeneous input; INS; Information", } @ARTICLE{Mach87:First, AUTHOR="F. Machihara", TITLE="First Passage Times of {PH/PH/1/K} and {PH/PH/1} Queues", JOURNAL=jorsj, VOLUME=30, PAGES=26, YEAR=1987, REFERENCES=11, KEYWORDS="Passage time; ph/ph/1/n; ph/ph/1", } @ARTICLE{Nels87:Stochastic, AUTHOR="R. T. Nelson", TITLE="Stochastic Catastrophe Theory in Computer Performance Modeling", JOURNAL=jacm, VOLUME=34, NUMBER=3, PAGES="661-685", YEAR=1987, REFERENCES=22, KEYWORDS="Computer system; performance evaluation; model; stochastic", ANNOTE="In this paper catastrophic behavior found in computer systems isinvestigated. Deterministic Catastrophe theory is introduced first. Then it is shown how the theory can be applied in a stochastic framework, which is useful for understanding computer system performance models. Computer system models that exhibit stochastic cusp catastrophe behavior are then analyzed. These models include slotted ALOHA, multiprogramming and buffer flow control.", } @ARTICLE{Tayl87:Residue, AUTHOR="F. J. Taylor", TITLE="A Residue Arithmetic Implementation Of The {FFT}", JOURNAL=jpdc, VOLUME=4, PAGES="191-208", YEAR=1987, REFERENCES=21, KEYWORDS="FFT; Fast Fourier Transform; RNS; residue Number System", } @ARTICLE{Todd87:Access, AUTHOR="T. D. Todd", TITLE="An Access Control Protocol Using Instantaneous Bandwidth Reconfiguration", JOURNAL=cnis, VOLUME=12, PAGES="99-106", YEAR=1987, REFERENCES=12, KEYWORDS="Computer network; LAN; access protocol; access control", ANNOTE="A random access protocol is presented for multiaccess broadcast bus systems. This protocol has the capability to reconfigure the available bandwidth instantaneously. As a result, the protocol achieves better delay throughput characteristics than the best available static or presented indicating the relative performance of the proposed protocol.", } @ARTICLE{Trop87:Priorities, AUTHOR="C. Tropper", TITLE="Priorities and Performance in Packet-Switching Networks", JOURNAL=cnis, VOLUME=12, PAGES="89-98", YEAR=1987, REFERENCES=18, KEYWORDS="Priority; routing algorithm; packet switching; performance", ANNOTE="In this paper the use of priorities in a packet-switching network is examined to speed the return of acknowledgements and to effect a grad of service routing policy. An objective of a grade of service routing policy is to incure that shorter, interachtive packets are not delayed by longer messages. New priority-queueing algorithms ofr use with heuristic mean-value analysis has been developed.", } @ARTICLE{Yum87:Packet, AUTHOR="T. S. Yum and M. Schwartz", TITLE="Packet-Switched Performance with Different Circuit-Switched Routing Procedures in Nonhierarchical Integrated Circuit-Switched and Packet-Switched Networks", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=3, PAGES="362-366", YEAR=1987, REFERENCES=14, KEYWORDS="Packet switching; circuit switching; routing algorithm", ANNOTE="It is shown in [13] that different types of routing procedures for circuit-switched traffic in a nonhierarchical network exhibit various performance tradeoffs. In this paper, the average time delay of the packet-switched traffic is examined assuming that the network uses a movable boundary scheme to allocate bandwidth dynamically.", } @ARTICLE{Apos87:New, AUTHOR="T. Apostolopoulos and E. Sykas and E. Orotonotarios", TITLE="Analysis of a New Retransmission Control Algorithm for Slotted {CSMA/CD} {LAN's}", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=6, PAGES="692-701", YEAR=1987, KEYWORDS="Ieee 802.3; Lan; csma/cd", ANNOTE="Algorithms for the control of the retransmission procedure in random multiple access schemes are needed to ensure stability of the system operation under high traffic conditions. Optimal retransmission control policies cannot be applied in practice since they are based on global information about the systm state. In the case of the most well-known implementation of the CSMA/CD protocol, ANSI/IEEE Std 802.3-1985, a heuristic approach, .", } @ARTICLE{Ashf87:Static, AUTHOR="E. Lee and D. Messerschmitt", TITLE="Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=1, PAGES="24-35", YEAR=1987, KEYWORDS="Digital signal processing; multiprocessing; Petri net", ANNOTE="Large grain data flow programming is natural and convenient for describing digital signal processing systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of programmer convenience. This is particulary true when the target machine is a programmable DSP chip.", } @ARTICLE{Baba87:Functionally, AUTHOR="T. Baba and S. Yao and A. Hevner", TITLE="Design of a Functionally Distributed, Multiprocessor Database Machine Using Data Flow Analysis", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=6, PAGES="650-665", YEAR=1987, KEYWORDS="Data flow machine; multiprocessor system; architecture", ANNOTE="We propose a design methodology based on data flow analysis for a functionally distributed, multiprocessor database machine. We define a cost model of database processing with the objective cost being response time of a set of query strategies. Heuristic optimization techniques are proposed using the operations of ``grouping'', ``decomposition'', and ``replication''. We apply the new optimization techniques in several realistic multiprocessor environments.", } @ARTICLE{Bian87:Interprocessor, AUTHOR="R. Bianchini and Jun Shen", TITLE="Interprocessor Traffic Scheduling Algorithm for Multiple - Processor Networks", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=4, PAGES="396-409", YEAR=1987, KEYWORDS="Scheduling; multiprocessor system; network; optimization", ANNOTE="Recent research on parallel systems has shown that the most difficult problem for system disigners and users is interprocessor connection and communication. A methodology for the automated design and implementation of interprocessor communication for certain multiple-processor systems has been developed and is presented in this paper.", } @ARTICLE{Chla87:Distributed, AUTHOR="I. Chlamtac and S. Pinter", TITLE="Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=6, PAGES="728-737", YEAR=1987, KEYWORDS="Packet radio; multihop", ANNOTE="This paper proposes a solution to providing a collision network. An efficient solution to this problem provides spatial reuse of the band width whenever possible. A robust solution maintains the collision free property of the The node organization algorithm presented in this paper provides a completely distributed, maximally localize", } @ARTICLE{Fiol87:Discrete, AUTHOR="M. Fiol and J. Yebra and I. Alegre and M. Valero", TITLE="A Discrete Optimization Problem in Local Networks and Data Alignment", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=6, PAGES="702-713", YEAR=1987, KEYWORDS="LAN; optimization", ANNOTE="This paper presents the solutions of the following optimization problem that appears in the design of double-loop structures for local networks and also in data Consider the digraph on $N$ vertices, labeled from $0$ to $N-1$, where every vertex $i$ is adjacent to the vertices $(i+a) \bmod N$ and $(i+b) \bmod N$.", } @ARTICLE{Gold87:Scheduling, AUTHOR="Y. Gold and William R. Franta", TITLE="A Scheduling-Function-Based Distributed Access Protocol that Uses {CDM} to Relay Control Information in a Network with Hidden Nodes", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=5, PAGES="562-569", YEAR=1987, KEYWORDS="Packet radio; CDMA; code division multiple access; protocol", ANNOTE={We introduce a method for broadcasting control information in stationary networks with "hidden" nodes. Control information is transmitted as short bitparallel control messages on a separate control channel whose capacity is shared among the bits of a control message using code division multiplexing. The CDM method takes advantage of spread-spektrum signal properties that allow, in particular, high accuracy of time-of-arrival measurement.}, } @ARTICLE{King87:Modeling, AUTHOR="P. King and I. Mitrani", TITLE="Modeling a Slotted Ring Local Area Network", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=5, PAGES="554-561", YEAR=1987, KEYWORDS="LAN; cambridge ring; approximation; performance", ANNOTE="Models for local area networks of the slottet ring style of architecture are developed. The bardware protocol is modeled using a BCMP network. The Basic Block protocol of the Cambridge ring is modeled using an approximate solution method of the fixed-point type. A limited comparison between the Cambridge Ring and ano ther ring architecture, the token ring, is carried out.", } @ARTICLE{Sezn87:New, AUTHOR="A. Seznec", TITLE="A New Interconnection Network for {SIMD} Computers: The Sigma Network", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=7, PAGES="794-801", YEAR=1987, KEYWORDS="Interconnection network; SIMD; Omega network", ANNOTE="When processing vectors on SIMD computers, some data manipulations have to be performed by an interconnection network. When thisnetwork lacks an efficient routing control, it becomes the bottleneck for performance. It has been pointed out that general algorithms to control rearrangeable networks for arbitrary permutations are time consuming. To overcome this difficulty, Lenfant proposed a set of permutations covering standard needs associated", } @BOOK{Slom87:Verteilte, AUTHOR="M. Sloman and J. Kramer", TITLE="Verteilte Systeme und Rechnernetze", PUBLISHER="Prentice-Hall International (UK) Ltd. -- Carl Hanser", ADDRESS="München, Germany", YEAR=1987, LANGUAGE="German", KEYWORDS="Computer network; WAN; LAN", ANNOTE="Verteilte Systeme; Die Architektur verteilter Systeme; Softwarekomponenten und ihre Verbindungen untereinader; Kommunikationsprimitive und verwandte Softwarefragen; Kommunikationssysteme; Bitübertragungsschicht; Lokale Netze", } @ARTICLE{Amma87:Optimality, AUTHOR="Mahmoud Ammar and J. W. Wong", TITLE="On the Optimality of Cyclic Transmission in Teletext Systems", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=1, PAGES="68-73", YEAR=1987, KEYWORDS="Teletex; transmission; Markov process; optimization", ANNOTE="Teletext is a one-way information delivery system where pages ofinformation are broadcast to all users in a continuous manner. System respons time is an important consideration in the design of teletext systems. One factor contributing to response time isthe order in which pages are transmitted. In this paper, we formulate the problem of determining the sequence of page transmissions as a Markovian decision process.", } @ARTICLE{Andr87:Transmission, AUTHOR="D. Andrew", TITLE="A Transmission Scheme for integrated Services on Broad-Band Internal Private Business Networks", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=3, PAGES="328-335", YEAR=1987, KEYWORDS="BISDN; STM; transmission; private network", ANNOTE="Internal business networks are expected to present an economic area of application for broad-band communications. A star netwo rk with switches optimized for various services is envisaged. Anasynchronous switch for video in square wave frequency modulati on format can provide a practical solution for full bandwidth switched video services. A transmission scheme is described which combines a SWFM video service together with synchronous PCM data", } @ARTICLE{Bell87:Point, AUTHOR="Paul R. Bell and K. Jabbour", TITLE="Evaluation of Point-to-Point Network Routing Algorithms", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=4, PAGES="470-472", YEAR=1987, KEYWORDS="Packet switching; routing algorithm; communication network", ANNOTE="A sampling of routing algorithms is evaluated through simulation. The algorithms selected are random walk, fixed directory, split traffic, isolated shortest queue and backward learning. Backwardlearning exhibited the most desirable characteristics, approaching fixed directory routing in delay and path and path length, while adapting to link failures.", } @ARTICLE{Boor87:Throughput, AUTHOR="R. R. Boorstyn and A. Kershenbaum and B. Maglaris and V. Sahin", TITLE="Throughput Analysis in Multihop {CSMA} Packet Radio Networks", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=3, PAGES="267-274", YEAR=1987, KEYWORDS="CSMA; carrier sense multiple access; packet radio", ANNOTE="In this paper, we use a Markov model to develop a product form solution to efficiently analyze the throughput of arbitrary topology multihop packet radio networks that employ a carrier sensi ng multiple access protocol with perfect capture. We consider both exponential and nonexponential packet length distributions. Our method preserves the dependence between nodes, characterist ic of CSMA, and determines the joint probability that nodes tr.", } @ARTICLE{Cici87:Performability, AUTHOR="B. Ciciani and Vincenzo Grassi", TITLE="Performability Evaluation of Fault-Tolerant Satellite Systems", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=4, PAGES="403-409", YEAR=1987, KEYWORDS="Satellite communication; performability; performance", ANNOTE="A combined performance and reliability measure for gracefully degradable fault-tolerant satellite systems is introduced, and a closed-form analytic solution is provided in order to compute the performability for a class of unrepairable systems. An efficient algorithm for the solution of Markovian models which take into account the degradation of more than one type system components is given.", } @ARTICLE{Cook87:Modeling, AUTHOR="Claire Kehrwald Cook", TITLE="Modeling Interference Effects for Land-Mobile and Air-Mobile Communications", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=2, PAGES="151-165", YEAR=1987, KEYWORDS="Mobile radio; performance evaluation; propagation delay", ANNOTE="Analytic and computer models are presented that can provide an assessment of land-mobile and air-mobile communications performance in interference environments. The results optained with the se models, based on a communications region of operability criterion, include the effects of greater-than-free-space propagationpath losses associated with low-elevation signal paths. The analytic models are used to examine the effects of higher.", } @ARTICLE{Dava87:Channel, AUTHOR="F. Davarian", TITLE="Channel simulation to faciliate mobile-satellite communications research", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=1, PAGES="47-56", YEAR=1987, KEYWORDS="Satellite communication; mobile radio; simulation", ANNOTE="In designing a mobile satellite network, engineers and technologists are facet with wide-ranging issues for which there is no prior database. System engineers must address such issues as adequate margin to combat multipath fading, the level of adjacent channel protection required to allow transmission in narrow-band channels, the cochannel protection required to allow for frequency reuse in a multiple beam system, and the level of intermodula", } @ARTICLE{Ephr87:Delay, AUTHOR="Anthony Ephremides", TITLE="Delay Analysis of Interacting Queues with an Approximate Model", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=2, PAGES="194-201", YEAR=1987, KEYWORDS="Slotted ALOHA; approximation; delay analysis; throughput", ANNOTE="An approximate model of coupled Markov chains is proposed and analyzed for a slotted ALOHA system with a finite number of buffered nodes. This model differs from earlier ones in th at it attempts to capture the interdependence between the nodes. The analytical results lead to a set of equations that, when solved numerically, yield the average packet delay. Comparison between computational and simulation results for a small number.", } @ARTICLE{Mera87:Interconnection, AUTHOR="L. Merakos and G. Exley and C. Bisdikian", TITLE="Interconnection of {CSMA} Local Area Networks: The Frequency Division Approach", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=7, PAGES="730-738", YEAR=1987, KEYWORDS="LAN; CSMA; carrier sense multiple access; bridge", ANNOTE="This paper considers the interconnection of two local area networks, each of which connects a large population of users via a carrier-sense multiple-access channel. In each network a bridge node receives internetwork packets from the local users and forwards them to the bridge node of the other network via a point-to -point link; the bridge node of the destination network queues these internetwork packets for subsequent broadcasting.", } @ARTICLE{Poly87:Finite, AUTHOR="George C. Polyzos and Mart L. Molle and A. N. Venetsanopoulos", TITLE="Performance Analysis of Finite Nonhomogeneous Population Tree Conflict Resolution Algorithms Using Constant Size Window Access", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=11, PAGES="1124-1137", YEAR=1987, KEYWORDS="Packet switching; flow control; window mechanism; delay", ANNOTE="Multiple-access protocols control access to a broadcast communication channel. Tree conflict resolution algorithms are the heartof some distributed multiple-access protocols with nice properties like stability, high capacity, and low delay under light load. We consider a random access protocol based on a tree conflict resolution algorithm similar to one first proposed by Capetanakis, but in which constant size windows on the arrival time axis.", } @ARTICLE{Rayc87:Stability, AUTHOR="D. Raychaudhuri", TITLE="Stability, Throughput, and Delay of Asynchronous Selective Reject {ALOHA}", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=7, PAGES="767-772", YEAR=1987, KEYWORDS="ALOHA; stability; delay analysis; throughput analysis", ANNOTE="An analytical performance evaluation model is presented for selective reject ALOHA, a recently proposed high-capacity protocol for unslotted channels with high propagation delay. SREJALOHA approaches the theoretical asynchronous multiaccess throughput limit of 0.368 for fixed or variable length message traffic, usingsubpacketization of messages in conjuction with a selective reject retransmission policy.", } @ARTICLE{Sidi87:Tandem, AUTHOR="M. Sidi", TITLE="Tandem Packet-Radio Queueing Systems", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=2, PAGES="246-248", YEAR=1987, KEYWORDS="Packet radio; communication network; tandem queue", ANNOTE="Tandem packet-radio systems are considered. The nodes of the tandem have infinite buffers, they share a common radio channel fortransmission of data packets and each node transmits whenever ithas a packet ready for transmission. An approximate analysis is developed for an arbitrary tandem. The approximation uses the exact results optained for a four-node tandem and is based on exploiting the special features of tandem systems.", } @ARTICLE{Wood87:Engineering, AUTHOR="C. M. Woodside and E. Ho", TITLE="Engineering Calculation of Overflow Probabilities in Buffers with Markov-Interrupted Service", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=12, PAGES="1272-1277", YEAR=1987, KEYWORDS="Radio channel; M/G/1; blocking; overflow", ANNOTE="Interrupted service, which may occur in fading radio channels, in low-priority channels which can be preempted or in systems with failures may make severe demands on buffer size if overflow is to be avoided. This paper analyzes a buffer with a Markov-interruptedt timeslotted server, generalizing earlier work on independent random interruptions. An equivalent service distribution is defined for use in an approximate M/G/1 model.", } @INPROCEEDINGS{Ahoo87:Comparing, AUTHOR="R. Ahooja", TITLE="Comparing Normal Forms Obtained from {ESTELLE} and {LOTOS} Specifications", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="373-384", YEAR=1987, REFERENCES=14, KEYWORDS="ESTELLE; LOTOS; protocol specification; protocol testing", ANNOTE="A method is developed to symbolically execute LOTOS specifications. The analysis leads to the detection of various errors and omissions in LOTOS protocol specifications and has the potential to be used in protocol testing, modeling and implementation of LOTOS specifications.", } @INPROCEEDINGS{Ansa87:Software, AUTHOR="P. Ansart and Khaled Amer and Suresh Chari and Lenotre and Lumbroso", TITLE="Software Tools for {ESTELLE}", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="55-61", YEAR=1987, REFERENCES=9, KEYWORDS="ESTELLE; protocol specification; software; tool; protocol", ANNOTE="The purpose of the paper is to present a few specially designed software tools for building and debugging protocol specifications in Estelle. The general idea is to process automatically a protocol specification and ensure it is in accordance with the definition of Estelle and that it is correct with respect to the protocol description.", } @ARTICLE{Bolo87:ISO, AUTHOR="T. Bolognesi and Ed Brinksma", TITLE="Introduction to the {ISO} Specification Language {LOTOS}", JOURNAL=cnis, PUBLISHER="North Holland", VOLUME=14, PAGES="25-59", YEAR=1987, REFERENCES=47, KEYWORDS="Specification language; OSI; LOTOS; concurrency", ANNOTE="The article gives an informally introduction into the specification language LOTOS, it explains the basic LOTOS, equivalences, data types, value expressions, and a small but complete LOTOS specification.", } @INPROCEEDINGS{Bour87:Petri, AUTHOR="A. Bourguet", TITLE="A Petri Net Tool for Service Validation in Protocol", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="281-292", YEAR=1987, REFERENCES=16, KEYWORDS="Protocol verification; token ring; PROLOG", ANNOTE="The paper presents a tool for validating protocols using Petri nets. The main interest of the presented method is that it can be applied to complex service specifications, it proves that a protocol works correctly or otherwise detects and automatically exhibits anomalies in its behavior. Then the implementation is developed.", } @INPROCEEDINGS{Bria87:Executing, AUTHOR="J. P. Briand and M. C. Fehri and L. Logrippo and A. Obaid", TITLE="Executing {LOTOS} Specifications", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="73-84", YEAR=1987, REFERENCES=21, KEYWORDS="LOTOS; interpreter; specification; implementation", ANNOTE="The paper gives an account of a prototype LOTOS interpreter. After a brief outline of the implementation method of the interpreter, we focus on its utilization, based on a sample specification.", } @INPROCEEDINGS{Brin87:LOTOS, AUTHOR="Ed Brinksma and G. Scollo and C. Steenbergen", TITLE="{LOTOS} Specifications, their Implementations and their Tests", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="349-360", YEAR=1987, REFERENCES=18, KEYWORDS="LOTOS; implementation; specification; validation; testing", ANNOTE="The notation of implementation is analyzed in the context of formal specification of processes. Some analysis is carried out for LOTOS processes. The characterizations proposed lead to an integrated perspective on the validation and testing procedures for formal specifications and provide a theoretical basis for the development of validation and testing methodologies.", } @ARTICLE{Brui87:Integration, AUTHOR="J. Bruijning and SPECS Consortium", TITLE="Evaluation and Integration of Specification Languages", JOURNAL=cnis, VOLUME=13, PAGES="75-89", YEAR=1987, REFERENCES=7, KEYWORDS="SDL; LOTOS; ESTELLE; specification language; comparison", ANNOTE="In the first part of this paper, the results from a comparison evaluation of the specification languages SDL, LOTOS and Estelle are presented. In the second part, the proposed SPECS architecture and its rationale are described.", } @INPROCEEDINGS{Fase87:Image, AUTHOR="B. Fasel and F. Vossebuerger and D. Meyer-Ebrecht", TITLE="Image-Network for {PACS}", BOOKTITLE="CAR", ADDRESS="Berlin, Germany", YEAR=1987, REFERENCES=8, KEYWORDS="LAN; image transfer; distributed system; collision free", ANNOTE="The paper introduces a novel network approach which is based on a PACS-wide separation of image data vs. non-image data. A new type of LAN has been created for the image layer which will be ass-on to conventional LANs rather than a replacement.", } @INPROCEEDINGS{Favr87:Automatic, AUTHOR="J. P. Favreau and Jr. Linn", TITLE="Automatic Generation of Test Scenario Skeletons from Protocol Specifications written in {ESTELLE}", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="191-202", YEAR=1987, REFERENCES=21, KEYWORDS="ESTELLE; protocol testing; communication protocol; data", ANNOTE="The paper focusses on methods for generating test sequences for communication protocols and describes a model and method for partially automated generation of test skeletons for protocols written in Estelle.", } @INPROCEEDINGS{Gotz87:Specifying, AUTHOR="R. Gotzhein", TITLE="Specifying Abstract Data Types with {LOTOS}", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="15-26", YEAR=1987, REFERENCES=10, KEYWORDS="LOTOS; protocol specification; OSI; abstract data type", ANNOTE="The usefulness of LOTOS for the formal description of abstract data types (ADTs) is demonstrated and discussed. Several versions of the ADT stack are presented. Discussion focusses on sychronization aspects and architectural concepts.", } @TECHREPORT{Klei87:Leistungsanalyse, AUTHOR="H. Kleines", TITLE="Leistungsanalyse eines {ISO-Transportprotokoll-Profils} am Beispiel der {iNA} 960", INSTITUTION="Lehrstuhl für Informatik IV der RWTH Aachen", ADDRESS="Aachen, Germany", PAGES="142-156", YEAR=1987, LANGUAGE="German", REFERENCES=73, KEYWORDS="ISO protocol; performance evaluation; transport layer; throughput; measurement", ANNOTE="The author uses an analytical model to evaluate his performance measurements on iNA 960 in some examples.", } @ARTICLE{Koss87:Graphic, AUTHOR="H. Kossmann", TITLE="A Graphic {SDL} Support Environment", JOURNAL=cnis, VOLUME=13, PAGES="91-96", YEAR=1987, REFERENCES=6, KEYWORDS="SDL; tool; graphics; application", ANNOTE="The paper describes the experiences gained at Siemens AG from large scale applications of a first version of an SDL tool on a graphic workstation as well as the development of an integrated set of tools supporting SDL.", } @ARTICLE{Li87:Multiple, AUTHOR="V. Li", TITLE="Performance Evaluation of Multiple-Access Networks: Introduction and Issue Overview", JOURNAL=ieeejsac, VOLUME=5, NUMBER=6, PAGES="933-937", YEAR=1987, REFERENCES=18, KEYWORDS="Performance evaluation; survey; modeling; satellite; LAN", ANNOTE="This issue of J-SAC collects a set of papers which illustrate various techniques used to model multiple access networks. Multiple-access schemes, satellite networks, LANs and packet radio networks are described.", } @ARTICLE{Liu87:CSMA, AUTHOR="Y. Liu and G. L. Wise", TITLE="Performance of a {CSMA/CD} Protocol for Local Area Networks", JOURNAL=ieeejsac, VOLUME=5, NUMBER=6, PAGES="948-955", YEAR=1987, REFERENCES=5, KEYWORDS="Performance evaluation; CSMA/CD; access protocol; LAN", ANNOTE="The paper presents a performance analysis of a CSMA/CD protocol designed to resolve collisions in a LAN. Expressing for the average time required to resolve a collision involving $k$ stations and the average time for a particular station. The above analysis is independent of packet arrival distribution.", } @INPROCEEDINGS{Llor87:Incremental, AUTHOR="J. C. Lloret and P. Azema", TITLE="Incremental Verification of the Token Ring Protocol", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="293-304", YEAR=1987, REFERENCES=4, KEYWORDS="Token ring; protocol verification", ANNOTE="The paper presents an experiment on verification of token ring protocol. This approach is based upon Predicate Net. A specific Prolog environment has been developed. The main contribution concerns a stepwise verification method, whose principles should be applied to any OSI specification.", } @INPROCEEDINGS{Meer87:Derivation, AUTHOR="J. de Meer", TITLE="Derivation and Validation of Test Scenarios based on the Formal Specification Language {LOTOS}", BOOKTITLE="Protocol Specification Testing and Verification VI", ORGANIZATION="IFIP", PAGES="203-216", YEAR=1987, REFERENCES=10, KEYWORDS="LOTOS; testing; validation", ANNOTE="The article gives a short introduction to LOTOS, then it shows how test scenarios can be derivated and validated.", } @ARTICLE{Moll87:Space, AUTHOR="Mart L. Molle and K. Sohraby and A. N. Venetsanopoulos", TITLE="Space-Time Models of Asynchronous {CSMA} Protocols for Local Area Networks", JOURNAL=ieeejsac, VOLUME=5, NUMBER=6, PAGES="956-968", YEAR=1987, REFERENCES=8, KEYWORDS="LAN; access protocol; CSMA; carrier sense multiple access", ANNOTE="The article highlights the key properties included by the introduced model with exact timings of events, including the notion of an embedded Markovian sequence of idle points. The results are presented for the case of a 1-dimensional LAN, that show that previous models of bus LANs can significantly underestimate their performance.", } @BOOK{Blac87:Computer, AUTHOR="U. Black", TITLE="Computer networks: protocols, standards, interfaces", PUBLISHER="Prentice-Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1987, } @BOOK{Knig87:Standards, AUTHOR="K. G. Knightson and T. Knowles and J Larmouth", TITLE="Standards for open systems interconnection", PUBLISHER="McGraw-Hill", ADDRESS="New York, New York", YEAR=1987, } @BOOK{Mill87:Digital, AUTHOR="M. J. Miller and Syed Ahamed", TITLE="Digital transmission systems and networks. Vol {I:} principles", PUBLISHER="Computer Science Press", ADDRESS="Rockville, Maryland", YEAR=1987, } @BOOK{Kumm87:Advances, AUTHOR="K. Kummerle and J. O. Limb and F. A. Tobagi", TITLE="Advances in Local Area Networks", PUBLISHER="IEEE Press", ADDRESS="New York, New York", YEAR=1987, } @BOOK{Bodl87:Distributed, AUTHOR="H. L. Bodlaender", TITLE="Distributed Computing: Structure and Complexity", PUBLISHER="Centrum voor Wiskunde en Informatica", ADDRESS="Amsterdam, The Netherlands", YEAR=1987, } @MISC{Know87:Standards, AUTHOR="T. Knowles and J Larmouth and K. G. Knightson", TITLE="Standards for Open Systems Interconnection", PUBLISHER="BSP Professional Books", YEAR=1987, } @BOOK{Silv87:Data, AUTHOR="Gerald A. Silver and Myrna Silver", TITLE="Data communications for business", PUBLISHER="Boyd and Fraser", ADDRESS="San Francisco, California", PAGES=411, YEAR=1987, } @BOOK{Schw87:Telecommunications, AUTHOR="M. Schwartz", TITLE="Telecommunications Networks: Protocols, Modeling and Analysis", PUBLISHER="Addison-Wesley", ADDRESS="Reading, Massachusetts", YEAR=1987, } @TECHREPORT{Comp87:Internet, AUTHOR="Computer Science Facilities Group", TITLE="Introduction to the {Internet} Protocols", INSTITUTION="Rutgers University", YEAR=1987, URL="gopher://nic.merit.edu/1/.introducing.the.internet", } @BOOK{Hube87:Geodesic, AUTHOR="Peter W. Huber", TITLE="The Geodesic Network: 1987 Report on Competition in the Telephone Industry", PUBLISHER="U.S. Government Printing Office", ADDRESS="Washington, DC", YEAR=1987, } @ARTICLE{Schm87:Oneness, AUTHOR="Denise Schmandt-Besserat", TITLE="Oneness, Twoness, Threeness: How Ancient Accountants Invented Numbers", JOURNAL="The Sciences", VOLUME=27, PAGES="44-49", YEAR=1987, } @ARTICLE{Chao87:Priority, AUTHOR="Hung-Po Chao and R. J. Wilson", TITLE="Priority Service: Pricing, Investment and Market Organization", JOURNAL="American Economic Review", VOLUME=77, PAGES="899-916", YEAR=1987, } @MISC{Acam87:Knockout, AUTHOR="A. S. Acampora and M. G. Hluchyj and Y.-S. Yeh", TITLE="An {N-by-N} ``knockout'' switch for a high-performance packet switching system", PUBLISHER="European patent application 87306680.7, date of filing: 29.07.87, publication 0 256 702", ADDRESS="Munich", PAGES=18, YEAR=1987, KEYWORDS="ATM; packet switching; knockout switch", } @BOOK{Ajmo87:Petri, AUTHOR="Marco {Ajmone Marsan} and Giovanni Chiola", TITLE="On Petri nets with deterministic and exponentially distributed firing times", SERIES="Lecture Notes in Computer Science ``Advances in Petri Nets''", PUBLISHER="Springer-Verlag", ADDRESS="Torino", VOLUME=266, PAGES="132-145", YEAR=1987, REFERENCES=16, KEYWORDS="Petri net; DSPN; deterministic stochastic Petri net; performance evaluation; reliability; estimation", } @INCOLLECTION{Ajmo87:Accurate, AUTHOR="Marco {Ajmone Marsan} and Giovanni Chiola and A. Fumagalli", TITLE="An accurate performance model of {CSMA/CD} bus {LAN}", BOOKTITLE="Advances in Petri Nets", SERIES="Lecture Notes in Computer Science", PUBLISHER="Springer Verlag", ADDRESS="Torino", VOLUME=266, PAGES="146-161", YEAR=1987, REFERENCES=15, KEYWORDS="DSPN; deterministic stochastic Petri net; TPN; timed Petri net; estimation; CSMA/CD; protocol; performance evaluation; simulation; calculation", } @ARTICLE{Akyi87:Exact, AUTHOR="Ian Akyildiz", TITLE="Exact product form solution for queueing networks with blocking", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=1, PAGES="122-125", YEAR=1987, REFERENCES=22, KEYWORDS="Method; performance evaluation; blocking; MI/M/1/S; transform", ANNOTE="This work investigates closed queueing networks with blocking composed of two stations with multiple servers. Blocking occurs when a job wanting to enter a full station is forced to remain in its source station, thus blocking the source station until room is a available at the destination station. This type of blockingis known as classical blocking. We show that, for a two-station closed queueing network with blocking, there exists an equivalent", } @INPROCEEDINGS{Amer87:Measurement, AUTHOR="P. D. Amer and L. N. Cassel", TITLE="Measurement Management Service", BOOKTITLE=sigcomm, PUBLISHER="ACM", ADDRESS="Stowe, Vermont", PAGES="361-367", NOTE="also in ACM CCR 17(5)", YEAR=1987, KEYWORDS="Measurement method; ISO protocol", } @INPROCEEDINGS{Amer87:Local, AUTHOR="P. D. Amer and R. Krishna Kumar and R. Kao and J. T. Phillips and L. N. Cassel", TITLE="Local Area Broadcast Network Measurement: Traffic Characterization", BOOKTITLE=compcon, PUBLISHER="IEEE Computer Society Press", PAGES="64-70", YEAR=1987, REFERENCES=15, KEYWORDS="LAN; Traffic Measurement; Ethernet", } @ARTICLE{Amma87:Response, AUTHOR="Mahmoud Ammar", TITLE="Response Time in a Teletext System: An Individual User's perspective", JOURNAL=ieeecom, VOLUME="COM-35", PAGES="1159-1170", YEAR=1987, REFERENCES=8, KEYWORDS="Traffic Model", } @ARTICLE{Bagr87:Message, AUTHOR="R. L. Bagrodia and J. Misra", TITLE="A message-based approach to discrete event simulation", JOURNAL=ieeese, VOLUME="SE-13", PAGES="654-665", YEAR=1987, KEYWORDS="Simulation; message based", ANNOTE="Simulator ``MAY'' in Fortran", } @MISC{Barz87:Notable, AUTHOR="H. W. Barz", TITLE="Notable abbreviations in telecommunications", PUBLISHER="ccr", VOLUME=17, NUMBER="1-2", PAGES="71-79", YEAR=1987, KEYWORDS="Bibliography; communication", ANNOTE="Zusammenstellung von im bereich datenfernverarbeitung gebraeuchlichen abkuerzungen.", } @ARTICLE{Bell87:Visual, AUTHOR="P. Bell and R. O'Keefe", TITLE="Visual interactive simulation - history, recent developments, and mayor issues", JOURNAL="Simulation SCS", VOLUME=49, NUMBER=3, PAGES="109-116", YEAR=1987, REFERENCES=54, KEYWORDS="Discrete event simulation; computer animation; interactive mode", } @INPROCEEDINGS{Bene87:Participating, AUTHOR="S. L. Benedict", TITLE="Participating in {IBMs} Open Network Management", BOOKTITLE=infocom, YEAR=1987, REFERENCES=5, KEYWORDS="Network Management; multi-vendor environment; performance parameter; SNA; accounting", } @ARTICLE{Blaz87:Time, AUTHOR="Jacek Blazewicz and J. Brzezinski and G. Gambosi", TITLE="Time-Stamp Approach to Store-and-Forward Deadlock Prevention", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=5, PAGES="490-495", YEAR=1987, REFERENCES=16, KEYWORDS="deadlock prevention; store-and-forward; packet switching", ANNOTE="This paper deals with the problem of store-and-forward deadlock prevention in store-and-forward networks. The presented solution uses time stamping of all messages in the network, and a nonpreemptable message exchange mechanism. By combining these ideas, a new distibuted flow control procedure is derived which guarantees that all messages are delivered to their own destinations, thus avoiding both deadlock and livelock without any message los", } @TECHREPORT{Blon87:MMPP, AUTHOR="C. Blondia", TITLE="An {MMPP/G/1/N} feedback queue with overload control", INSTITUTION="Philips research laboratory", ADDRESS="Brussels", NUMBER="R 518", PAGES=20, YEAR=1987, KEYWORDS="Queueing system; overload control; ATM", } @ARTICLE{Blon87:Finite, AUTHOR="C. Blondia", TITLE="An {M/G/1} finite capacity queue with vacations and priorities", JOURNAL="PRLB report", ADDRESS="Brussels", YEAR=1987, KEYWORDS="Queueing system; M/G/1/S; server vacation", } @INPROCEEDINGS{Boll87:Simulation, AUTHOR="E. Bollweg and B. Page", TITLE="Simulation von Autotelefonsystemen zur Analyse von Verfahren der Funkfrequenzzuteilung auf einem {PC}", BOOKTITLE="4. Symposium Simulationstechnik", ISBN="3-540-18373-6", ADDRESS="Zürich", VOLUME=150, PAGES="448-455", NOTE="Informatik Fachberichte", YEAR=1987, LANGUAGE="German", REFERENCES=6, KEYWORDS="MAT; simulation; channel assignment", } @ARTICLE{Broo87:Butterfly, AUTHOR="E. D. Brooks", TITLE="A Butterfly Processor-Memory Interconnection for a Vector Processing Environment", JOURNAL="Parallel Computing", PUBLISHER="North Holland", VOLUME=4, PAGES="103-110", YEAR=1987, REFERENCES=5, KEYWORDS="Packet switching; fast packet switching; switching; multistage interconnection network; Banyan network; buffer management; performance evaluation; simulation", ANNOTE="In this paper we examine the performance of the butterfly or indirect binary n-cube network in a vector processing environment. We describe a simple modification of the standard 2x2 switch node used in such networks. This local modification of the switch node endows the network with a suprising global property. It adaptively removes chaotic behaviour during a vector operation.", } @INPROCEEDINGS{Bux87:Modeling, AUTHOR="W. Bux", TITLE="Modeling Token Ring Networks - A Survey", BOOKTITLE="4. GI/ITG Fachtagung, MMB-Gruppe", EDITOR="Shai Herzog and M. Paterok", PUBLISHER="Springer Verlag", ADDRESS="Erlangen, Germany", PAGES="192-221", YEAR=1987, REFERENCES=69, KEYWORDS="token ring; FDDI; performance evaluation; LAN", } @ARTICLE{Chan87:Effect, AUTHOR="C. J. Chang and J.-F. Chang", TITLE="The Effect if Idle Server First Random Routing on the Behaviour of a Finite Queue", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=5, PAGES="496-502", YEAR=1987, REFERENCES=7, KEYWORDS="Random routing; queueing discipline", ANNOTE="This paper studies the effect of routing on the behavior of a finite queue which accepts batch Poisson inputs and receives service from multiple synchronous servers. Upon the arrival of a group of customers idle or pseudoidle servers will be considered first in routing decisions. Otherwise routing will be determined randomly in accordance with a preset probability distribution. Results obtained include state probability, blocking probability", } @ARTICLE{Chun87:Forwarding, AUTHOR="F. R. K. Chung and E. G. Coffman and M. I. Reiman and B. Simon", TITLE="The Forwarding Index of Communication Networks", JOURNAL=ieeeit, VOLUME="IT-33", NUMBER=2, PAGES="224-232", YEAR=1987, REFERENCES=5, KEYWORDS="graph theory; communication network", ANNOTE="The forwarding index of a network is the maximum number of paths passing through any vertex in the graph. Thus it corresponds to the maximum amount of forwarding done by any node in a communication network with a fixed routing. For a given number of vertices, each having a given degree constraint, we consider the problem of finding networks that minimize the forwarding index. Forwarding indexes are calculated for cube networks and", } @ARTICLE{Chun87:Application, AUTHOR="C.-C. Lo", TITLE="Performance analysis and application of a two-priority packet queue", JOURNAL=atttj, VOLUME=66, PAGES="82-99", YEAR=1987, REFERENCES=13, KEYWORDS="M/G/1; G/G/1; priority; LAN; performance evaluation", } @ARTICLE{Cido87:Distributed, AUTHOR="I. Cidon and Joseph Jaffe and M. Sidi", TITLE="Distributed Store-and-Forward Deadlock Detection and Resolution algorithms", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=11, PAGES="1139-1145", YEAR=1987, REFERENCES=20, KEYWORDS="Store-and-forward; packet switching; deadlock; deadlock prevention", ANNOTE="Distributed algorithms for the detection and resolution of deadlocks in store-and-forward computer communication networks are presented and validated. The algorithms use a 'fixed amount of storage' at each node (that is independent of size of the network). The detection algorithm is simple but requires network-wide coordination. The resolution algorithm is based on earlier approaches, but uses the network-wide coordination to address certain", } @ARTICLE{Cock87:Grundlagen, AUTHOR="D. Cockburn and W. Pauli and D. Kern", TITLE="Grundlagen der digitalen Vermittlungstechnik", JOURNAL="Unterrichtsblätter der Deutschen Bundespost", VOLUME=40, NUMBER=11, PAGES="403-419", YEAR=1987, LANGUAGE="German", REFERENCES=1, KEYWORDS="Switching system; SPC", } @ARTICLE{Coff87:Class, AUTHOR="E. G. Coffman and M. Hofri", TITLE="A class of {FIFO} queues arising in computer systems", JOURNAL=or, VOLUME=26, PAGES="864-880", YEAR=1987, KEYWORDS="Queueing system; Disk; model; FIFO; queue length; waiting time", ANNOTE={We model secondary memory devices as single-server queueing systems. The non-random access to data within these devices is explicitly accounted for as "set-up" times. Requests are typed by the location of the desired record. We present some specializations to disks and drums.}, } @ARTICLE{Comf87:Distributed, AUTHOR="J. C. Comfort", TITLE="Distributed simulation on a network of transputers", JOURNAL="Discrete Event Simulation an Operation Research", PAGES="25-29", YEAR=1987, REFERENCES=16, KEYWORDS="Transputer; distributed simulation; parallel computing", } @MISC{Cour87:Controlled, AUTHOR="P.-J. Courtois and G. Scheys and P. Semal", TITLE="Controlled {CSMA} packet switching system", PUBLISHER="European patent 0 314 217 A2 priority 30.10.87 GB 8725487", ADDRESS="Brussels", PAGES="18 + 7 fig.", YEAR=1987, KEYWORDS="Packet switching; nonpersistent; LAN; CSMA; carrier sense multiple access", } @ARTICLE{Cout87:Planning, AUTHOR="R. W. Couture and J. H. Simester", TITLE="Planning Tools for Special Networks", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=1, PAGES="38-46", YEAR=1987, KEYWORDS="Network planning", ANNOTE="This paper describes two strategic network planning tools that can aid network planners in determining the optimal hubbing configuration for their networks. HUBCAP (Hubbing Configuration Analysis Program) is a program that analyzes analog special services networks. SUBCAP (Subrate Configuration Analysis Program) examines networks designed for digital data services. The capabilities and application of each of the tools are discussed.", } @INPROCEEDINGS{Davi87:Challenge, AUTHOR="W. S. Davies and R. J. Lang and E. Vinnal", TITLE="The Challenge of Advanced Base Station Antennas for Future Cellular Mobile Radio Systems", BOOKTITLE="IEEE International Workshop - Digital Mobile Radio", ADDRESS="Melbourne", YEAR=1987, KEYWORDS="Mat", ANNOTE="dynamic antenna assignment", } @INCOLLECTION{Dias87:Dynamically, AUTHOR="Daniel M. Dias and A. Goyal and M. Kumar", TITLE="A Dynamically Reconfigurable Switch for Integrated Communications", BOOKTITLE="Local Communication Systems: LAN and PBX", PUBLISHER="Elsevier Science Publishers", PAGES="329-337", YEAR=1987, REFERENCES=4, KEYWORDS="ATM", } @BOOK{Disn87:Traffic, AUTHOR="R. L. Disney and P. C. Kiessler", TITLE="Traffic processes in queueing networks - a Markov renewal approach", PUBLISHER="The John Hopkins University Press", ADDRESS="Baltimore", PAGES=251, YEAR=1987, REFERENCES=75, KEYWORDS="Queueing network", } @MISC{Eng8708:Knockout, AUTHOR="K. Y. Eng and Y.-S. Yeh and M. G. Hluchyj", TITLE={An {N-by-N} "knockout" switch for a high-performance packet switching system with variable length packets}, PUBLISHER="European patent Application 0 257 816 US-Priority 893610 06.08.86", ADDRESS="New York", YEAR=1987, KEYWORDS="ATM; variable packet length; fast packet switching", } @INPROCEEDINGS{Erli87:Simulation, AUTHOR="M. Erlinghagen", TITLE="Simulation eines lokalen Funknetzes bezüglich des Kanalbündels unter besonderer Berücksichtigung der Kanalökonomie", BOOKTITLE="4. Symposium Simulationstechnik", ADDRESS="Zürich", VOLUME=150, PAGES="456-462", NOTE="Informatik Fachberichte", YEAR=1987, LANGUAGE="German", REFERENCES=7, KEYWORDS="MAT; simulation", } @ARTICLE{Fehl87:Messungen, AUTHOR="F. Fehlau and T. Simon and O. Spaniol and J. Suppan-Borowka", TITLE="Messungen des Leistungsverhaltens Lokaler Netze mit einem Software-Monitor", JOURNAL="Informatik Forschung und Entwicklung", VOLUME=2, PAGES="55-64", YEAR=1987, LANGUAGE="German", REFERENCES=16, KEYWORDS="LAN; protocol; workload; software monitor; Ethernet; standard user method; performance measurement", ANNOTE="good overview with measurement results", } @ARTICLE{Fili87:Modeling, AUTHOR="J. Filipiak and Prosper Chemouil", TITLE="Modeling and Prediction of Traffic Fluctuations in Telephone Networks", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=9, PAGES="931-940", YEAR=1987, REFERENCES=14, KEYWORDS="traffic prediction; traffic model; circuit switching; communication network", ANNOTE="Discrete-time stochastic models designed to encompass various sequential measurements of telephone traffic are derived from assumptions of classical queueing theory. The models are linear and their coefficients depend on the measurement cycle length normalized by the mean holding time. Proposed descriptions are tested against the real data gathered by the supervisor of the French toll network. Forecasting methods are then proposed and implemen", } @INPROCEEDINGS{Furu87:Channel, AUTHOR="Y. Furuya and A. Yoshihiko", TITLE="Channel Segregation, a distributed adaptive channel allocation scheme for mobile communications systems", BOOKTITLE="DMR II", ADDRESS="Stockholm", PAGES="311-315", YEAR=1987, KEYWORDS="MAT; DCA; dynamic channel assignment", } @ARTICLE{Gall87:Blocking, AUTHOR="F. Le Gall and J. Bernussou", TITLE="Blocking Probabilities for Trunk Reservation Policy", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=3, PAGES="313-318", YEAR=1987, REFERENCES=7, KEYWORDS="Circuit switching; blocking; alternate routing", ANNOTE="This paper presents an analysis of the blocking phenomenon in circuit-switched routing policies with alternate routing and trunk reservation. From the usual assumptions on the offered traffic (Poisson) and the service time (exponential distribution), a classical Markov chain model is derived. Some approximate formulas are given to compute the blocking probabilities for first- and second-choice traffic. The accuracy of the proposed estimates is", } @INPROCEEDINGS{Gies87:Expert, AUTHOR="L. R. Gieszl", TITLE="The expert system applicability question", BOOKTITLE="Conference on Simulation and AI", VOLUME=18, PAGES="17-20", YEAR=1987, REFERENCES=6, KEYWORDS="Artificial intelligence; expert system", } @ARTICLE{Gigl87:Stochastic, AUTHOR="J. Giglmayr", TITLE="Analysis of stochastic Petri nets by the decomposition of the transition rate matrix, part 1", JOURNAL=ntzarchiv, ADDRESS="Berlin (West)", VOLUME=9, NUMBER=5, PAGES="115-120", YEAR=1987, REFERENCES=5, KEYWORDS="SPN; stochastic Petri net; near complete decomposability; stationary marking probability", } @ARTICLE{Gold87:Efficient, AUTHOR="Y. Gold and William R. Franta", TITLE="An efficient collision-free protocol for prioritized access-control of cable or radio channels", JOURNAL=cnis, VOLUME=7, PAGES="83-98", YEAR=1987, KEYWORDS="Computer network; protocol; access control", } @TECHREPORT{Guse87:Diskless, AUTHOR="Riccardo Gusella", TITLE="The Analysis of Diskless Workstation Traffic on an Ethernet", INSTITUTION="Computer Science Division, University of California, Berkeley", ADDRESS="Berkeley, California", NUMBER="UCB/CSD 87/379", YEAR=1987, REFERENCES=58, KEYWORDS="LAN; measurement; Ethernet; file server; diskless workstation", } @ARTICLE{Herz87:Einflu, AUTHOR="U. Herzog and M. Paterok and C. Vogel", TITLE="Der Einfluß des Wiederholeffekts auf die Leistungsgrößen von Verlustsystemen", JOURNAL="Informatik Fachberichte", VOLUME=154, PAGES="65-78", YEAR=1987, LANGUAGE="German", REFERENCES=16, KEYWORDS="Loss system; Call reattempt", } @ARTICLE{Ide87:Uber, AUTHOR="H.-D. Ide and J. Sägebarth and R. Schehrer", TITLE="Über eine Software-Struktur mit Buseigenschaften für eine Versuchsvermittlung", JOURNAL=ntzarchiv, VOLUME=9, PAGES="3-8", YEAR=1987, LANGUAGE="German", KEYWORDS="Switching system", } @INPROCEEDINGS{Iver87:Exact, AUTHOR="V. B. Iversen", TITLE="The exact evaluation of multi-service loss systems with access control", BOOKTITLE="7th nordic teletraffic seminar (NTS-7)", ADDRESS="Lund", PAGES="56-61", YEAR=1987, REFERENCES=9, KEYWORDS="Queueing system; loss system", ANNOTE="Presented at the RACE R1022 TG D+E meeting at Athens 17.03.88 A simple algorithm is presented for the exact evaluation of a multi-service system with heterogeneous service requirements andn servers, e.g., an ISDN-node with $N$ different types of calls. The system is operated as loss system. The arrival processes arestate-dependent Poisson arrival processes, and the holding time distributions are general distributions.", } @TECHREPORT{Iver87:Properties, AUTHOR="V. B. Iversen and B. F. Nielsen", TITLE="Some properties of Coxian distributions with applications", INSTITUTION="Technical University of Denmark", ADDRESS="Lyngby, Denmark", PAGES="69-74", YEAR=1987, REFERENCES=4, KEYWORDS="Phase concept; distribution", ANNOTE="two properties of phase-type distributions of the coxian type Are derived. these properties are illustrated by phase diagrams. they allow for a unified interpretation of previous models of traffic processes. the properties also reduce the space of values of parameters when modelling empirical data with coxian distributions.", } @ARTICLE{Jeff87:Distributed, AUTHOR="David Jefferson and Brian Beckman and Fred Wieland and L. Blume and others", TITLE="Distributed simulation and the Time Warp Operating System", JOURNAL=acmosrev, ISBN="0163-5980", VOLUME=21, PAGES="77-93", YEAR=1987, REFERENCES=14, KEYWORDS="Distributed simulation; time warp; operating system; hypercube; multiprocessor system; virtual time; synchronization; time to completion; speedup", ANNOTE="The article describes the Time Warp Operating System, under development for three years at the Jet propulsion Laboratory for Caltech Mark III Hypercube multiprocessor. Its primary goal is concurrent execution of large, irregular discrete event simulatiat maximum speed. It also supports any other distributed applicathat are synchronized by virtual time. The Time Warp Operating Sincludes a complete implementation of the Time Warp mechanism, a", } @ARTICLE{Kaud87:Literature, AUTHOR="F. Kaudel", TITLE="A literature survey on distributed discrete event simulation", JOURNAL=simuletter, VOLUME=18, NUMBER=2, PAGES="11-21", YEAR=1987, KEYWORDS="Distributed simulation", } @ARTICLE{Key87:Connection, AUTHOR="M. Key and M. Karimzadeh", TITLE="Connection-Control Protocols in a Fast Packet-Switching Multi-Service Network Based on {ATD} Techniques", JOURNAL="British Telecommunications Engineering", VOLUME=6, PAGES="192-198", YEAR=1987, REFERENCES=10, KEYWORDS="ATM", } @ARTICLE{Kill87:Asynchrone, AUTHOR="Ulrich Killat", TITLE="Asynchrone Zeitvielfachübermittlung für Breitbandnetze", JOURNAL=ntz, VOLUME=40, NUMBER=8, PAGES="572-577", YEAR=1987, LANGUAGE="German", REFERENCES=19, KEYWORDS="ATM; BISDN; Banyan network; Prelude; Orwell Ring", ANNOTE="Die asynchrone Zeitvielfachübermittlungstechnik (AZÜ) stellteinen völlig neuen Ansatz für die Gestaltung eines universellen Breitbandnetzes dar. Dieser Beitrag will den Leser mit den Grundgedanken der AZÜ vertraut machen und ihn zugleich für die Vielzahl technischer Optionen und konkurrierender Lösungsmöglichkeiten sensibilisieren.", } @ARTICLE{Kirk87:Optimized, AUTHOR="W. W. Kirkman", TITLE="An optimized contention protocol for broadband networks", JOURNAL=tocs, VOLUME=5, NUMBER=3, PAGES="275-283", YEAR=1987, REFERENCES=11, KEYWORDS="broadband; LAN", ANNOTE="This paper describes the concepts underlying an alternative link-level protocol for broadband local networks. The protocol uses implicit slotting of the contention channel to support larger networks, improve performance, and provide reliable distributed collision recognition witout reinforcement. It is designed such that compatible interfaces to existing CSMA/CD-based systems canbe provided.", } @INPROCEEDINGS{Kirt87:Teletraffic, AUTHOR="Paul Kirton", TITLE="Teletraffic Issues in Fast Packet Switched Networks", BOOKTITLE="1st Australian Teletraffic Research Seminar", PAGES="9.3.1-6", YEAR=1987, KEYWORDS="ATM", } @INPROCEEDINGS{Klin87:Supercomputers, AUTHOR="C. S. Kline", TITLE="Supercomputers on the {Internet}", BOOKTITLE=sigcomm, PUBLISHER="ACM", ADDRESS="Stowe, Vermont", PAGES="27-33", NOTE="also in ACM CCR 17(5)", YEAR=1987, REFERENCES=11, KEYWORDS="TCP/IP; Hyperchannel; robustness", ABSTRACT="This paper will discuss the design of a TCP/IP implementation and its upper level protocols on the University of Illinois supercomputer. We will also discuss som of the issues peculiar to TCP communication with a supercomputer, and some of the special problems encountered while writing and debugging under CTSS, which is not an environment particularly conductive to network development.", ANNOTE="no performance measures except ``Data transfer rates remain disappointingly slow''", } @ARTICLE{Knes87:Two, AUTHOR="Ch. Knessl and B. J. Matkowsky and Z. Schuss and C. Tier", TITLE="Two Parallel {M/G/1} Queues Where Arrivals Join the System with the Smaller Buffer Content", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=11, PAGES="1153-1158", YEAR=1987, REFERENCES=12, KEYWORDS="M/G/1; queueing system; dynamic routing", ANNOTE="We consider two parallel, infinite capacity, M/G/1 queues characterized by: A new arrival is assigned to the queue with the smaller buffer content. We construct formal (as opposed to rigorous) asymptotic approximations to the joint stationary distribution of the Markov process, treating separately the asymptotic limits of heavy traffic, light traffic, and large buffer contents. In heavy traffic, the stochastic process", } @ARTICLE{Kram87:Computional, AUTHOR="M. Kramer", TITLE="Computional methods for Markov chains occuring in queuing theory", JOURNAL="Informatik Fachberichte", VOLUME=154, PAGES="164-175", YEAR=1987, REFERENCES=11, KEYWORDS="Markov chain; queueing theory; discrete time queue", } @INPROCEEDINGS{Kuhn87:Realzeitanwendungen, AUTHOR="P. J. Kühn and K. P. Sauer", TITLE="Realzeitanwendungen mit dem Token Ring - Sprachübertragung", BOOKTITLE="Kolloquium ``HECTOR''", PAGES="77-93", YEAR=1987, LANGUAGE="German", REFERENCES=15, KEYWORDS="LAN; token ring; traffic source model; packet voice", } @ARTICLE{Kuma87:Augmented, AUTHOR="V. Kumar and S. M. Reddy", TITLE="Augmented Shuffle-Exchange Multistage Interconnection Networks", JOURNAL=ieeecomp, ADDRESS="Holmdel", PAGES="30-40", YEAR=1987, REFERENCES=11, KEYWORDS="Shuffle exchange; Interconnection Network", } @INPROCEEDINGS{Lang87:Application, AUTHOR="P. A. Langen", TITLE="Application of artificial intelligence techniques to simulation", BOOKTITLE="Conference on simulation and AI, simulation series", VOLUME=18, PAGES="49-57", YEAR=1987, KEYWORDS="Simulation; artificial intelligence", } @INPROCEEDINGS{Lehm87:Expert, AUTHOR="A. Lehmann", TITLE="Expert systems for interactive simulation of computer system dynamics", BOOKTITLE="Conference on simulation and AI, simulation series", VOLUME=18, PAGES="21-26", YEAR=1987, REFERENCES=20, KEYWORDS="Simulation; expert system; artificial intelligence", } @ARTICLE{Lieb87:Routing, AUTHOR="F. Liebl", TITLE="Routing-Algorithmen für paketvermittelnde Datennetze - ein Beitrag zur Systematik", JOURNAL=ntzarchiv, VOLUME=9, PAGES="317-325", YEAR=1987, LANGUAGE="German", KEYWORDS="Packet switching; routing algorithm", } @ARTICLE{Ligo87:Local, AUTHOR="P. Ligomenides and P. K. Mannava", TITLE="Local rerouting with virtual cut-through switching", JOURNAL="ieeproc\_E", VOLUME=134, PAGES="197-202", YEAR=1987, KEYWORDS="Cut-through switching; routing algorithm", } @ARTICLE{Litt87:Evolution, AUTHOR="Morgan Littlewood and I. D. Gallagher and J. L. Adams", TITLE="Network Evolution Using Asynchronous Time-Division Techniques", JOURNAL="British Telecommunications Engineering", VOLUME=6, PAGES="95-104", YEAR=1987, REFERENCES=12, KEYWORDS="ATM", } @ARTICLE{Lubb87:Messung, AUTHOR="U. L bbe and O. Gihr", TITLE="Messung von Verkehrsprofilen in lokalen Netzen", JOURNAL=datacom, VOLUME="11/12", PAGES="88-94", YEAR=1987, REFERENCES=3, KEYWORDS="LAN; hardware monitor; measurement; media access control; network level", } @ARTICLE{Mali87:Turing, AUTHOR="I. Malitz", TITLE="The Turing machine", JOURNAL=byte, VOLUME=12, NUMBER=11, PAGES="345-357", YEAR=1987, KEYWORDS="Turing machine", } @ARTICLE{Manf87:Modelling, AUTHOR="David R. Manfield and P. Tran-Gia and H. Jans", TITLE="Modelling and Performance Analysis of Inter-Processor Messaging in Distributed Systems", JOURNAL=pe, VOLUME=7, PAGES="285-298", YEAR=1987, REFERENCES=9, KEYWORDS="Queueing system; Clocked input; Delay Analysis; Imbedded Markov Chain; overload control; Two Level Queueing System", } @INPROCEEDINGS{Meis87:Study, AUTHOR="Bernd Meister", TITLE="A performance study of the {ISO} transport protocol", BOOKTITLE="7th international conference on distributed computing systems21.-25.09.87", ADDRESS="Berlin", PAGES=31, YEAR=1987, REFERENCES=7, KEYWORDS="Protocol engineering; performance evaluation; ISO", } @ARTICLE{Mitr87:Optimum, AUTHOR="D. Mitra and I. Mitrani", TITLE="Analysis and optimum performance of two message-passing parallel processors synchronized by rollback", JOURNAL=pe, VOLUME=7, PAGES="111-124", YEAR=1987, KEYWORDS="Distributed simulation; rollback", } @ARTICLE{Ng87:Joint, AUTHOR="T. M. J. Ng and D. B. Hoang", TITLE="Joint optimization of capacity and flow assignment in a packet-switched communication network", JOURNAL=ieeecom, VOLUME="COM-35", PAGES="202-209", YEAR=1987, KEYWORDS="Packet switching; routing algorithm; optimization", } @ARTICLE{Nowi87:Analyse, AUTHOR="K. Nowicki and T. Uhl", TITLE="Analyse von Problemen bei der Rekonstruktion der Paketreihenfolge in Rechnernetzen", JOURNAL="Informatik Fachberichte", VOLUME=130, PAGES="699-711", YEAR=1987, LANGUAGE="German", REFERENCES=8, KEYWORDS="Packet switching; resequencing; M/M/1; bulk system; M/M/oo; G/M/1", } @TECHREPORT{Prot87:Zuverlaessigkeit, AUTHOR="P. Protzel", TITLE="Zuverlässigkeit von Nahbereichs-Kommunikationsnetzen", TYPE="Fortschritt-Berichte VDI, Reihe 10", ISBN="3-18-147110-0", INSTITUTION="VDI", ADDRESS="Braunschweig", VOLUME=71, PAGES=183, YEAR=1987, LANGUAGE="German", REFERENCES=90, KEYWORDS="Switching system; reliability", } @INPROCEEDINGS{Radi87:Logic, AUTHOR="A. Radiya and R. G. Sargent", TITLE="Logic programming and discrete event simulation", BOOKTITLE="Conference on simulation and AI, simulation series", VOLUME=18, PAGES="64-71", YEAR=1987, REFERENCES=18, KEYWORDS="Discrete event simulation", } @ARTICLE{Rath87:Protocol, AUTHOR="Erwin P. Rathgeb and C. Homann and H. L. Truong and G. Waldmann", TITLE="Protocol Testing for the {ISDN} D-Channel Network Layer", JOURNAL="Protocol Specification, Testing, and Verification, VII, North-Holland", ISBN="0 444 70293 8", ADDRESS="Zurich", PAGES="421-434", YEAR=1987, REFERENCES=15, KEYWORDS="Protocol testing", ANNOTE="Contribution to IFIP WG 6.1 Seventh International Conference on Protocol Specification, Testing, and Verification, Zurich, Switzerland, 5 - 8 May, 1987", } @BOOK{Reed87:Multicomputer, AUTHOR="Daniel Reed and R. M. Fujimoto", TITLE="Multicomputer networks - message-based parallel processing", ISBN="0-262-18129-0", PUBLISHER="MIT Press series in scientific computation", ADDRESS="Cambridge, Mass.", PAGES=380, YEAR=1987, REFERENCES=45, KEYWORDS="Parallel computing; distributed simulation; hypercube; performance evaluation", } @ARTICLE{Rock87:Karmarkar, AUTHOR="A. M. Rockett and J. C. Stevenson", TITLE="Karmarkar's algorithm: A method for solving large linear programming problems (technical)", JOURNAL=byte, VOLUME=12, NUMBER=10, PAGES="146-160", YEAR=1987, KEYWORDS="Program; linear programming; problem solving; algorithm; simplex method; linear algebra; BASIC; Karmarkar's algorithm", ANNOTE="captions: finding a point on the circle $s$ that minimizes $C(T)X$; the intersection of the subspace of $r3$ and the two-dimensional simplex; the initial step; the general step; the karex1 program, written in microsoft's basic, to solve an example; reduction to the restricted problem; programming language: BASIC", } @ARTICLE{Rose87:Random, AUTHOR="C. A. Rose and M. G. Hluchyj", TITLE="The Performance of Random and Optimal Scheduling in a Time-Multiplex Switch", JOURNAL=ieeecom, VOLUME="COM-35", PAGES="813-817", YEAR=1987, REFERENCES=7, KEYWORDS="ATM; Analysis", } @ARTICLE{Ross87:Switched, AUTHOR="M. H. Rossitter", TITLE="A Switched Poisson Model for Data Traffic", JOURNAL="Telecom Australia Research Laboratories", VOLUME=21, PAGES="53-57", YEAR=1987, REFERENCES=7, KEYWORDS="Traffic Model; SPP; switched Poisson Process; Superposition", } @ARTICLE{Sall87:Hybrid, AUTHOR="K. Sallberg and B. Stavenow and B. Eklundh", TITLE="Hybrid channel assignment and reuse partitioning in a cellular mobile telephone system", JOURNAL=ieeevt, VOLUME="VT-36", PAGES="404-411", YEAR=1987, KEYWORDS="MAT; DCA; dynamic channel assignment", ANNOTE="overview on reuse partitioning", } @ARTICLE{Sari87:Test, AUTHOR="B. Sarikaya and Gregor V. Bochmann and E. Cerny", TITLE="A Test Design Methodology for Protocol Testing", JOURNAL=ieeese, VOLUME="SE-13", NUMBER=5, PAGES="518-531", YEAR=1987, REFERENCES=18, KEYWORDS="Protocol testing", } @TECHREPORT{Sche87:Class, AUTHOR="G. Scheys and P. Semal", TITLE="On a Class of Constrained Shortest Path Problems", INSTITUTION="Philips Research Lab., Brussels, R510", ADDRESS="Brussels", YEAR=1987, KEYWORDS="Shortest path; network planning; optimization; mathematical analysis; programming", } @ARTICLE{Schi87:Schwelle, AUTHOR="M. Schindler", TITLE="An der Schwelle zur 2. Computer Ära: Parallelverarbeitung", JOURNAL="Elektronik", NUMBER=10, PAGES="73-80", YEAR=1987, LANGUAGE="German", KEYWORDS="Parallel computing", } @ARTICLE{Schm87:Approximation, AUTHOR="L. Schmickler", TITLE="Approximation von empirischen Verteilungsfunktionen mit Erlangmischungen und Coxverteilung", JOURNAL="Informatik-Fachberichte", VOLUME=154, PAGES="118-133", YEAR=1987, LANGUAGE="German", REFERENCES=17, KEYWORDS="Cox distribution; distribution function; approximation", } @ARTICLE{Schr87:Empirical, AUTHOR="F. Schreiber", TITLE="The empirical stationary distribution function of Markovian correlated random sequences", JOURNAL=aeu, VOLUME=41, PAGES="257-263", YEAR=1987, REFERENCES=18, KEYWORDS="Statistics; Bayes statistics", ANNOTE="also ITC 11, Kyoto, Japan, 1985", } @ARTICLE{Stre87:Wahrscheinlichkeitsverteilungen, AUTHOR="J. C. Strelen", TITLE="Wahrscheinlichkeitsverteilungen maximaler Entropie für die Wartezeiten in G/G/1-Systemen", JOURNAL="Informatik Fachberichte", VOLUME=154, PAGES="13-27", YEAR=1987, LANGUAGE="German", REFERENCES=12, KEYWORDS="G/G/1; Approximation", } @INPROCEEDINGS{Supp87:Calculating, AUTHOR="J. Suppan-Borowka", TITLE="Calculating the requested capacity of a {CSMA/CD} {LAN} regarding different types of file servers", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="1-17", YEAR=1987, REFERENCES=26, KEYWORDS="LAN; application oriented performance; file server; peak load; upper layer performance; simulation; traffic source model; resource use model; transaction; decentralization; PLS; Peak Load Simulation Tool", ABSTRACT="Modellbildung interaktiver Netzbenutzung und daraus abgeleitete Anforderungen an die Transfer-Rate des Netzes", } @INPROCEEDINGS{Szym87:Results, AUTHOR="T. H. Szymanski", TITLE="Some Results on Monte Carlo Methods, Markov Chains and Performance of Petri Networks", BOOKTITLE="2nd International Workshop on Applied Mathematics and Performance/Reliability Models of Computer Systems", ADDRESS="Rome, Italy", PAGES="259-274", YEAR=1987, REFERENCES=24, KEYWORDS="Simulation; Banyan network", } @ARTICLE{Zhan87:Thoughts, AUTHOR="L. Zhang", TITLE="Some thoughts on the packet network architecture", JOURNAL=ccr, ADDRESS="Cambridge, MA", VOLUME=17, NUMBER="1, 2", PAGES="3-17", MONTH="January/April", YEAR=1987, KEYWORDS="Packet switching; network; datagram; virtual channel", } @ARTICLE{Dahm87:Mehrfachnutzung, AUTHOR="H. Dahms", TITLE="Über die Mehrfachnutzung von Kanälen eines Zeitmultiplex-Vermittlungssystems unter Berücksichtigung abhängiger Teilnehmer", JOURNAL=ntzarchiv, VOLUME=9, NUMBER=3, PAGES="55-62", YEAR=1987, LANGUAGE="German", REFERENCES=12, KEYWORDS="ATM; traffic source model; TDM; time division multiplex", ANNOTE="Models and analysing methods are presented which take into account the particular interdependence of a pair of traffic sources. The paper deals with the exact calculation of the state prob. and the char. traffic values by means of closed form solutions. Results of these models are compared with those based on independent subscribers.", } @ARTICLE{Dahm87:Voice, AUTHOR="H. Dahms", TITLE="On voice-activated switching in {TDM-systems} with interdependent traffic sources and buffered speech samples", JOURNAL=aeu, VOLUME=41, NUMBER=3, PAGES="140-148", YEAR=1987, REFERENCES=12, KEYWORDS="Traffic source model; ATM; delay loss model; FIFO; TDM; time division multiplex", ANNOTE="In order to increase the channel efficiency of modern asynchronous TDM-systems it is possible that a number of sources are able to share a smaller number of channels by voice-activated switching. A finite buffer be provided for reducing a possible loss of speech samples. State prob. and char. traffic values are calculated exactly by means of closed form solutions and iterativ methods based on the interdependence of a pair of traffic sources.", } @ARTICLE{Kumm87:Protocol, AUTHOR="P. Kummer and R. Tasker and N. Linge and E. Ball", TITLE="A Protocol-less Scheme for Bridging Between {IEEE} 802 Local Area Networks", JOURNAL=cnis, VOLUME=12, PAGES="81-87", YEAR=1987, REFERENCES=12, KEYWORDS="LAN; gateway; IEEE 802.3; bridge", ANNOTE="This paper describes an algorithm for a MAC-level bridge to interconnect any IEEE 802 LAN, which does not rely an communications between the bridges. It will resolve the route over any arbitrary network topology between any pair of communicating end-stations to be the shortest possible. Such a technique will make the best possible use of network resources as the routes are always selected dependent on load.", } @ARTICLE{Schm87:Vermittlungstechnik, AUTHOR="W. Schmidt", TITLE="Die Vermittlungstechnik in integrierten Paket-Übermittlungssystemen - Einführung und Systemübersicht", JOURNAL=fernmelde, VOLUME="9/10", PAGES="1-32/1-28", YEAR=1987, LANGUAGE="German", REFERENCES=42, KEYWORDS="Survey; ATM; packet switching; hybrid system", ANNOTE="Umfassender Überblick über ATM-Systeme und Paketvermittlung.", } @ARTICLE{Sohr87:Comments, AUTHOR="K. Sohraby and Mart L. Molle and A. N. Venetsanopoulos", TITLE={Comments on "Throughput Analysis for Persistent {CSMA} Systems"}, JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=2, PAGES="240-243", YEAR=1987, REFERENCES=5, KEYWORDS="CSMA; carrier sense multiple access; collision detection; protocol", ANNOTE="A brief and simple analysis of asynchronous (unslotted) 1-Persistent CSMA protocols in the worst-case star topology is presented. First, a simple approach is given based on an embedded Markov chain at the beginning of subbusy periods that greatly simplifies the analysis. And second, a correct analysis for 1-Persistent CSMA with collision detection is given, since the only available analysis of the present model [1] is in error.", } @ARTICLE{Taka87:Correction, AUTHOR="H. Takagi and L. Kleinrock", TITLE={Correction to "Throughput Analysis for Persistent {CSMA} Systems"}, JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=2, PAGES="243-245", YEAR=1987, REFERENCES=2, KEYWORDS="Multiple access channel; n-persistent; CSMA; carrier sense multiple access; packet switching", ANNOTE="This paper corrects errors in sections IV and VI of [1]. Accordingly, Figs. 6-8 of [1] are also corrected. An error in [1] for the special case of unslotted 1-persistent CSMA with collision detection is pointed out by [2] which also corrects the error for the infinite population case using a different approach.", } @ARTICLE{Dimo87:Throughput, AUTHOR="Nikitas Dimopoulos", TITLE="Throughput and Packet Delay Analysis for the {H-} Network: {CSMA/CD} with Adaptive and Nonadaptive Backoff Protocols", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=11, PAGES="1146-1152", YEAR=1987, KEYWORDS="LAN; CSMA/CD; broadcast", ANNOTE="In this work, we present the structure of the H-Network, which is a high data rate local area network used to provide point to point and broadcast communication for the Homogeneous Multiprocessor. We also present the analysis, and obtain the throughput and packet delay characteristics for the H- Network operating under CSMA/CD with adaptive and nonadaptive backoff protocols.", } @MISC{Law87:Improving, AUTHOR="A. M. Law", TITLE="Improving system design and analysis via simulation modeling", PUBLISHER="Simulation modeling and analysis company, State of the art limited (SAL)", ADDRESS="Tucson, Arizona", YEAR=1987, REFERENCES=1, KEYWORDS="Simulation; discrete event simulation; simulation language; random number; output Analysis", ANNOTE="Overview on simulation modeling, random nunbers and output analsysis.", } @ARTICLE{Budk87:Estelle, AUTHOR="S. Budkowski and P. Dembinski", TITLE="An Introduction to Estelle: A Specification Language for Distributed Systems", JOURNAL=cnis, VOLUME=14, PAGES="3-23", YEAR=1987, REFERENCES=34, KEYWORDS="Specification language; OSI; ESTELLE; distributed system", ANNOTE="The paper presents the Estelle language by describing its principal features, the syntactic and the semantic aspects, and illustrates its use by examples.", } @INPROCEEDINGS{Sajk87:Protocol, AUTHOR="M. Sajkowski", TITLE="Protocol Verification in the Presence of Time", BOOKTITLE="Protocol Specification, Testing and Verification VI", ORGANIZATION="IFIP", PAGES="269-280", YEAR=1987, REFERENCES=20, KEYWORDS="Protocol verification; Petri net", ANNOTE="An approach to the application of the time augmented reachability analysis for the protocol verification is presented. The limitations of its use are indicated, possible solutions for these limitations are given, examples of the use of this technique, for the verification of certain protocol properties, are presented. Then the analysis of the used Petri net protocol is given.", } @ARTICLE{Sara87:CCITT, AUTHOR="Roberto Saracco and P. A. J. Tilanus", TITLE="{CCITT} {SDL:} Overview of the Language and its Applications", JOURNAL=cnis, VOLUME=13, PAGES="65-74", YEAR=1987, REFERENCES=5, KEYWORDS="CCITT; SDL; overview; application; tool; future outlook", ANNOTE="The paper gives an overview of the language according to its final definition, its fields of application and the availiable support tools.", } @INPROCEEDINGS{Scol87:Architectural, AUTHOR="G. Scollo and M. van Sinderen", TITLE="On the Architectural Design of the Formal Specification of the Session Standards in {LOTOS}", BOOKTITLE="Protocol Specification, Testing and Verification VI, IFIP 1987", PAGES="3-14", YEAR=1987, REFERENCES=15, KEYWORDS="Protocol specification; OSI; LOTOS; specification language", ANNOTE="Structuring formal specifications of services and protocols in LOTOS is proposed and should emphasize mutual commonalities. Structuring principles for the session specifications are of general use for the specification of services and protocols.", } @ARTICLE{Vaki87:Flow, AUTHOR="F. Vakil and M. Hsiao and Aurel A. Lazar", TITLE="Flow Control in Integrated Local Area Networks", JOURNAL=pe, VOLUME=7, PAGES="43-57", YEAR=1987, REFERENCES=15, KEYWORDS="Integrated network; LAN; flow control; optimal control; queueing system; analysis; simulation", ANNOTE="A generic integrated lan with double bus architecture, adaptive TDMA access protocol and heterogenous users is considered. Dynamic optimal flow control strategies on a finite horizon are analyzed. It is shown by simulation that adaptive window flow control maximizes the average throughput.", } @INPROCEEDINGS{Welz87:Analyse, AUTHOR="T. Welzel", TITLE="Analyse und Messung der Workload einer technisch- wissenschaftlichen Programmentwicklungsumgebung als Grundlage der Leistungsbewertung Lokaler Netze", BOOKTITLE="Communication in Distributed Systems Informatik Fachberichte, Springer-Verlag", PAGES="493-505", YEAR=1987, REFERENCES=34, KEYWORDS="LAN; performance evaluation; workload; model; load measurement", ANNOTE="Der Beitrag beschreibt die Analyse einer technisch- wissenschaftlichen Programmentwicklungsumgebung als eines der User-Scenarios durch die Entwicklung geeigneter Modelle zur Darstellung des Benutzerverhaltens. Die Modellparameter werden durch Lastmessungen quantifiziert.", } @INPROCEEDINGS{Welz87:Simulation, AUTHOR="T. Welzel", TITLE="Simulation of a Multiple Token Ring Backbone (preliminary version)", BOOKTITLE="High Speed Local Area Networks IFIP", PAGES="103-117", YEAR=1987, REFERENCES=29, KEYWORDS="LAN; gateway; backbone network; simulation", ANNOTE="In the paper a model of a Multiple Token Ring Backbone interconnecting several LANs is introduced. Simulation results are presented according to the distinct workload characteristics of different application areas.", } @INPROCEEDINGS{Wood87:CAEDE, AUTHOR="C. M. Woodside and T. W. Pearce and R. J. A. Buhr", TITLE="The {CAEDE/ESTELLE} Graphical Tool for Formal Definition of Protocols", BOOKTITLE="Protocol Specification, Testing and Verification VI, IFIP 1987", PAGES="97-107", YEAR=1987, REFERENCES=6, KEYWORDS="ESTELLE; graphics; computer tool; structure; SDL; protocol specification", ANNOTE="A description is given of the way the tool is used and the resulting graphical representation. Issues raised by graphical specification are discussed, with reference also to the graphical version of the CCITT specification language SDL.", } @BOOK{Wins87:K, AUTHOR="P. H. Winston", TITLE="Künstliche Intelligenz", ISBN="3-925118-60-8", PUBLISHER="Addison-Wesley", ADDRESS="Bonn", PAGES="1-535", YEAR=1987, LANGUAGE="German", KEYWORDS="Artificial intelligence; expert system", ANNOTE="Der intelligente Computer; Beschreibungsvergleich und Zielreduktion; Ausnutzung natürlicher Beschränkungen; Die Erkundung von Alternativen; Kontrollmetaphern; Problemlösungsparadigmen; Die Räpresentation von Alltagswissen", } @ARTICLE{Pryc87:Performance, AUTHOR="M. de Prycker and M. de Somer", TITLE="Performance of a Service Independent Switching Network with Distributed Control", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1293-1301", YEAR=1987, REFERENCES=15, KEYWORDS="Fast packet switching; switching network; architecture; performance evaluation; multistage interconnection network; routing algorithm; path control", ANNOTE="This paper describes a switching network which is service inde- pendent and able to transport services of any bitrate, based on the fast packet switching concept. The control of the switching network is completely distributed; the path select is not centrally controlled, but gradually performed as the control packetis passing through the switching network. The switching network is a multistage network constructed with independent switching", } @ARTICLE{Peru87:Research, AUTHOR="G. Perucca and P. Belforte and E. Garetti and F. Perardi", TITLE="Research on Advanced Switching Techniques for the Evolution to {ISDN} and Broadband {ISDN}", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1356-1364", YEAR=1987, REFERENCES=10, KEYWORDS="Fast packet switching; switching network; architecture; multistage interconnection network; banyan network", ANNOTE="Switching techniques for packetized data and for video communi- cations are a key element in the evolution of the central officefrom IDN, to ISDN, and to broadband ISDN. An evolutionary scena-rio, based both on a short-term and on a long-term reference architecture for the switching system, is proposed, and two advanced switching techniques for labeled switching and for diffu-sve video switching, respectively, are analyzed which match", } @ARTICLE{Bono87:Approximate, AUTHOR="F. Bonomi", TITLE="An approximate analysis for a class of assembly-like queues", JOURNAL=qs, VOLUME=1, PAGES="289-309", YEAR=1987, REFERENCES=13, KEYWORDS="Queueing theory; synchronization; decomposition; approximation", ANNOTE="Assembly-like queues model assembly operatons where separate inpprocesses deliver different types of component (customer) and thservice station assembles (serves) these input requests only whecorrect mix of components (customers) is present at the input. In this work, we develop an effective approximate analytical solution. For an assembly-like queueing system with $n$ $(n>=2)$ classes of coforming $n$ independent Poisson arrival streams with rates $\lambda\_i$", } @ARTICLE{Armb87:Weiterentwicklung, AUTHOR="H. Armbrüster", TITLE="Weiterentwicklung der Telekommunikation: Universalnetz {Breitband-ISDN}", JOURNAL=ntz, ISBN="0027-707X", VOLUME=40, NUMBER=8, PAGES="564-569", YEAR=1987, LANGUAGE="German", REFERENCES=5, KEYWORDS="BISDN; broadband; intelligent network; service integration; development; introduction strategy; BTX; UNI; user network interface", } @ARTICLE{Bauw87:Versuchssystem, AUTHOR="J. G. Bauwens and M. de Prycker", TITLE="Versuchssystem für die Breitband-Kommunikation mit Asynchron-Zeitvielfachtechnik", JOURNAL="Elektrisches Nachrichtenwesen", ISBN="0013-5453", VOLUME=61, NUMBER=1, PAGES="123-130", YEAR=1987, LANGUAGE="German", REFERENCES=8, KEYWORDS="ATM; BISDN; switching system; test; network architecture; video coding; VBR; variable bitrate coding", } @INPROCEEDINGS{Hass87:Intelligent, AUTHOR="R. J. Hass and R. W. Humes", TITLE="Intelligent Network /2: A Network Architecture Concept for the 1990s", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", VOLUME=4, PAGES="944-951", YEAR=1987, REFERENCES=5, KEYWORDS="Public network; switching system; planning; architecture", } @ARTICLE{Huan87:Fault, AUTHOR="Chia-chi Huang and Wei-Peng Chen", TITLE="Fault-Tolerant Single-Stage Interconnection Networks", JOURNAL=ieeetc, ISBN="0018-9340", VOLUME="C-36", NUMBER=5, PAGES="637-640", YEAR=1987, REFERENCES=14, KEYWORDS="Interconnection network; fault tolerance; graph model; optimization; routing algorithm; multiprocessor system; parallel computing", } @ARTICLE{Brum87:Kommunikationssysteme, AUTHOR="K. Brummund", TITLE="Kommunikationssysteme in verteilten Steuerungen", JOURNAL=nte, ADDRESS="Berlin", VOLUME=5, PAGES="185-186", YEAR=1987, LANGUAGE="German", KEYWORDS="Data traffic; computer network", } @ARTICLE{Cram87:Messungen, AUTHOR="B. Cramer and D. Garthe", TITLE="Messungen des Einflusses einer langsamen simultanen Datenübertragung auf die Qualität der Sprachübertragung im digitalen Fernsprechkernsprechkanal", JOURNAL=ntzarchiv, VOLUME=9, NUMBER=8, PAGES="205-210", YEAR=1987, LANGUAGE="German", KEYWORDS="Gos", } @ARTICLE{Madk87:Packet, AUTHOR="M. A. Madkour", TITLE="Performance evaluation of packet-switched networks with retransmission due finite buffers and channel errors", JOURNAL="ieeproc\_F", VOLUME=134, NUMBER=1, PAGES="79-84", YEAR=1987, KEYWORDS="packet switching", } @ARTICLE{Akyi87:Mean, AUTHOR="Ian Akyildiz", TITLE="Mean value analysis of closed queueing networks with {Erlang} service time distributions", JOURNAL=comp, VOLUME=39, PAGES="219-232", NOTE="Fascicle 3", YEAR=1987, KEYWORDS="Queueing network; analysis", } @ARTICLE{Bake87:Polling, AUTHOR="J. Baker and I. Rubin", TITLE="Polling with a general-service order table", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=3, PAGES="283-288", YEAR=1987, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Beil87:Experimente, AUTHOR="H. Beilner and P. Buchholz and B. Müller-Clostermann", TITLE="Experimente mit Ersatzdarstellungen unter Berücksichtigung der Verweilzeitverteilung", JOURNAL="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", PUBLISHER="Springer Verlag", ADDRESS="Erlangen", VOLUME=154, PAGES="343-359", YEAR=1987, LANGUAGE="German", KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Bolc87:Funktionales, AUTHOR="G. Bolch and G. Fleischmann and R. Schreppel", TITLE="Ein funktionales Konzept zur Analyse von Warteschlangennetzen und Optimierung von Leistungsgrößen", JOURNAL="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", PUBLISHER="Springer-Verlag", ADDRESS="Erlangen", VOLUME=154, PAGES="327-342", YEAR=1987, LANGUAGE="German", KEYWORDS="Queueing network; analysis", } @ARTICLE{Bolc87:Softwaretools, AUTHOR="G. Bolch and G. Zeis", TITLE="Softwaretools zur Leistungsbewertung von Rechensystemen", JOURNAL=aninf, NUMBER=11, PAGES="470-480", YEAR=1987, LANGUAGE="German", KEYWORDS="Computer tool; performance evaluation", } @ARTICLE{Bond87:Decomposition, AUTHOR="A. B. Bondi", TITLE="Decomposition approaches to modelling {LAN} contention and host computer performance", JOURNAL=comcom, VOLUME=10, NUMBER=2, PAGES="70-78", YEAR=1987, } @ARTICLE{Boxm87:Pseudo, AUTHOR="O. J. Boxma and W. P. Groenendijk", TITLE="Pseudo-conservation laws in cyclic-service systems", JOURNAL=jap, VOLUME=24, NUMBER=4, PAGES="949-964", YEAR=1987, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Boxm8701:Waiting, AUTHOR="O. J. Boxma and Bernd Meister", TITLE="Waiting-time approximations in multi-queue systems with cyclic service", JOURNAL=pe, VOLUME=7, NUMBER=1, PAGES="59-70", YEAR=1987, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Boxm8704:Waiting, AUTHOR="O. J. Boxma and Bernd Meister", TITLE="Waiting-time approximations for cyclic-service systems with switchover times", JOURNAL=pe, VOLUME=7, NUMBER=4, PAGES="299-308", YEAR=1987, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Brem87:ISDN, AUTHOR="R. Bremer", TITLE="{ISDN-Benutzerteil} des Zeichengabesystems {CCITT} Nr.7", JOURNAL=nte, VOLUME=37, NUMBER=10, PAGES="376-378", YEAR=1987, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Budi87:Achieving, AUTHOR="P. S. Budihardjo and M. J. Langlois", TITLE="Achieving {SS7} network efficiency through node integration", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=3, PAGES="40.3 (1-8)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Chal87:ISDN, AUTHOR="A. Chalet and J. Ess Skinner", TITLE="{ISDN} transaction architecture for the System 12 digital exchange", JOURNAL=ec, ADDRESS="Paris", VOLUME=61, NUMBER=1, PAGES="50-56", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Chow87:CCITT, AUTHOR="T. S. Chow and M. A. Gauldin and B. H. Hornbach and D. A. Ljung", TITLE="{CCITT} signalling system No. 7: The backbone for intelligent network services", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=3, PAGES="40.1 (1-5)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Clos87:Main, AUTHOR="M. Clost and A. Vomscheid", TITLE="Main characteristics of the {ISDN}", JOURNAL="Commutation and transmission", VOLUME=9, NUMBER=3, PAGES="19-34", YEAR=1987, KEYWORDS="ISDN", } @ARTICLE{Coll87:CCITT, AUTHOR="P. Collet and J. Craveur and P. Lucas and F. Lanquetot and J. Botherel", TITLE="Introduction of {CCITT} No. 7: signaling system into French exchanges", JOURNAL="Commutation and transmission", VOLUME=5, NUMBER=3, PAGES="5-24", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Coop87:Queues, AUTHOR="R. B. Cooper", TITLE="Queues with ordered servers that work at different rates: An exact analysis of a model solved approximately by others", JOURNAL=pe, VOLUME=7, NUMBER=2, PAGES="147-149", YEAR=1987, } @INCOLLECTION{Mora87:Waiting, AUTHOR="L. de Moraes and A. N. L. Valverde", TITLE="Waiting-time analysis of a reservation access-control scheme with message-based priorities", BOOKTITLE="Data Communication Systems and their Performance", EDITOR="L. T. M. and Christopher Carothers", PUBLISHER="North-Holland", PAGES="283-296", YEAR=1987, KEYWORDS="Queueing system; priority; analysis", } @TECHREPORT{Denz87:Untersuchungen, AUTHOR="W. Denzel", TITLE="Untersuchungen zu Vermittlungssystemen mit verteilter Steuerung", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universiät Stuttgart", ADDRESS="Stuttgart, Germany", NUMBER=42, YEAR=1987, LANGUAGE="German", } @ARTICLE{Souz87:Approximate, AUTHOR="E. de Souza and R. R. Muntz", TITLE="Approximate solutions for a class of non-product form queueing network models", JOURNAL=pe, VOLUME=7, NUMBER=3, PAGES="221-242", YEAR=1987, KEYWORDS="Queueing network; analysis", } @ARTICLE{Devr87:Simple, AUTHOR="L. Devroye", TITLE="A simple generator for discrete log-concave distributions", JOURNAL=comp, VOLUME=39, NUMBER=1, PAGES="87-91", YEAR=1987, KEYWORDS="random variate generation", } @INPROCEEDINGS{Dist87:Impact, AUTHOR="P. Distler and J. M. Bernard", TITLE="The impact of signalling system Nr. 7 on the evolution of services in the French network", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=3, PAGES="40.4 (1-5)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Duda87:Fork, AUTHOR="A. Duda and T. Czacherski", TITLE="Performance evaluation of fork and join synchronization primitives", JOURNAL=acta, VOLUME=24, NUMBER=5, PAGES="525-553", YEAR=1987, KEYWORDS="Queueing network; analysis", } @INPROCEEDINGS{Eveq8703:Reassembly, AUTHOR="C. Evequoz and C. Tropper", TITLE="On reassembly delay in packet-switching networks", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="971-980 (TH3B.3)", MONTH="March/April", YEAR=1987, } @ARTICLE{Fisc87:ZGS, AUTHOR="N. Fischer", TITLE="{ZGS} {CCITT} Nr.7 als Basis des {ISDN-Universalnetzes}", JOURNAL=ntz, VOLUME=40, NUMBER=8, PAGES="580-585", YEAR=1987, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Font87:Models, AUTHOR="B. Fontana and M. Villen-Altamirano and G. H. Petit", TITLE="Models and tools for evaluating the traffic handling performance of System 12 {ISDN} exchanges", JOURNAL=ec, ADDRESS="Paris", VOLUME=61, NUMBER=1, PAGES="104-109", YEAR=1987, KEYWORDS="Switching system; ISDN; performance evaluation", } @ARTICLE{Fran87:Really, AUTHOR="R. Franck", TITLE="Who really does need {ISDN?}", JOURNAL=cnis, VOLUME=14, NUMBER="2-5", PAGES="331-337", YEAR=1987, KEYWORDS="ISDN", } @ARTICLE{Fran87:Trends, AUTHOR="V. Frantzen", TITLE="Trends in the development of public telecommunication networks", JOURNAL=cnis, VOLUME=14, NUMBER="2-5", PAGES="339-358", YEAR=1987, KEYWORDS="ISDN", } @ARTICLE{Fren87:ISDN, AUTHOR="K. J. Frensch", TITLE="{ISDN} -- weltweite Innovation mit Zukunft", JOURNAL=siemenstr, VOLUME=10, NUMBER=5, PAGES="264-271", YEAR=1987, LANGUAGE="German", KEYWORDS="ISDN", } @ARTICLE{Fret87:CCITT, AUTHOR="K. G. Fretten and C. K. Davies", TITLE="{CCITT} signalling system No. 7 in British Telecom's network", JOURNAL=bte3, VOLUME=6, PAGES="160-162", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @BOOK{Gele87:Queueing, AUTHOR="E. Gelenbe and", TITLE="Introduction to Queueing Networks", PUBLISHER="John Wiley and Sons Limited", ADDRESS="Chichester", YEAR=1987, KEYWORDS="Queueing network; analysis", } @TECHREPORT{Gihr87:Dynamische, AUTHOR="O. Gihr and G. Willmann", TITLE="Dynamische Datenstrukturen zur effizienten Simulation komplexer Verkehrsmodelle", INSTITUTION="Interner Bericht Fachbereich Informatik IV, Unversität Dortmund, (Hrsg. J. Mäter)", ADDRESS="Dortmund", PAGES="56-65", YEAR=1987, LANGUAGE="German", KEYWORDS="Simulation", } @ARTICLE{Glyn87:Sufficient, AUTHOR="P. W. Glynn and W. Whitt", TITLE="Sufficient conditions for functional-limit-theorem versions of {L=W}", JOURNAL=qs, VOLUME=1, PAGES="279-287", YEAR=1987, KEYWORDS="Queueing theory; Little's formula", } @ARTICLE{Goya87:Modeling, AUTHOR="A. Goyal and S. S. Lavenberg", TITLE="Modeling and analysis of computer system availability", JOURNAL=ibmjrd, VOLUME=31, NUMBER=6, PAGES="651-664", YEAR=1987, } @ARTICLE{Hack87:Implications, AUTHOR="K.-D. Hackbarth", TITLE="Implications of the {ISDN-concept} on telecommunication network planning", JOURNAL=cnis, VOLUME=13, NUMBER="4-5", PAGES="269-274", YEAR=1987, KEYWORDS="ISDN; network planning", } @ARTICLE{Heid87:Common, AUTHOR="A. Heidermark and P. Hemrin", TITLE="Common channel signalling widens boundaries", JOURNAL=tele, VOLUME=31, NUMBER=1, PAGES="10-13", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Hsia87:Optimal, AUTHOR="M. Hsiao and Aurel A. Lazar", TITLE="Optimal flow control of multi-class queueing networks with decentralized information", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="652-661", YEAR=1987, KEYWORDS="Communication network; window mechanism; flow control", } @ARTICLE{Hsie87:Two, AUTHOR="C.-T. Hsieh and S. S. Lam", TITLE="Two classes of performance bounds for closed queueing networks", JOURNAL=pe, VOLUME=7, NUMBER=1, PAGES="3-30", YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Kauf8703:Management, AUTHOR="R. Kaufman", TITLE="Network management performance model", BOOKTITLE=infocom, ADDRESS="San Francisco", PAGES="106-111 (T1D.1)", MONTH="March/April", YEAR=1987, } @TECHREPORT{Kies87:Architektur, AUTHOR="W. M. Kiesel", TITLE="Architektur und Verkehrsleistung eines lokalen Netzes mit Busstruktur und einem kollisionsarmen Vielfach-Zugriffsprotokoll", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", NUMBER=41, YEAR=1987, LANGUAGE="German", } @INPROCEEDINGS{Koll87:Exploiting, AUTHOR="M. A. Kollmorgen and P. R. Miller and R. L. Simms", TITLE="Exploiting the power of common channel signaling system No. 7: Network capabilities and new signaling network switching technology", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", PAGES="1-6 (paper 2)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Krze87:Multiclass, AUTHOR="A. Krzesinski", TITLE="Multiclass queueing networks with state-dependent routing", JOURNAL=pe, VOLUME=7, NUMBER=2, PAGES="125-143", YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Kühn87:Modelling, AUTHOR="P. J. Kühn and G. Willmann", TITLE="Modelling of the common channel signalling network for {ISDN}", BOOKTITLE="Abstracts of the ORSA/TIMS Special Interest Conference on Queueing Networks and their Applications", ADDRESS="New Brunswick", NOTE="(extended abstract)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Lamy87:CCS, AUTHOR="J. Lamy and Jan Olivier and J. C. Pennanec'h", TITLE="{CCS} Nr. 7 transfer point", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", VOLUME=1, PAGES="1-7 (B2.5)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Laws87:Common, AUTHOR="J. J. Lawser and P. L. Oxley", TITLE="Common channel signaling network evolution", JOURNAL=atttj, VOLUME=66, NUMBER=3, PAGES="13-20", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Lazz87:Carrying, AUTHOR="A. Lazzari", TITLE="Carrying user data over a signalling network", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=3, PAGES="40.6 (1-5)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Lehm87:Leistungsanalyse, AUTHOR="A. Lehmann and H. Szczerbicka", TITLE="Leistungsanalyse mit {INT3:} Einer interaktiven, intelligenten und integrierten {PC-Modellierungsumgebung}", EDITOR="U. Herzog and Christopher Carothers", JOURNAL="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", ADDRESS="Erlangen", VOLUME=154, PAGES="279-293", YEAR=1987, LANGUAGE="German", KEYWORDS="Computer tool; performance evaluation", } @INPROCEEDINGS{Liu87:Throughput, AUTHOR="Y. Liu", TITLE="A throughput analysis of {SDLC/HDLC} link level protocols", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=1, PAGES="6.6 (1-8)", YEAR=1987, KEYWORDS="Performance evaluation; link layer; HDLC", } @TECHREPORT{Mail87:Queueing, AUTHOR="D. Mailles and S. Fdida", TITLE="Queueing systems with flag mechanisms", TYPE="MASI Rapport de Recherche", INSTITUTION="Universite de Pierre et Marie Curie, Paris, Juin", ADDRESS="Paris", NUMBER=184, PAGES="1-24", YEAR=1987, } @INPROCEEDINGS{Mats87:Go, AUTHOR="T. Matsui and Yutaka Takahashi and Toshiharu Hasegawa", TITLE="Performance analysis of {go-back-N} {ARQ} with limited receiving buffer", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=1, PAGES="6.7 (1-5)", YEAR=1987, KEYWORDS="Performance evaluation; link layer; ARQ", } @INPROCEEDINGS{McKe87:New, AUTHOR="J. McKenna", TITLE="A new proof and a tree algorithm for {RECAL}", BOOKTITLE="Performance", EDITOR="P.-J. Courtois and G. Latouche", ADDRESS="Brussels, Belgium", PAGES="3-16", YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Mull87:Synchronized, AUTHOR="B. Müller-Clostermann and G. Rosentreter", TITLE="Synchronized queueing networks: Concepts, examples and evaluation techniques", EDITOR="U. Herzog and Christopher Carothers", JOURNAL="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", ADDRESS="Erlangen", VOLUME=154, PAGES="176-191", YEAR=1987, KEYWORDS="Queueing network; analysis", } @INPROCEEDINGS{Naka87:Enlarging, AUTHOR="A. Nakajima and H. Sawada and N. Shinagawa", TITLE="Enlarging technologies based on No. 7 signalling system for mobile communication network", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=3, PAGES="40.5 (1-6)", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @TECHREPORT{Nels87:Expected, AUTHOR="Randolph D. Nelson", TITLE="Expected Response Time for a {FCFS} Feedback Queue with Multiple Classes", INSTITUTION="IBM Research Report RC-13221, Yorktown Heights, New York, Oct.", ADDRESS="Yorktown Heights", PAGES="1-15", YEAR=1987, } @ARTICLE{Anon87:ISDN, AUTHOR="Anonymous", TITLE="{ISDN-Begriffe}", JOURNAL=ntz, VOLUME=40, NUMBER=11, PAGES="814-819", YEAR=1987, LANGUAGE="German", KEYWORDS="ISDN; standardization", } @ARTICLE{Anon87:Integrated, AUTHOR="Anonymous", TITLE="Integrated Services Digital Network", JOURNAL=ec, ADDRESS="Paris", VOLUME=61, NUMBER=1, YEAR=1987, KEYWORDS="ISDN", } @ARTICLE{Ott87:Single, AUTHOR="Teunis Ott", TITLE="The single-server queue with independent {GI/G} and {M/G} input streams", JOURNAL=aap, VOLUME=19, NUMBER=1, PAGES="266-286", YEAR=1987, } @ARTICLE{Pomb87:Ada, AUTHOR="G. Pomberger and E. Wallmüller", TITLE="Ada und Modula-2 -- ein Vergleich", JOURNAL=infspec, VOLUME=10, NUMBER=4, PAGES="181-191", YEAR=1987, LANGUAGE="German", KEYWORDS="ADA; Modula-2", } @TECHREPORT{Rait87:Leistungsuntersuchung, AUTHOR="T. Raith", TITLE="Leistungsuntersuchung von Multi-Bus-Verbindungsnetzwerken in lose gekoppelten Systemen", TYPE="Bericht über verkehrstheoretische Arbeiten", INSTITUTION="Institut für Nachrichtenvermittlung und Datenverarbeitung, Universität Stuttgart", ADDRESS="Stuttgart, Germany", NUMBER=43, YEAR=1987, LANGUAGE="German", KEYWORDS="Interconnection network", } @ARTICLE{Romp87:Aspekte, AUTHOR="K. Römpler", TITLE="Aspekte bei der Realisierung der Ebene-3-Funktionen des Zeichengabesystems {CCITT} Nr.7", JOURNAL=nte, VOLUME=37, NUMBER=10, PAGES="374-376", YEAR=1987, LANGUAGE="German", KEYWORDS="Signalling; common channel; CCS", } @BOOK{Schw87:TeX, AUTHOR="N. Schwarz", TITLE="Einführung in TeX.", PUBLISHER="Addison-Wesley Publishing Company", ADDRESS="Bonn", YEAR=1987, LANGUAGE="German", } @ARTICLE{Shan8707:Stochastic, AUTHOR="J. G. Shanthikumar and D. D. Yao", TITLE="Stochastic monotonicity of the queue lengths in closed queueing networks", JOURNAL=or, VOLUME=35, NUMBER=4, PAGES="583-588", MONTH="July/August", YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @INCOLLECTION{Skoo87:Engineering, AUTHOR="R. A. Skoog", TITLE="Performance and engineering of common channel signaling networks supporting {ISDN}", BOOKTITLE="North-Holland Studies in Telecommunication", EDITOR="M. Bonatti and Christopher Carothers", PUBLISHER="North-Holland, Amsterdam", VOLUME=9, PAGES="415-424", YEAR=1987, KEYWORDS="Signalling; common channel; CCS; performance evaluation", } @INPROCEEDINGS{Stan8703:Approach, AUTHOR="W. P. Standish and B. R. Hurley", TITLE="Approach to dimensioning analysis of Telecom Canada's {CCS7} network", BOOKTITLE=infocom, ADDRESS="San Francisco, California", PAGES="117-123 (T1D.3) (paper 3)", MONTH="March/April", YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INCOLLECTION{Taka87:Queueing, AUTHOR="H. Takagi", TITLE="A survey of queueing analysis of polling models", BOOKTITLE="Data Communication Systems and their Performance", EDITOR="L. T. M. and Christopher Carothers", PUBLISHER="North-Holland, Amsterdam", PAGES="277-295", YEAR=1987, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Totz87:Kopplung, AUTHOR="G. Totzauer", TITLE="Kopplung der Kettendurchsätze in geschlossenen Warteschlangennetzwerken", EDITOR="U. Herzog and Christopher Carothers", JOURNAL="Informatik-Fachberichte Messung, Modellierung und Bewertung von Rechensystemen", ADDRESS="Erlangen", VOLUME=154, PAGES="360-374", YEAR=1987, LANGUAGE="German", KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Wink87:ISDN, AUTHOR="L. Winkler and L. Rettelbusch", TITLE="{ISDN-Konzepte}", JOURNAL=nte, VOLUME=37, NUMBER=10, PAGES="368-374", YEAR=1987, LANGUAGE="German", KEYWORDS="ISDN", } @ARTICLE{Wood87:Application, AUTHOR="A. Woodcock", TITLE="Towards the application of {OSI} standards", JOURNAL=cnis, VOLUME=14, NUMBER="2--5", PAGES="291-295", YEAR=1987, KEYWORDS="Osi", } @INPROCEEDINGS{Worr87:Virtual, AUTHOR="E. M. Worrall", TITLE={Virtual network capabilities -- the next phase of the "Intelligent Network"}, BOOKTITLE=globecom, VOLUME=3, PAGES="40.2 (1-4)", YEAR=1987, KEYWORDS="Intelligent network", } @ARTICLE{Ches87:Protocol, AUTHOR="G. L. Chesson", TITLE="The Protocol Engine Project", JOURNAL=unixr, VOLUME=5, NUMBER=9, PAGES="70-77", YEAR=1987, KEYWORDS="Transport protocol", } @ARTICLE{Kauf87:High, AUTHOR="F.-J. Kauffels", TITLE="High Speed Local Area Networks", JOURNAL=datacom, VOLUME=6, PAGES="68-72/108-111", YEAR=1987, LANGUAGE="German", REFERENCES=14, KEYWORDS="HSLAN; MAN; FDDI", ANNOTE="The paper presents an overview on MAN research. FDDI and DATApipe are described.", } @TECHREPORT{Klei87:Comparison, AUTHOR="R. Kleinewillinghöfer-Kopp and E. Wollner", TITLE="Comparison of Access Control Strategies for {ISDN-Traffic} on Common Trunk Groups", INSTITUTION="Research Institute of the Deutsche Bundespost", ADDRESS="Darmstadt", YEAR=1987, KEYWORDS="ISDN; routing", } @INPROCEEDINGS{Masu87:Multimedia, AUTHOR="Masunaga", TITLE="Multimedia Databases --- A Formal Framework", BOOKTITLE="IEEE Computer Society Office Automation Symposium 1987", YEAR=1987, KEYWORDS="multimedia", } @INPROCEEDINGS{Smit87:Intermedia, AUTHOR="Kate Smith and S. Zdonik", TITLE="Intermedia --- A Case Study of the Differences Between Relational and {O-ODB} Systems", BOOKTITLE="OOPSLA", PAGES="452-465", YEAR=1987, KEYWORDS="multimedia", } @BOOK{Cher87:VMTP, AUTHOR="D. R. Cheriton", TITLE="{VMTP:} Versatile Message Transaction Protocol", PUBLISHER="Computer Science Department, Stanford University", ADDRESS="Stanford, CA", NOTE="Preliminary Version 0.3", YEAR=1987, } @ARTICLE{Farb8701:Observations, AUTHOR="D. Farber and L. N. Cassel", TITLE="Some Observations on the Performance of a 56 Kbit {Internet} Link", JOURNAL=ccr, VOLUME=17, NUMBER="1 \\& 2", PAGES="35-47", MONTH="January/April", YEAR=1987, } @ARTICLE{Farr87:Visual, AUTHOR="E. J. Farrell", TITLE="Visual Interpretation of Complex Data", JOURNAL=ibmsj, VOLUME=26, NUMBER=2, PAGES="174-200", YEAR=1987, } @ARTICLE{Flei87:ISO, AUTHOR="A. Fleischmann and S. T. Chin and W. Effelsberg", TITLE="Specification and Implementation of an {ISO} Session Layer", JOURNAL=ibmsj, VOLUME=26, NUMBER=3, PAGES="255-275", YEAR=1987, } @ARTICLE{Gold87:Data, AUTHOR="B. C. Goldstein and Joseph Jaffe", TITLE="Data Communications: The Implications of Communication Systems for Protocol Design", JOURNAL=ibmsj, VOLUME=26, NUMBER=1, PAGES="122-137", YEAR=1987, } @ARTICLE{Gree87:Prospects, AUTHOR="David Green and D. N. Godard", TITLE="Prospects and Design Choices for Integrated Private Networks", JOURNAL=ibmsj, VOLUME=26, NUMBER=1, PAGES="37-54", YEAR=1987, } @ARTICLE{Gree87:Perspective, AUTHOR="P. E. Green and R. J. Chappuis and Joseph Fisher and P. S. Frosch and", TITLE="A Perspective on Advanced Peer-to-Peer Networking", JOURNAL=ibmsj, VOLUME=26, NUMBER=4, PAGES="414-428", YEAR=1987, } @TECHREPORT{Hase87:Architecture, AUTHOR="Jonathan S. Turner Kurt Haserodt", TITLE="An Architecture for Connection Management in a Broadcast Packet Network", INSTITUTION="Washington University", ADDRESS="St. Louis, MO 63130", NUMBER="WUCC-87-3", NOTE="DRAFT", YEAR=1987, } @UNPUBLISHED{Lai87:Leaky, AUTHOR="W. S. Lai", TITLE="The Leaky Bucket Algorithm for Throughput Control in Packet Networks", NOTE="Bellcore", YEAR=1987, } @INBOOK{Mean87:Run, AUTHOR="B. Meandzija", TITLE="On the Run-Time Specification of Protocol Architectures", PUBLISHER="Elsevier Science Publishers", PAGES="413-424", YEAR=1987, } @ARTICLE{Sche87:Structures, AUTHOR="A. L. Scherr", TITLE="Structures for Networks of Systems", JOURNAL=ibmsj, VOLUME=26, NUMBER=1, PAGES="4-12", YEAR=1987, } @ARTICLE{Schu87:Message, AUTHOR="T. E. Schutt and J. B. Staton I. I. I and W. F. Racke", TITLE="Message-Handling Systems Based on the {CCITT} {X.400} Recommendations", JOURNAL=ibmsj, VOLUME=26, NUMBER=3, PAGES="235-254", YEAR=1987, } @UNPUBLISHED{Sinc87:Algorithms, AUTHOR="W. Sincoskie and C. Cotton", TITLE="Algorithms for Adaptive Routing in Communications Networks", NOTE="Bellcore", YEAR=1987, } @MANUAL{Spec87:Guide, AUTHOR="A. Z. Spector and K. R. Swedlow", TITLE="Guide to the Camelot Distributed Transaction Facility", EDITION="0.4(27a)", ORGANIZATION="Carnegie-Mellon University", ADDRESS="Pittsburgh, PA", NOTE="Release 1", YEAR=1987, } @ARTICLE{Sult87:Implementing, AUTHOR="R. A. Sultan and Parviz Kermani and G. A. Grover and T. P. Barzilai and A. E. Baratz", TITLE="Implementing System/36 Advance Peer-to-Peer Networking", JOURNAL=ibmsj, VOLUME=26, NUMBER=4, PAGES="429-452", YEAR=1987, } @ARTICLE{Sund87:SNA, AUTHOR="R. J. Sundstrom and J. B. Staton I. I. I and Gary D. Schultz and M. L. Hess and Jr. Deaton and L. J. Cole and R. M. Amy", TITLE="{SNA:} Current Requirements and Direction", JOURNAL=ibmsj, VOLUME=26, NUMBER=1, PAGES="13-36", YEAR=1987, } @ARTICLE{Sy87:OSI, AUTHOR="K. K. Sy and M. O. Shiobara and M. Yamaguchi and Y. Kobayashi and S. Shukuya and T. Tomatsu", TITLE="{OSI-SNA} Interconnections", JOURNAL=ibmsj, VOLUME=26, NUMBER=2, PAGES="157-173", YEAR=1987, } @ARTICLE{Toma8701:OSI, AUTHOR="J. G. Tomas and J. Pavon and O. Pereda", TITLE="{OSI} Service Specification: {SAP} and {CMEP} Modelling", JOURNAL=ccr, VOLUME=17, NUMBER="1 \\& 2", PAGES="48-70", MONTH="January/April", YEAR=1987, } @TECHREPORT{Turn87:Challenge, AUTHOR="J. S. Turner", TITLE="The Challenge of Multipoint Communication", INSTITUTION="Washington University", ADDRESS="St. Louis, MO 63130", NUMBER="WUCS-87-6", NOTE="DRAFT", YEAR=1987, } @TECHREPORT{Wein87:Decentralized, AUTHOR="A. Weinrib and G. Gopal", TITLE="Decentralized Resource Allocation for Distributed Systems", INSTITUTION="Bell Communications Research, Inc.", NOTE="DRAFT", YEAR=1987, } @ARTICLE{Acam8711:Terabit, AUTHOR="A. S. Acampora and Mark Karol and M. G. Hluchyj", TITLE="Terabit Lightwave Networks: The Multihop Approach", JOURNAL=atttj, VOLUME=66, NUMBER=6, PAGES="21-34", MONTH="November/December", YEAR=1987, } @BOOK{Slom87:Distributed, AUTHOR="M. Sloman and J. Kramer", TITLE="Distributed Systems and Computer Networks", ISBN="0-13-215849-3", PUBLISHER="Prentice-Hall", YEAR=1987, } @TECHREPORT{Wilb87:Distributed, AUTHOR="S. R. Wilbur and P. J. M. Polkinghorne", TITLE="Distributed Robust Filestore", TYPE="Internal Note", INSTITUTION="University College London", YEAR=1987, ABSTRACT="Gives description of DRFS and possible transactions supported by it.", } @ARTICLE{Ackl87:Empirical, AUTHOR="David H. Ackley", TITLE="An Empirical Study of Bit Vector Function Optimization", JOURNAL="Genetic Algorithms and Simulated Annealing", PAGES="Pitman", YEAR=1987, } @TECHREPORT{Adam87:Evolutionary, AUTHOR="H. P. Adams", TITLE="Evolutionary strategies applied to search (interim report)", TYPE="private paper", INSTITUTION="University College London", YEAR=1987, } @ARTICLE{Belw8702:Comparison, AUTHOR="A. S. Belward and A. Hoyos", TITLE="A comparison of supervised maximum likelihood and descision tree classification for crop cover estimation from multitemporal {LANDSAT} {MSS} data", JOURNAL=remote, VOLUME=8, NUMBER=2, PAGES="229-235", YEAR=1987, } @TECHREPORT{Boyc87:Relational, AUTHOR="Jill Boyce and J. Feng", TITLE="Relational cycle homomorphisms and object recognition", TYPE="Private paper", INSTITUTION="WheatStone Lab, Kings College", YEAR=1987, ABSTRACT="An invariance property of cycles on n-array relations is used to define pruning operations on the unit-label search tree corresponding to object recognition. Application is made to a test library of polyhedral edge segment models.", } @INPROCEEDINGS{Brid87:Reproduction, AUTHOR="C. L. Bridges and D. Goldberg", TITLE="An analysis of reproduction and crossover in a binary coded genetic algorithm", BOOKTITLE="conference of Genetic Algorithms", PAGES="9-13", YEAR=1987, ABSTRACT="The foundation of GA theory, the so called schema theorem of GAs provide a lower bound on the expected number of representatives of a particular schema (similarity subset) in the next generation of various genetic algorithm. In this paper assuming a large population of binary haploid structures of known distribution processed by fitness proportionate reproduction, random mating and random, single point crossover, an exact expression for the expected proportion of a particular string in the next generation is calculated. The derivation is useful in analysing the expected performance of simple GAs.", } @ARTICLE{Carp87:Massively, AUTHOR="G. A. Carpenter and S. Crossberg", TITLE="A massively parallel architecture for a self-organizing neural pattern recognition machine", JOURNAL="CVGIP", VOLUME=37, PAGES="54-115", YEAR=1987, ABSTRACT="A neural network architecture for the learning of recognition categories is derived. Real time network dynamics are completely characterised through mathematical analysis and computer simulations. The architecture embodies a search scheme which updates itself adaptively as the learning process unfolds. The architecture pocesses a context-senstive self scaling property which enables its emergent critical feature patterns to form.", } @ARTICLE{Chen87:Statistical, AUTHOR="Chi-Ming Chen", TITLE="Statistical pattern recognition - early developments and recent progress", JOURNAL=pattern_ai, VOLUME="1 (1)", PAGES="43-51", YEAR=1987, ABSTRACT={A good review {"}The tree classifier is probably the best engineering approach to classification especially when the feature dimension or the number of pattern classes is large as experienced in remote sensing{"}}, } @INPROCEEDINGS{Clax87:Use, AUTHOR="P. R. Claxton and E. K. Y. Kwok", TITLE="The use of colour to segment and label images.", BOOKTITLE="3rd Alvey Vision Conference", ADDRESS="Cambridge", PAGES="295-302", YEAR=1987, ABSTRACT="The application of spectral information to image segmentation is examined, with an approach to colour manipulation being described. A transformation from red/green/blue space to intensity/ saturation/hue is advocated using a triangular polar space to reduce non-linearity. A colour orientated edge detector is described for this space. The methodology is illustrated with two applications, the reading of colour codes on resistors and the segmentation of vehicles within natural scenes.", } @ARTICLE{Cohe87:Simple, AUTHOR="F. S. Cohen and D. B. Cooper", TITLE="Simple parallel hierarchical and relaxation algorithms for segmenting noncausal Markhovian random fields", JOURNAL=ieeepami, VOLUME=9, PAGES="195-219", YEAR=1987, ABSTRACT="Adaptive image segmentation, image modelling, Markhovian random fields, maximum likelihood segmentation, parallel relaxation segmentation, textured image segmentation, texture model parameter estimation, 2D binary processes, 2D Gaussian processes.", } @ARTICLE{Deri8701:Modelling, AUTHOR="H. Derin and H. Elliot", TITLE="Modelling and segmentation of noisy and textured images using Gibb's random fields", JOURNAL=ieeepami, VOLUME=9, NUMBER=1, PAGES="39-55", YEAR=1987, ABSTRACT="The paper presents a new approach to the use of Gibb's distributions (GD) for modelling and segmentation of noisy and textured images. Specifically the paper presents random field models for noisy and textured image data based upon a heirarchy of GD. It then presents dynamic programming based segmentation algorithms for $n$ and $t\_i$, considering a statistical maximum a posteriori (MAP) criterion. Due to computational concerns however suboptimal versions of the algorithm are devised through simplifying approximations in the model. Since model parameters are needed for th esegmentation algorithm, a new parameter estimation technique is developed for estimating the parameters in a GD. Finally a number of examles are presented which show the usefullness of the Gibbsian model and the effectiveness of the segmentation algorithms and parameter estimation procedures.", } @BOOK{Eale87:Dynamic, AUTHOR="P. Eales", TITLE="Dynamic programming for linear feature matching", PUBLISHER="Internal report, Dept. Photogrammetry and Surveying, UCL.", YEAR=1987, ABSTRACT="Modifications to classical dynamic programming are described, enabling the technique to be used for linear image feature matching. The modifications are due to Maitre and Wu (1985,1986). The algorithm will be implemented on the IBM AT/370 as an IAX function in PL/1, and plans for this implementation are outlined.", } @BOOK{East87:Proposed, AUTHOR="S. Easterbrook", TITLE="A proposed learning system to derive heuristics for a network manager", PUBLISHER="Dept Comp Sci. UCL, Internal note 2183", YEAR=1987, KEYWORDS="TCP; performane maximisation; adaptation; neuron net.", } @INPROCEEDINGS{Flec87:Representing, AUTHOR="M. M. Fleck", TITLE="Representing space for practical reasoning.", BOOKTITLE="3rd Alvey Vision Conference", ADDRESS="Cambridge", PAGES="275-284", YEAR=1987, ABSTRACT="Describes a new approach for representing space and time for practical reasoning, based on space filling cells. Unlike $R^n$, the new models can be manipulated directly. Unlike $Z^n$, they have useful notions of function continuity anf connectedness. The topology of space is allowed to depend on the situation being represented, accounting for sharp changes in function values and lack of connectedness across object boundaries.", } @INCOLLECTION{Gema87:Locating, AUTHOR="D. Geman and S. Geman and C. Graffigne", TITLE="Locating texture and object boundaries", BOOKTITLE="Pattern recognition theory and applications, NATO ASI Series, Vol F30", EDITOR="P. A. Devijver and J. Kittler", PUBLISHER="Springer-Verlag", ADDRESS="Berlin Heidelberg", YEAR=1987, } @ARTICLE{Gema8702:Stachastic, AUTHOR="D. Geman", TITLE="Stachastic model for boundary detection", JOURNAL=image, VOLUME=5, NUMBER=2, PAGES="61-65", YEAR=1987, } @INPROCEEDINGS{Godd87:Alvey, AUTHOR="R. J. Godden and J. A. Fullwood and J. Hyde", TITLE="Alvey {MMI-007} vehicle exemplar: Image segmentation and attribute generation", BOOKTITLE="3rd Alvey Vision Conference", ADDRESS="Cambridge", PAGES="5-13", YEAR=1987, } @INPROCEEDINGS{Gold87:Genetic, AUTHOR="D. Goldberg and J. Richardson", TITLE="Genetic algorithms with sharing for multi-modal function optimisation", BOOKTITLE="2nd International Conference on Genetic Algorithms and Their Applications", PAGES="41-", YEAR=1987, } @INPROCEEDINGS{Gold87:Function, AUTHOR="D. Goldberg and R. E. Smith", TITLE="Non-stationary function optimisation using Genetic Algorithms with dominance and diploidy.", BOOKTITLE="2nd International Conference on Genetic Algorithms and Their Applications", PAGES="59-68", YEAR=1987, } @BOOK{Hard87:Workshop, AUTHOR="J. R. Hardy and others", TITLE="Workshop on contextual classification of remotely sensed data", PUBLISHER="NERC, University of Reading", YEAR=1987, } @ARTICLE{Ince8712:Maximum, AUTHOR="F. Ince", TITLE="Maximum likelihood classification, optimal or problimatic? A comparison with the nearest neighbour clasification", JOURNAL=remote, VOLUME=8, NUMBER=12, PAGES="1829-1838", YEAR=1987, } @ARTICLE{Jone87:Back, AUTHOR="W. P. Jones and J. Hoskins", TITLE="Back-propagation: a generalised delta learning rule", JOURNAL=byte, VOLUME="October", PAGES="155-162", YEAR=1987, } @ARTICLE{Josi87:Neural, AUTHOR="G. Josin", TITLE="Neural-network heuristics", JOURNAL=byte, VOLUME="October", PAGES="183-192", YEAR=1987, ABSTRACT="Three heuristic algorithms that learn from experience.", } @ARTICLE{Kala8703:Stochastic, AUTHOR="H. M. Kalayeh and D. A. Landgrebe", TITLE="Stochastic model utilizing spectral and spatial characteristics", JOURNAL=ieeepami, VOLUME=9, NUMBER=3, PAGES="457-461", YEAR=1987, ABSTRACT="In remote sensing, because of physical properties of targets, sensor pixels in spatial proximity to one another are class conditionally correlated. Our main objective is to exploit this spatial correlation. Therefore, a 2D causal first order Markov model was used to exttract the spatial and spectral information and, based upon it new object classifiers with improved performance were developed. First the minimum distance (mt) and the maximum likelihood (ml) object classifiers are discussed. Then based on th eproposed model, these 2 classifiers are modified and a linear object classifier is introduced. Finally, experimental results are presented.", } @INPROCEEDINGS{Kani87:Adaptive, AUTHOR="B. Kani and M. J. B. Wilson", TITLE="Adaptive windows for texture discrimination", BOOKTITLE="3rd Alvey Vision Conference", PAGES="251-257", YEAR=1987, } @ARTICLE{Kris8704:Discriminant, AUTHOR="T. Krishnan and S. C. Nandy", TITLE="Discriminant analysis with a stochastic supervisor", JOURNAL=pattern, VOLUME=20, NUMBER=4, PAGES="379-384", YEAR=1987, ABSTRACT="We consider the problem of linear discriminant analysis for 2 p-variate normal distributions with a common covariance matrix, where the initial sample classification is done stochastically. Assuming a Beta model for this classification variable and its independence of the observed variable for each group, we derive the EM algorithm for maximum likelihood estimation of the parameters. The EM algorithm. Parameters $m,n$ permit a sliding scale of regimes, from supervised to non-supervised. concerned with ``what if the labels are only probabilistic''. Note that no consideration of spatial aspects is made (i.e., no use of context). Normal distributions are used.", } @TECHREPORT{Koza87:Proposals, AUTHOR="Y. Kozato", TITLE="Proposals for the design of ``general-purpose'' image processing system", TYPE="Internal note", INSTITUTION="UCL", NUMBER=2199, YEAR=1987, ABSTRACT="This document introduces current status and future development of the research subject on ``general-purpose'' image processing system. Although a number of image processing software and hardware have been developed, there are hardly any good systems to perform image processing tasks efficiently. This is because not only of the nature of the work which deals with ill-understood substance, ``images'', but lack of philosophy and effort to integrate various elements of the technology and build up a system. The research concentrates on this aspect and the discussions from several views are presented.", } @BOOK{Lill87:Remote, AUTHOR="T. M. Lillesand and R. W. Kiefer", TITLE="Remote sensing and image interpretation", PUBLISHER="John Wiley \\& sons", YEAR=1987, } @ARTICLE{Mait8704:Improving, AUTHOR="H. Maitre and Yunnan Wu", TITLE="Improving dynamic programming to solve image regestration", JOURNAL=pattern, VOLUME=20, NUMBER=4, PAGES="443-462", YEAR=1987, ABSTRACT="A new method of dynamic prog (DP) is presented. A picture is pared with a reference map. In order to arrive at picture registration, an ordered sequence of primative patterns is formed from the map. An attempt is made to locate a similar sequence from the picture using classical picture processing methods. This yields a distorted and unordered sequence marked by noise. DP is then used to search for a common match to the two sequences. Both the initial and final registration states are, however, common unknown. Moreover, the continuity of the path is frequently interrupted, due to shortcommings in detection, or perhaps occlusions. Thus, classical DP algorithms appear to give only poor results under practical conditions. When well adapted to treat signals issued from a first order Markovian process, they can be used, as this method shows, to treat Kth order processes. The concept of the ``virtual state'', kept in memory, suspends broken paths until they can be reconnected, thus bridging the existing gaps between the different parts of the path. The proposed alg has been applied to satellite images with their contours sectioned by clouds. The result leads to the guarantee of very good registration in spite of image contours badly hampered by noise and/or clouds.", } @ARTICLE{Mohn8706:Simulation, AUTHOR="E. Mohn and N. L. Hjort and G. O. Storvik", TITLE="A simulation study of some contextual classification methods for remotely sensed data", JOURNAL="IEEE Transactions on Geoscience and remote sensing", VOLUME=25, NUMBER=6, PAGES="796-804", YEAR=1987, } @INPROCEEDINGS{OHar87:Land, AUTHOR="G. O'Hare", TITLE="Land use identification and classification in the High Peak area of Derbyshire", BOOKTITLE="13th Annual Conference of the Remote Sensing Society", ADDRESS="Nottingham", PAGES="520-526", YEAR=1987, ABSTRACT="Using maximum liklihood methods, land cover classes are identified and mapped on a geometrically corrected image. The use of Landsat 5 TM in hte recognition of land cover classes from a detailed vegetation map of the area arounf Glosop is demonstrated. The results of this investigation show most land ccover classes can be fairly well identified.", } @BOOK{Otto87:Canny, AUTHOR="G. P. Otto", TITLE="Canny's edge operator - a brief critical review", PUBLISHER="Dept. Computer Science, UCL", NOTE="I.N. 2209", YEAR=1987, ABSTRACT={Canny's (family of) edge detectors are meant to be the "optimal" detectors from a certain class, with respect to some plausible criteria. Unfortunately, Canny's derivation of his edge detectors is seriously flawed (at several points), so it is unlikely that his edge detectors are optimal in the sense claimed. More importantly, the restriction to a certain class (based on linear operators) seems (to us) likely to give notably non-optimal results; and his notions of an {"}edge{"}, and what makes a good edge detector are debatable.}, } @BOOK{Peac87:Knowledge, AUTHOR="G. Peacegood", TITLE="A knowledge based system for the automatic extraction and recognition of linear features in satellite imagery and aerial photography", PUBLISHER="Dept. Photogrametry and Surveying, UCL", YEAR=1987, ABSTRACT="An overview of a system that uses AI techniques in the classification of remotely sensed imagery is presented. Rigorous analysis of the performance of this system is currently underway, and so attention is focused upon the design and capabilities of the system and on key issues in scene analysis which have been met.", } @ARTICLE{Pear87:Distributed, AUTHOR="J. Pearl", TITLE="Distributed revision of composite beliefs", JOURNAL=ai, VOLUME=33, PAGES="173-215", YEAR=1987, ABSTRACT={This paper extends the applications of belief network models to include the revision of belief {"}commitments{"}, ie , the categorical acceptance of a subset of hypothesis which together constitute the most satisfactory explanation of the evidence at hand. A coherent model of nonmonotonic reasoning is introduced and distributed algs for belief revision are presented. We show that, in single connected networks, the most satisfactory explanation can be found in linear time by a message passing alg similar to the one used in belief updating. In multiply connected networks, the problem may be exponentially hard but, if the network is sparse, topological considerations can be used to render the interpretation task tractible. In general, finding the most probable combination of hypothesis is no more complex than computing the degree of belief for any individual hypothesis. Applications to circuit and medical diagnosis are illustrated.}, } @INPROCEEDINGS{Pedl87:Digital, AUTHOR="M. I. Pedley", TITLE="Digital image classification of {SPOT} {HRV} data using a field based approach", BOOKTITLE="13th Annual Conference ofr the Remote Sensing Society", PAGES="168-173", YEAR=1987, } @BOOK{Pool87:Lapwing, AUTHOR="I. Poole", TITLE="Lapwing - a prototype image recognition system for the linear array processor", PUBLISHER="Dept. Computer Science, UCL", NOTE="I.N. 2157", YEAR=1987, ABSTRACT="A prototype recognition system intended for the detection of features in satellite imagery and for potential application in for example production line inspection has been constructed. Techniques of supervised pattern recognition are used to find linear descriminant funtions that will partition the pattern space and isolate the required features. A criterion fuction which favours partitions that are insensitive to a simply defined form of additive bias is proposed. The partitions are bulit up hierarchically and represented as a classification tree. The training phase generates programs for the LAP permitting subsequent images to be processed rapidly. A simple method for exploiting contextual information is used at present.", } @TECHREPORT{Pool87:Contextual, AUTHOR="I. Poole", TITLE="On the contextual definition of linear features", TYPE="Research note", INSTITUTION="Dept. Computer Science, UCL", NUMBER="RN/88/3", YEAR=1987, ABSTRACT={This is a first attempt to formalise my ideas relating to classifiers which are trained with a contextual supervisor only. These ideas have been brought into sharper focus after discussions with Paul Otto and Bill Witts on the issue of defining an {"}edge{"} and their critical study of the Canny edge detector. Linear features are used as a useful exemplar of a contextually defined {"}thing{"} but the discussion is quite general.}, } @INPROCEEDINGS{Riol87:Bucket, AUTHOR="R. L. Riolo", TITLE="Bucket Brigade performance:1. Long sequences of classifiers", BOOKTITLE="2nd International Conference on Genetic Algorithms and Their Applications", PAGES="184-195", YEAR=1987, ABSTRACT={In Holland-type classifier systems the bucket bridage algorithm allocates strength ({"}credit{"}) to classifiers that lead to rewards from environment. This paper presents results that show the bba basically works as designed - strength is passed down sequences of coupled classifiers that recieve rewards directly from the environment to those that are stage setters. Results indicate it can take a fairly large number of trials for a classifier system to respond to changes in its environment by relocatting strength down competing sequences of classifiers that implement simple reflex and non-reflex behaviours. However, {"}bridging classifiers{"} are shown to dramatically decrease the number of times a long sequence must be execuited in order relocate strength to all the classifiers in the sequence. Bridging classifiers also were shown to be one way to avoid problems caused by sharing classifiers accross competing sequences.}, } @INPROCEEDINGS{Scha87:Adaptive, AUTHOR="J. D. Schaffer and A. Morishima", TITLE="An adaptive crossover distribution mechanism for genetic algorithms", BOOKTITLE="2nd International Conference on Genetic Algorithms and Their Applications", PAGES="36-40", YEAR=1987, ABSTRACT={This paper presents a new version of a class of search procedures usually called genetic algorithms. Our new version implements a modified string representation that includes special punctuation used by the crossover recombination operator. The idea behind this scheme was abstracted from the mechanics of natural genetics and seems to yield a search procedure wherein the actio of the recombination operator can be made to adapt to the search space in parallel with the adaptation of the string contents. In addition this adaptation happens {"}for free{"} in that no additional operators beyond those of the traditional GA are employed. We present some empirical evidence that suggests this procedure may be as good as or better than the traditional GA across a range of search problems and that its action does successfully adapt the search mechanics to the problem space.}, } @ARTICLE{Sett8705:Fast, AUTHOR="J. G. Settle and S. A. Briggs", TITLE="Fast maximum likelihhod classification of remotely-sensed imagery", JOURNAL=remote, VOLUME=8, NUMBER=5, PAGES="723-734", YEAR=1987, } @BOOK{Sett87:Digital, AUTHOR="J. G. Settle and N. A. Drake", TITLE="Digital Ground Reference Maps", PUBLISHER="NUTIS, Dept. Geography, University of Reading.", YEAR=1987, } @INPROCEEDINGS{Sett87:Parameter, AUTHOR="J. G. Settle and N. A. Drake", TITLE="Parameter estimation in the contextual classification of images", BOOKTITLE="13th Annual Conference of RSS", PAGES=568, YEAR=1987, ABSTRACT="Classification of remotely sensed data using contextual and spectral information can be much more accurate than classifying images on the basis of spectral data alone. A technique is described which classifies images assumong multivariate normal distributions for the spectral data and a simple Markov model for spatial dependencies. Results are shown for a number of data sets. It is found that the final results depend quite strongly on a number of parameters which may be estimated during the procedure.", } @ARTICLE{Siar8702:Thermodynamic, AUTHOR="P. Siarry and L. Bergonzi and G. Dreyfus", TITLE="Thermodynamic optimisation of block placement", JOURNAL=ieeecad, VOLUME=6, NUMBER=2, PAGES="211-221", YEAR=1987, ABSTRACT={This paper presents the results of a systematic investigation of the thermodynamic ({"}simulated annealing{"}) method applied to the placement of rectangular blocks on a chip. A new presentation of the fundemental ideas underlying this technique is proposed. It is shown that the analogies with physics, which have been the origin of the method, may be partially forgotten, but that they are still useful for understanding some results. Several simple examples are investigated, and the influence of various parameters are studied. Typical complex industrial applications are subsequntally investigated. Finally, an interactive implementation of the thermodynamic optimisation algorithm, based on the results of the presented investigation is proposed.}, } @BOOK{Simp87:Artificial, AUTHOR="P. K. Simpson", TITLE="A survey of artificial neural systems", PUBLISHER="Unisys, San Diego Systems Engineering Center", ADDRESS="San Diego", YEAR=1987, ABSTRACT="This paper is a survey of the field of artificial neural systems (ANS). ANSs have a large number of highly interconnected processing elements that demonstrate the ability to learn and generalise from presented patterns. ANSs represent a possible solution to previously difficult problems in areas such as speech processing and natural language understanding. This paper presents a brief history of ANSs, examples of ANS models and areas where the technology has been applied. Also discussed is the connection between AI and ANS, computer architectures that are evolving from this field and ANS algorithms.", } @INPROCEEDINGS{Stad87:Schema, AUTHOR="I. Stadnyk", TITLE="Schema recombination in a pattern recognition problem", BOOKTITLE="2nd International Conference on Genetic Algorithms and Their Applications", PAGES="27-35", YEAR=1987, ABSTRACT="A simple pattern recognition problem is presented, where a population of binary strings evolves under the genetic algorithm as it tries to match and recognise another population of binary strings. Sampling is used in the GA to do matching, which determines fitness, and crowding, which allows subpopulations to form that recognise different pattern strings. To understand what subpatterns the recogniser strings chose as the regularities in the patterns and how these are organised as recognition improves, the theory of schemata is applied to the resulting recogniser string population. The schemata that are formed by recombing other schemata and mutating them with a low level of noise emerge in a default hierarchy. This hierarchy has general properties that apply to any knowledge representation used in such a pattern recognition system.", } @ARTICLE{Walt87:Applications, AUTHOR="D L Waltz", TITLE="Applications of the connection machine", JOURNAL=ieeecomp, PAGES="85-96", YEAR=1987, } @ARTICLE{Wang8701:Large, AUTHOR="Q. R. Wang and C. Y. Suen", TITLE="Large tree classifier with heuristic search and global training", JOURNAL=ieeepami, VOLUME=9, NUMBER=1, PAGES="91-102", YEAR=1987, ABSTRACT={In the tree classifier with top-down search, a global decision is made via a series of local decisions. Although this approach gains in classification efficiency, it also gives rise to error accumulation which can be very harmful when the number of classes is very large. To overcome this difficulty, a new tree classifier with the following characteristics is proposed: 1) fuzzy logic search is used to find all {"}possible correct classes{"}, and some similarity measures are used to determine the {"}most probable class{"};2) global training is applied to generate extended terminals in order to enhance the recognition rate; 3) both the training and search algorithms have been given a lot of flexibility, to provide tradeoffs between error and rejection rates, and between the recognition rate and speed. A computer simulation of the decision trees for the recognition of 3200 Chinese character categories yielded a very high recognition rate of 99.93\% and a very high speed of 861 samples/s, when the program was written in a high level language and run on a large multiuser time-sharing computer.}, } @ARTICLE{Wats87:New, AUTHOR="A. I. Watson", TITLE={A new method of classification for Landsat data using the "watershed" algorithm}, JOURNAL="Pattern recognition Letters", VOLUME=6, PAGES="15-19", YEAR=1987, ABSTRACT={Many methods of classifying satellite imagery have been suggested. Most of the accepted methods, either supervised or unsupervised, are founded on the assumption that the radiance values of a particular ground cover type can be characterised by some probability distribution having a central values and a range parameters. This assumption is rarely, if ever, tenable and hence the methods must produce unnecessarily high rates of misclassification. Thus there is a need for an approach which avoids this type of assumption. Pattern recognition techniques, eg the {"}watershed{"} algorithm, can be used to divide up the radiance-frequency domain, provided the radiance values can be reduced to 2D These methods do not presuppose any {"}shape{"} for the radiance-frequency distributions and therefore provide an unbiased aid to the interpretation of satellite imagery.}, } @ARTICLE{Zenz8706:G, AUTHOR="S. D. Zenzo and S. D. Degloria and R. Bernstein and H. G. Kolsky", TITLE="{GML} and contextual classificaton algorithms for multicrop classification; experiments using {TM} and {MSS} data", JOURNAL="IEEE Transactions on Geoscience and remote sensing", VOLUME=25, NUMBER=6, PAGES="815-824", YEAR=1987, } @TECHREPORT{Zhou87:Trace, AUTHOR="Songnian Zhou", TITLE="A Trace Driven Simulation Study of Dynamic Load Balancing", TYPE="Technical Report", INSTITUTION="University of California", ADDRESS="Berkeley, California", YEAR=1987, KEYWORDS="Simulation Load", } @BOOK{Davi87:Genetic, AUTHOR="L. Davis", TITLE="Genetic Algorithms and Simulated Annealing", PUBLISHER="Pitman", YEAR=1987, ABSTRACT="A collection of papers in the RN on AI series from Pitman.", } @MASTERSTHESIS{Adam87:Genetic, AUTHOR="H. P. Adams", TITLE="The Genetic Algorithm - A search strategy: Review, implementation and use", SCHOOL="Dept. Computer Science, University of York", YEAR=1987, ABSTRACT="This project concerns a type of search strategy called a genetic algorithm. Based on evolution, it is capable of coping with multimodal, non-convex, discontinuous and noisy functions. A survey of the work in this field is presented together with a discussion of the theory behind the method. AN autonomous genetic algorithm written in Pascal is included. This algrithm is applied to the travelling salesman problem and the properties of its parameters explored. Finally results are presented from an image recognition project using the genetic algorithm to search for classifying rules.", } @TECHREPORT{Lant87:Experiment, AUTHOR="K. A. Lantz", TITLE="An Experiment in Integrated Multimedia Conferencing", INSTITUTION="Stanford University", YEAR=1987, } @TECHREPORT{ISO87:LOTOS, AUTHOR="I. S. O", TITLE="{LOTOS} - Language of Temporal Ordering Specification", INSTITUTION="International Standards Organization", NUMBER="ISO DP 8807", YEAR=1987, } @TECHREPORT{Para87:Parallax, AUTHOR="Parallax Graphics", TITLE="The Parallax 1280 Series Videographic Processor", TYPE="Technical Report", INSTITUTION="Parallax Graphics", YEAR=1987, KEYWORDS="video; frame buffer; workstation architecture", } @BOOK{ATT87:Streams, AUTHOR="A. T.\&T", TITLE="Streams Programmers Guide and Streams Primer", PUBLISHER="Prentice Hall", ADDRESS="Englewood Cliffs, New Jersey", YEAR=1987, KEYWORDS="Unix; streams; operating systems; programming manual", } @BOOK{Cadz87:Foundations, AUTHOR="James A. Cadzow", TITLE="Foundations of digital signal processing and data analysis", ISBN="0-02-318010-2", PUBLISHER="Macmillan", ADDRESS="New York, New York", YEAR=1987, KEYWORDS="digital signal processing; estimation; DSP; tutorial", } @ARTICLE{Gruc8701:Burroughs, AUTHOR="S. Gruchevsky and D. Piscitello", TITLE="The Burroughs Integrated Adaptive Routing System {(BIAS)}", JOURNAL=ccr, VOLUME=17, NUMBER="1 \\& 2", PAGES="18-34", MONTH="January/April", YEAR=1987, } @ARTICLE{Barz8701:Notable, AUTHOR="H. W. Barz", TITLE="Notable Abbreviations in Telecommunications", JOURNAL=ccr, VOLUME=17, NUMBER="1 \\& 2", MONTH="January/April", YEAR=1987, } @ARTICLE{Witt8707:Comment, AUTHOR="M. Witt", TITLE="A Comment on Current Source Routing Techniques", JOURNAL=ccr, VOLUME=17, NUMBER=3, PAGES="4-6", MONTH="July/August", YEAR=1987, REFERENCES=3, } @ARTICLE{Jako8707:OSI, AUTHOR="K. Jakobs", TITLE="{OSI} Addressing Strategies", JOURNAL=ccr, VOLUME=17, NUMBER=3, PAGES="7-12", MONTH="July/August", YEAR=1987, REFERENCES=5, ABSTRACT="The paper presents a survey of addressing principles of the OSI/RM. Relevant OSI-specific terms and mechanisms are explained; the addressing capabilities of the seven layers are described.", } @ARTICLE{Cock8707:Efficient, AUTHOR="A. Cockburn", TITLE="Efficient Implementation of the {OSI} Transport Protocol Checksum Algorithm Using 8/16-Bit Arithmetic", JOURNAL=ccr, VOLUME=17, NUMBER=3, PAGES="13-20", MONTH="July/August", YEAR=1987, REFERENCES=4, ABSTRACT="The checksum algorithm recommended in the OSI transport-protocol specifications is an arithmetic checksum algorithm which makes heavy use of base-255 addition. In this technical note, an efficient implementation of the recommended checksum algorithm is derived, using 8-bit unsigned addition as the base for an inexpensive modulo-255 addition.", } @ARTICLE{Thom8707:Netbios, AUTHOR="S. Thomas", TITLE="Netbios for {ISO} Networks", JOURNAL=ccr, VOLUME=17, NUMBER=3, PAGES="21-29", MONTH="July/August", YEAR=1987, } @ARTICLE{Prie8707:Model, AUTHOR="A. R. Prieto and J. G. Comas", TITLE="A Model to Order the Encryption Algorithms According to their Quality", JOURNAL=ccr, VOLUME=17, NUMBER=3, PAGES="30-47", MONTH="July/August", YEAR=1987, REFERENCES=45, ABSTRACT="Usually the unicity distance is used to give the strength of encryption algorithms. In this work, the behavior of encipherment algorithm has been analyzed and two different parameters are proposed in order to evaluate the quality. These parameters are checked against the unicity distance and a final test has been executed, using DES.", } @ARTICLE{Parr8707:Address, AUTHOR="G. Parr", TITLE="Address Resolution for an Intelligent Filtering Bridge Running on a Subnetted Ethernet System", JOURNAL=ccr, VOLUME=17, NUMBER=3, PAGES="48-70", MONTH="July/August", YEAR=1987, REFERENCES=23, ABSTRACT="When a generic host goes down or moves on a subnetted configuration on Ethernets running, for example TCP/IP, and comes back up again, with either a completely new network interface, or a newly assigned protocol address, this information is not currently available to remote hosts/devices on the system. What I propose here is a facility whereby all connected systems can be informed of this ''REBOOT'' situation as soon as it is detected by its neibouring Bridge. This way, subsequent redundant, and wasteful transmissions can be prevented taking place from remote sources to 'unobtainable' hosts. A broadcast medium such as Ethernet is assumed.", } @ARTICLE{Part8710:CSNET, AUTHOR="C. Partridge and C. Mooers and M. Laubach", TITLE="The {CSNET} Information Server: Automatic Document Distribution using Electronic Mail", JOURNAL=ccr, VOLUME=17, NUMBER=4, PAGES="3-10", MONTH="October/November", YEAR=1987, REFERENCES=10, } @ARTICLE{Thom8710:Dynamic, AUTHOR="S. Thomas", TITLE="A Dynamic Naming Protocol for {ISO} Networks", JOURNAL=ccr, VOLUME=17, NUMBER=4, PAGES="11-24", MONTH="October/November", YEAR=1987, } @ARTICLE{McLe87:Approach, AUTHOR="Dennis McLeod", TITLE="An Approach to Controlled Sharing among Autonomous, Heterogeneous Database Systems", JOURNAL="IEEE Database Engineering", PAGES="17-41", YEAR=1987, } @BOOK{Bern87:Concurrency, AUTHOR="P. A. Bernstein and V. Hadzilacos and N. Goodman", TITLE="Concurrency Control and Recovery in Database Systems", PUBLISHER="Addison-Wesley", YEAR=1987, } @UNPUBLISHED{Nels87:Literary, AUTHOR="Ted Nelson", TITLE="Literary Machines", NOTE="702 South Michigan, South Bend, IN 46618", YEAR=1987, } @ARTICLE{Luba87:Efficient, AUTHOR="B. D. Lubachevsky", TITLE="Efficient Parallel Simulations of Asynchronous Cellular Arrays", JOURNAL="Complex Systems", VOLUME=1, PAGES="1099-1123", YEAR=1987, } @INPROCEEDINGS{Kim87:Composite, AUTHOR="W. Kim and J. Banerjee and H. Chou and J. Garza and D. Woelk", TITLE="Composite Object Support in an Object-Oriented Database System", BOOKTITLE=oopsla, PAGES="118-125", YEAR=1987, } @ARTICLE{Koga87:Update, AUTHOR="Boris Kogan and H. Garcia Molina", TITLE="Update Propagation in Bakunin Data Networks", JOURNAL="PODC", PAGES="13-26", YEAR=1987, KEYWORDS="Read-Access-Graph", } @INPROCEEDINGS{Noe87:Effectiveness, AUTHOR="J. D. Noe and Agnes Andreassian", TITLE="Effectiveness of Replication in Distributed Computer Networks", BOOKTITLE=dcs, ADDRESS="Berlin", PAGES="508-513", YEAR=1987, } @TECHREPORT{Cabr87:Quicksilver, AUTHOR="Luis Felipe Cabrera and Jim Wyllie", TITLE="The Quicksilver File System", INSTITUTION="IBM Almaden Research Center, San Jose, California", NUMBER="IBM TR RJ 5578", YEAR=1987, } @ARTICLE{Rapp87:Selecting, AUTHOR="S. Rapps and E. J. Weyuker", TITLE="Selecting software test data using data flow information", JOURNAL=ieeese, VOLUME=13, PAGES="518-531", YEAR=1987, } @INPROCEEDINGS{Ural87:Test, AUTHOR="H. Ural", TITLE="A Test Derivation Method for Protocol Conformance Testing", BOOKTITLE="7th International Symposium on Protocol Specification, Testing and Verification", SERIES="IFIP Transactions", PUBLISHER="North-Holland", YEAR=1987, } @ARTICLE{Cher87:Network, AUTHOR="D. R. Cheriton and Carey Williamson", TITLE="Network Measurement of the {VMTP} Request Response Protocol in the {VDistributed} System", JOURNAL="ACM?", YEAR=1987, REFERENCES=16, KEYWORDS="Request response; transaction communication; VMTP; Distributed System", } @ARTICLE{Cox87:Interactive, AUTHOR="S. Cox", TITLE="Interactive graphics in {GPSS/PC}", JOURNAL="Simulation", PAGES="117-122", YEAR=1987, KEYWORDS="Computer animation; discrete event simulation; GPSS", } @ARTICLE{Eng87:Knockout, AUTHOR="K. Y. Eng and M. G. Hluchyj and Y.-S. Yeh", TITLE="A Knockout Switch for Variable-Length Packets", JOURNAL=ieeejsac, ADDRESS="Holmdel, New Jersey", VOLUME="SAC-5", PAGES="1426-1435", YEAR=1987, REFERENCES=11, KEYWORDS="ATM; Knockout Switch; Packet Switching", } @ARTICLE{Kübl87:Transputer, AUTHOR="F. D. Kübler", TITLE="Transputer in industriellen Anwendungen", JOURNAL="VMEbus, Ein Magazin der Elektronic", ADDRESS="Germany", VOLUME=1, YEAR=1987, LANGUAGE="German", KEYWORDS="Transputer; OCCAM; VME-Bus", } @INPROCEEDINGS{Li87:Languages, AUTHOR="Xiao Li and B. W. Unger", TITLE="Languages for distributed simulation", BOOKTITLE="Conference on Simulation and AI", SERIES="Simulation series", VOLUME=18, PAGES="35-40", YEAR=1987, REFERENCES=26, KEYWORDS="Distributed simulation", } @PROCEEDINGS{Anon87:IEEE, TITLE="{IEEE} Infocom -- The Conference on Computer Communications", EDITOR="Anonymous", PUBLISHER="IEEE Computer Press", YEAR=1987, KEYWORDS="Computer communication", } @ARTICLE{ORei87:Burst, AUTHOR="Peter O'Reilly", TITLE="Burst and Fast Packet Switching: Performance Comparisons", JOURNAL=cnis, ADDRESS="Netherlands", VOLUME=13, PAGES="21-32", YEAR=1987, REFERENCES=28, KEYWORDS="ATM; burst switching; analysis; simulation", } @ARTICLE{Li8710:New, AUTHOR="Song Li and J. W. Mark", TITLE="A New Performance Measurement for Voice Transmission in Burst and Packet Switching", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=10, PAGES="1083-1094", YEAR=1987, REFERENCES=24, KEYWORDS="Burst switching; talkspurt; clipping; packet switching; packet voice; geometric distribution; queueing discipline; simulation; performance evaluation", ABSTRACT="Voice transmission in burst switching is charaterized by the process of talkspurt clipping, while in packet switching, it is characterized by the process of packet delay. The contribution of this paper is to propose a new analytical approach to measuring the worst case behaviour of both talkspurt clipping period and packet delay during overload period.", } @ARTICLE{Dahm8703:Über, AUTHOR="H. Dahms", TITLE="Über die Mehrfachnutzung von Kanälen eines Zeitmultiplex-Vermittlungssystems unter Ber cksichtigung abhängiger Teilnehmer", JOURNAL=ntzarchiv, ADDRESS="Germany", VOLUME=9, NUMBER=3, PAGES="55-62", YEAR=1987, LANGUAGE="German", REFERENCES=12, KEYWORDS="ATM; traffic source model; TDM", ABSTRACT="Models and analysing methods are presented which take into account the particular interdependence of a pair of traffic sources. The paper deals with the exact calculation of the state prob. and the char. traffic values by means of closed form solutions. Results of these models are compared with those based on independent subscribers.", } @INPROCEEDINGS{Vlee87:Architectures, AUTHOR="I. de Vleeschouwer", TITLE="Architectures for subscribers' premises networks using {ATD}", BOOKTITLE="GSLB-Seminar on Broadband Switching", ADDRESS="Albufeira, Portugal", PAGES="237-246", YEAR=1987, REFERENCES=25, KEYWORDS="ATM; subscriber premises network; overview; media access control; network topology; hierarchical network; synchronous transmission; multimedia; switching; signalling; optical LAN", } @ARTICLE{Roma8703:Bildfernsprechen, AUTHOR="G. Romahn and A. Prussog and L. M hlbach", TITLE="Bildfernsprechen am Arbeitsplatz", JOURNAL=ntz, ISBN="0027-707X", ADDRESS="Germany", VOLUME=40, NUMBER=3, PAGES="160-165", YEAR=1987, LANGUAGE="German", REFERENCES=10, KEYWORDS="Video telephony; case study; test", } @INPROCEEDINGS{Schm87:ATD, AUTHOR="W. Schmidt", TITLE="{ATD} switching networks", BOOKTITLE="GSLB-Seminar on Broadband Switching (FTZ Darmstadt)", ADDRESS="Albufeira, Portugal", PAGES="225-234", YEAR=1987, KEYWORDS="ATM; switching network; switching methodology; self routing; multipath; Banyan network; sorting network", } @ARTICLE{Yum8705:Comparison, AUTHOR="T.-K. Yum and M. Schwartz", TITLE="Comparison of Routing Procedures for Circuit-Switched Traffic in nonhierarchical Networks", JOURNAL=ieeecom, ISBN="0090-6778", VOLUME="COM-35", NUMBER=5, PAGES="535-544", YEAR=1987, REFERENCES=7, KEYWORDS="Circuit switching; routing algorithm; comparison; alternate routing; performance parameter; blocking; performance improvement", } @BOOK{Schw87:Telecommunication, AUTHOR="M. Schwartz", TITLE="Telecommunication Networks: Protocols, Modeling and Analysis", PUBLISHER="Addison-Wesley Publishing Company, Reading", YEAR=1987, KEYWORDS="Communication network; performance evaluation", } @BOOK{Schw87:Hrung, AUTHOR="N. Schwarz", TITLE="Einführung in {TeX}", PUBLISHER="Addison-Wesley Publishing Company", ADDRESS="Bonn, Germany", YEAR=1987, LANGUAGE="German", } @ARTICLE{Adzh87:Effect, AUTHOR="A. S. Adzhemov and Y. I. Filyushin", TITLE="Effect of Switching Different-Rate Channels on Digital Switching System Characteristics", JOURNAL="Telecommunications and Radio Engineering", VOLUME="41/42", NUMBER=5, PAGES="6-10", YEAR=1987, KEYWORDS="multiserver", } @INPROCEEDINGS{Ahlb87:Reuse, AUTHOR="L. Ahlberg", TITLE="Reuse Partitioning in A Cellular Mobile Telephone System", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="XI.1.1-14", YEAR=1987, KEYWORDS="cellular system; mobile radio", ABSTRACT="Radio bendwith for mobile communication is very scarce. Therefore, various attempts are made in order to increase spectrum efficiency. Investigations of these attempts have so far concentrated mainly on systems with small reuse patterns containing a relative small number of channels and few comparisons between these systems and systems with larger reuse patterns or a larger number of channels have been performed. Reuse pa", } @ARTICLE{Aldo87:Least, AUTHOR="D. Aldous and L. Shepp", TITLE="The Least Variable Phase Type Distribution is {Erlang}", JOURNAL="Communication Statististics - Stochastic Models", VOLUME=3, NUMBER=3, PAGES="467-473", YEAR=1987, KEYWORDS="Cox distribution", } @ARTICLE{Alle87:Frequency, AUTHOR="J. R. Allen and R. V. Helgason and J. L. Kennington", TITLE="The Frequency Assignment Problem: A Solution via Nonlinear Programming", JOURNAL=navres, VOLUME=34, PAGES="133-139", YEAR=1987, KEYWORDS="communication network; programming; channel assignment; math. programming technique; mobile radio", ABSTRACT="This paper gives a mathematical programming model for the problem of assigning frequencies to nodes in a communications network. The objective is to select a frequency assignment which minimizes both cochannel and adjacent-channel interference. In addition, a design engineer has the option to designate key links in which the avoidance of jamming due to self interference is given a higher priority. The model has a nonconve", } @ARTICLE{Alti87:Approximate, AUTHOR="T. Altiok and Harry Perros", TITLE="Approximate Analysis of Arbitrary Configurations of Open Queueing Networks with Blocking", JOURNAL="Annals of Operations Research", VOLUME=9, PAGES="481-509", YEAR=1987, KEYWORDS="queueing network; finite queue; blocking; decomposition", ABSTRACT="An algorithm for analyzing approximately open exponential queueing networks with blocking is presented. The algorithm decomposes a queueing network with blocking into individual queues with revised capacity, and revised arrival and service processes. These individual queues are then analyzed in isolation. Numerical experience with this algorithm is reported for three-node and four-node queueing networks. The approximate", } @ARTICLE{Anil87:Simulated, AUTHOR="S. Anily and A. Federgruen", TITLE="Simulated annealing methods with general acceptance probabilities", JOURNAL=jap, VOLUME=24, PAGES="657-667", YEAR=1987, KEYWORDS="probability; convergence rate; convergence conditions; general acceptance probabilities", ABSTRACT="Heuristic solution methods for combinatorial optimization problems are often based on local neighborhood searches. These tend to get trapped in a local optimum and the final result is often heavily dependent on the starting solution. Simulated annealing methods attempt attempt to avoid these problems by randomizing the procedure so as to allow occasional changes", } @ARTICLE{Arth87:Network, AUTHOR="J. L. Arthur and Al Davis and P. Ghandforoush", TITLE="A Network Queueing Model for Data Communication Systems", JOURNAL=omega, VOLUME=15, NUMBER=2, PAGES="157-165", YEAR=1987, KEYWORDS="Data communication; communication system; queueing theory; queueing network", } @INPROCEEDINGS{Arvi87:Overflow, AUTHOR="X. Arvidsson", TITLE="The Overflow Process from a Link with State Protection", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="IX.4.1-12", YEAR=1987, KEYWORDS="overflow traffic; link system; Poisson distribution; performance evaluation; blocking; traffic offered; traffic model", ABSTRACT="In a previous paper, we presented some results on the performance of a link with state protection. The analysis concerned the blocking period and the probability of repeated blocking for a link with n circuits to which Poissonian and non-Poissonian traffics were offered. The state protection mechanism was assumed to accept or reject calls at random, with the probability of acception depending on the priority of the", } @INPROCEEDINGS{Back87:Ny, AUTHOR="R. Bäckström and E. Carlsson", TITLE="Ny Spärrnorm för {VIOR}", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VII.4.1-12", YEAR=1987, LANGUAGE="Swedish", ABSTRACT="Metoder för att bestämma totalekonomiskt optimal spärr ligger till grund för den nya spärrnormen. Den är avsedd för dimensionering av alla vior och viakomplex i telenätet oberoende av om bråd timme inträffar under förmiddag eller kväll och ger möjlighet att särbehandla vior med kort högsäsong men enligt samma groundprinciper. Spärrnormen för vior är en funktion av trafikstvrka och högsäsonglängd och innebär lägre spärrniv", } @INCOLLECTION{Bals87:Identity, AUTHOR="Simonetta Balsamo and V. De Nitto Persone and G. Iazeolla", TITLE="Identity and Reducibility Properties of Some Blocking and Non-Blocking Mechanisms in Congested Networks", BOOKTITLE="Flow Control of Congested Networks", EDITOR="A. R. Odoni and Christopher Carothers", SERIES="NATO ASI Series", PUBLISHER="Springer Verlag", VOLUME="F38", PAGES="243-254", YEAR=1987, KEYWORDS="Queueing network; blocking; resource; computer system; communication system; production system", ABSTRACT="Networks of queues with blocking are used for representing resource constraints in production, communication and computer systems. Different types of blocking which have been studied in various application fields will be compared and proved to be either identical (in terms of general performance indices) or reducible one to the other. The case is also shown of identity and reducibility properties", } @TECHREPORT{Bark87:Iterative, AUTHOR="V. A. Barker", TITLE="Iterative Solution of Singular Systems of Equations Arising from Ergodic Markov Chains", INSTITUTION="Numerisk Institut, Danmarks Tekniske Hojskole", PAGES=21, YEAR=1987, KEYWORDS="Iterative method; ergodicity; markov chain; mathematical method", } @ARTICLE{Bart8704:Future, AUTHOR="P. Bartholomé", TITLE="The future of Satellite Communications in Europe", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=4, PAGES="615-623", YEAR=1987, KEYWORDS="Satellite radio; communication network; communication", } @ARTICLE{Bhat87:Stastistical, AUTHOR="U. Narayan Bhat and S. V. Rao", TITLE="Stastistical Analysis of Queueing Systems", JOURNAL=qs, VOLUME=1, PAGES="217-247", YEAR=1987, KEYWORDS="Queueing system; time series analysis", ABSTRACT="Richard Larson", } @ARTICLE{Blum87:Simple, AUTHOR="L. Blum and M. Blum and M. Shub", TITLE="A Simple Unpredictable Pseudo-Random Number Generator", JOURNAL=sicomp, VOLUME="15 (1986)", NUMBER=2, PAGES="364-383", YEAR=1987, KEYWORDS="random number", } @ARTICLE{Blun87:Telephone, AUTHOR="K. Blunar", TITLE="An Analysis of a Telephone Network with Alternate Routes", JOURNAL="Telecommunications and Radio Engineering", VOLUME="41/42", NUMBER=7, PAGES="16-19", YEAR=1987, KEYWORDS="Alternate routing; network; analysis", } @ARTICLE{Bola8702:Cellular, AUTHOR="J. E. Boland", TITLE="The Cellular Mobile Telephone Service - System Overview", JOURNAL="Telecommunication Journal of Australia", ADDRESS="Australia", VOLUME=37, NUMBER=2, PAGES="9-16", YEAR=1987, KEYWORDS="MAT; Cellular system; mobile radio; telephony", } @ARTICLE{Bott87:Characterizations, AUTHOR="R. F. Botta and C. R. Harris and W. G. Marchal", TITLE="Characterizations of Generalized Hyperexponential Distribution functions", JOURNAL="Communication Statististics - Stochastic Models", VOLUME=3, NUMBER=1, PAGES="115-148", YEAR=1987, KEYWORDS="Cox distribution", ABSTRACT="This paper examines in detail the class of generalized hyperexponential (GH) probability distribution functions. The family is compared to and contrasted with similar popular classes of distributions used in stochastic modelling. Each of these families arises from a desire to preserve the computationally attractive feature of ``memorylessness'' possessed by the exponential probability distribution while extending the representation", } @ARTICLE{Cao87:Feedback, AUTHOR="Xi-Ren Cao", TITLE="Feedback invariant discipline and insensitivity in closed queueing networks", JOURNAL="Systems \& Control Letters", VOLUME=9, PAGES="349-353", YEAR=1987, KEYWORDS="feedback; closed queueing network; discrete event simulation; insensitivity", ABSTRACT="Motivated by control theory concepts, we investigate a closed queueing network by adding a feedback path to each node. A feedback invariant service discipline is introduced. This approach differs from the conventional queueing theory approach and provides a new criteria and an intuitive explanation for the insensitivity property in a closed queueing network.", } @ARTICLE{Cao87xx:Sensitivity, AUTHOR="Xi-Ren Cao and Yu-Chi Ho", TITLE="Sensitivity Analysis and Optimization of Throughput in a Production Line with Blocking", JOURNAL=ieeeac, VOLUME="AC-32", PAGES="959-967", YEAR=1987, KEYWORDS="Throughput Analysis; Manufacturing System; Blocking", } @ARTICLE{Carm87:Equivalence, AUTHOR="D. G. Carmichael", TITLE="On the Equivalence of the (Eh(M/c) and (M/M/c) Finite Source Queues", JOURNAL=ces, VOLUME=4, PAGES="87-93", YEAR=1987, KEYWORDS="machine-repair-man model; loss system; Palm's machine problem", } @ARTICLE{Carm87:Refined, AUTHOR="D. G. Carmichael", TITLE="A refined queueing model for earthmoving operations", JOURNAL=ces, VOLUME=4, NUMBER=3, PAGES="153-159", YEAR=1987, KEYWORDS="queueing theory; Erlang distribution; data; case study", ABSTRACT="Earthmoving; field data", } @ARTICLE{Carm87:Machine, AUTHOR="D. G. Carmichael", TITLE="Machine Interference with General Repair and Running Times", JOURNAL=zor, VOLUME=31, PAGES="B115-B113", YEAR=1987, KEYWORDS="Renewal process; repair", } @ARTICLE{Cass87:Optimization, AUTHOR="Christos Cassandras", TITLE="On-Line Optimization for a Flow Control Strategy", JOURNAL=ieeeac, VOLUME="AC-32", NUMBER=11, PAGES="1014-1017", YEAR=1987, KEYWORDS="Flow Control; Optimization", } @ARTICLE{Cham87:Experiments, AUTHOR="M. Chams and A. Hertz and D. de Werra", TITLE="Some Experiments with simulated annealing for coloring graphs", JOURNAL=ejor, VOLUME=32, PAGES="260-266", YEAR=1987, KEYWORDS="heuristics; simulation; manufacturing system; production system; scheduling", ABSTRACT="Methods of thermodynamical simulation have been used for several famous combinatorial optimization problems. For graph coloring (i.e. partition of the node set into as few independent sets as possible) we describe a method of simulation. Such an approach is combined with other techniques for graph coloring. Experiments on random graphs show evidence that this combination gives better results than anyone of the", } @INPROCEEDINGS{Chri87:Inhomogeneous, AUTHOR="J. P. R. Christensen and C. Rasmussen", TITLE="Inhomogeneous Poisson Processes {(IPP)} and Related Processes", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="II.2.1-4", YEAR=1987, KEYWORDS="Poisson process; point process", ABSTRACT="One main result in the work below is, that the class of inhomogeneous Poisson point processes (IPP) are stable under ``ramdom translations'' of the type described below. This has been known only in special cases (see K.Q. Liao). A main tool is a characterization of IPP by the conditional distribution given a certain number of arrivals (essentially known, see Neveu 1976). Other characterizations of IPP are discussed.", } @ARTICLE{Cora87:Minimizing, AUTHOR="A. Corana and M. Marchesi and C. Martini and S. Ridella", TITLE="Minimizing Multimodal Functions of Continuous Variables with the Simulated Annealing Algorithm", JOURNAL=toms, VOLUME=13, NUMBER=3, PAGES="262-280", YEAR=1987, KEYWORDS="Optimization", } @ARTICLE{Cour87:Optimal, AUTHOR="C. A. Courcoubetis and M. I. Reiman", TITLE="Optimal Control of a Queueing System with Simultaneous Service Requirements", JOURNAL=ieeeac, VOLUME="AC-32", NUMBER=8, PAGES="717-727", YEAR=1987, KEYWORDS="Simultaneous resource possession; queueing system; optimal control", } @ARTICLE{Delo87:Telecommunications, AUTHOR="J.-C. Delorme", TITLE="Telecommunications and Economic Development", JOURNAL="Telecommunication Journal of Australia", VOLUME=37, NUMBER=1, PAGES="55-60", YEAR=1987, KEYWORDS="Ccitt", ABSTRACT="ITU", } @INPROCEEDINGS{Dirk87:Tillampningar, AUTHOR="P. Dirke", TITLE="Tillampningar av en Ekonomisk Metod for Driftsäkerhetsplanering", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VI.1.1-10", YEAR=1987, LANGUAGE="Swedish", ABSTRACT="I ett bidrag till NTS-6 (Per Lindberg: Planering av tillförlitligheten i ett digitalt riksnät) presenterades en metod för att ekonomisk värdera driftsäkerhetshöjande åtgärder. Där visades bl.a hur en nuvärdeskalkyl kan användas dela förmedlingsstationer.", } @INPROCEEDINGS{Dzio87:Adaptive, AUTHOR="Z. Dziong and M. Pióro and U. Körner", TITLE="An Adaptive Call Routing Strategy for Circuit Switched Networks", BOOKTITLE="NTS", ADDRESS="Lund, Sweden", PAGES=34, YEAR=1987, KEYWORDS="Adaptive Routing; Circuit Switching", ABSTRACT="In this paper we consider call routing strategies applicable to non-hierarchical circuit switched networks. We describe a new adaptive strategy based on the maximum revenue principle. We discuss the main features of the strategy in comparison with existing routing methods. The discussion about the traffic performance of the introduced strategy and of certain reference ones is based on a simulation study.", } @ARTICLE{Ein87:Attributes, AUTHOR="P. Ein-dor and J. Feldmesser", TITLE="Attributes of the Performance of Central Processing Units: A Relative Performance Prediction Model", JOURNAL=cacm, VOLUME=30, NUMBER=4, PAGES="308-317", YEAR=1987, KEYWORDS="Central Server; Performance Prediction", } @INPROCEEDINGS{Emst87:Computational, AUTHOR="P. J. Emstad and B. Feng", TITLE="The Computational Complexity of a Mixed Queueing Network Model of a Message Handling System", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="IV.1.1-8", YEAR=1987, KEYWORDS="Queueing Network; Complexity; Approximation", ABSTRACT="A mixed queueing network model is formulated for a Message Handling System. A comparison study for both exact and approximate solution procedures has been performed. The complexity of the model makes it necessary to use approximate methods. A heuristic mehtod by Martin Reiser seems to be the best, both with regard to efficiency and accuracy.", } @ARTICLE{Fein8702:Method, AUTHOR="B. Feinberg and S. S. Chiu", TITLE="A Method to Calculate Steday-State Distributions of Large Markov Chains by Aggregating States", JOURNAL=or, VOLUME=35, NUMBER=2, PAGES="282-290", YEAR=1987, KEYWORDS="Analysis; Markov Chain; Steady State Probability; Algorithm; Approximation", ABSTRACT="This paper develops an efficient algorithm to calculate the steady-state of nearly all irreducible discrete-time Markov chains. Computational experiences suggest that, for large Markovian systems (more than 130 states), the proposed algorithm can be ten times faster than standard Gaussian elimination in finding solutions to an accuracy of 0.1 \%. The proposed algorithm is developed in three stages. First, we develop a very", } @ARTICLE{Fuka87:Priority, AUTHOR="Y. Fukagawa and T. Yanara and S. Yoshida", TITLE="Non-Preemptive Priority Queue with Server's Walking Process.", JOURNAL=ecij1, ADDRESS="Japan", VOLUME=70, NUMBER=11, PAGES="49-57", YEAR=1987, KEYWORDS="Queueing System; Analysis; Nonpreemptive Priority; Server Vacation", } @ARTICLE{Fuka87:Queueing, AUTHOR="Y. Fukagawa and T. Yanaru and S. Yoshida", TITLE="A Queueing System with Server's Walking-Time and Serial Service", JOURNAL=ecij1, ADDRESS="Japan", VOLUME=70, NUMBER=11, PAGES="58-67", YEAR=1987, KEYWORDS="Queueing System; Analysis; Server Vacation; Tandem Queue", } @ARTICLE{Gaut87:Une, AUTHOR="P. Gauthier and Prosper Chemouil and M. Klein", TITLE="Une maquette Pour Expérimenter l'Acheminement Adaptif en France", JOURNAL=atele, VOLUME=42, NUMBER="7-8", PAGES="439-447", YEAR=1987, KEYWORDS="adaptive routing", } @ARTICLE{Gerr87:New, AUTHOR="P. Gerrand", TITLE="The New Teletraffic Engineering", JOURNAL="Telecommunication Journal of Australia", VOLUME=37, NUMBER=1, PAGES="61-68", YEAR=1987, KEYWORDS="Traffic Engineering; Method; Planning", } @ARTICLE{Gers87:Efficient, AUTHOR="S. B. Gershwin", TITLE="An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking", JOURNAL=or, VOLUME=35, NUMBER=2, PAGES="291-305", YEAR=1987, KEYWORDS="Performance Evaluation; Approximation; Tandem Queue; Finite Capacity; Blocking; Decomposition", } @ARTICLE{Ghai8704:INMARSAT, AUTHOR="A. Ghais and G. Berzins and D. Wright", TITLE="{INMARSAT} and the Future of Mobile Satellite Services", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=4, PAGES="592-600", YEAR=1987, KEYWORDS="Mobile Radio; Satellite Radio; Survey; Overview", } @INPROCEEDINGS{Gopa87:Architecture, AUTHOR="G. Gopal and A. Weinrib and G. Herman", TITLE="An Architecture and Algorithm for Distributed Control of Resources in the Public Network", BOOKTITLE="International Switching Symposium, ISS, Phoenix, Arizona, 1987. Proceedings B 12.5.1-5", YEAR=1987, KEYWORDS="Architecture; Algorithm; Distributed Control; Communication Network; Resource; Resource Use Model", } @ARTICLE{Haas8704:Multiple, AUTHOR="A. Haas", TITLE="The Multiple Prime Random Number Generator", JOURNAL=toms, VOLUME=13, NUMBER=4, PAGES="368-381", YEAR=1987, KEYWORDS="Simulation; RNG; Monte Carlo Simulation", } @ARTICLE{Hahn8707:Developments, AUTHOR="P. M. Hahn and M. C. Jeruchim", TITLE="Developments in the Theory and Application of Importance Sampling", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=7, PAGES="706-714", YEAR=1987, KEYWORDS="Simulation; Importance Sampling; Simulation Method", } @INPROCEEDINGS{Halg87:Analyse, AUTHOR="C. Halgreen and J. Rasmussen", TITLE="Analyse af Ikke-Hierarkisk Netstruktur", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VII.1.1-14", YEAR=1987, LANGUAGE="Danish", ABSTRACT="Strukturen for det fremtidige dansk telenet er for tiden underkastet en vurdering i en arbejdsgruppe bestående repræsentanter for de danske teleselskaber. Hensigten med dette arbejde er, at der skal udsendes en revision af centralledningsnettet. Allerend på udsendelsestidspunktet af dette cirkulære stod det klart, at der var tale om et circulære med begrænset tidshorisont, idet den gradvise indf relse af digitalteknik vil", } @ARTICLE{Hare87:Strong, AUTHOR="A. Harel and P. H. Zipkin", TITLE="Strong Convexity Results for Queueing Systems", JOURNAL=or, VOLUME=35, NUMBER=3, PAGES="405-418", YEAR=1987, KEYWORDS="Queueing System; Analysis", } @ARTICLE{Helv87:Modelling, AUTHOR="B. E. Helvik and A. R. Swensen", TITLE="Modelling of Clustering Effects in Point Processes. An Application to Failures in {SPC-Systems}", JOURNAL="Scandinavian Journal of Statistics", VOLUME=14, PAGES="57-66", YEAR=1987, KEYWORDS="point process; computer; failure; reliability; telephony", ABSTRACT="Intensity modelling; Computer failure patterns; The paper introduces a failure intensity model with a self-excitation term describing the clustering effect in computer failure data. The model is an extension of a previous non-homogeneous Poisson model used to investigate the influence of load and operational activities on the failure intensity. It allows a straightforward determination of maximum likelihood parameter esti", } @ARTICLE{Hend87:Potential, AUTHOR="L. C. Hendry", TITLE="The Potential Impact of Artificial Intelligence on the Practice of {OR}", JOURNAL=ejor, VOLUME=28, PAGES="218-225", YEAR=1987, KEYWORDS="Forecasting; Artificial Intelligence", } @ARTICLE{Hert87:Using, AUTHOR="A. Hertz and D. de Werra", TITLE="Using Tabu Search Techniques for Graph Coloring", JOURNAL=comp, VOLUME=39, PAGES="345-351", YEAR=1987, KEYWORDS="graph marking algorithm; graph coloring; tabu search; simulated annealing", ABSTRACT="Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden movements is updated during the iterations to avoid cycling and being trapped in local minima. Such techniques are adapted to graph coloring problems. We show that they provide almost optimal coloring of graphs having up to 1000 nodes and their efficiency", } @ARTICLE{Heym87:Asymptotic, AUTHOR="D. P. Heyman", TITLE="Asymptotic Marginal Independence in Large Networks of Loss Systems", JOURNAL="Annals of Operations Research", VOLUME=8, PAGES="57-73", YEAR=1987, KEYWORDS="product form; limit theorem", } @ARTICLE{Hill8704:Prototype, AUTHOR="T. R. Hill and S. D. Roberts", TITLE="A Prototype Knowledge-Based Simulation Support System", JOURNAL="Simulation", VOLUME=48, NUMBER=4, PAGES="152-161", YEAR=1987, KEYWORDS="artificial intelligence; expert system; expert system; simulation; modeling; simulation; database", ABSTRACT="Knowledge-based simulation; Simulation environments; Training", } @ARTICLE{Hord87:Stochastic, AUTHOR="A. Hordijk and A. Ridder", TITLE="Stochastic Inequalities for an Overflow Model", JOURNAL=jap, VOLUME=24, PAGES="696-708", YEAR=1987, KEYWORDS="queueing network; stationary process", ABSTRACT="Stationary distribution; Insensitive bounds; A general method to obtain insensitive upper and lower bounds for the stationary distribution of queueing networks is sketched. It is applied to an overflow model. The bounds are shown to be valid for service distributions with decreasing failure rate. A characterization of phase-type distributions with decreasing failure rate is given. An approximation method is proposed. The", } @ARTICLE{Horn8702:Kapazitätsoptimierung, AUTHOR="R. Hornung", TITLE="Kapazitätsoptimierung in Paketvermittelten Datennetzen", JOURNAL=ors, ADDRESS="Germany", VOLUME=9, NUMBER=2, PAGES="109-121", YEAR=1987, LANGUAGE="German", KEYWORDS="packet switching; optimization", } @ARTICLE{Huds87:Telecommunications, AUTHOR="H. E. Hudson", TITLE="Telecommunications and the Developing World", JOURNAL=ieeecm, VOLUME=25, NUMBER=10, PAGES="28-33", YEAR=1987, KEYWORDS="CCITT; ITU; Tetrapro", } @ARTICLE{Hurl87:Dynamic, AUTHOR="B. R. Hurley and C. J. R. Seidl and W. F. Sewell", TITLE="A Survey of Dynamic Routing Methods for Circuit-Switched Traffic", JOURNAL=ieeecm, VOLUME=25, NUMBER=9, PAGES="13-21", YEAR=1987, KEYWORDS="Circuit switching; dynamic routing", } @INPROCEEDINGS{Jens87:Trafikkmodeller, AUTHOR="E. Lykke Jensen and T. Ormhaug and O. Østerb³", TITLE="Trafikkmodeller for Linjesvitsede Bredbåndsnett", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="IX.1.1-48", YEAR=1987, LANGUAGE="Norwegian", KEYWORDS="Atm", ABSTRACT="Digitaliseringen av det offentlige telenettet kan på sikt tillate integrering av linjesvitsjede bredbåndstjenester med ulike krav til båandbredde. Foredraget presenterer noen noen trafikkmodeller for tilfeller hvor trafikk med forsjellige båndbredderkave konkurrerer om felles ressurser. Utledningene omfatter: - tapssystemer - overl pssystemer - lukkede brukergrupper Noen numeriske eksempler blir også diskutert.", } @ARTICLE{Kahn8704:Networks, AUTHOR="R. E. Kahn", TITLE="Networks for Advanced Computing", JOURNAL="Scientific American", VOLUME=257, NUMBER=4, PAGES="128-135", YEAR=1987, KEYWORDS="Computer network", ABSTRACT="The information generated by computing is useless until it is communicated, and so the nature of the networks that link computers is as important as raw computing power. Establishing an effective network can be as difficult a task as getting the machines to think.", } @ARTICLE{Kari8702:Delay, AUTHOR="M. R. Karim", TITLE="Delay-Throughput and Buffer Utilization Characteristics of Some Statistical Multiplexers", JOURNAL=atttj, VOLUME=66, NUMBER=2, PAGES="55-69", YEAR=1987, KEYWORDS="Statistical multiplexer", } @INPROCEEDINGS{Karl87:Load, AUTHOR="J. Karlsson", TITLE="Performance Analysis of a Load Sharing Scheme in a Cellular Mobile Telephone System", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="XI.2.1-10", YEAR=1987, KEYWORDS="Mobile radio; load sharing", ABSTRACT="An algorithm which shows an substantial improvement, compared with channel allocation techniques, can be achieved as far as carried traffic is concerned. The analytical solution makes use of a Markov chain and shows almost identical results compared with simulations made. In the previous paper (1,2) the setting for some of the parameters (l,n) were restricted trying to avoid ping-pong effects.", } @INPROCEEDINGS{Karl87:Overload, AUTHOR="T. Karlstedt", TITLE="Overload Control of {SPC} Systems - A Survey", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="X.1.1-8", YEAR=1987, KEYWORDS="Overload control", ABSTRACT="This paper discusses the problem of overload control in a public communication network from quite a general point of view. The situation in the network of today is treated and it is pointed out that existing SPC systems have solved the problem in a way that works reasonably well as long as the network carries just traditional telephony. As the network develops towards an ISDN network new questions and difficulties arise.", } @ARTICLE{Kell8703:One, AUTHOR="F. P. Kelly", TITLE="One-Dimensional Circuit-Switched Networks", JOURNAL="The Annals of Probability", VOLUME=15, NUMBER=3, PAGES="1166-1179", YEAR=1987, KEYWORDS="Circuit switching", } @ARTICLE{Kerb87:Generalized, AUTHOR="L. Kerbache and Jonathan Smith", TITLE="The generalized expansion method for open finite queueing networks", JOURNAL=ejor, VOLUME=32, PAGES="448-461", YEAR=1987, KEYWORDS="queueing theory; network; approximation", } @INPROCEEDINGS{Kilk87:Förutspående, AUTHOR="K. Kilkki and K. Rahko", TITLE="Förutspående av Trafikgodhet", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VIII.1.1-10", YEAR=1987, LANGUAGE="Finnish", ABSTRACT="Undersökningens ändamål har varit att utföra ett program, med vilket man kan analysera teletrafikmätningars resultat på möjligast allmänna sätt. Programmet har utvecklats utgående från följande målsättning: Trafiken i modellen bör innefatta olika variationer: både långsamma variationer, vilkas tidsperiod är många vector, och snabba variationer med några sekunders period. Ytterligare bör i modellen beaktas spärrade anrop o", } @ARTICLE{Kirb87:Rule, AUTHOR="H. R. Kirby and F. O. Montgomery", TITLE="Towards a Rule-Based Approach for Traffic Signal Design Design", JOURNAL=ces, VOLUME=4, NUMBER=1, PAGES="202-206", YEAR=1987, KEYWORDS="artificial intelligence; road traffic signal", } @INPROCEEDINGS{Knut87:Modellering, AUTHOR="A. Knutsson", TITLE="Modellering och Analys av Dynamiska Trafiksystem", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="X.4.1-8", YEAR=1987, LANGUAGE="Finnish", } @ARTICLE{Korn87:Reflections, AUTHOR="J. Kornell", TITLE="Reflections on Using Knowledge Based Systems for Military Simulation", JOURNAL="Simulation", VOLUME=48, NUMBER=4, PAGES="144-148", YEAR=1987, KEYWORDS="artificial intelligence; expert system; expert system; knowledge engineering; simulation; military; knowledge based system", } @INPROCEEDINGS{Körn87:Study, AUTHOR="U. Körner", TITLE="A Performance Study of a Cluster of Data Networks", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="V.2.1-18", YEAR=1987, KEYWORDS="Data network; performance evaluation", ABSTRACT="This study is mainly focused on the question of how to model the behaviour of a cluster of heterogeneous data networks. The model takes into account the ``traditional'' physical parts of the networks, parts like transmission links and buffers in network nodes, but also the impact of higher communication protocol layers, i.e. the impact of flow control procedures as well as packet fragmentation and reassembly.", } @INPROCEEDINGS{Körn87:Model, AUTHOR="U. Körner and B. Wallström", TITLE="A Model for Transient Queues in {SPC} Exchanges", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="X.3.1-12", YEAR=1987, KEYWORDS="SPC; queueing system", ABSTRACT="This paper presents a simple analytic model for the transient behaviour of an SPC precessor which is loaded by setting up new calls, as well as by disconnecting terminating calls. The model allows arbitrary call intensity functions and takes into account the impact of the holding time distribution on the process of call termination epochs. The model should help to improve the understanding of system behaviour under varying", } @INPROCEEDINGS{Krag87:Tidstro, AUTHOR="L. A. Kragh and V. B. Iversen", TITLE="Tidstro Simulering af Telenet på {PC'} ere", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="III.1.1-12", YEAR=1987, LANGUAGE="Danish", KEYWORDS="Simulation", ABSTRACT="Simulationsprogrammet SIMSOR-2 simulerer kredsl bskoblede telenet med op til 3 typer trafik. Simulationen er en tidstro diskret simulation. Der indgår 3 typer centraler i modellen: A (Abonnent-central), T (Transit-central) og S (Secondary transit-central). Ledningsbundterne mellem centralerne kan indeholde både enkeltrettede og dobbeltrettede ledninger. Modellen kan behandle 3 forskellige trafiktyper med forkskellige kapa", } @ARTICLE{Krai87:Channel, AUTHOR="B. Kraimeche and M. Schwartz", TITLE="A Channel Access Structure for Wideband {ISDN}", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1327-1335", YEAR=1987, KEYWORDS="multiserver", } @ARTICLE{Kuma8702:Interrelationship, AUTHOR="V. Kumar and J. N. Kapur and O. Hawaleshka", TITLE="On the Interrelationship Between Semi-Open and Closed Queueing Network Models for Flexible Manufacturing System", JOURNAL="Journal of Information \& Optimization Sciences", VOLUME=8, NUMBER=2, PAGES="167-187", YEAR=1987, KEYWORDS="Manufacturing system; queueing network; analysis", ABSTRACT="FMS", } @ARTICLE{Kuma8702:Throughput, AUTHOR="V. Kumar and J. N. Kapur and O. Hawaleshka", TITLE="On Throughput and Congestion Measures for Closed and Semi-Open Network of Queues Models for Flexible Manufacturing Systems", JOURNAL="Journal of Informations \& Optimization Sciences", VOLUME=8, NUMBER=2, PAGES="119-139", YEAR=1987, KEYWORDS="manufacturing system; queueing network; analysis", ABSTRACT="FMS", } @ARTICLE{Lars8706:Perspectives, AUTHOR="R. E. Larson", TITLE="Perspectives on Queues: Social Justice and the Psychology of Queueing", JOURNAL=or, VOLUME=35, NUMBER=6, PAGES="895-905", YEAR=1987, KEYWORDS="Queueing theory; survey", } @ARTICLE{Lee8704:New, AUTHOR="Wenke Lee", TITLE="New Cellular Schemes for Spectral Eficiency", JOURNAL=ieeevt, VOLUME="VT-36", NUMBER=4, PAGES="188-192", YEAR=1987, KEYWORDS="Mobile radio", ABSTRACT="Assuming the constraint of an allocated frequency spectrum, two new schemes are suggested to increase spectral efficiency. Furthermore, the two new schemes can be integrated to become a hybrid system and offer greater performance which takes advantage of the merits and performance of each individual scheme.", } @ARTICLE{Lein8701:Packet, AUTHOR="B. M. Leiner and D. L. Nielson and F. A. Tobagi", TITLE="Issues in Packet Radio network Design", JOURNAL={Proceedings of the IEEE Special issue on " Packet Radio Networks"}, VOLUME=75, NUMBER=1, PAGES="6-20", YEAR=1987, KEYWORDS="Packet radio", } @ARTICLE{Li87:Cycle, AUTHOR="Tongtong Li", TITLE="The Cycle Time Distribution of Exponential Cyclic Queues with Multiple Servers", JOURNAL=spl, VOLUME=6, PAGES="77-81", YEAR=1987, KEYWORDS="machine-repair-man model; queueing network", } @ARTICLE{Li8706:Multiple, AUTHOR="V. Li", TITLE="Multiple Access Communications Networks", JOURNAL=ieeecm, VOLUME=25, NUMBER=6, PAGES="41-48 (paper 3)", YEAR=1987, KEYWORDS="Multiple access", ABSTRACT="This article is an introduction to multiple access communications networks in which the terminals share common communications channels. Multiple access networks include satellite networks, local area networks, and packet radio networks. Various multiple access protocols will be described. We shall also describe how some of these protocols are used in different multiple access networks.", } @ARTICLE{Liao8703:Videoconference, AUTHOR="K. Liao and J. W. Roberts", TITLE="Videoconference Traffic and Network Design", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=3, PAGES="275-282", YEAR=1987, KEYWORDS="Video conference", } @INPROCEEDINGS{Lind87:Generaliseringar, AUTHOR="G. Lind", TITLE="Generaliseringar av Klassisk Köteori", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="III.2.1-18", YEAR=1987, LANGUAGE="Swedish", KEYWORDS="Switching system", ABSTRACT="Avsikten är att diskutera generaliseringar av klassisk köteori och att ge några exampel på sådana generaliseringar. Vad som skall räknas som klassisk köteori kan man naturligtvis ha olika uppfattning om. Jag själv har i tankarna modeller för ett-stegs kösystem (till dem räknas eller flera parallella betjäningsstationer, där modellerna innehåller groundläggande oberoendeantaganden och antaganden om tidshomogenitet. Klassis", } @INPROCEEDINGS{Lind87:En, AUTHOR="K. Lindberger", TITLE="En Modell för Studium av Ojämna Trafikströmmar i Könät", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES=8, YEAR=1987, LANGUAGE="Swedish", KEYWORDS="Packet switching", ABSTRACT="Att ha en viss kontroll över fördelningen av fördröjningar i Packet Switchade telenät är av stor betydelse bl a för att behärska de trafikala aspekterna i dagens låghastighets datanät av typ X25 eller X28. Det är viktigt att veta vilka fördröjningar, som där kan uppstå, även om den totala volvmen av all sådan trafik är så pass måttlig att en transmissionsmässig överdimensionering på grund av brist på noggranna modeller oc", } @INPROCEEDINGS{Lind87:Approximate, AUTHOR="P. O. Lindkvist", TITLE="Approximate Calculation of the Congestions in a Mutual Overflow System", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="III.4.1-10", YEAR=1987, KEYWORDS="Link system; overflow", ABSTRACT="In this paper we deal with an overflow problem, which occurs both in capacity calculations in certain link systems such as subscriber and in calculations of non-hierarchical networks.", } @ARTICLE{Mach8705:Decision, AUTHOR="M. J. Machina", TITLE="Decision Making in the Presence of Risk", JOURNAL="Science", VOLUME=236, NUMBER=5, PAGES="537-543", YEAR=1987, KEYWORDS="Decision theory", } @INPROCEEDINGS{Make87:Tidsdebiteringens, AUTHOR="M. Mäkelä", TITLE="Tidsdebiteringens verkningar i telefontrafiken på helsingfors telefonförenings område", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VIII.3.1-20", YEAR=1987, LANGUAGE="Finnish", } @ARTICLE{Mari87:Note, AUTHOR="Raymond Marie and K. S. Trivedi", TITLE="A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue", JOURNAL=ipl, VOLUME=24, PAGES="397-401", YEAR=1987, KEYWORDS="Queueing system; preemptive priority", ABSTRACT="We study the stability condition of an M/G/1 priority queue with two classes of jobs. Class 1 jobs have preemptive priority over class 2 jobs. We consider three different types of preemptions and the effects of possible work loss (due to preemption) on the stability condition for the queueing system.", } @ARTICLE{Houc8702:Comparison, AUTHOR="D. J. Houck", TITLE="Comparison of Policies for Routing Customers to Parallel Queueing Systems", JOURNAL=or, VOLUME=35, NUMBER=2, PAGES="306-310", YEAR=1987, KEYWORDS="Queueing network; routing", } @ARTICLE{Meie87:Fitting, AUTHOR="K. S. Meier-Hellstern", TITLE="A Fitting Algorithm for Markov-Modulated Poisson Processes Having Two Arrival Rates", JOURNAL=ejor, VOLUME=29, PAGES="370-377", YEAR=1987, KEYWORDS="Mmpp", } @ARTICLE{Mell8705:Expert, AUTHOR="J. M. Mellichamp and A. F. A. Wahab", TITLE="An Expert System for {FMS} Design", JOURNAL="Simulation", VOLUME=48, NUMBER=5, PAGES="201-208", YEAR=1987, KEYWORDS="expert system; flexible manufacturing system; LISP", ABSTRACT="KEE; SIMAN", } @ARTICLE{Mitr87:Asymptotic, AUTHOR="D. Mitra", TITLE="Asymptotic Analysis and Computational Methods for a Class of Simple, Circuit-Switched Networks with Blocking", JOURNAL=aap, VOLUME=19, PAGES="219-239", YEAR=1987, KEYWORDS="Circuit switching", } @ARTICLE{Miya8711:Loss, AUTHOR="K. Miyake", TITLE="Analysis for Loss System with Finite Sources Which Require Several Channels Simultaneously", JOURNAL=ecij1, ADDRESS="Japan", VOLUME=70, NUMBER=11, PAGES="81-89", YEAR=1987, KEYWORDS="multiserver", ABSTRACT="This paper analyzes a loss system with finite sources. The idle period of a source forms a renewal process and each customer requires several channels simultaneously. The service time of customers which require the same number of channels exhibit a general independent identical distribution. This is a general traffic model for a subscriber concentration stage in a high-speed", } @ARTICLE{Mori87:Japan, AUTHOR="T. Mori and T. Iida", TITLE="Japan's Space Development Programs for Communications: An Overview", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=4, PAGES="624-629", YEAR=1987, KEYWORDS="mobile radio", } @ARTICLE{Mouf87:Computer, AUTHOR="Hussein Mouftah and K. S. Shanmugan", TITLE="Computer Aided Techniques for Communications Systems Engineering", JOURNAL=ieeecm, VOLUME=25, NUMBER=7, PAGES="48-54", YEAR=1987, KEYWORDS="performance evaluation", } @ARTICLE{Nedz87:Nonstationary, AUTHOR="O. V. Nedzelnitsky and K. S. Narendra", TITLE="Nonstationary Models of Learning Automata Routing in Data Communication Networks", JOURNAL=ieeesmc, VOLUME="SMC-17", PAGES="1004-1015", YEAR=1987, KEYWORDS="Routing; network optimization", } @ARTICLE{Nels8703:Approximating, AUTHOR="R. T. Nelson and Donald F. Towsley", TITLE="Approximating the Mean Time in System in a Multiple-Server Queue that Uses Threshold Scheduling", JOURNAL=or, VOLUME=35, NUMBER=3, PAGES="419-427", YEAR=1987, KEYWORDS="Queueing system; multiserver", } @INPROCEEDINGS{Niel87:Model, AUTHOR="B. F. Nielsen", TITLE="A Model for Service Protection in a System with Two Types of Customers", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="IX.2.1-20", YEAR=1987, KEYWORDS="Queueing system; priority", ABSTRACT="In this paper we describe a model for service protection in a system with two types of customers. The first type of customers the type 1 customers are blocked if all channels are busy while the other type of customers the type 2 customers are allowed to queue. We want to protect the type 1 customers from total service deterioration as a result of overload from type 2 customers.", } @ARTICLE{Nojo8701:New, AUTHOR="S. Nojo and Hitoshi Watanabe", TITLE="A New Stage Method Getting Arbitrary Coefficient of Variation by Two Stages", JOURNAL="The Transactions of the IEICE", ADDRESS="Japan", VOLUME="E70", NUMBER=1, PAGES="33-36", YEAR=1987, KEYWORDS="Phase-type model", ABSTRACT="The stage method used in the analysis of traffic or reliability models cause an increase in the number of state. For example, the k-2 stage Erlang distribution is used to approximate the general type of distribution, which has a coefficient of variation beta = 1/k (ex. the 100-stage Erlang distribution is used for beta = 0.01). This paper proposes a new type of stage method that needs only two stages to approximate a gene", } @ARTICLE{OCin87:Algorithm, AUTHOR="C. A. O'Cinneide and H. Schneider", TITLE="An Algorithm for Computing the Convolution of Poisson, Negative Binomial, and Geometric Distributions", JOURNAL=or, VOLUME=35, NUMBER=3, PAGES="445-449", YEAR=1987, KEYWORDS="convolution algorithm; infinitely many server queue", ABSTRACT="We present a simple algorithm that computes the convolution of Poisson, negative binomial, and geometric distributions. We show that a certain infinite-server queue in a random facility repair environment has a steady-state distribution that involves such convolutions. The algorithm arises from the steady-state equations of this process.", } @ARTICLE{OKee8704:Interactive, AUTHOR="R. O'Keefe", TITLE="An Interactive Simulation Description Interpreter", JOURNAL="Computers and Operations Research", VOLUME=14, NUMBER=4, PAGES="273-283", YEAR=1987, KEYWORDS="Simulation method; man-machine interaction", } @ARTICLE{Oere87:Quality, AUTHOR="T. I. Oeren", TITLE="Quality Assurance Paradigms for Artificial Intelligence in Modelling and Simulation", JOURNAL="Simulation", VOLUME=48, NUMBER=4, PAGES="149-151", YEAR=1987, KEYWORDS="expert system; ISDN; cognizant quality assurance; Knowledge-base auditing", } @INPROCEEDINGS{Parv87:Average, AUTHOR="A. Parviala", TITLE="The Average Profile Representing the Daily Traffic Flow Measured in A Circuit Group", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VII.3.1-10", YEAR=1987, KEYWORDS="Traffic measurement", ABSTRACT="It is quite commonly assumed that every circuit group has a busy hour with constant time from day to day, although with different times in separate circuit groups. This assumption might be a result of limited measurements, but nevertheless the non-continuous intensity measurements and certain overflow cluster measurements are based on it. In the following, the motivation of such an assumption is looked at.", } @ARTICLE{Pear87:Problem, AUTHOR="C. Pearce", TITLE="On the Problem of Re-Attempted Calls in Teletraffic", JOURNAL="Communication Statististics - Stochastic Models", VOLUME=3, NUMBER=3, PAGES="393-407", YEAR=1987, KEYWORDS="call reattempt", ABSTRACT="A simple form is presented for the solution of Cohen's model for repeated call attempts in teletraffic. The solution avoids the use of contour integrals and matrix operations.", } @INPROCEEDINGS{Piro87:Computer, AUTHOR="M. Pióro and M. Jarocin'ski and T. Wickberg", TITLE="A Computer Based Tool for Designing Non-Hierarchical Circuit Switched Networks", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VI.4.1-14", YEAR=1987, KEYWORDS="Network planning", ABSTRACT="In this paper we present a system of computer programs for the optimization of trunk groups and routing sequences of non-hierarchical circuit switched networks with time variable fixed alternative routing. Input to the system is the cost matrix, traffic matrix and traffic profiles. With the help of the system it is possible design a suboptimal network structure satisfying the desired node-to-node blocking probability constraints", } @INPROCEEDINGS{Piri87:Extended, AUTHOR="A. Pirinen and K. Rahko", TITLE="Extended Moe's Principle", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VI.3.1-12", YEAR=1987, KEYWORDS="Network planning; routing", ABSTRACT="We study optimal dimensioning of a teletraffic route the main goal being in proposing a new method to find the optimum number of lines. The method bases on the redefined classical Moe's principle of teletraffic economics and applies both to Poisson and non-Poisson traffic in a loss system of the full availability. The actual assumptions are that a discrete or continuous traffic distributions of occupied lines", } @ARTICLE{Psaf87:Heterogeneous, AUTHOR="A. Pósafalvi and J. Sztrik", TITLE="On the Heterogeneous Machine Interference with Limited Server's Availability", JOURNAL=ejor, VOLUME=28, PAGES="321-328", YEAR=1987, KEYWORDS="machine-repair-man model; Palm", } @ARTICLE{Pour87:Modeling, AUTHOR="B. Pourbabai", TITLE="Performance modeling of a closed loop material handling system", JOURNAL=ejor, VOLUME=32, PAGES="340-352", YEAR=1987, KEYWORDS="queueing network; approximation; simulation; manufacturing system; machine-repair-man model; Palm", } @INPROCEEDINGS{Rahk87:Telestrugorna, AUTHOR="K. Rahko", TITLE="Telestrugorna och deras Kommunikationsmedel och Roll i Teletrafikforskning och Undervisning", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="III.3.1-6", YEAR=1987, LANGUAGE="Finnish", ABSTRACT="År 1986 grundades en samnordisk organisation av telestugan FILIN, med syfte att befrämja spridningen av telestugideen, speciellt i glesbygd i Norden och att utveckla modeller för hela världen. Undertecknad höll föredrag om telestugor vid ett Pacific Telecommunication Counsils seminarium i Honolului februari detta år (Referens 1.) och ledde där ett seminarium om telestugor i Stilla havsregionen. Avsikten var att utveckla e", } @INPROCEEDINGS{Rapp87:Approximate, AUTHOR="D. Rapp", TITLE="Approximate Analysis of Response-Times in Queues with Delayed Feedback", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="IV.3.1-16", YEAR=1987, KEYWORDS="Feedback queue", ABSTRACT="We consider a class of queueing networks witch could be modeled as a FCFS single-server queue with direct and delayed feedback. Markovian product-form queueing networks are assumed. We consider a tagged customer witch visits servers according to a specific and individual pattern. Approximate formulae for the distribution of the total response-time of the tagged customer is calculated.", } @ARTICLE{Rath8710:Service, AUTHOR="R. N. S. Rathore and E. L. Pinnes", TITLE="Service Provisioning Operations for Public Packet Switched Network {(PPSN)} Access", JOURNAL=ieeecm, VOLUME=25, NUMBER=10, PAGES="22-27", YEAR=1987, KEYWORDS="Packet switching", } @ARTICLE{Redd87:Epistemology, AUTHOR="R. Reddy", TITLE="Epistemology of Knowledge Based Simulation", JOURNAL="Simulation", VOLUME=48, NUMBER=4, PAGES="162-166", YEAR=1987, KEYWORDS="decision theory; tutorial; expert system; automation of analysis; knowledge representation", } @TECHREPORT{Roos87:Efficient, AUTHOR="A. H. Roosma", TITLE="Efficient Models for Traffic Flow in Telecommunication Networks with Arbitrary Routing. Part {A:} Basic Model and Convergence. Part {B:} Improved Models", INSTITUTION="Netherlands PTT, Dr. Neher Laboratory, Department of Applied Mathematics", ADDRESS="Leidschendam, Netherlands", PAGES=32, YEAR=1987, KEYWORDS="Routing", } @ARTICLE{Rose8703:Nonlinear, AUTHOR="E. Rosenberg", TITLE="A Nonlinear programming heuristic for computing optimal link capacities in a multi-hour alternate routing communications network", JOURNAL=or, VOLUME=35, NUMBER=3, PAGES="354-364", YEAR=1987, KEYWORDS="Communication network; alternate routing", } @ARTICLE{Roth8706:Perspectives, AUTHOR="M. H. Rothkopf and P. Rech", TITLE="Perspectives on Queues: Combining Queues is not always beneficial", JOURNAL=or, VOLUME=35, NUMBER=6, PAGES="906-909", YEAR=1987, KEYWORDS="Queueing system; survey", } @ARTICLE{Ruiz8704:Hybrid, AUTHOR="S. Ruiz-Mier and J. Talavage", TITLE="A Hybrid Paradigm for Modeling of Complex Systems", JOURNAL="Simulation", VOLUME=48, NUMBER=4, PAGES="135-141", YEAR=1987, KEYWORDS="discrete event simulation; object-oriented programming", ABSTRACT="Logic programming; Network modelling", } @ARTICLE{Sala8708:Network, AUTHOR="A. C. Salazar and P. J. Scarfo and R. J. Horn I. I. I", TITLE="Network Management Systems for Data Communications", JOURNAL=ieeecm, VOLUME=25, NUMBER=8, PAGES="21-27", YEAR=1987, KEYWORDS="Data network; network management", } @ARTICLE{Sand8708:Estimating, AUTHOR="B. Sanders and E. A. Van Doorn", TITLE="Estimating Time Congestion from Traffic Parameters", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=8, PAGES="856-862", YEAR=1987, KEYWORDS="Arrival process; overflow traffic", ABSTRACT="We address the problem of estimating the time congestion of a finite trunk group from the size of the group and the mean and peakedness factor of the offered traffic. In order to be able to assess the relative merits of the various estimates, we adopt a common setting where the offered traffic is simple overflow traffic. Next to giving brief description of earlier results, we elaborate on some of the earlier suggestions", } @ARTICLE{Shan87:Optimal, AUTHOR="J. G. Shanthikumar and D. D. Yao", TITLE="Optimal Server Allocation in a System of Multi-Server Stations", JOURNAL=ms, VOLUME=33, NUMBER=9, PAGES="1173-1180", YEAR=1987, KEYWORDS="closed queueing network; buffer; allocation; concavity of throughput; optimal server buffer allocation", } @ARTICLE{Soko8703:Problem, AUTHOR="V. A. Sokolov", TITLE="The Problem of Standardizing Grade of Service in Telephone Networks", JOURNAL="Telecommunications and Radio Engineering", ADDRESS="SU", VOLUME="41/42", NUMBER=3, PAGES="13-18", YEAR=1987, KEYWORDS="Telephony; GOS", } @INPROCEEDINGS{Soyl87:Midlere, AUTHOR="T. Søyland", TITLE="Midlere Sperr - Et Styringskriterium for Investeringer i Telefonnettet", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VII.2.1-16", YEAR=1987, LANGUAGE="Swedish", } @ARTICLE{Spea87:Broadband, AUTHOR="D. R. Spears", TITLE="Broadband {ISDN} Switching Capabilities from a Services Perspective", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1222-1230", YEAR=1987, KEYWORDS="ATM", } @INPROCEEDINGS{Stax87:Packet, AUTHOR="P. Staxén and K. Sällberg", TITLE="Packet-oriented Multiplexing Methods for Broadband {ISDN}", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="V.3.1-18", YEAR=1987, KEYWORDS="B-ISDN; ATM; statistical multiplexing", ABSTRACT="The switching and transmission methods used in present packet data communications networks will not be sufficient in a future broadband ISDN, which will utilize transmission rates of several hundreds of Mbits/s. The aspects of different multiplexing methods in broadband networks are discussed in terms of packet losses, delays, bandwidth flexibility, overload sensitivity and throughput.", } @ARTICLE{Step8702:Qualitative, AUTHOR="S. N. Stepanov and I. I. Tsitovich", TITLE="Qualitative Methods of Analysis of Systems with Repeat Calls", JOURNAL="Problems of Information Transmission", ADDRESS="SU", VOLUME=23, NUMBER=2, PAGES="156-173", YEAR=1987, KEYWORDS="Call reattempt", } @INPROCEEDINGS{Stor87:Utvidet, AUTHOR="K. Stordahl", TITLE="Utvidet veiet minste kvadraters metode for prognostisering av trafikkmatriser", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="VIII.2.1-20", YEAR=1987, LANGUAGE="Danish", ABSTRACT="Med trafikkmatriseprognostisering menes at det lages prognoser for en hel trafikkmatrise. Dette gjøres i to step. Først lages det prognoser for rad- og kolonnesummene og eventuelt alle elementene i trafikkmatrisen. Til dette benyttes tradisjonelle prognosemodeller. Neste step består i å justere prognosene i trafikkmatrisen slik at det blir konsistens eksempelvis mellom elementene og rad- og kolonnesummene. Denne justering", } @ARTICLE{Sumi87:Comparison, AUTHOR="S. Sumita", TITLE="Comparison of Integration and Segregation Schemes for a Loss System Having Two Types of Traffic", JOURNAL="The Transactions of the IEICE", VOLUME="E 70", NUMBER=1, PAGES="4-6", YEAR=1987, KEYWORDS="multiserver", } @ARTICLE{Svor87:Loss, AUTHOR="A. Svoronos and L. Green", TITLE="The N-Seasons S-Servers Loss System", JOURNAL=navres, VOLUME=34, PAGES="579-591", YEAR=1987, KEYWORDS="Loss system", } @ARTICLE{Sztr87:Heterogeneous, AUTHOR="J. Sztrik", TITLE="On the Heterogeneous M/G/n Blocking System in a Random Environment", JOURNAL=jors, VOLUME=38, NUMBER=1, PAGES="57-63", YEAR=1987, KEYWORDS="loss system", } @ARTICLE{Taka8702:Applications, AUTHOR="H. Takagi", TITLE="Analysis and Applications of a Multiqueue Cyclic Service System with Feedback", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=2, PAGES="248-250", YEAR=1987, KEYWORDS="Cyclic service", } @ARTICLE{Taka8703:Formula, AUTHOR="H. Takahashi and H. Akimaru", TITLE="A Formula for Mean Queue Length of {GI1} {GI2/GI1} {GI2/1} Preemptive-Resume Priority Queues", JOURNAL=ecij1, ADDRESS="Japan", VOLUME=70, NUMBER=3, PAGES="11-19", YEAR=1987, KEYWORDS="Queueing system; preemptive priority", } @ARTICLE{Tezu8708:Walsh, AUTHOR="S. Tezuka", TITLE="Walsh-Spectral Test for {GFSR} Pseudorandom Numbers", JOURNAL=cacm, VOLUME=30, NUMBER=8, PAGES="731-735", YEAR=1987, KEYWORDS="RNG; spectral test", } @INPROCEEDINGS{Tidb87:Mätning, AUTHOR="S.-E. Tidblom", TITLE="Mätning, Analys och Modellering av Paketfördröjningar i Datapaknätet", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="V.1.1-32", YEAR=1987, LANGUAGE="Swedish", KEYWORDS="Packet switching", ABSTRACT="Data, som sänds över Datapaknätet, fördröjs alltid vid passage genom stationer på vägeh mellan A- och B-abonnent. Fördröjningarna beror på att dätapaketen, vid varje passage av en datamaskin, måste genomgå ett antal servicesteg med tillhörande väntan på service. För att mäta dessa fördröjningar finns två hjälpmedel: XTEST och XRAY. XTEST-utrustningen, som framtagits av AU-system, används huvudsakligen för kontrol av sina", } @INCOLLECTION{den87:Throughput, AUTHOR="J. van den and O. J. Boxma", TITLE="Throughput analysis of a Flow-Controlled Communication Network with Buffer Space Limitations", BOOKTITLE="Flow Control of Congested Networks", EDITOR="Amedeo R. Odoni and Lucio Bianco and Giorgio Szegö", PUBLISHER="Springer", PAGES="173-188", YEAR=1987, KEYWORDS="communication network; flow control; overflow; acknowledgement; closed queueing network; throughput", } @ARTICLE{VanD87:Simple, AUTHOR="N. Van Dijk", TITLE="Simple and Insensitive Bounds for a Grading and an Overflow Model", JOURNAL=orl, VOLUME=6, NUMBER=2, PAGES="73-76", YEAR=1987, KEYWORDS="queueing system; overflow; loss probability; upper bound; lower bound; local balance; job-local-balance; insensitivity", ABSTRACT="Simple and intuitively obvious lower and upper bounds are suggested for a specific grading and an overflow model. The bounds are based on product-type modifications and are insensitive. Numerical support indicates a potential usefulness for quick engineering purposes.", } @INPROCEEDINGS{Voig87:Processor, AUTHOR="H. Voigt", TITLE="On Processor Load Control Strategies", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="X.2.1-16", YEAR=1987, KEYWORDS="SPC; overload control", ABSTRACT="To be able to run an SPC system during all traffic situations and avoid throughput degradation at overload, some sort of supervision is required. One necessary control mechnism is processor load control, applied to the processors in the SPC system. In this paper three existing processor load control methods are discussed, the ones implemented in the systems AXE, ITT 1240 and AXB. The AXE and the ITT 1240 load control algorithms", } @INPROCEEDINGS{Wall87:Job, AUTHOR="B. Wallström", TITLE="On Job Arrival Processes in {SPC-System}", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="II.1.1-8", YEAR=1987, KEYWORDS="SPC; arrival process", ABSTRACT="This paper presents a unified model for different job arrival sequences in SPC system that result from customer activities. The model assumes a general time dependent poissonian call arrival stream and general distributions of typical customer dependent times, e.q. pre-dialling delays, inter digit delays and call holding times. The model has shown very useful as a basis for analytic studies of transient queueing problems", } @ARTICLE{Wang8711:Application, AUTHOR="Q. R. Wang and V. K. Bhargava", TITLE="On the Application of Importance Sampling to {BER} Estimation in the Simulation of Digital Communication Systems", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=11, PAGES="1231-1233", YEAR=1987, KEYWORDS="Channel simulation", } @ARTICLE{Whit8702:Cellular, AUTHOR="J. Whitehead", TITLE="Cellular System Design: An Emerging Engineering Discipline", JOURNAL=ieeecm, VOLUME=24, NUMBER=2, PAGES="8-15", YEAR=1987, KEYWORDS="Mobile radio", } @ARTICLE{Wort87:Queueing, AUTHOR="D. J. Worthington", TITLE="Queueing Models for Hospital Waiting Lists", JOURNAL=jors, VOLUME=38, NUMBER=5, PAGES="413-422", YEAR=1987, KEYWORDS="health services; case study; queueing system", ABSTRACT="Results of some recent research into queueing models are applied to the hospital waiting-list problem to give some important insights into the likely implications of attempts to reduce waiting lists.", } @ARTICLE{Yama8708:Optimal, AUTHOR="G. Yamazaki and H. Sakasegawa", TITLE="An Optimal Design Problem for Limited Processor Sharing Systems", JOURNAL=ms, VOLUME=33, NUMBER=8, PAGES="1010-1019", YEAR=1987, KEYWORDS="Processor sharing", } @ARTICLE{Yang87:Retrial, AUTHOR="T. Yang and J. G. C. Templeton", TITLE="A Survey on Retrial Queues", JOURNAL=qs, VOLUME=2, PAGES="201-233", YEAR=1987, KEYWORDS="Imbedded Markov chain; call reattempt; stochastic decomposition", ABSTRACT="Queueing Systems in which arriving customers who find all servers and waiting positions (if any) occupied may retry for service after a period of time are called retrial queues or queues with repeated orders. Retrial queues have been widely used to model many problems in telephone switching systems, telecommunication networks, computer networks and computer systems. In this paper, we discuss some", } @ARTICLE{Yao87:Arrangement, AUTHOR="D. D. Yao", TITLE="The Arrangement of Servers in an Ordered-Entry System", JOURNAL=or, VOLUME=35, PAGES="759-763", YEAR=1987, KEYWORDS="Queueing system", } @ARTICLE{Yao8701:Modeling, AUTHOR="D. D. Yao and J. A. Buzacott", TITLE="Modeling a Class of Flexible Manufacturing Systems with Reversible Routing", JOURNAL=or, VOLUME=35, NUMBER=1, PAGES="87-93", YEAR=1987, KEYWORDS="Manufacturing system; routing", } @ARTICLE{Yao87:Reducing, AUTHOR="D. D. Yao and S. Kim", TITLE="Reducing the Congestion in a Class of Job Shops", JOURNAL=ms, VOLUME="33 (1989)", NUMBER=9, PAGES="1165-1172", YEAR=1987, KEYWORDS="Majorization; arrangement ordering; likelihood ratio ordering; stochastic ordering; open queueing network", } @ARTICLE{Yao8701:Optimal, AUTHOR="D. D. Yao and J. G. Shantikumar", TITLE="The Optimal Input Rates to a System of Manufacturing Cells", JOURNAL=infor, VOLUME=25, NUMBER=1, PAGES="57-65", YEAR=1987, KEYWORDS="Manufacturing system", } @ARTICLE{Zeki8701:Average, AUTHOR="S. Zekici", TITLE="Average Waiting time in Queues with Scheduled Batch Services", JOURNAL="Transportation Science", VOLUME=21, NUMBER=1, PAGES="55-61", YEAR=1987, KEYWORDS="Queueing system; batch arrival; waiting time", } @ARTICLE{Zied87:Quasi, AUTHOR="I. Ziedins", TITLE="Quasi-Stationary Distributions and One-Dimensional Circuit-Switched Networks", JOURNAL=jap, VOLUME=24, PAGES="965-977", YEAR=1987, KEYWORDS="birth-death process; communication network", ABSTRACT="We discuss the quasi-stationary distribution obtained when a simple birth and death process is conditioned on never exceeding K. An application of this model to one-dimensional circuit-switched communication networks is described, and some special cases examined.", } @INPROCEEDINGS{Iver87:Simple, AUTHOR="V. B. Iversen", TITLE="A Simple Convolution Algorithm for The Exact Evalution of Multi-Service Loss Systems with Heterogeneous Traffic Flows and Access Control", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="IX.3.1-22", YEAR=1987, KEYWORDS="Loss system; multiserver; algorithm", ABSTRACT="We present a simple algorithm for the exact evalution of a multi-service system with heterogeneous service requirements and n servers, eg. an ISDN-node with N different types of calls. The system is operated as a loss system. The arrival processes are state-dependent Poisson arrival processes, and the holding time distributions are general distributions. Calls of type i requires Ci servers, and the number of calls Xi", } @INPROCEEDINGS{Jaco87:Telekommunikationspolicy, AUTHOR="C. Jacobaeus", TITLE="Telekommunikationspolicy och Telesystemkonstruktion Några Industriella Synpunkter", BOOKTITLE="NTS 7", ADDRESS="Lund, Sweden", PAGES="I.1.1-6", YEAR=1987, KEYWORDS="Communication network", ABSTRACT="Föredraget handlar om det ömsesidiga inflytandet mellan telekommunikationspolicy och telesystemkonstruktion med särskild hänsyn till industrins synpunkter. Industrin kan nu erbjuda utrustning som kan möta nästan alla krav från administrationer (regeringar). Detta är ett faktum för både automatstationer och transmissionsutrustning. Likaså har material för lokalnät givit administrationerna mycket strörre frihet än tidigare.", } @ARTICLE{Jajs8712:Dynamic, AUTHOR="A. Jajszczyk", TITLE="A Dynamic Programming Approach to Optimization of Switching Networks Composed of Digital Switching Matrices", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=12, PAGES="1342-1346", YEAR=1987, KEYWORDS="Switching network; optimization", } @BOOK{Ghez87:Programming, AUTHOR="C. Ghezzi and M. Jazayeri", TITLE="Programming Language Concepts {2/E}", PUBLISHER="John Wiley", YEAR=1987, KEYWORDS="Programming; programming language", } @ARTICLE{Link87:Universal, AUTHOR="C. Links and W. Diepstraten and V. Hayes", TITLE="Universal Wireless {LANs}", JOURNAL=byte, PAGES="99-108", YEAR=1987, KEYWORDS="LAN; mobile radio", ABSTRACT="A new IEEE standard (IEEE 802.11) promises to bring interoperability to the wireless LAN marketplace.", } @TECHREPORT{Jain87:Congestion, AUTHOR="Raj Jain and K. G. Ramakrishnan and D. Chiu", TITLE="Congestion Avoidance in Computer Networks with a Connectionless Network Layer", INSTITUTION="DEC", NUMBER="DEC-TR-506", PAGES=17, NOTE="DEC-TR-506, reprinted in C. Partridge, Ed., {\em Innovations in Internetworking}, 140--156, published by Artech House, October 1988", YEAR=1987, ABSTRACT="Widespread use of computer networks and the use of varied technology for the interconnection of computers has made congestion a significant problem. In this report, we summarize our research on congestion avoidance. We compare the concept of congestion avoidance with that of congestion control. Briefly, congestion control is a recovery mechanism, while congestion avoidance is a prevention mechanism. A congestion control scheme helps the network to recover from the congestion state while a congestion avoidance scheme allows a network to operate in the region of low delay and high throughput with minimal queuing, thereby preventing it from entering the congested state in which packets are lost due to buffer shortage. A number of possible alternatives for congestion avoidance were identified. From these alternatives we selected one called the binary feedback scheme in which the network uses a single bit in the network layer header to feed back the congestion information to its users, which then increase or decrease their load to make optimal use of the resources. The concept of global optimality in a distributed system is defined in terms of efficiency and fairness such that they can be independently quantified and apply to any number of resources and users. The proposed scheme has been simulated and shown to be globally efficient, fair, responsive, convergent, robust, distributed, and configuration-independent.", URL="http://www.cis.ohio-state.edu/~jain/papers/cr5.htm", } @INPROCEEDINGS{Ofek87:Distributed, AUTHOR="Y. Ofek and Michael Faiman", TITLE="Distributed Global Event Synchronization in a Fiber Optic Hypergraph Network", BOOKTITLE=dcs, PAGES="307-314", YEAR=1987, ABSTRACT="The principles and the design of global event synchronization in a large area network (about 10,000 nodes within 1000$km sup 2$), are presented and nalyzed in this paper. The network architecture is a hypergraph, its edges are nets or buses, and its vertices are nodes. The communication over each net is time slotted, and the event duration is one time slot. Synchronization among all the system's nets is maintained and, as a result, this distributed system preserves a total ordering of all the events in the system. It is shown that this total ordering is achieved with small communication overhead (less than 5\%). Each net is a passive, centralized optical star, with a bandwidth of about 1 gigabit/second. The high bandwidth enables a wide multiple-access nets, therefore, the dimension of the hypergraph is low. The low dimension allows the timing and state information to propagate quickly through the system, and simplifies the distributed switching in the network.", } @INPROCEEDINGS{Ofek87:Resource, AUTHOR="Y. Ofek and Philip McKinley", TITLE="Resource Sharing on an Optical Hypergraph Using Open Loop Locking", BOOKTITLE="IEEE Symposium on the Simulation of Computer Networks", PAGES="159-169", YEAR=1987, ABSTRACT="An optical hypergraph is a network architecture in which each edge of the hypergraph, a net, is a multiple-access broadcast medium constructed as a passive optical star. Access to each net is time-slotted, and slots are of fixed length. The major operational principle of the system is global synchronization which enables total event ordering. The network may have thousands of nodes which are distributed over an area of thousands of square kilometers. This paper describes a mechanism for sharing independent, replicated data base objects among collections of cooperating processes in an optical hypergraph. Locks are used to provide mutual exclusion. By including lock requests as part of control information transmitted at the beginning of each slot, and by exploiting the fact that such control information pervades a hypergraph in short, bounded time. Locking a resource can proceed in an open loop fashion, i.e., locking without explicit acknowledgement messages, but with negative acknowledgement in the case of a failure. The basic functionality of the protocol is presented, with emphasis on adaptation to high network loads, either by aborting requests or by scheduling requests in two broadcast phases.", } @INPROCEEDINGS{Lehm87:Recovery, AUTHOR="T. J. Lehman and M. Carey", TITLE="A Recovery Algorithm for a High Performance Memory-Resident Database System", BOOKTITLE="ACM SIGMOD Conference on Management of Data", PAGES="104-117", YEAR=1987, } @INPROCEEDINGS{Ande87:Empirical, AUTHOR="D. P. Anderson and D. Ferrari and P. V. Rangan and B. Sartirana", TITLE="The Empirical Evaluation of a Security-Oriented Datagram Protocol", BOOKTITLE="Performance", PUBLISHER="North-Holland", ADDRESS="Brussels, Belgium", YEAR=1987, REFERENCES=21, KEYWORDS="Authentication; protocol specification; transport protocol; performance evaluation; hardware encryption; security; cost; measurement; trace driven simulation", } @ARTICLE{Toba87:Modeling, AUTHOR="F. A. Tobagi", TITLE="Modeling and performance analysis of multihop packet radio networks", JOURNAL=ieeeproc, VOLUME=75, NUMBER=1, PAGES="135-155", YEAR=1987, REFERENCES=80, KEYWORDS="Packet radio; multihop; performance evaluation", } @ARTICLE{Blac87:Architecture, AUTHOR="J. P. Black and L. F. Marshall and B. Randell", TITLE="The Architecture of {UNIX} United", JOURNAL=ieeeproc, VOLUME=75, NUMBER=5, PAGES="709-718", YEAR=1987, REFERENCES=16, KEYWORDS="UNIX; architecture; operating system; structure", ANNOTE="UNIX United is an architecture for a distributed system based on UNIX. After a description of the basic semantics follows that of the architecture and of the software structure.", } @ARTICLE{Reed87:Parallel, AUTHOR="Daniel Reed and D. Allen and Bradley D. McCredie", TITLE="Parallel discrete event simulation: A shared memory approach", JOURNAL=per, ISBN="0-89791-225-X", VOLUME=15, PAGES="36-38", YEAR=1987, KEYWORDS="Discrete event simulation; distributed simulation", ANNOTE="The inherently sequential nature of event list manipulation limithe potential parallelism of standard simulation models. Althougtechniques for performing event list manipulation and event simulation in parallel have been suggested, large scale performaincreases seem unlikely. Only by eliminating the event list, in traditional form, can additional parallelism be obtained; this igoal of distributed simulation. Several distributed simulation", } @ARTICLE{Yunu87:Approximation, AUTHOR="N. M. Yunus", TITLE="Approximation for Mean of Overflow Traffic with Discrete Time-dependent Input", JOURNAL=ieeeproc, VOLUME=75, NUMBER=11, YEAR=1987, KEYWORDS="Overload control; flow control; communication network", } @INPROCEEDINGS{Hsia87:Game, AUTHOR="M. Hsiao and Aurel A. Lazar", TITLE="A Game Theoretic Aproach to Dezentralized Flow Control of Marko vian Queueing Networks", BOOKTITLE="Performance", EDITOR="P.-J. Courtois and G. Latouche", PUBLISHER="North-Holland", PAGES="55-73", YEAR=1987, KEYWORDS="Queueing network; packet switching; flow control; congestion control; buffer management; resource sharing", ABSTRACT="A computer communication network in which multiple controllers execute decentralizet flow control is analyzed using a Markovianqueueing network model. The user optimization criterion in whicheach individual user maximizes its average throughput subject toa constraint on its average time delay is investigated. The individual unser's performance collectively define a multiple objective optimization problem and lead to a game theoretic formulatin", } @INPROCEEDINGS{Ganz87:Finite, AUTHOR="A. Ganz and I. Chlamtac", TITLE="Finite Buffer Queueing Model For P-Persistent {CSMA/CD} {PROTOCOL}", BOOKTITLE="Performance", PAGES="481-495", YEAR=1987, } @MISC{Sjo:lic, AUTHOR={P. Sj{\"o}di}, TITLE="Optimizing Protocol Implementations for {Performance--A} Case Study", HOWPUBLISHED="Licentiate thesis", YEAR=1987, } @INPROCEEDINGS{Jubi87:DARPA, AUTHOR="J. Jubin and J. Tornow", TITLE="The {DARPA} Packet Radio Network Protocols", BOOKTITLE="IEEE", VOLUME="75,1", PAGES="21-32", YEAR=1987, } @ARTICLE{Li8701:Homogeneous, AUTHOR="Kin Li and Nikitas Dimopoulos", TITLE="The performance analysis of the Homogeneous Multiprocessor Proper", JOURNAL="Canadian Electrical Engineering Journal", VOLUME=12, NUMBER=1, PAGES="3-10", MONTH=jan, YEAR=1987, } @BOOK{Stal8701:Handbook, AUTHOR="W. Stallings", TITLE="Handbook of Computer-Communications Standards; Vol 1: The Open Systems Interconnection {(OSI)} Model and {OSI-related} Standards", PUBLISHER="Macmillan Publishing Company", ADDRESS="New York, NY", MONTH=jan, YEAR=1987, } @ARTICLE{Stef8701:Chalkboard, AUTHOR="M. Stefik and Gregg Foster and Daniel G. Bobrow and Kenneth Kahn and Stan Lanning and Lucy Suchman", TITLE="Beyond the chalkboard: computer support for collaboration and problem solving in meetings", JOURNAL=cacm, VOLUME=30, NUMBER=1, PAGES="32-47", MONTH=jan, YEAR=1987, REFERENCES=35, KEYWORDS="CSCW; computer-supported collaboration; computer-supported groups; computer-supported meetings; multi-user interface", ABSTRACT="Although individual use of computer is fairly widespread, in meetings we tend to leave them behind. At Xerox PARC, an experimental meeting room called the Colab has been created to study computer support of collaborative problem solving in face-to-face meetings. The long-term goal is to understand how to build computer tools to make meetings more effective.", } @ARTICLE{Albe8701:Testen, AUTHOR="R. Albers and W. Daniel and R. Lehnert and W. Lemppenau", TITLE="Testen von Vermittlungssystemen mit Hilfe des Umweltsimulators {UNES}", JOURNAL=pkitm, ADDRESS="Nürnberg", PAGES="25-30", MONTH=jan, YEAR=1987, LANGUAGE="German", REFERENCES=5, KEYWORDS="Environment simulation; UNES; universal environment simulator", } @INPROCEEDINGS{Pryc8701:ATD, AUTHOR="M. de Prycker and J. G. Bauwens", TITLE="The {ATD} concept: one universal bearer service", BOOKTITLE="GSLB Seminar on Braodband Switching", ADDRESS="Albufeira", PAGES="103-113", MONTH=jan, YEAR=1987, REFERENCES=9, KEYWORDS="ATM", } @INPROCEEDINGS{Fish8701:Architectural, AUTHOR="D. G. Fisher", TITLE="Architectural aspects of an {ATD} based integrated broadband network", BOOKTITLE="GSLB Seminar on Broadband Switching", ADDRESS="Albufeira", PAGES="93-102", MONTH=jan, YEAR=1987, KEYWORDS="ATM; BISDN; future outlook", } @INPROCEEDINGS{Kric8701:ATD, AUTHOR="W. Krick and W. Kowalk", TITLE="{ATD} transfer gain versus information loss and delay by means of service and network models", BOOKTITLE="GSLB Seminar on Broadband Switching", ADDRESS="Albufeira", PAGES="257-265", MONTH=jan, YEAR=1987, REFERENCES=5, KEYWORDS="ATM; loss probability; performance evaluation", ANNOTE="A better utilization of network resources using ATD is considered. The possibility to save transmission capacity or increase the number of virtual channels, has to be investigated considering the performance criteria for typical services.", } @INPROCEEDINGS{Prot8701:Resource, AUTHOR="E. Protonotarios and others", TITLE="Resource Allocation and performance aspects of asynchronous time division {(ATD)} networks", BOOKTITLE="GSLB Seminar on Braodband Switching", ADDRESS="Albufeira", PAGES="192-202", MONTH=jan, YEAR=1987, REFERENCES=7, KEYWORDS="ATM; Resource allocation; routing algorithm", } @ARTICLE{Supp8701:Planung, AUTHOR="J. Suppan-Borowka", TITLE="Planung und Gestaltung von Lokalen Netzen zur Kommunikation zwischen Großrechnern, Terminals und Personal Computern", JOURNAL=datacom, VOLUME=1, PAGES="110-116", MONTH=jan, YEAR=1987, LANGUAGE="German", REFERENCES=4, KEYWORDS="LAN; network planning; analysis; architecture; traffic density", ANNOTE="A survey about the main aspects for planning a LAN is given. These aspects are: analysis of the expected traffic density, definition of the necessary services, decision about the network structure and aspects of futural extensions and the integration in a communication system.", } @ARTICLE{Dixo8701:Lore, AUTHOR="R. C. Dixon", TITLE="Lore of the Token Ring", JOURNAL=ieeenet, VOLUME=1, NUMBER=1, PAGES="11-18", MONTH=jan, YEAR=1987, REFERENCES=10, } @ARTICLE{Need8701:Athentication, AUTHOR="R. M. Needham and M. D. Schroeder", TITLE="Athentication Revisited", JOURNAL=acmosrev, VOLUME=21, NUMBER=1, PAGES=7, MONTH=jan, YEAR=1987, } @ARTICLE{Otwa8701:Efficient, AUTHOR="D. Otway and O. Rees", TITLE="Efficient and Timely Mutual Authentication", JOURNAL=acmosrev, VOLUME=21, NUMBER=1, PAGES="8-10", MONTH=jan, YEAR=1987, } @ARTICLE{Pitt8701:Standards, AUTHOR="D. Pitt", TITLE="Standards for the Token Ring", JOURNAL=ieeenet, VOLUME=1, NUMBER=1, PAGES="19-22", MONTH=jan, YEAR=1987, REFERENCES=9, } @ARTICLE{Ross8701:Rings, AUTHOR="Floyd E. Ross", TITLE="Rings Are 'Round for Good", JOURNAL=ieeenet, VOLUME=1, NUMBER=1, PAGES="31-38", MONTH=jan, YEAR=1987, REFERENCES=8, ABSTRACT="A ring topology is one where the stations are serially arranged using point-to-point connections between adjacent stations, such that a message must be received and then retransmitted, that is, repeated, by each station in turn as it progresses around the ring. After years of largely theoretical interest, ring topologies have enjoyed a surge in popularity during this decade. This article examines two broadly supported ring designs, Institute of Electrical and Electronic Engineers (IEEE) 802.5 and the Fiber Distributed Data Interface (FDDI), currently emerging as Local Area Network (LAN) standards, and explores the basis for this new-found interest in ring topologies. The many advantages that ring designs offer are presented, and based upon these, a proliferation of rings is envisioned in the next decade.", } @TECHREPORT{Star8701:Kernel, AUTHOR="R. Staroste and H. Eberle", TITLE="Kernel Service Call - A Multitasking Facility for Heterogeneous Enviornments", INSTITUTION="IBM European Networking Center", NUMBER="43.8701", MONTH=jan, YEAR=1987, } @ARTICLE{Stro8701:IBM, AUTHOR="N. C. Strole", TITLE="The {IBM} Token-Ring Network - A Functional Overview", JOURNAL=ieeenet, VOLUME=1, NUMBER=1, PAGES="23-30", MONTH=jan, YEAR=1987, REFERENCES=19, ABSTRACT="This article describes the IBM Token-Ring Network, which is based on a ring topology with token-access control. A description of the star-wired ring topology and the functions of several of the key physical components that comprise a token-ring network are given. The token-access control protocol for regulating data flow on the ring is explained, including the data frame format and addressing structures, mechanisms for ensuring token integrity and fair token access to all attached nodes, and some token-ring performance attributes. The relationship between the token-ring architecture and Systems Network Architecture (SNA) is also discussed. Some of the fault detection and isolation capabilities that are available with the token-ring LAN are also presented.", } @ARTICLE{Will8701:Token, AUTHOR="M. Willett", TITLE="Token-Ring Local Area Networks - An Introduction", JOURNAL=ieeenet, VOLUME=1, NUMBER=1, PAGES="8-9", MONTH=jan, YEAR=1987, REFERENCES=1, } @INPROCEEDINGS{Rama8701:Protocols, AUTHOR="S. Ramakrishnan and B. N. Jain", TITLE="Protocols for Reliable Multicast Over Local Area Networks", BOOKTITLE="Twentieth Hawaii International Conference on System Sciences 1987", EDITOR="E. A. Stohr and L. Hoevel and L. S. Haynes", PUBLISHER="Hawaii International Conference Syst. Sci.", ADDRESS="Honolulu", PAGES=500, NOTE="Published as Proceedings of the Twentieth Hawaii International Conference on System Sciences 1987, volume 3, number 2", MONTH=jan, YEAR=1987, ABSTRACT="One page summary only . Focuses on the design, analysis and simulation of multicast protocols. The aim is to develop protocols for reliable multicast communication from one transmitter (designated as the primary) to a group of $N$ receivers (secondaries), assuming an arbitrary channel access scheme and an already established virtual circuit like connection.", } @TECHREPORT{Zhou8701:Experimental, AUTHOR="Songnian Zhou and D. Ferrari", TITLE="An Experimental Study of Load Balancing Performance", TYPE="Technical Report", INSTITUTION="UCB", ADDRESS="Berkeley, California", MONTH=jan, YEAR=1987, KEYWORDS="Load Balancing", } @TECHREPORT{Razo8701:Guided, AUTHOR="R. R. Razouk", TITLE="A Guided Tour of {P-NUT} (Release 2.2)", TYPE="Technical Report", INSTITUTION="University of California, Irvine, Department of Information and Computer Science", NUMBER="ICS-TR-86-25", PAGES=41, MONTH=jan, YEAR=1987, 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 begi nning 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{Bane8701:Data, AUTHOR="J. Banerjee and H. Chou and J. Garza and W. Kim and D. Woelk and N. Ballou and Hyun Kim", TITLE="Data Model Issues for Object-Oriented Applications", JOURNAL=toois, ORGANIZATION="ACM", VOLUME=5, NUMBER=1, PAGES="3-26", MONTH=jan, YEAR=1987, } @ARTICLE{Fish8701:Iris, AUTHOR="D. Fishman and D. Beech and Cate H. and Chow E. and Connors T. and Denning P. J. and D. G. N. and Hoch C.", TITLE="Iris: An Object-Oriented Database Management System", JOURNAL=toois, VOLUME=5, NUMBER=1, MONTH=jan, YEAR=1987, } @TECHREPORT{Aham8701:Multicast, AUTHOR="M. Ahamad and Mahmoud Ammar and Jose Bernabeu and M. Yousef Khalidi", TITLE="A Multicast Scheme for Locating Objects in a Distributed Operating System", INSTITUTION="Georgia Tech", NUMBER="GIT-ICS-87/01", MONTH=jan, YEAR=1987, KEYWORDS="BCMP analysis", } @ARTICLE{Gibb8701:Stub, AUTHOR="Phillip B. Gibbons", TITLE="A stub generator for multilanguage {RPC} in heterogeneous environments", JOURNAL=ieeese, VOLUME=13, NUMBER=1, PAGES="77-86", MONTH=jan, YEAR=1987, } @TECHREPORT{Lars8701:Social, AUTHOR="R. E. Larson", TITLE="Social Justice and Other Attributes of Queueing", INSTITUTION="Massachusetts Institute of Technology", ADDRESS="Cambridge, Massachusetts", PAGES=26, MONTH=jan, YEAR=1987, KEYWORDS="Queueing theory", } @ARTICLE{BMLe8701:Packet, AUTHOR="B. M. Leiner and D. L. Nelson and F. A. Tobagi", TITLE="Issues in Packet Radio Design", JOURNAL=ieeeproc, VOLUME=75, NUMBER=1, PAGES="6-20", MONTH=jan, YEAR=1987, } @TECHREPORT{Kemp8702:NSA, AUTHOR="David P. Kemp and Joseph P Campbell and David L. Andre and Douglas J. Rahikka", TITLE="{NSA} {LPC-10} Version 52", TYPE="Draft Documentation", INSTITUTION="National Security Agency", MONTH=feb, YEAR=1987, KEYWORDS="LPC; speech coding; linear predictive coding", ABSTRACT="Linear predictive coding (LPC) is a bandwidth compression technique for narrowband speech transmission. The NSA LPC-10 algorithm operates at 2400 bits per second using a tenth-order predictor. This document describes LPC-10 version 52, which was designed for the STU-III desktop secure telephone. The algorithm is programmed in VAX/VMS Fortran and runs 21x realtime on a DEC VAX 11/750. A realtime version also exists for the 6 MIPS Floating Point Systmes AP-120 B array processor.", ANNOTE="collection of related papers and software documentation", } @ARTICLE{Li8702:HM, AUTHOR="Kin Li and Nikitas Dimopoulos and J. William Atwood", TITLE="The {HM-Nucleus:} A Distributed Kernel Design for the Homogeneous Multiprocessor", JOURNAL=ieeemicro, VOLUME=7, NUMBER=2, PAGES="14-24", MONTH=feb, YEAR=1987, } @ARTICLE{Witt8702:Simulation, AUTHOR="M. Witten and B. L. Bodnar and A. C. Liu", TITLE="Simulation and Modeling of a Single Bus Tightly Coupled Multiprocessor System", JOURNAL="Mathematics and Computers in Simulation", VOLUME=29, PAGES="19-31", MONTH=feb, YEAR=1987, } @UNPUBLISHED{Schu8702:Random, AUTHOR="Henning Schulz-Rinne", TITLE="A Random Collection of Functions and Subroutines", NOTE="SIAG Technical Note, University of Cincinnati", MONTH=feb, YEAR=1987, } @INPROCEEDINGS{Dant8702:General, AUTHOR="A. Danthine and B. M. Hauzeur", TITLE="A General Management Architecture for a Wideband Backbone Network and its Interconnected {LANS}", BOOKTITLE="IFIP Workshop", ADDRESS="Aachen, Germany", PAGES="1-17", MONTH=feb, YEAR=1987, REFERENCES=32, KEYWORDS="Backbone network; network management; architecture; LAN", ANNOTE="The ESPRIT Project 73 aims at building a backbone wideband network for the interconnection of heterogeneous LANs. The specification of this system is summarized. The paper presents the gradual build-up of the management architecture. Management concepts and models are presented.", } @BOOK{Stal8702:Handbook, AUTHOR="W. Stallings", TITLE="Handbook of Computer-Communications Standards; Vol 2: Local Area Network Standards", PUBLISHER="Macmillan Publishing Company", ADDRESS="New York, NY", MONTH=feb, YEAR=1987, } @INPROCEEDINGS{Gold8702:Architecture, AUTHOR="E. H. Göldner and M. Huber and P. J. Kühn", TITLE="Architecture of a new inhouse communication system providing integrated circuit and packet switching", BOOKTITLE="Kommunikation in verteilten Systemen", ADDRESS="Aachen", MONTH=feb, YEAR=1987, KEYWORDS="LAN; circuit switching; packet switching", } @ARTICLE{Juch8702:Grafische, AUTHOR="H. J chter and R. Lehnert", TITLE="Grafische Simulation von Strategien für eine 140 Mbit/s Ersatzschalteeinrichtung", JOURNAL=pkitm, ADDRESS="Nürnberg", PAGES="43-53", MONTH=feb, YEAR=1987, LANGUAGE="German", REFERENCES=2, KEYWORDS="Protocol engineering; simulation; computer animation", } @ARTICLE{Mous8702:Standardization, AUTHOR="S. Moustakas", TITLE="The Standardization of {IEEE} 802.3 Compatible Fiber Optic {CSMA/CD} Local Area Networks: Physical Topologies", JOURNAL=ieeecm, VOLUME=25, NUMBER=2, PAGES="22-29", MONTH=feb, YEAR=1987, REFERENCES=29, KEYWORDS="Topology; ring; star; CSMA/CD; fiber optics", ANNOTE="The suitability of various fiber optic network topologies, and their electrooptic interfaces, for implementation and subsequent standardization of IEEE 802.3 compatible fiber optic CSMA/CD LANs is examined. In particular, the advantages and disadvantages of the bus, ring, and star topologies are considered in detail.", } @ARTICLE{Cher8702:UIO, AUTHOR="D. R. Cheriton", TITLE="{UIO:} A Uniform {I/O} System Interface for Distributed Systems", JOURNAL=tocs, VOLUME=5, NUMBER=1, PAGES="12-46", MONTH=feb, YEAR=1987, } @TECHREPORT{JulE8702:Fine, AUTHOR="J. F. E. and H. M. Levy and N. Hutchinson and A. Black", TITLE="Fine-Grained Mobiligy in the Emerald System", INSTITUTION="University of Washington, Seattle", NUMBER="87-02-03", MONTH=feb, YEAR=1987, } @TECHREPORT{Schw8702:Name, AUTHOR="M. Schwartz and J. L. Zahorjan and D. Notkin", TITLE="A Name Service for Evolving Heterogeneous Systems", INSTITUTION="University of Washington, Seattle", NUMBER="87-02-05", MONTH=feb, YEAR=1987, } @INPROCEEDINGS{Schi8702:FDDI, AUTHOR="A. Schill and Martin Zieher", TITLE="Performance Analysis of the {FDDI} 100 Mbit/s Token Ring", BOOKTITLE="Symposium on HSLANs", PAGES="57-78", MONTH=feb, YEAR=1987, } @ARTICLE{Birm8702:Reliable, AUTHOR="K. Birman and T. A. Joseph", TITLE="Reliable Communication in the Presence of Failures", JOURNAL=tocs, VOLUME=5, NUMBER=1, PAGES="47-76", MONTH=feb, YEAR=1987, KEYWORDS="multicast; atomic broadcast; fault-tolerant process group; reliable broadcast; protocols; reliable multicast", ABSTRACT="The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local and wide area networks. These protocols attain high levels of concurrency, while respecting application-specific delivery ordering constraints, and have varying cost and performance that depend on the degree of ordering desired. In particular, a protocol that enforces causal delivery orderings is introduced and shown to be a valuable alternative to conventional asynchronous communication protocols. The facility also ensures that the processes belonging to a fault-tolerant process group will observe consistent orderings of events affecting the group as a whole, including process failures, recoveries, migration, and dynamic changes to group properties like member rankings. A review of several uses for the protocols in the ISIS system, which supports fault-tolerant resilient objects and bulletin boards, illustrates the simplification of higher level algorithms made possible by our approach.", ANNOTE="Reliable multicast protocols are presented, which preserve consistency in distributed computations even in the presence of process failures. The main means to achieve this is by atomicity of multicasts and by consistent ordering of messages from different multicasts at all overlapping destinations [jon].", } @INPROCEEDINGS{Kats8702:Flow, AUTHOR="H. P. Katseff", TITLE="Flow-controlled multicast in multiprocessor systems", BOOKTITLE="6th Annual International Phoenix Conference on Computers and Communications", PUBLISHER="IEEE Computer Society Press", ADDRESS="Washington", PAGES="8-13", MONTH=feb, YEAR=1987, ABSTRACT="Many application programs for a message-based multiprocessor supercomputer could make use of a multicast mechanism in which a message is sent to a large group of processes efficiently in a single operation. The author introduces multicast-channels, which provide a symmetric interface for establishing communications within a group of processors, as well as controlled and error-resilient communications within the group of processors. By allowing programmers to specify buffering requirements, a wide range of applications may be implemented in a deadlock-free manner. Multicast channels are suitable for implementation on a variety of interconnects, including bus-based switches and those providing simultaneous parallel communications, like systems based on the hypercube topology. The use of efficient, tree-based acknowledgement scheme that uses 0(log/sub 2/n) time to effect flow control and to deliver a multicast message sent on a multicast channel with n processors allows an implementation with low latency and high throughput for systems with thousands of processors.", } @TECHREPORT{Fidg8702:Timestamps, AUTHOR="C. J. Fidge", TITLE="Timestamps in Message-passing systems that preserve the partial ordering", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-08", MONTH=feb, YEAR=1987, } @TECHREPORT{Hans8702:Teleindustriens, AUTHOR="O. E. Hansen and M. Neisig and B. Sondergård", TITLE="Teleindustriens Produktion og Produktionsbetingelser i Japan", INSTITUTION="Roskilde Universitetscenter", ADDRESS="Roskilde, Denmark", PAGES=220, MONTH=feb, YEAR=1987, LANGUAGE="Danish", KEYWORDS="technology", ABSTRACT="RUC; Tatel-projektet", } @INPROCEEDINGS{Bitt8702:Complex, AUTHOR="D. Bitton and M. B. Hanrahan and C. Turbyfill", TITLE="Performance of Complex Queries in Main Memory Database Systems", BOOKTITLE="International Conference on Data Engineering", PAGES="72-81", MONTH=feb, YEAR=1987, } @INPROCEEDINGS{Jacq8703:Tools, AUTHOR="P. Jacquet and S. Sedillot", TITLE="Evaluation Tools for Real-Time Message Scheduling Algorithms", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="626-634", MONTH=mar, YEAR=1987, KEYWORDS="real-time; scheduling", } @TECHREPORT{DeSe8703:Blocking, AUTHOR="Y. de Serres", TITLE="The Blocking Period in a Multi-server, Cutoff-Priority Queue in which Some Customers Require More Than One Server", TYPE="Rapport technique de l'INRS-Télécommunications", INSTITUTION="INRS-Télécommunications", ADDRESS="Ile des Soeurs, Québec", NUMBER="87-13", MONTH=mar, YEAR=1987, KEYWORDS="queueing theory", ANNOTE="mean blocking period, indicate how second moment of blocking period could be computed.", } @INPROCEEDINGS{Ades8703:High, AUTHOR="Stephen Ades", TITLE="A high speed network interface for integrated services", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="1092-1101", MONTH=mar, YEAR=1987, KEYWORDS="Cambridge ring; network interface; integrated services; local-area networks", ABSTRACT="Performance of network interfaces rather than the raw capacity of the networks themselves currently limits the bandwidth available for computing LANs. If we wish to use such LANs for integrated traffic (voice, data and video), this problem becomes exacerbated by the desire for both intelligence in the interface to handle data protocols and high throughput for voice and video. This paper examines the problem for the case of the Cambridge Fast Ring, which is well suited to integrated traffic. We propose both a block-level protocol and hardware to implement it. We examine the handling of mixed traffic and of voice streams. We suggest that in order to build a high performance mixed traffic interface consideration must be given during the design of the protocol to how hardware support can strategically be employed for a fast implementation of that protocol.", } @INPROCEEDINGS{Stan8703:Switching, AUTHOR="W. P. Standish and S. Sistle", TITLE="Network switching in the 1990's", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="395-403 (C5.1)", MONTH=mar, YEAR=1987, KEYWORDS="fast packet switching", ABSTRACT="This paper identifies the factors influencing the evolution of switching machine design in the 1990's. The future ISDN compatible network being considered will require new switching systems designed with capabilities to meet tomorrow's requirements. Standard circuit and packet connections, integrated line and trunk access, new teleservice capabilities, and new OAM capabilities are factors influencing switching system design. Two switch architecture evolution scenarios are possible, the segregated approach and the integrated approach. The segregated evolution approach requires separate lowspeed circuit, highspeed circuit, and packet modules. The integrated approach will require a more radical change in architecture to fast packet switching, fast circuit switching or hybrid switching.", } @INPROCEEDINGS{Lude8703:Wideband, AUTHOR="Gottfried Luderer and J. J. Mansell and E. J. Messerli and R. E. Staehler and A. K. Vaidya", TITLE="Wideband packet technology for switching systems", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="448-454", MONTH=mar, YEAR=1987, KEYWORDS="fast packet switching", ABSTRACT="Wideband packet switches capable of switching packetized voice, data, and digitized video signals at rates in excess of 50 Mb/s have the potential to make wideband ISDN services economically possible. This paper highlights important features of wideband packet technology (WPT) that might impact the architectural evolution of future switching systems. WPT relies on aggressive use of VLSI technology for implementing the core of a large switch as a self-routing multi-stage interconnection network and on distributed packet processing in trunk interfaces. An architectural proposal and a report on some experiments that involve the use of this technology habe been published earlier. This paper presents some of the recent advances in the wideband packet technology and examines its feasibility for continues evolution of the integrated services digital network (ISDN) to meet the objectives of AT\\&T's vision for the future, Universal Information Services (UIS).", } @INPROCEEDINGS{Kirt8703:Fast, AUTHOR="Paul Kirton and John C Ellershaw and Morgan Littlewood", TITLE="Fast packet switching for integrated network evolution", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="455-461", MONTH=mar, YEAR=1987, KEYWORDS="fast packet switching; integrated services", ABSTRACT="Fast packet switching (FPS) enables voice, video, image and data services to be supported on a single broadband network. This gives flexibility to cater for services with very different characteristics and to cope with uncertainty in the future traffic mix. FPS networks can be built from highly parallel multistage switches interconnected by high speed optical fibres thus providing high throughputs with low delays. The network protocols blend the characteristics of datagram, virtual-circuit and circuit-switched networks. FPS networks can be implemented as an overlay to the narrowband integrated services digital network (ISDN) to provide new services and network growth. FPS will be able to increase the utilization and flexibility of narrowband ISDN transmission equipment. This paper considers future services and network requirements, the structure of fast packet switched networks and integrated network evolution.", } @INPROCEEDINGS{Rama8703:Negative, AUTHOR="S. Ramakrishnan and B. N. Jain", TITLE="A negative acknowledgement with periodic polling protocol for multicast over {LAN}", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="502-511", MONTH=mar, YEAR=1987, KEYWORDS="multicast; ARQ; reliable transport protocol", ABSTRACT="This paper concerns the design of a protocol that ensures reliable one-to-many (multicast) communication of messages from a source station (transmitter) to a group of other stations (receivers), all connected over a local area network. Some analytical results and simulation results have been used to provide an assessment of its behavior. The protocol performance is also compared with an earlier multicast protocol. The consideration in this study have been to exploit the broadcast feature of the channel to the extent possible. We propose a new negative acknowledgement with periodic polling (NAPP) scheme for reliable communication. Necessary and sufficient conditions that relate the window size to the numbering scheme have been derived.", } @INPROCEEDINGS{Shac8703:Queueing, AUTHOR="N. Shacham", TITLE="Queueing analysis of a selective-repeat {ARQ} receiver", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="512-520", MONTH=mar, YEAR=1987, KEYWORDS="ARQ; selective repeat; performance evaluation; link level", ABSTRACT="Among the link-level, feedback-based automatic repeat request (ARQ) protocols the selective-repeat achieves the highest channel efficiency. This protocol, however, has a side effect: it delivers packets to the receiver not necessarily in their original order, thus requiring the receiver to queue packets temporarily until all the packets with lower sequence number are successfully received. This also may cause the window, which includes all packets in transit, to grow to a very large size. This paper presents an analysis of the important parameters of this protocol from the receiver's point of view, namely, the receiver-buffer occupancy, the window size, and packet waiting times in the receiver's buffer and in the window. We obtain closed-form expressions for the generating functions of the buffer occupancy, the window size, and the packet waiting time in the window and show how to compute the distribution of the packet's buffer time. We also derive the mean buffer occupancy for the case when the packet success probability tends to one, which can serve as an upper bound on the average number in the buffer.", } @INPROCEEDINGS{Tows8703:Selective, AUTHOR="Donald F. Towsley and Sanjay Mithal", TITLE="A selective repeat {ARQ} protocol for a point to multipoint channel", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="521-526", MONTH=mar, YEAR=1987, KEYWORDS="selective repeat; multicast; ARQ", ABSTRACT="We present a selective repeat protocol for a point-to-multipoint channel. This protocol is easy to implement and exhibits good throughput characteristics. A comparison of the performance of this protocol with those previously reported in the literature is made. Last, in the course of analyzing this protocol, we obtain a tighter bound on the throughput of Weldom's point to point selective repeat protocol.", } @ARTICLE{McLe8703:Framework, AUTHOR="Raymond McLeod and John Jones", TITLE="A Framework for Office Automation", JOURNAL=misq, PAGES="87-104", MONTH=mar, YEAR=1987, KEYWORDS="CSWC; computer conferencing; office automation", ABSTRACT="Much attention currently is being aimed at office automation. Proponents are recognizing its potential value to the manager as an information source, in addition to its initial focus on improved clerical operations. However, proponents are recommending office automation as an information system without citing any basis, theoretical or empirical, for their claims. The authors construct a theoretical framework that may be useful to the manager, or the system designer, in channeling office automation efforts in the right direction. The framework is based on Henry Mintzberg's concept of managerial roles, and is presented in the context of data gathered from five senior executives.", } @INPROCEEDINGS{Stac8703:Dynamic, AUTHOR="R. R. Stacey and D. J. Songhurst", TITLE="Dynamic alternative routing in the British Telecom trunk network", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="984-988 (B12.4.1)", MONTH=mar, YEAR=1987, REFERENCES=8, KEYWORDS="Network planning; routing algorithm", } @INPROCEEDINGS{Taka8703:Architectural, AUTHOR="K. Takami and T. Takenaka", TITLE="Architectural and Functional Aspects of a Multi-Media Packet Switched Network", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="470-474", MONTH=mar, YEAR=1987, REFERENCES=6, KEYWORDS="ATM; simulation; analysis", } @INPROCEEDINGS{Tran8703:Semidynamic, AUTHOR="P. Tran-Gia and Erwin P. Rathgeb", TITLE="Performance analysis of semidynamic scheduling strategies in discrete-time domain", BOOKTITLE=infocom, ADDRESS="San Francisco, California", PAGES="962-970", MONTH=mar, YEAR=1987, KEYWORDS="Queueing system; scheduling; discrete time analysis", } @ARTICLE{Abo8703:Delay, AUTHOR="A. Abo-Taleb and Hussein Mouftah", TITLE="Delay analysis under a general cut-through switching technique in computer networks", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=3, PAGES="356-559", MONTH=mar, YEAR=1987, REFERENCES=6, KEYWORDS="Queueing Network; cut-through switching; G/G/1; M/D/1", ANNOTE="A general cut-through switching (GCTS) technique is proposed and analyzed. In GCTS, a message may cut through a node if the node becomes free before the message is completely received there. Under GCTS mechanism, a message may cut through a node even though the node has more than one message in it. This results in minimizing the end-to-end delay of messages as compared to the other cut-through mechanisms.", } @INPROCEEDINGS{Boye8703:Time, AUTHOR="P. Boyer and J. Boyer and Jean Raymond Louvion and L. Romoeuf", TITLE="Time transparency evaluation of an asynchronous time-division network", BOOKTITLE=iss, PAGES="B12.2.1-B12.2.5", MONTH=mar, YEAR=1987, REFERENCES=4, KEYWORDS="PRELUDE; ATM; transparency; evaluation", ANNOTE="Description of ATD.", } @INPROCEEDINGS{Cido8703:PARIS, AUTHOR="I. Cidon and I. Gopal and H. Heleis", TITLE="{PARIS:} An approach to integrated private networks", BOOKTITLE=iss, PAGES="22.1.1.-22.1.5.", MONTH=mar, YEAR=1987, REFERENCES=8, KEYWORDS="Design; fast packet switching; integrated network", ANNOTE="This paper describes a design of a high speed packet switching system for integrated voice and data communications. The system makes use of a simplified network architecture in order to achieve the low packet delay and high nodal throughput necessary for the transport of voice. The authors believe that this system canprovide a cost-effective solution for private integrated networks.", } @INPROCEEDINGS{Egan8703:Costing, AUTHOR="B. L. Egan", TITLE="Costing and Pricing the Network of the Future", BOOKTITLE=iss, MONTH=mar, YEAR=1987, } @INPROCEEDINGS{Day8703:Applications, AUTHOR="C. Day and J. Giacopelli and J. Hickey", TITLE="Applications of self-routing switches to {LATA} fiber optic networks", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="519-523 (A7.3.1)", MONTH=mar, YEAR=1987, REFERENCES=8, KEYWORDS="ATM; STM; self routing", ANNOTE="This paper discusses exploratory research prototypes using self-routing networks for both circuit and packet switching applications within a fiber hubbing network.", } @INPROCEEDINGS{Dieu8703:Switching, AUTHOR="M. Dieudonne and M. Quinquis", TITLE="Switching Techniques for Asynchronous Time Division Multiplexing (or Fast Packet Switching)", BOOKTITLE=iss, ADDRESS="Phoenix, Az", PAGES="367-372", MONTH=mar, YEAR=1987, REFERENCES=9, KEYWORDS="ATM", } @INPROCEEDINGS{Fisc8703:ISDN, AUTHOR="W. Fischer and E. H. Göldner", TITLE="Performance of the {ISDN} user-network interface for signalling and packetized user-data transfer", BOOKTITLE=iss, ADDRESS="Phoenix, AZ", PAGES="286-290 (A4.5.1)", MONTH=mar, YEAR=1987, REFERENCES=8, KEYWORDS="ISDN; D-channel; performance evaluation; simulation", } @INPROCEEDINGS{Fisc8703:Modular, AUTHOR="W. Fischer and M. Huber and K. J. Schrodi", TITLE="Performance Analysis of a Modular Videophone Switching Network", BOOKTITLE=iss, ADDRESS="Phoenix, Az", MONTH=mar, YEAR=1987, REFERENCES=8, KEYWORDS="Interconnection Network; Analysis", } @INPROCEEDINGS{Gabl8703:Migration, AUTHOR="H. Gabler", TITLE="Migration towards the {ISDN}", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", PAGES="177-181 (A3.2.1)", MONTH=mar, YEAR=1987, KEYWORDS="ISDN; network evolution; service characterization", ANNOTE="Leiter FTZ T1", } @INPROCEEDINGS{Gall8703:Multi, AUTHOR="I. D. Gallagher", TITLE="A multi-service network based on the Orwell protocol", BOOKTITLE=iss, ADDRESS="Phoenix, Az", PAGES="979-983", MONTH=mar, YEAR=1987, REFERENCES=3, KEYWORDS="ATM; Orwell ring", } @INPROCEEDINGS{Gerk8703:Fast, AUTHOR="P. Gerke and J. Huber", TITLE="Fast Packet Switching - A Principle for Future System Generations?", BOOKTITLE=iss, ADDRESS="Phoenix, Az", PAGES="373-379", MONTH=mar, YEAR=1987, REFERENCES=10, KEYWORDS="ATM", ANNOTE="Discussion of several technologies for broadband communication with focus on ATD or FPS.", } @INPROCEEDINGS{Gior8703:Experimenting, AUTHOR="S. Giorcelli and Carlo Demichelis and G. Giandonato and R. Melen", TITLE="Experimenting with Fast Packet Switching Techniques in first generation {ISDN} Environment", BOOKTITLE=iss, ADDRESS="Phoenix, Az", PAGES="388-394", MONTH=mar, YEAR=1987, REFERENCES=10, KEYWORDS="ATM", } @INPROCEEDINGS{Horn8703:Conformance, AUTHOR="M. Hornbeek and K. Kneightson", TITLE="Conformance and Performance Testing {ISDN} Protocols", BOOKTITLE=iss, ADDRESS="Phoenix, Az", PAGES="249-253", MONTH=mar, YEAR=1987, REFERENCES=10, KEYWORDS="Protocol testing", } @INPROCEEDINGS{Koon8703:Stored, AUTHOR="Z. Koono and Takumi Kimura and M. Iwamoto and M. Soga", TITLE="A stored program controlled environmental function tester based on {FMM/SDL} design", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", PAGES="B9.5", MONTH=mar, YEAR=1987, REFERENCES=5, KEYWORDS="Environment simulation; test tool; functional test; SDL", } @INPROCEEDINGS{Lemp8703:UNES, AUTHOR="W. Lemppenau and P. Tran-Gia", TITLE="{UNES:} a versatile environment simulator for load tests of switching system software", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", PAGES="711-715", MONTH=mar, YEAR=1987, REFERENCES=7, KEYWORDS="Environment simulation; UNES; universal environment simulator", } @INPROCEEDINGS{Pleh8703:Evolution, AUTHOR="P. Plehiers and M. Fastrez and J. G. Bauwens and M. De Pryker", TITLE="Evolution towards a Belgian Broadband Experiment", BOOKTITLE=iss, ADDRESS="Phoenix, Az", PAGES="380-387", MONTH=mar, YEAR=1987, REFERENCES=10, KEYWORDS="ATM", } @INPROCEEDINGS{den8703:Synchronization, AUTHOR="F. van den", TITLE="Synchronization Aspects of the {ATD-IBC} Networks", BOOKTITLE=iss, ADDRESS="Phoenix, Az", PAGES="969-973", MONTH=mar, YEAR=1987, REFERENCES=11, KEYWORDS="ATM; synchronization", ANNOTE="It is investigated in this paper whether it makes sense to synchronize the ATD network nodes in order to decrease buffer sizesin the network.", } @INPROCEEDINGS{Kahl8703:Broadband, AUTHOR="P. Kahl", TITLE="The broadband-ISDN, an upward-compatible evolution of the 64 kbit/s {ISDN}", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", PAGES="A8.3.1.-A8.3.5.", MONTH=mar, YEAR=1987, KEYWORDS="Network planning; BISDN; DBP; Deutsche Bundespost", ANNOTE="The paper describes the plans of the Deutsche Bundespost to de- velop the 64 kbit/s ISDN into a Broadband ISDN. Special attention is paid to the principles (upward compatibility) to be taken into account in the design of the ISDN-B. A range of possible broadband applications for the ISDN-B is discussed from which a number of basic requirements for the ISDN-B can be derived.", } @TECHREPORT{Grab8703:Verkehrsmodelle, AUTHOR="K.-H. Grabowski and L. Hagenhaus", TITLE="Verkehrsmodelle für den leitungsvermittelten und paketvermittelten Schmalband-Verkehr im {ISDN} der {DBP} in den Jahren 1992/95/2000", INSTITUTION="Siemens AG", ADDRESS="München", PAGES="1-8", MONTH=mar, YEAR=1987, LANGUAGE="German", KEYWORDS="Integrated network", } @INPROCEEDINGS{Balb8703:Multi, AUTHOR="G. Balbo and G. Serazzi", TITLE="Multi-class product form closed queueing networks under heavy loading conditions", BOOKTITLE="International Workshop on Modelling Techniques and Performance Evaluation", ADDRESS="Paris", PAGES="257-269", MONTH=mar, YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Bret8703:Signalling, AUTHOR="Y. Bretecher", TITLE="Network signalling evolution in {ISDN} and impacts on switching systems", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", VOLUME=3, PAGES="1-6 (C8.3)", MONTH=mar, YEAR=1987, KEYWORDS="Switching system; ISDN", } @INPROCEEDINGS{Crav8703:CCITT, AUTHOR="J. Craveur and D. Algalarrondo and M. Tardieu and C. Monjoin", TITLE="{CCITT} No. 7 common channel signalling in the French telecommunication network", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", VOLUME=3, PAGES="1-5 (C8.2)", MONTH=mar, YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Fich8703:ISDN, AUTHOR="George Fiche and C. Le Palud and L. Etesse", TITLE="{ISDN} traffic assumptions and repercussions for switching system architectures", BOOKTITLE=iss, ADDRESS="Phoenix, Az", VOLUME=2, PAGES="1-7 (C4.1)", MONTH=mar, YEAR=1987, KEYWORDS="Switching system; ISDN", } @INPROCEEDINGS{Gobb8703:MS7, AUTHOR="B. Gobbi and A. Lazzari and G. Premoli", TITLE="{MS7:} A switching node for common channel signalling networks", BOOKTITLE=iss, ADDRESS="Phoenix, Az", VOLUME=1, PAGES="1-6 (B2.1)", MONTH=mar, YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Heid8703:Experience, AUTHOR="A. Heidermark and K. Alsmar", TITLE="Experience and coming development of {CCITT} No. 7", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", VOLUME=2, PAGES="1-5 (C3.4)", MONTH=mar, YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Mant8703:Evolution, AUTHOR="R. J. Manterfield", TITLE="Specification and evolution of {CCITT} signalling system No. 7", BOOKTITLE=iss, ADDRESS="Phoenix, Az.", PAGES="1-5 (paper 4)", MONTH=mar, YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @INPROCEEDINGS{Stan8703:Planning, AUTHOR="W. P. Standish and E. S. Guevara", TITLE="Planning Telecom Canada's common channel signalling No. 7 network.", BOOKTITLE=iss, ADDRESS="Phoenix", PAGES="1-5 (paper 1)", MONTH=mar, YEAR=1987, KEYWORDS="Signalling; common channel; CCS; network planning", } @INPROCEEDINGS{Vern8703:Comparison, AUTHOR="M. K. Vernon and J. L. Zahorjan and E. D. Lazowska", TITLE="A comparison of performance Petri Nets and queueing network models", BOOKTITLE="International Workshop on Modelling Techniques and Performance Evaluation", ADDRESS="Paris", PAGES="181-192", MONTH=mar, YEAR=1987, KEYWORDS="Queueing network; Petri net; analysis", } @INPROCEEDINGS{Zaho8703:Use, AUTHOR="J. L. Zahorjan and E. D. Lazowska and K. C. Sevcik", TITLE="The use of approximations in production performance evaluation software", BOOKTITLE="International Workshop on Modelling Techniques and Performance Evaluation", ADDRESS="Paris", PAGES="271-281", MONTH=mar, YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Tenn8703:Exploiting, AUTHOR="David Tennenhouse and I. Leslie and R. M. Needham and J. W. Burren and C. J. Adams and C. S. Cooper", TITLE="Exploiting Wideband {ISDN:} The Unison Exchange", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, CA", MONTH=mar, YEAR=1987, } @INPROCEEDINGS{Chla8703:Alternative, AUTHOR="I. Chlamtac and A. Ganz", TITLE="Toward Alternative High Speed Networks: The {SWIFT} Architecture", BOOKTITLE=infocom, ADDRESS="San Francisco, California", PAGES="1102-1108", MONTH=mar, YEAR=1987, } @TECHREPORT{Rose8703:ISO, AUTHOR="Marshall T. Rose and D. E. Cass", TITLE="The {ISO} Development Environment at {NRTC:} User's Manual", TYPE="Research Report", INSTITUTION="Northrop", MONTH=mar, YEAR=1987, KEYWORDS="Isode", } @INPROCEEDINGS{Yeh8703:Knockout, AUTHOR="Y.-S. Yeh and M. G. Hluchyj and A. S. Acampora", TITLE="The Knockout Switch: A simple, modular architecture for high performance packet switching", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="801-808", MONTH=mar, YEAR=1987, REFERENCES=9, KEYWORDS="ATM; switching block; analysis", ABSTRACT="A new high-performance packet-switching architecture, called theKnockout Switch, is proposed. The Knockout Switch uses a fully interconnected switch fabric topology so that no switch blockingoccurs where packets destined for one output interfere with pac-kets going to different outputs. Its architecture has low latency, and is self-routing and nonblocking.", } @INPROCEEDINGS{Eklu8703:Load, AUTHOR="B. Eklundh and J. Karlsson", TITLE="Load Sharing in a Cellular Mobile Telephone System. Blocking Probabilities and Channel Utilization", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", VOLUME=3, PAGES="C9.4.1-6", MONTH=mar, YEAR=1987, REFERENCES=13, KEYWORDS="Mobile Radio; Telephony; Cellular System; Load Sharing; Blocking; Channel Utilization", } @INPROCEEDINGS{Kais8703:Architecture, AUTHOR="Gail Kaiser and Peter H. Feiler", TITLE="An Architecture for Intelligent Assistance in Software Development", BOOKTITLE="9th International Conference on Software Engineering", MONTH=mar, YEAR=1987, LANGUAGE="English", } @TECHREPORT{Finn8703:Routing, AUTHOR="Greg Finn", TITLE="Routing and Addressing Problems in Large Metropolitan-scale Internetworks", INSTITUTION="ISI", NUMBER="ISU/RR-87-180", MONTH=mar, YEAR=1987, } @INPROCEEDINGS{Yin8704:Priority, AUTHOR="Nanying Yin and T. E. Stern and Song Li", TITLE="Performance Analysis of a Priority-Oriented Packet Voice System", BOOKTITLE=infocom, ORGANIZATION="IEEE", ADDRESS="San Francisco, California", PAGES="856-863", MONTH=apr, YEAR=1987, KEYWORDS="packet voice", } @ARTICLE{Peng8704:Modeling, AUTHOR="Dartzen Peng and Kang G. Shin", TITLE="Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control", JOURNAL=ieeetc, VOLUME=36, NUMBER=4, PAGES="500-516", MONTH=apr, YEAR=1987, } @ARTICLE{Wang8704:Protocol, AUTHOR="B. Wang and D. Hutchinson", TITLE="Protocol Testing Techniques", JOURNAL=comcom, VOLUME=10, NUMBER=2, PAGES="79-87", MONTH=apr, YEAR=1987, REFERENCES=22, KEYWORDS="Protocol testing", } @ARTICLE{Liou8704:Inverse, AUTHOR="Ching-Tien Liou and Yi-Shyong Chou", TITLE="Inverse Laplace transform by piecewise linear polynomial function", JOURNAL="International Journal of System Science", VOLUME=18, NUMBER=4, PAGES="749-754", MONTH=apr, YEAR=1987, KEYWORDS="Laplace transform; numerical inversion; polynomial; approximation", ABSTRACT="A new approximation method with piecewise linear polynomial functions based on the application of the operational matrix for integration is presented. It is shown that this approximation is more satisfactory than the block-pulse approximation. Two illustrative examples are given.", } @INPROCEEDINGS{Chan8704:Discrete, AUTHOR="U. Chandrasekaran and S. Sheppard", TITLE="Discrete event distributed simulation - A survey", BOOKTITLE="Methodology and Validation", ISBN="0-911801-16-2", ADDRESS="Orlando, FL", MONTH=apr, YEAR=1987, REFERENCES=41, KEYWORDS="Distributed simulation; multiprocessor system; communication network", ANNOTE="Distributed simulation has become increasingly popular in recentyears with the availability of cost effective multiprocessor sysand communication networks. The objective of distributed simulatin a broad perspective is to execute the functionally independenparts of a simulation environment in parallel thus distributing simulation execution over multiple processors. The paper outlineresearch effort in the area of distributed simulation.", } @ARTICLE{Nowi8704:Analyse, AUTHOR="K. Nowicki and T. Uhl", TITLE="Analyse von Resequencing-Verfahren in Netzen mit Paketvermittlung", JOURNAL=aeu, VOLUME=41, NUMBER=4, PAGES="232-241", MONTH=apr, YEAR=1987, LANGUAGE="German", KEYWORDS="computer network; packet switching; resequencing", ANNOTE="In dieser Arbeit werden zwei Systeme, die aus einem Subnetz, einem Zielkommunikationsknoten und einem Benutzer bestehen, jeweils analytisch und simulativ untersucht. Das Resequencing-Protokoll ist dabei entweder im Kommunikationsknoten oder beim Benutzer realisiert. Die erhaltenen Ergebnisse können bei Entwurf und Dimensionierung von Kommunikationsnetzen mit Paketvermittlung angewendet werden.", } @ARTICLE{McKe8704:Asymptotic, AUTHOR="J. McKenna", TITLE="Asymptotic expansions of the sojourn time distribution function of jobs in closed, product-form queuing networks", JOURNAL=jacm, VOLUME=34, NUMBER=4, PAGES="985-1003", MONTH=apr, YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @ARTICLE{Abra8704:Security, AUTHOR="M. D. Abrams and A. B. Jeng", TITLE="Network Security: Protocol Reference Model and the Trusted Computer System Evaluation Criteria", JOURNAL=ieeenet, VOLUME=1, NUMBER=2, PAGES="24-33", MONTH=apr, YEAR=1987, REFERENCES=33, } @ARTICLE{Bran8704:Considerations, AUTHOR="D. K. Branstad", TITLE="Considerations for Security in the {OSI} Architecture", JOURNAL=ieeenet, VOLUME=1, NUMBER=2, PAGES="34-39", MONTH=apr, YEAR=1987, REFERENCES=13, } @ARTICLE{Cerf8704:Information, AUTHOR="V. G. Cerf", TITLE="Information Infrastructure", JOURNAL=ieeenet, VOLUME=1, NUMBER=2, PAGES=44, MONTH=apr, YEAR=1987, } @ARTICLE{Cido8704:Failsafe, AUTHOR="I. Cidon and R. Rom", TITLE="Failsafe End-to-End Protocols in Computer Networks with Changing Topology", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=4, PAGES="410-413", MONTH=apr, YEAR=1987, } @INPROCEEDINGS{Clar8704:Comparison, AUTHOR="D. D. Clark and D. R. Wilson", TITLE="A Comparison of Commercial and Military Computer Security Policies", BOOKTITLE="IEEE Symposium on Security and Privacy", ORGANIZATION="IEEE", ADDRESS="Oakland, CA", PAGES="184-194", MONTH=apr, YEAR=1987, } @ARTICLE{Hell8704:Commercial, AUTHOR="M. E. Hellman", TITLE="Commercial Encryption", JOURNAL=ieeenet, VOLUME=1, NUMBER=2, PAGES="6-10", MONTH=apr, YEAR=1987, REFERENCES=11, } @ARTICLE{Juen8704:Electronic, AUTHOR="R. R. Jueneman", TITLE="Electronic Document Authentication", JOURNAL=ieeenet, VOLUME=1, NUMBER=2, PAGES="17-23", MONTH=apr, YEAR=1987, REFERENCES=8, } @ARTICLE{Newm8704:Public, AUTHOR="T. G. Newman and J. K. Omura and R. L. Pickholtz", TITLE="Public Key Management for Network Security", JOURNAL=ieeenet, VOLUME=1, NUMBER=2, PAGES="11-16", MONTH=apr, YEAR=1987, REFERENCES=7, } @INPROCEEDINGS{Soll8704:Distributed, AUTHOR="D. D. Clark K. R. Sollins", TITLE="Distributed Name Management", BOOKTITLE="IFIP WG 6.5 International Computer Message Systems Working Conference", PUBLISHER="IFIP WG 6.5", ADDRESS="Munich, Germany", PAGES="2.3.1-1.3.19", MONTH=apr, YEAR=1987, } @ARTICLE{Kimu8704:Coherent, AUTHOR="Takumi Kimura", TITLE="Coherent Optical Fiber Transmission", JOURNAL=ieeejlt, VOLUME="LT-5", NUMBER=4, PAGES="414-428", MONTH=apr, YEAR=1987, } @TECHREPORT{Will8704:Experiments, AUTHOR="G. Williams", TITLE="Some Experiments in Decision Tree Induction", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-01", MONTH=apr, YEAR=1987, } @ARTICLE{Lipp8704:Computing, AUTHOR="R. P. Lippmann", TITLE="An Introduction to Computing with Neural Nets", JOURNAL="IEEE SSSP Magazine", MONTH=apr, YEAR=1987, KEYWORDS="neural network", } @INPROCEEDINGS{Agra8705:Resequencing, AUTHOR="S. C. Agrawal and Ravi Ramaswamy", TITLE="Analysis of the Resequencing Delay for $M/M/m$ Systems", BOOKTITLE=sigmetrics, ORGANIZATION="ACM", ADDRESS="Banff, Alberta, Canada", PAGES="27-35", MONTH=may, YEAR=1987, KEYWORDS="queueing theory", ABSTRACT="The resequencing operation introduces an additional delay in transmission which may be significant. In this paper the probability distribution of the resequencing delay is obtained for the $M/M/m$ system. Simple expressions for the mean and coefficient of variation of the resequencing delay are also provided. It is shown through a variety of numerical examples that the resequencing delay is likely to be a significant component of the overall response time. Some interesting aspects of dependence of the mean resequencing delay on system parameters are studied analytically.", } @INPROCEEDINGS{Boye8705:Modelling, AUTHOR="P. Boyer and J. Boyer and Jean Raymond Louvion and L. Romoeuf", TITLE="Modelling the {ATD} Transfer Technique", BOOKTITLE="Traffic Engineering for ISDN Design and Planning --- Proceedings of the Fifth ITC Seminar", EDITOR="Mario Bonatti and Maurizio Decina", ADDRESS="Lake Como, Italy", PAGES="381-404", MONTH=may, YEAR=1987, KEYWORDS="queueing theory", ANNOTE="Prelude system. See \cite{Boye8710:Performance}.", } @ARTICLE{Clar8705:Boundaries, AUTHOR="Loren Clare and I. Rubin", TITLE="Performance Boundaries for Prioritized Multiplexing Systems", JOURNAL=ieeeit, VOLUME="IT-33", NUMBER=3, PAGES="329-340", MONTH=may, YEAR=1987, KEYWORDS="discrete time queue", ABSTRACT="Systems in which many data sources are multiplexed over a single communication channel are considered. Data from all the sources are generated in fixed-length packets and are stored in a common buffer with finite capacity. Packets that overflowed or were removed from the buffer prior to transmission are lost. The system performance measure is the set of packet loss probabilities associated with the sources. Queueing disciplines vary depending on the stringency of prioritization and the utilization of system resources. The set of all possible performances is characterized as we span the set of all queueing disciplines. Whether a given performance is possible can be deduced. Strategies that achieve the minimum overall loss probability are identified. The extreme disciplines are specified, and their performances are calculable by means of a given algorithm.", ANNOTE="arbitrary source statistics", } @INPROCEEDINGS{Holt8705:Examining, AUTHOR="J. M. Holtzman", TITLE="Examining Individual Traffic Streams in Superpositions", BOOKTITLE="Traffic Engineering for ISDN Design and Planning --- Proceedings of the Fifth ITC Seminar", EDITOR="Mario Bonatti and Maurizio Decina", ADDRESS="Lake Como, Italy", PAGES="141-150", MONTH=may, YEAR=1987, KEYWORDS="queueing theory", ANNOTE="Peakedness of sum of streams. Finite-waiting room systems. $MMPP/M/c/c+k$ system.", } @ARTICLE{Wats8705:Gaining, AUTHOR="R. W. Watson and S. A. Mamrak", TITLE="Gaining Efficiency in Transport Services by Appropriate Design and Implementation Choices", JOURNAL=tocs, VOLUME=5, NUMBER=2, PAGES="97-120", MONTH=may, YEAR=1987, ANNOTE="Transport protocols.", } @ARTICLE{Hill8705:Perceived, AUTHOR="Alex Hills and Ken Edward Scott", TITLE="Perceived Degradation Effects in Packet Speech Systems", JOURNAL=ieeeassp, VOLUME="ASSP-35", NUMBER=5, PAGES="699-701", MONTH=may, YEAR=1987, KEYWORDS="packet voice; packet loss; speech quality", ABSTRACT="A packet speech system's sound quality is degraded when packets do not arrive at their destination in a timely fashion. This can happen when packets are lost in a network or when network delay is excessive. Simulation results are reported which measure the effects of such losses and delays on sound quality and intelligibility. Thirty human subjects were asked to listen to the output of a simulated packet speech system in which some packets are missing. Sound quality and intelligibility were measured as a function of packet loss and packet length.", ANNOTE="Random packet loss; only loss effects; lost packets replaced by previous packet. ``The results for 2 \% packet loss, except for a packet length of 1000 samples, are very similar to the results for unaltered speech. At 5 \% loss, both quality and intelligibility are quite high for packet sizes of 100 and 200 samples. At 20 \% loss, \ldots, intelligibility exceeds 98 \%.", } @INPROCEEDINGS{Cher8705:Measurement, AUTHOR="D. R. Cheriton and Carey Williamson", TITLE="Network Measurement of the {VMTP} Request-Response Protocol in the V Distributed System", BOOKTITLE=sigmetrics, ORGANIZATION="ACM", ADDRESS="Banff, Alberta, Canada", PAGES="216-225", MONTH=may, YEAR=1987, KEYWORDS="transport protocol", } @INPROCEEDINGS{Beck8705:Protocol, AUTHOR="M. W. Beckner and T. T. Lee and S. E. Minzer", TITLE="A protocol and prototype for broadband subscriber access to {ISDNs}", BOOKTITLE=iss, ADDRESS="Phoenix, Arizona", PAGES="462-469 (B6.3)", MONTH=may, YEAR=1987, KEYWORDS="leaky bucket; ISDN; DTDM; dynamic time division multiplexing; multiplexer; performance evaluation", ABSTRACT="Broadband access to ISDN should flexibly and efficiently accomodate a wide variety of existing and future services. While both circuit-mode and packet-mode access capabilities are envisioned, the focus of this paper is the latter since the characteristics of packet-mode capabilities in a broadband environment will significantly differ from those found in today's networks. In this paper, we briefly discuss how the variability of service requirements and new technological possibilities are shaping broadband interfaces and protocols. A protocol suitable for broadband subscriber access to ISDNs is then described according to the layered set of functions that constitute the protocol. An implementation of a subscriber access prototype that includes high-speed multiplexing, demultiplexing, and protocol processing is described and interim results of a packet multiplexer performance study are reported.", } @ARTICLE{Malo8705:Intelligent, AUTHOR="Thomas W. Malone and Kenneth R. Grant and Franklyn A. Turback and Stephen A. Brobst and Michael Cohen", TITLE="Intelligent Information-Sharing Systems", JOURNAL=jacm, ADDRESS="Massachusetts Institute of Technology, Cambridge, MA, 02139 (all but Cohen); University of Michigan, Ann Arbor, 48104", VOLUME=30, NUMBER=5, PAGES="390-402", MONTH=may, YEAR=1987, KEYWORDS="human factors; electronic mail", ABSTRACT="Much of the work that has been done on computer-mediated communication systems (e.g., electronic mail, computer conferencing, and electronic bulletin boards) has focused on technical capabilities and standards for storing messages. We propose to shift our focus to a more general problem, the {\it information sharing} problem, which has to do with disseminating information so that it reaches those people to whom it is valuable without interfering with those to whom it is not. This problem will become increasingly important with advances in communication technology, and we suggest three fundamental approaches to its solution. Our characterization of these approaches will be illustrated with examples from a series of informal studies that we have conducted on how people share information in organizations, and through a description of an intelligent information-sharing system that we have developed called the Information Lens. It is already a common experience in mature computer-based messaging communities for people to feel flooded with large quantities of electronic ``junk mail'' (he references Denning's ``Electronic Junk'' in cacm March 1982, Hiltz and Turoff's ``Avoiding overload'' in cacm July 1985, Palme, J. ``You have 134 unread mail do you want to read them now?'' in IFIP Conference on Computer Based Message Services, 1984, and another article by Wilson, Maude, Marshall and Heaton from the same Proceedings). In current systems people often adopt crude methods, such as removing themselves entirely from distribution lists that are of occasional interest, in order to avoid being inundated. At the same time, it is also common for people to be ignorant of facts that would facilitate their work and that are known elsewhere in their organization. Our system uses techniques from artificial intelligence and user-interface design to help solve both these problems: It helps people filter, sort, and prioritize messages that are already addressed to them, and it also helps them find useful messages they would not otherwise have received. We believe that the most important use of systems like this will not be to just reduce the flow of ``junk mail,'' but to dramatically increase the amount of useful information that can be exchanged electronically without leading to information overload. Many previous communication technologies (e.g., the printing press, broadcast television, photocopiers) have increased the amount of information exchanged, although their usefulness has been, to some extent, bounded by the limits of information overload. Computer technology can not only increase the amount, speed, and distance of information flow, it can also increase the selectivity with which the information is disseminated. Viewing the problem of information sharing in this general way suggests that much of the work that has been done separately on information-retrieval systems (such as bibliographic search systems) and database management systems is potentially relevant to the design of computer-mediated communication systems. Our discussion shows how concepts from both these fields are incorporated in the Information Lens system and how information-sharing systems like this can help integrate communications with both other kinds of systems. One of the key ideas behind the system is that many of the unsolved problems of natural-language understanding can be avoided in intelligent information-sharing systems through the use of semistructured templates (or frames) for different types of messages. These templates can be used by senders to facilitate message composition. The same templates can then be used by recipients to facilitate construction of a set of rules for filtering and categorizing messages.", ANNOTE="Further quotes from the paper: There are five key ideas that form the basis of the Information Lens system. Though some of these ideas are empirically testable, we treat them here as premises for our system design. (1) A rich set of semistructured message types (or frames) can form the basis for an intelligent information-sharing system. Important because (a) semistructured messages enable computers to automatically process a much wider range of information than would otherwise be possible. (b) Much of the processing that people already do with the information they receive reflects a set of semistructured message types. (c) Even if no automatic processing of messages were involved, providing senders with a set of semistructured message templates would often be helpful. (2) Sets of production rules (that may include multiple levels of reasoning in addition to Boolean selection criteria) can be used to conveniently specify automatic processing for these messages (3) The use of semistructured message types and automatic rules for processing them can be greatly simplified by a consistent set of display-oriented editors for composing messages, constructing rules and defining new message templates. (4) The definition and use of semistructured messages and processing rules are simplified if the message types are arranged in a frame inheritance lattice. (5) The initial introduction and later evolution of a group communication system can be facilitated if the process can occur as a series of small changes, each of which has the following properties (a) users can continue to use their existing system with no change; (b) users who make small changes receive some benefit; and (c) groups of users who adopt the changes receive additional benefits beyond the individual benefits. end quote.", } @ARTICLE{Span8705:Architectures, AUTHOR="R. A. Spanke", TITLE="Architectures for guided-wave optical space switching systems", JOURNAL=ieeecm, VOLUME=25, NUMBER=5, PAGES="42-48", MONTH=may, YEAR=1987, REFERENCES=13, KEYWORDS="Switching system; optical switching", } @INPROCEEDINGS{Turn8705:Challenge, AUTHOR="J. S. Turner", TITLE="The Challenge of Multipoint Connection", BOOKTITLE="5th ITC Seminar: Traffic Engineering for ISDN Design", ADDRESS="Cernobbio", MONTH=may, YEAR=1987, REFERENCES=29, KEYWORDS="ATM", } @INPROCEEDINGS{Nies8705:Nonblocking, AUTHOR="G. Niestegge", TITLE="Nonblocking multirate switching networks", BOOKTITLE="5th ITC seminar", ADDRESS="Cernobbio", PAGES=10, MONTH=may, YEAR=1987, REFERENCES=5, KEYWORDS="Multistage interconnection network; switching network", } @INPROCEEDINGS{Deci8705:Evolving, AUTHOR="M. Decina", TITLE="Evolving Network Architecture and Technology for the {ISDN}", BOOKTITLE="5th ITC Seminar: Traffic Engineering for ISDN Design and Planning", ADDRESS="Cernobbio", MONTH=may, YEAR=1987, KEYWORDS="ISDN", } @INPROCEEDINGS{Kuhn8705:Traffic, AUTHOR="P. J. Kühn", TITLE="Traffic Engineering for {ISDN} Design and Planning", BOOKTITLE="5th ITC Seminar: Traffic Engineering for ISDN Design and Planning", ADDRESS="Cernobbio", MONTH=may, YEAR=1987, KEYWORDS="Traffic Engineering", } @ARTICLE{Anon8705:Connection, AUTHOR="J. L. Adams and A. Sarsby", TITLE="Connection control protocols in a fast packet switching multi-service network based on {ATD} techniques", JOURNAL="Communications Engineering International", PAGES="31-39", MONTH=may, YEAR=1987, KEYWORDS="ATM; Protocol", } @TECHREPORT{Corp8705:End, AUTHOR="Computer Sciences Corporation", TITLE="End-to-End Compromise and Integrity Controls", INSTITUTION="Computer Science Corporation", ADDRESS="3160 Fairview Park Drive, Falls Church, VA 22042", NUMBER="CSC/TR-87-3001", MONTH=may, YEAR=1987, } @ARTICLE{Dong8705:Distribution, AUTHOR="J. J. Dongarra and E. Grosse", TITLE="Distribution of Mathematical Software via Electronic Mail", JOURNAL=cacm, VOLUME=30, NUMBER=5, PAGES="403-407", MONTH=may, YEAR=1987, } @ARTICLE{Glas8705:Development, AUTHOR="J. I. Glasgow and G. H. MacEwen", TITLE="The Development and Proof of a Formal Specification for a Multi-Level Secure System", JOURNAL=tocs, VOLUME=5, NUMBER=2, PAGES="151-184", MONTH=may, YEAR=1987, } @ARTICLE{Joyc8705:Monitoring, AUTHOR="J. Joyce and G. Lomow and K. Slind and B. W. Unger", TITLE="Monitoring Distributed Systems", JOURNAL=tocs, VOLUME=5, NUMBER=2, PAGES="121-150", MONTH=may, YEAR=1987, } @ARTICLE{Kish8705:Configuration, AUTHOR="R. Kishimoto and K. Ariki and Tsuyukis. and T. Kitami", TITLE="Configuration and Characteristics of a Fiber-Optic Video Distribution System", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=5, PAGES="522-528", MONTH=may, YEAR=1987, } @ARTICLE{Mamr8705:Software, AUTHOR="S. A. Mamrak and M. J. Kaelbling and C. K. Nicholas and M. Share", TITLE="A Software Architecture for Supporting the Exchange of Electronic Manuscripts", JOURNAL=cacm, VOLUME=30, NUMBER=5, PAGES="408-415", MONTH=may, YEAR=1987, } @ARTICLE{Maxe8705:Routing, AUTHOR="N. F. Maxemchuk", TITLE="Routing in the Manhattan Street Network", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=5, PAGES="503-512", MONTH=may, YEAR=1987, } @ARTICLE{Tows8705:Announced, AUTHOR="Donald F. Towsley and O. P. Vales", TITLE="Announced Arrival Random Access Protocols", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=5, PAGES="513-521", MONTH=may, YEAR=1987, } @TECHREPORT{Waxm8705:Thesis, AUTHOR="Bernard M. Waxman", TITLE="Thesis Proposal: Routing of Multipoint Connections", INSTITUTION="Washington University", ADDRESS="St. Louis, MO 63130", NUMBER="WUCS=87-10", MONTH=may, YEAR=1987, } @INPROCEEDINGS{Shen8705:Conjectures, AUTHOR="S. Shenker", TITLE="Some Conjectures on the behavior of acknowledgment based transmission control of random access communication channels.", BOOKTITLE=sigmetrics, ADDRESS="Banff, Alberta, Canada", PAGES="245-255", MONTH=may, YEAR=1987, } @TECHREPORT{Fidg8705:Reproducible, AUTHOR="C. J. Fidge", TITLE="Reproducible Tests in {CSP}", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-07", MONTH=may, YEAR=1987, } @INPROCEEDINGS{Kash8705:Bandwidth, AUTHOR="A. Kashper", TITLE="Bandwidth Allocation and Network Dimensioning for International Multiservice Networks", BOOKTITLE="Traffic Engineering for ISDN Design and Plan - 5th ITC Seminar held", ADDRESS="Cernobbio, Italy", PAGES="293-298", MONTH=may, YEAR=1987, KEYWORDS="multiserver", ABSTRACT="This paper proposes a design methodology for international ISDNs based on Dynamic Nonhierarchical Routing (DNHR) call set-up and routing rules. This approach results in full-access international networks and allows us to solve the international ISDN dimensioning problem by considering the bilateral network as a single digital pipe.", } @INPROCEEDINGS{Pau8705:Artificial, AUTHOR="L. F. Pau", TITLE="Artificial Intelligence in Communications Networks", BOOKTITLE="VLSI and Computers (IEEE COMP-EURO)", ADDRESS="Hamburg, Germany", PAGES=6, MONTH=may, YEAR=1987, KEYWORDS="artificial intelligence", } @PHDTHESIS{Ofek8705:Topology, AUTHOR="Y. Ofek", TITLE="The Topology, Algorithms and Analysis of a Synchronous Optical Hypergraph Architecture", SCHOOL="Electrical Engineering Department, University of Illinois at Urbana", NUMBER="UIUCDCS-R-87-1343", MONTH=may, YEAR=1987, } @ARTICLE{Gray8705:View, AUTHOR="J. P. Gray", TITLE="A View of Database System Performance Measures", JOURNAL=sigmetrics, VOLUME=15, NUMBER=1, PAGES="3-4", MONTH=may, YEAR=1987, } @INPROCEEDINGS{Eng8706:Knockout, AUTHOR="K. Y. Eng and M. G. Hluchyj and Y.-S. Yeh", TITLE="A Knockout Switch for Variable-Length Packets", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Seattle, Washington", PAGES="794-799", MONTH=jun, YEAR=1987, KEYWORDS="fast-packet switching", ABSTRACT="The Knockout switch is a new packet switch architecture recently proposed for local area networks, multiprocessing, and local or toll interconnects. Here we describe an approach to extend the original Knockout Switch to work with variable-length packets, which is conveniently dubbed the ``Knockout Switch II''. As in the original Knockout Switch, the Knockout II architecture also employs an input broadcast bus arrangement to achieve complete internal cross-connection, i.e., $N \times N$. Consequently, there is no congestion inside the switch fabric other than the unavoidable conflict of multiple simultaneous packets destined for the same output port. It is in this output contention that the Knockout principle is fully utilized to efficiently concentrate and store contending packets while maintaining the first-in first-out discipline of the packet sequence; and no switch can yield better delay/throughput performance. These are the most important attributes that have been preserved in the current proposal from the original Knockout Switch. For an $N \times N$ switch configuration, the Knockout II consists of an input broadcast bus, an $N : L$ concentrator $(N \ll L)$ and a shared buffer for each output. The design of each subsystem is discussed with emphasis on possible VLSI realization. Using today's technology, we should be able to implement the proposed switch with both interface lines and internal hardware operating at 50 Mb/s. The dimension of the switch $N \times N$ can grow modularly from say $32 \times 32$ to $1024 \times 1024$, rendering a total throughput in the range of tens of gigabit per second. Future upgrades of the line interfaces to much higher speed without modification to the internal switch hardware is also conceivable with a modest restriction on the minimum length of the new packets.", } @INPROCEEDINGS{Karo8706:Using, AUTHOR="Mark Karol and M. G. Hluchyj", TITLE="Using a Packet Switch for Circuit-Switched Traffic: A Queueing System with Periodic Input", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Seattle, Washington", PAGES="1677-1682 (48.3)", MONTH=jun, YEAR=1987, KEYWORDS="queueing theory; discrete time queue", ANNOTE="Time-multiplexed periodic (deterministic) input streams, with random distribution of packets over slots of frame. Analyzes loss if buffer less than slots per frame.", } @INPROCEEDINGS{DePr8706:Terminal, AUTHOR="M. de Prycker and Marc Ryckebusch and Peter Barri", TITLE="Terminal Synchronization in Asynchronous Networks", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Seattle, Washington", PAGES="800-807", MONTH=jun, YEAR=1987, KEYWORDS="clock synchronization; DPLL", ABSTRACT="This paper describes a possible solution for the connection of synchronous terminals to asynchronous networks suffering from stochastic delays. Especially the problem of asynchronous clocks is discussed, and an algorithm is proposed which is based on two independent functionalities: an initial and a final adjustment phase. In order to minimize the impact of stochastical effects, an adjustment procedure will be described. This algorithm reduces the amplitude and frequency of the clock adjustments. Finally, these functions are applied to a sample situation where a continuous bit stream of encoded video signals is transported over a high-speed local area network.", } @ARTICLE{Tsou8706:Interchangeability, AUTHOR="Pantelis Tsoucas and J. Walrand", TITLE="On the Interchangeability and Stochastic Ordering of $\cdot/M/1$ Queues in Tandem", JOURNAL=aap, VOLUME=19, NUMBER=2, PAGES="515-520", MONTH=jun, YEAR=1987, } @INPROCEEDINGS{Corb8706:Example, AUTHOR="Charles M. Corbalis", TITLE="A design example of a T1-based fast packet voice switch", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Seattle, Washington", PAGES="1267-1271 (36.3)", MONTH=jun, YEAR=1987, KEYWORDS="packet voice; packet switches", ABSTRACT="Designing a fast-packet voice switch involves balancing many complex and interrelated issues. This paper discusses these issues and deseribes how they were addressed in the design of the Integrated Packet Exchange (IPX) - a Tl-based fast packet voice switch for corporate private networks.", } @ARTICLE{Mudg8706:Multiple, AUTHOR="T. Mudge and John Hayes and D. C. Winsor", TITLE="Multiple Bus Architectures", JOURNAL=ieeecomp, PAGES="42-48", MONTH=jun, YEAR=1987, } @ARTICLE{Reed8706:Multicomputer, AUTHOR="Daniel Reed and Dirk Grunwald", TITLE="The Performance of Multicomputer Interconnection Networks", JOURNAL=ieeecomp, PAGES="63-73", MONTH=jun, YEAR=1987, } @INPROCEEDINGS{DePr8706:Switching, AUTHOR="M. de Prycker and J. G. Bauwens", TITLE="A switching exchange for an asynchronous time division based network", BOOKTITLE=icc, ORGANIZATION="IEEE", ADDRESS="Seattle, Washington", PAGES="774-781 (22.3)", MONTH=jun, YEAR=1987, KEYWORDS="asynchronous time division; fast packet switching; switch", ABSTRACT="Recently, a growing interest has been shown towards fast packet switching, also called ATD (asynchronous time division), in a number of companies and organizations such as CCITT and Race. In Belgium a broadband experiment is planned using this technique. This paper focuses its attention on the switching exchange. This exchange is a multistage network constructed with independent switching elements based on the self-routing principle. The load control in the exchange is provided by a static load control mechanism applied to the logical connections granted on these links. Simulation results show that this load control mechanism can work perfectly if used in the proper environment.", ANNOTE="self-routing 565 Mbs switch with randomization network followed by routing network. Fixed-length packets; an average load counter controls call admission; input buffering for each $n \times n$ switch; analysis (cited) using $M/D/1$ model with correlation across three packets", } @TECHREPORT{Tsuc8706:Landmark, AUTHOR="Paul F. Tsuchiya", TITLE="Landmark Routing: Description and Analysis", INSTITUTION="The Mitre Corporation", NUMBER="MTR-87W00152", MONTH=jun, YEAR=1987, KEYWORDS="routing; hierarchy; reliability; fault tolerance", ABSTRACT="Hierarchical routing structures are needed to reduce the amount of routing information stored and exchanged by switching nodes in large networks (data or voice). Only one hierarchical structure, the area hierarchy, has been available to network designers. This has resulted in a limited set of design alternatives. In particular, the area hierarchy is known to have some poor survivability characteristics. This paper introduces a new hierarchical structure, the Landmark Hierarchy. Analysis and simulation of the Landmark Hierarchy in its static state show that it is a viable alternative to the area hierarchy for large network routing. Further work is needed to determine the survivability characteristics of the Landmark Hierarchy in a dynamic network environment.", } @INPROCEEDINGS{Tran8706:Discrete, AUTHOR="P. Tran-Gia", TITLE="Discrete-time analysis of polling systems with renewal inputs", BOOKTITLE="3rd international conference on data communication systems", ADDRESS="Rio de Janeiro, Brazil", MONTH=jun, YEAR=1987, KEYWORDS="Queueing theory; discrete time analysis", } @TECHREPORT{Clar8706:High, AUTHOR="R. T. Clarke", TITLE="A high speed communications network simulator - hardware design", INSTITUTION="School of engineering and applied science, Durham University", ADDRESS="Durham", MONTH=jun, YEAR=1987, REFERENCES=3, KEYWORDS="Distributed simulation; transputer; computer animation", } @INPROCEEDINGS{Hohl8706:Approximate, AUTHOR="S. Hohl and P. J. Kühn", TITLE="Approximate analysis of flow and cycle times in queueing networks", BOOKTITLE="3rd international conference on data communication systems and theiperformance", PUBLISHER="North Holland", ADDRESS="Rio de Janeiro", MONTH=jun, YEAR=1987, KEYWORDS="Queueing system; network", } @TECHREPORT{Nich8706:PSIMON, AUTHOR="S. J. Nichols", TITLE="The design of {PSIMON:} a high speed network simulator", INSTITUTION="School of engineering and applied science, Durham University", ADDRESS="Durham, North Carolina", PAGES=11, MONTH=jun, YEAR=1987, REFERENCES=5, KEYWORDS="Distributed simulation; transputer; computer animation", } @INPROCEEDINGS{Goha8706:New, AUTHOR="S. Gohara and Y. Sakurai and K. Otsuki", TITLE="A new distributed switching system architecture for media integration", BOOKTITLE=icc, ADDRESS="Seattle, WA", PAGES="373-377", MONTH=jun, YEAR=1987, REFERENCES=7, KEYWORDS="Burst switching; switching system; network architecture", ANNOTE="In the near future, after ISDN penetrates, a new advanced switching system which has flexibility and efficiency for various kinds of telecommunication services will be needed. This paper discusses the environment of communication in the next generation, considers the features of the new switching system, and describes a possible configuration of a switching system with self-routing control logic which gives benefits for", } @INPROCEEDINGS{Hui8706:Braodband, AUTHOR="Joseph Hui", TITLE="A broadband packet switch for multi-rate services", BOOKTITLE=icc, ADDRESS="Seattle, Washington", PAGES="782-788", MONTH=jun, YEAR=1987, REFERENCES=6, KEYWORDS="ATM; switching block; architecture; batcher-banyan; self routing; performance evaluation", ABSTRACT="This paper gives a broadband (approximately 1 Tb/s) self-routing packet switch design for providing flexible multiple bitrate broadband services for an end-to-end fiber network. The switch fabric for a slotted broadband packet switch delivers exactly one packet toeach output port from one of the input ports which request packet delivery to that output port. The denied requests would try again during the next slot.", } @INPROCEEDINGS{Mori8706:Elastic, AUTHOR="S. Morita and T. Katsuyama and K. Ito and H. Hayami", TITLE={"Elastic Basket Switching" Application to Distributed {PBX}}, BOOKTITLE=icc, ADDRESS="Seattle, WA", PAGES="789-793", MONTH=jun, YEAR=1987, REFERENCES=3, KEYWORDS="Hybrid switching; switching system; architecture; implementation", ANNOTE="This paper describes an experimenral Elastic Basket switching (EBS) system, as applied to a distributed PBX. EBS is a new integrated switching system for multimedia information includingvoice and high-speed burst data. For non-burst data such as voice, EBS performs switching as a circuit switching system. Forburst data, it achieves high efficiency bandwidth usage, equivalent to a packet switching system, using demand type time slot", } @ARTICLE{Sawc8706:Optical, AUTHOR="A. Varma A. A. Sawchuk and Charlotte Jenkins", TITLE="Optical Crossbar Networks", JOURNAL=ieeecomp, VOLUME=20, NUMBER=6, PAGES="50-60", MONTH=jun, YEAR=1987, KEYWORDS="optics; switch; crossbar; networks; crossbar; switch", } @ARTICLE{Bhuy8706:Guest, AUTHOR="L. Bhuyan", TITLE="Guest Editor's Introduction: Interconnection Networks for Parallel and Distributed Processing", JOURNAL=ieeecomp, VOLUME=20, NUMBER=6, PAGES="9-13", MONTH=jun, YEAR=1987, } @MISC{Engi8706:Report, AUTHOR="Engineering Federal Coordinating Council on Science and Technology (F. C. CSET)", TITLE="A Report to the Congress on Computer Networks to Support Research in the United States", NOTE="Volume II, Reports from the Workshop on Computer Networks, 2/17-19/87, San Diego, CA", MONTH=jun, YEAR=1987, } @MASTERSTHESIS{Kolo8706:MAM, AUTHOR="Lawrence K. Kolodney", TITLE="{MAM:} A Semi-Automatic Debugging Tool for Distributed Programs", SCHOOL="Massachusetts Institute of Technology", ADDRESS="Cambridge, MA", MONTH=jun, YEAR=1987, } @ARTICLE{Malo8706:Electronic, AUTHOR="Thomas W. Malone and J. Yates and R. I. Benjamin", TITLE="Electronic Markets and Electronic Hierarchies", JOURNAL=cacm, VOLUME=30, NUMBER=6, PAGES="484-497", MONTH=jun, YEAR=1987, } @INPROCEEDINGS{Dyke8706:Investigation, AUTHOR="Doug Dykeman and W. Bux", TITLE="An Investigation of the {FDDI} Media-Access Control Protocol", BOOKTITLE="EFOC/LAN, the 5th Annual European Fibre Optic Communications and Local Area Networks Exposition", ADDRESS="Basel, Switzerland", PAGES="229-236", MONTH=jun, YEAR=1987, } @UNPUBLISHED{Gree8706:Wavelength, AUTHOR="P. E. Green", TITLE="Wavelength Division Multiaccess", NOTE="unpublished manuscript", MONTH=jun, YEAR=1987, } @ARTICLE{John8706:Proof, AUTHOR="Marjory Johnson", TITLE="Proof that Timing Requirements of the {FDDI} Token Ring Protocol are Satisfied", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=6, PAGES="620-625", MONTH=jun, YEAR=1987, } @ARTICLE{Ross8706:Link, AUTHOR="G. Rossi and C. Garavaglia", TITLE="Link layer for cooperating process of a {LAN} with enhanced communication services.", JOURNAL=comcom, PAGES="121-7", MONTH=jun, YEAR=1987, ABSTRACT="Virtual network protocols provide classes of service suited to a multicast environment. Their availability offers higher layers a common frame work for the implementation of a computing system with distributed control.", } @INPROCEEDINGS{Part8706:Implementing, AUTHOR="C. Partridge", TITLE="Implementing the Reliable Data Protocol {RDP}", BOOKTITLE="USENIX", ADDRESS="Phoenix, Arizona", MONTH=jun, YEAR=1987, REFERENCES=18, KEYWORDS="RDP; BSD; timer algorithms; transport protocols", ABSTRACT="The author examines the problems of implementing a reliable IP-based protocol, including issues such as choosing timer algorithms, effecting congestion control mechanisms, and integration with the BSD operating system. A preliminary evaluation of the protocol is presented.", } @TECHREPORT{Wong8706:Message, AUTHOR="Wai-Choong Wong and T. Suda and L. Bic", TITLE="Performance Analysis of A Message-Oriented Knowledge-Base", TYPE="Technical Report", INSTITUTION="University of California, Irvine, Department of Information and Computer Science", NUMBER="ICS-TR-87-11", PAGES=40, MONTH=jun, YEAR=1987, ABSTRACT="First-order Horn logic is useful formalism to design knowledge-based systems. When implemented on a sequential von Neumann computer, the main limitation of such systems is performance. We present a message-driven model for function-free Horn logic, where the knowledge base is represented as a network of logical processing elements communicating with one another exclusively through messages. The lack of centralized control and centralized memory makes this model suitable to implementation on a highly-parallel asynchronous computer architecture. The primary contribution of this paper is a performance analysis of this message-driven system and a comparison with a sequential resolution scheme using backtracking. For both approaches, closed form expressions for the performance results are derived and compared.", } @TECHREPORT{Ston8706:Postgres, AUTHOR="Michael Stonebraker and Lawrence Rowe and others", TITLE="The Postgres Papers", INSTITUTION="UC Berkeley", MONTH=jun, YEAR=1987, } @INPROCEEDINGS{Lee8706:Multiprocessor, AUTHOR="Ruey-Yang Lee and P.-C. Yew and D. H. Lawrie", TITLE="Multiprocessor Cache Design Considerations", BOOKTITLE="14th International Symposium on Computer Architecture", PAGES="253-262", MONTH=jun, YEAR=1987, } @ARTICLE{Herl8706:Dynamic, AUTHOR="M. Herlihy", TITLE="Dynamic Quorum Adjustment for Partitioned Data", JOURNAL=tods, VOLUME=12, NUMBER=2, PAGES="170-194", MONTH=jun, YEAR=1987, KEYWORDS="partition", } @ARTICLE{Adam8706:Comparision, AUTHOR="G. C. Adams and D. P. Agrawal and G. J. Siegel", TITLE="A Survey and Comparision of Fault-Tolerant Multisage Interconnection Networks", JOURNAL=ieeecomp, PAGES="14-27", MONTH=jun, YEAR=1987, KEYWORDS="fault-tolerance; banyan; switch; MIN; Multipath Omega", } @TECHREPORT{Moli8706:Generation, AUTHOR="B. P. Molinari and C. W. Johnson", TITLE="Generation of Symbol Processing Modules", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-02", MONTH=jun, YEAR=1987, } @ARTICLE{Moth8706:Considerations, AUTHOR="K. Moth and S. B. Jacobsen", TITLE="Considerations on the use of {ATD} on the subscriber line", JOURNAL="EFOC/LAN", ADDRESS="Netherlands", PAGES="349-352", MONTH=jun, YEAR=1987, KEYWORDS="ATM; access network", ABSTRACT="EMI", } @TECHREPORT{Kris8706:Network, AUTHOR="Sri Krishnan", TITLE="Network Reconstitution Protocol", TYPE="Technical Report RADC-TR-87-38", INSTITUTION="SRI", MONTH=jun, YEAR=1987, } @ARTICLE{Djen8706:Praktischer, AUTHOR="A. Djenguerian", TITLE="Praktischer Aufbau eines Ethernet-/Cheapernet-Anschlußknotens", JOURNAL="Elektronik", VOLUME=13, PAGES="86-94", DAYS=13, MONTH=jun, YEAR=1987, LANGUAGE="German", KEYWORDS="CSMA/CD; Ethernet; Cheapernet; implementation", ANNOTE="The article describes the differences between Ethernet and cheapernet versions of a network node and gives practical hints for the implementation of this circuits with the LAN chip DP8390.", } @PHDTHESIS{Cruz8707:Calculus, AUTHOR="Rene L. Cruz", TITLE="A Calculus for Network Delay and a Note on Topologies of Interconnection Networks", SCHOOL="University of Illinois at Urbana-Champaign", MONTH=jul, YEAR=1987, KEYWORDS="end-to-end delay", } @TECHREPORT{Albu8707:NASA, AUTHOR="J. S. Albus and H. G. McCain and R. Lumia", TITLE="{NASA/NBS} Standard Reference Model for Telerobot Control System Architecture {(NASREM)}", INSTITUTION="NASA", NUMBER=1235, MONTH=jul, YEAR=1987, } @ARTICLE{Morr8707:Hierarchical, AUTHOR="D. Morris and C. J. Theaker", TITLE="Hierarchical multiprocessor architecture", JOURNAL=piee, VOLUME=134, NUMBER="E.4", PAGES="161-167", MONTH=jul, YEAR=1987, } @ARTICLE{Ibe8707:Assessing, AUTHOR="Oliver C. Ibe", TITLE="Assessing {ISDN} performance for packet networks", JOURNAL=datacommunications, PAGES="147-152", MONTH=jul, YEAR=1987, KEYWORDS="ISDN; packet switching", } @INPROCEEDINGS{Rich8707:Fault, AUTHOR="P. Richardson and D. Mansor and T. S. Dillon and K. E. Forward", TITLE="Design of a fault-tolerant signalling transfer point within a telecommunications network (late paper)", BOOKTITLE="Seventeenth International Symposium on Fault-Tolerant Computing", ADDRESS="Pittsburgh", PAGES=182, MONTH=jul, YEAR=1987, KEYWORDS="Signalling; common channel; CCS", } @ARTICLE{Chla8707:Fair, AUTHOR="I. Chlamtac and A. Lerner", TITLE="Fair Algorithms for Maximal Link Activation in Multihop Radio Networks", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=7, PAGES="739-746", MONTH=jul, YEAR=1987, } @TECHREPORT{Gosn8707:Heterogeneous, AUTHOR="Kiniko Gosney", TITLE="Heterogeneous Remote Procedure Call for Franz Lisp", INSTITUTION="University of Washington", ADDRESS="Seattle 98195", NUMBER="87-07-03", MONTH=jul, YEAR=1987, } @TECHREPORT{Amer8707:Fiber, AUTHOR="American National Standards Institute", TITLE="Fiber-Distributed Data Interface {(FDDI)} - Token Ring Media Access Control {(MAC)}", INSTITUTION="American National Standards Institute", NUMBER="ANSI X3.139-1987", MONTH=jul, YEAR=1987, KEYWORDS="FDDI", } @TECHREPORT{Suda8707:Tree, AUTHOR="T. Suda and S. B. Morris and K. Goto", TITLE="Tree {LANs} with Collision Avoidance: Protocol, Switch Architecture and Performance", TYPE="Technical Report", INSTITUTION="University of California, Irvine, Department of Information and Computer Science", NUMBER="ICS-TR-87-17", PAGES=25, MONTH=jul, YEAR=1987, ABSTRACT="Packet collisions and their resolution create a performance bottleneck in random access LANs. A hardware solution to this problem is to use collision avoidance switches. These switches allow the implementation of random access protocols without the penalty of collisions among packets. We review and compare the designs of some tree LANs that use collision avoidance switches. They have the potential of combining the benefits of random access (low delay when traffic is light, simple and distributed, and therefore robust, protocols) with excellent network utilization and concurrency of transmission. The collision avoidance LANs we review are broadcast star, Hubnet-like tree, Tinker-Tree, and a treenet that allows concurrent broadcasts within non- intersecting subtrees. After this review, we present a slotted-time, infinite user analysis of the broadcast star network.", } @ARTICLE{Motr8707:Superviews, AUTHOR="A. Motro", TITLE="Superviews: Virtual Integration of Multiple Databases", JOURNAL=ieeese, VOLUME=13, NUMBER=7, MONTH=jul, YEAR=1987, } @ARTICLE{Ferr8707:Program, AUTHOR="Ferrante and Ottenstein and Gary Warren", TITLE="The program dependence graph and its use in optimization", JOURNAL=toplas, PAGES="319-349", MONTH=jul, YEAR=1987, KEYWORDS="parallelization; multiprocessor", } @TECHREPORT{Hurs8707:Informal, AUTHOR="A. J. Hurst", TITLE="An Informal Guide to {PODL}", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-06", MONTH=jul, YEAR=1987, } @TECHREPORT{McKa8707:Nauty, AUTHOR="Brendan D. McKay", TITLE="nauty User's Guide (version 1.2)", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-03", MONTH=jul, YEAR=1987, } @PHDTHESIS{LeGa8707:Contribution, AUTHOR="F. Le Gall", TITLE="Contribution a L'Etude des Reseaux a Commnutation de Circuits: Modelasation et Resolution Numerique", SCHOOL="l'Universite Paul Sabatier de Toulouse", ADDRESS="Toulouse, France", PAGES=133, MONTH=jul, YEAR=1987, LANGUAGE="French", } @ARTICLE{Bult8707:Application, AUTHOR="Dick Bulterman and E. Manolis", TITLE="Application-Level Performance Tools for Network-Based Systems", JOURNAL=ieeenet, VOLUME=1, NUMBER=3, PAGES="6-12", MONTH=jul, YEAR=1987, REFERENCES=5, } @ARTICLE{Soha8707:Distributed, AUTHOR="M. Soha", TITLE="A Distributed Approach to {LAN} Monitoring Using Intelligent High Performance Monitors", JOURNAL=ieeenet, VOLUME=1, NUMBER=3, PAGES="13-20", MONTH=jul, YEAR=1987, REFERENCES=12, } @ARTICLE{Aron8707:Transport, AUTHOR="R. Aronoff and K. Mills and M. Wheatley", TITLE="Transport Layer Performance Tools and Measurement", JOURNAL=ieeenet, VOLUME=1, NUMBER=3, PAGES="21-31", MONTH=jul, YEAR=1987, REFERENCES=9, ABSTRACT="For the past three years, the National Bureau of Standards (NBS) has investigated Open System Interconnection (OSI) protocol performance issues. To support this investigation the NBS has developed several transport layer performance tools and has made many performance measurements. This article describes the function and design of a software system and the implementation of a testbed comprising the software and hardware required to evaluate transport layer performance over a local area network. Further, some performance results are given to demonstrate the utility of the testbed. Other transport layer performance tools, developed by, and measurement projects, conducted at, the NBS are not recounted here, but the appropriate references are included.", } @ARTICLE{Ritt8707:Multi, AUTHOR="D. Ritter and M. Seale", TITLE="A Multi-Purpose Distributed {LAN} Traffic Monitoring Tool", JOURNAL=ieeenet, VOLUME=1, NUMBER=3, PAGES="32-39", MONTH=jul, YEAR=1987, REFERENCES=6, } @ARTICLE{Jaco8707:Master, AUTHOR="D. Jacobson and S. Gaitonde and Jaehyung Kim and John Lee and D. Rover and M. Sarwar and M. Shafiq", TITLE="A Master/Slave Monitor Measurement Technique for an Operating Ethernet Network", JOURNAL=ieeenet, VOLUME=1, NUMBER=3, PAGES="40-48", MONTH=jul, YEAR=1987, REFERENCES=8, ABSTRACT="Measuring performance is a critical area in the study of computer systems. As system have evolved over the years, various techniques to characterize their behavior have been developed. Meaningful performance parameters and appropriate techniques to derive them depend on the particular computer system under investigation. This article describes a performance measurement technique that is applicable to CSMA/CD-based local area networks, such as the Ethernet. As local area networks become more widely and diversely used, it becomes more important to make accurate and meaningful measurements. These measurements need to describe the existing operating parameters of the network and may also facilitate the study of distributed processing systems in general.", } @ARTICLE{Kuro8708:Load, AUTHOR="James F. Kurose and Renu Chipalkatti", TITLE="Load Sharing in Soft Real-Time Distributed Computer Systems", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=8, PAGES="993-1000", MONTH=aug, YEAR=1987, KEYWORDS="queueing theory; load sharing; real-time systems", } @INPROCEEDINGS{Lim8708:Voice, AUTHOR="B. W. Lim and Chong Kwan Un", TITLE="Performance analysis of voice/data integration on {X.25} protocol", BOOKTITLE="Computers and Communications Technology Toward (TENCON)", ADDRESS="Seoul, Korea", PAGES="336-340", MONTH=aug, YEAR=1987, KEYWORDS="packet voice", ABSTRACT="The notion of effective transfer time is introduced to analyze the performance of link layer procedures. From the analysis of data packet delay, it is shown that the assignment of priority to voice packet leads to a small delay for voice packets without impairing the data performance, provided that the percentage of the voice traffic is maintained below 30\% of the total traffic. The performance of voice flow control with bounded flow time is studied and shown to achieve better delay performance at the cost of some packet loss.", } @MASTERSTHESIS{Schu8708:Multistage, AUTHOR="Henning Schulz-Rinne", TITLE="Multistage Vector Quantization for Speech and Image Waveform Coding; The {DSP} Workbench: Distributed Multiprocess System Simulation", SCHOOL="University of Cincinnati", ADDRESS="Cincinnati, Ohio", MONTH=aug, YEAR=1987, } @INPROCEEDINGS{Clar8708:NETBLT, AUTHOR="D. D. Clark and Mark L. Lambert and L. Zhang", TITLE="{NETBLT:} A High Throughput Transport Protocol", BOOKTITLE=sigcomm, PUBLISHER="ACM", ADDRESS="Stowe, Vermont", PAGES="353-359", MONTH=aug, YEAR=1987, REFERENCES=6, KEYWORDS="transport protocol; NETBLT; file transfer", ABSTRACT="Bulk data transmission is now finding more and more application in various fields. The major performance concern of bulk data transfer is high throughput. Theoretically, a packet switched network allows any single user an unlimited share of the network resources. In the absence of other traffic, therefore, a user should be able to transmit data at the raw bandwidth of a network channel. In reality, achievable end-to-end throughputs over high bandwidth channels are often an order of magnitude lower than the provided bandwidth. Experience shows that the throughput is often limited by the transport protocol and its flow control mechanism. It is especially difficult to achieve high throughput, reliable data transmission across long delay, unreliable network paths. We introduce a new transport protoocol, NETBLT, which was designed for high throughput, bulk data transmission applications. We first analyze the impact of network unreliability and delay on the end-to-end transport protocol; we then summarize previous experience; next we show the design and implementation of NETBLT, followed by our initial experience. Generally speaking, errors and variable delays are two barriers to high performance for all transport protocols. The NETBLT design and experience explores general principles for overcoming these barriers.", ANNOTE="Also in Computer Computer Communication Review Vol.17 No.5", } @ARTICLE{Schw8708:CHAOS, AUTHOR="Karsten Schwan and Prabha Gopinath and Win Bo", TITLE="{CHAOS-Kernel} Support for Objects in the Real-Time Domain", JOURNAL=ieeetc, VOLUME="C-36", NUMBER=8, PAGES="904-916", MONTH=aug, YEAR=1987, } @ARTICLE{Schw8708:High, AUTHOR="Karsten Schwan and Tom Bihari and Bruce W. Weide and Gregor Taulbee", TITLE="High Performance Operating System Primitives for Robotics and Real-Time Control Systems", JOURNAL=tocs, VOLUME=5, NUMBER=3, PAGES="189-231", MONTH=aug, YEAR=1987, } @ARTICLE{Kent87:Fragmentation, AUTHOR="Christopher A. Kent and J. C. Mogul", TITLE="Fragmentation considered harmful", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="390-401", MONTH=aug, YEAR=1987, REFERENCES=24, KEYWORDS="fragmentation; IP", ABSTRACT="Internetworks can be built from many different kinds of networks, with varying limits on maximum packet size. Throughput is usually maximized when the largest possible packet is sent; unfortunately, some routes can carry only very small packets. The IP protocol allows a gateway to fragment a packet if it is too large to be transmitted. Fragmentation is at best a necessary evil; it can lead to poor performance or complete communication failure. There are a variety of ways to reduce the likelihood of fragmentation; some can be incorporated into existing IP implementations without changes in protocol specifications. Others require new protocols, or modifications to existing protocols.", ANNOTE="Also in SIGCOMM Workshop", } @INPROCEEDINGS{Bric8708:Secure, AUTHOR="E. F. Brickell and Pil Joong Lee and Y. Yacobi", TITLE="Secure audio teleconference", BOOKTITLE="Advances in Cryptology --- CRYPTO", EDITOR="Carl Pomerance", ORGANIZATION="International Association for Cryptologic Research", PUBLISHER="Springer Verlag", ADDRESS="Santa Barbara, California", VOLUME=293, PAGES="418-426", NOTE="Lecture Notes in Computer Science", MONTH=aug, YEAR=1987, KEYWORDS="security; cryptography; audio conferencing; audio bridge; mixing; identification; bridging; signature", ABSTRACT="A number of alternate encryption techniques have been suggested for secure audio teleconferencing implementable on public switched networks, in which the centralized facility, called bridge, does not hold any secret. The role of the bridge is to synchronously add simultaneous encrypted signals, modulo some known number, and then transmit the result to all the participants. Each terminal has a secret key, with which it can decrypt the above modular sum of encrypted signals to obtain the desired ordinary sum of cleartext signals. Secrecy of the system is analyzed. Some of which are provably secure, assuming the existence of one way functions, and the others we have partial cryptanalysis. We also present a $N$-party identification and signature system, based on Fiat and Shamir's single party system, and another $N$-party signature system based on discrete-log problem. Our systems have communications complexity $2N$ times that of the basic Fiat-Shamir systems (as compared to a factor of $N^2$ in the direct application of the basic scheme to all pairs).", } @UNPUBLISHED{Cass8708:Perturbation, AUTHOR="Christos Cassandras and Stephen G. Strickland", TITLE="Perturbation Analysis", INSTITUTION="Department of Electrical and Computer Engineering; University of Massachusetts", NOTE="Technical Report", MONTH=aug, YEAR=1987, KEYWORDS="perturbation analysis; queueing theory; routing; stochastic gradient; gradient estimation; flow control; G/G/1", ABSTRACT="Perturbation analysis (PA) is a technique for estimating performance sensitivities of queueing networks from direct observation of a single stochastic realization. For complex systems, it provides an alternative to queueing approximations and to repetitive simulation in design and optimization problems. In this paper, PA is used to address such problems for communication networks. For a G/G/1 link model, it is shown that efficient PA algorithms can be used to estimate on-line the marginal delay of messages due to incoming flow perturbations. This information is used in a minimum delay distributed algorithm to optimize routing. PA algorithms are extended to estimate throughput and mean delay sensitivities with respect to link capacities, including blocking phenomena due to finite queues. We also consider a window flow control model and provide experimental results of PA estimates for throughput sensitivities. These estimates are seen to be accurate under heavy load conditions, but, in general, PA techniques are required to incorporate more complicated dynamic flow control and routing policies.", } @ARTICLE{Chan8708:Algorithm, AUTHOR="C. K. Chan and Takshing P. Yum", TITLE="An Algorithm for Detecting and Resolving Store-and-Forward Deadlocks in Packet Switched Networks", JOURNAL=ieeecom, VOLUME=35, NUMBER=8, MONTH=aug, YEAR=1987, } @TECHREPORT{Hack8708:Strategien, AUTHOR="K.-D. Hackbarth", TITLE="Strategien zur Leitungsführung im {ISDN} unter Berücksichtigung der Verfügbarkeit im Störfall", TYPE="Technischer Bericht", INSTITUTION="FI 53", ADDRESS="Darmstadt", NUMBER="4402 TB 1", PAGES=25, MONTH=aug, YEAR=1987, LANGUAGE="German", REFERENCES=22, KEYWORDS="Network planning; reliability; availability", } @ARTICLE{Key8708:Possible, AUTHOR="M. Key and M. Karimzadeh", TITLE="Possible Connection Control Protocols for an Integrated Multi-Service Network", JOURNAL=comcom, VOLUME=10, NUMBER=4, PAGES="189-196", MONTH=aug, YEAR=1987, REFERENCES=9, KEYWORDS="ATM", } @ARTICLE{Bors8708:TCP, AUTHOR="P. Borsook", TITLE="{TCP/IP} and Interoperability: Seperating Myth from Reality", JOURNAL=datacommunications, VOLUME=16, NUMBER=9, PAGES="60-62", MONTH=aug, YEAR=1987, } @UNPUBLISHED{Deme8708:Epidemic, AUTHOR="Alan Demers and others", TITLE="Epidemic Algorithms for Replicated Database Maintenance", NOTE="Xerox PARC", MONTH=aug, YEAR=1987, } @ARTICLE{Maxe8708:Random, AUTHOR="N. F. Maxemchuk", TITLE="Random Access Strategies for Fiber-Optic Networks", JOURNAL=ieeetc, VOLUME=36, NUMBER=8, MONTH=aug, YEAR=1987, } @MISC{Meri8708:Merit, AUTHOR="Inc. Merit", TITLE="Merit Computer Network", MONTH=aug, YEAR=1987, } @INPROCEEDINGS{Haas8708:Case, AUTHOR="Z. Haas and D. R. Cheriton", TITLE="A Case for Packet Switching in High-Performance Wide-Area Networks", BOOKTITLE=sigcomm, PUBLISHER="ACM", ADDRESS="Stowe, Vermont", PAGES="402-409", NOTE="also in Computer Communications Review, 17 (5), August 1987", MONTH=aug, YEAR=1987, REFERENCES=15, ABSTRACT="The large capacity of optical fibers suggests that circuit- switching may become a more attractive switching method in future communication networks. We show, however, that under some reasonable assumptions the delays associated with circuit-switching make the technique inferior to packet-switching in a high-performance, distributed environment. A network design that demonstrates the feasibility of packet-switching in high-performance environment is also presented.", } @ARTICLE{Sibr8708:Simulation, AUTHOR="D. Sibranietz", TITLE="Simulation of Multicast Computer Communication", JOURNAL="SIMULA Newsletter", VOLUME=15, NUMBER=3, PAGES="3-6", MONTH=aug, YEAR=1987, ABSTRACT="A brief overview of a simulation system which has been primarily developed to assess reliability and efficiency aspects of multicast communication protocols. The study of distributed algorithms, including mapping strategies and load balancing, are also proposed.", } @ARTICLE{Moff8708:Echo, AUTHOR="R. H. Moffett", TITLE="Echo and delay problems in some digital communication systems", JOURNAL=ieeecm, VOLUME=25, NUMBER=8, PAGES="41-47", MONTH=aug, YEAR=1987, KEYWORDS="echo; delay; packet voice; mobile telephony; G.131; echo cancellation; echo suppression; acoustic echo", ABSTRACT="We are currently entering an era in which digital processing techniques are being proposed or introduced to reduce the bandwidth of new communication systems. These techniques can introduce delays comparable to those of long-distance international calls.", ANNOTE="G.114 states that 50\% of subscribers have difficulties with delays as long as 400 ms, and 40\% with delays of 300 ms. Acoustical echo delays in cars could be about 10 to 20 ms. Echo suppression is needed for any round-trip path over 40 ms.", } @INPROCEEDINGS{Ludw8708:Laboratory, AUTHOR="L. F. Ludwig and D. F. Dunn", TITLE="Laboratory for the emulation and study of integrated and coordinated media communication", BOOKTITLE=sigcomm, PUBLISHER="ACM", ADDRESS="Stowe, Vermont", PAGES="283-291", MONTH=aug, YEAR=1987, REFERENCES=6, KEYWORDS="multimedia; operating systems", ABSTRACT="In future telecommunications networks, understanding the issues of user-network control, Customer Premise Equipment (CPE) technologies, services and user applications is as important as the classical network problems of channel structure, switching, and transmission. This paper discusses a Bell Communications Research facility, the Integrated Media Architecture Laboratory (IMAL), designed to flexibly emulate a wide range of current and future network and CPE environments with a focus on multiple media communications. IMAL combines off-the-shelf technologies to create an easily clonable emulation environment for studying, planning, demonstrating, and checking the feasibility of integrated media communications. The IMAL project has assembled workstations which feature speech-synthesis/ sampled-audio /telephony capabilities, local 1 MIP computation capacity, and a high-resolution color display integrating text-graphics/ image /video under an expanded X Window display management system. (X Windows is an emerging windowing standard to provide high performance device-independent graphics.) The workstations may be augmented as needed by local image digitizers, video cameras, and color image printers producing paper and viewgraph hardcopies. Also, the workstations are interconnected with switches permitting access to one another as well as shared databases, temporary storage, intelligence, and information processing /conversion resources. Communications services are implemented under a distributed, real-time service primitive control scheme. This multiple-media service primitives scheme employs a threaded /dataflow -type architecture to support user-defined , network-defined, and vendor-defined services while including a wealth of flexible features for the study of network architecture, protocol, network management, and billing functions.", ANNOTE="Also in Computer Communication Review, Vol.17, No.5", } @ARTICLE{Karn8708:Improving, AUTHOR="P. Karn and C. Partridge", TITLE="Improving Round-Trip Time Estimates in Reliable Transport Protocols", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="2-7", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=24, ABSTRACT="As a reliable, end-to-end transport protocol, the ARPA Transmission Control Protocol (TCP) uses positive acknowledgements and retransmission to guarantee delivery. TCP implementations are expected to measure and adapt to changing network propagation delays so that its retransmission behavior balances user throughput and network efficiency. However, TCP suffers from a problem we call 'retransmission ambiguity': when an acknowledgement arrives for a segment that has been retransmitted, there is no indication which transmission is being acknowledged. Many existing TCP implementation do not handle this problem correctly. This paper reviews the various approaches to retransmission and presents a novel and effective approach to the retransmission ambiguity problem.", } @ARTICLE{Arno8708:Internet, AUTHOR="G. Arnold", TITLE="{Internet} Protocol Implementation Experiences in {PC-NFS}", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="8-14", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=18, ABSTRACT="A team at Sun Microsystems East Coast Division has been engaged in developing and supporting a PC implementation of Sun's Network File System (NFS) protocols. In the course of this work we were faced with the problem of implementing Internet protocol software within the PC environment. Our experiences revealed that there are some unique obstacles to be overcome in this kind of system and indicate that further work is needed in the development of protocols to manage networks of low-end machines.", } @ARTICLE{Brow8708:Kiewit, AUTHOR="Rick Brown", TITLE="The Kiewit Network: A Large AppleTalk Internetwork", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="15-26", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, ABSTRACT="Dartmouth College's Kiewit Network connects nearly all of the computing resources on the campus: mainframes, minicomputers, personal computers, terminals, printers, and file servers. It is a large internetwork, based on the AppleTalk protocols. There are currently over 2900 AppleTalk outlets in 44 zones on campus. Over 90 minicomputers act as bridges between 177 AppleTalk twisted pair buses. This paper describes the extent and facilities of the current network; the extensions made to the AppleTalk protocols, including a stream protocol and an asynchronous link protocol; and current development projects, including an AppleTalk stream to TCP converter.", } @ARTICLE{Klin8708:Supercomputers, AUTHOR="C. S. Kline", TITLE="Supercomputers on the Internet: A Case Study", JOURNAL=ccr, VOLUME=17, NUMBER=5, NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, } @ARTICLE{Zafi8708:Modeling, AUTHOR="M. Zafirovic and I. G. Niemegeers", TITLE="Performance Modeling of the Orwell Basic Access Mechanism", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="35-48", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=20, ABSTRACT="Orwell is a high speed slotted ring. Its protocol uses destination release of the slots. Because of this the carried load can be much larger than the transmission rate. A new analytical model of the Orwell basic access mechanism is presented in this paper. The model shows to be accurate and usable over a wide range of parameters. The performance analysis of the Orwell basic access mechanism is presented.", } @ARTICLE{Moha8708:Efficient, AUTHOR="S. Mohan and J. Qian and N. P. Rao", TITLE="Efficient Point-to-Point and Point-to-Multipoint Selective-Repeat {ARQ} Schemes with Multiple Retransmissions: A Throughput Analysis", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="49-57", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, } @ARTICLE{Mura8708:Researches, AUTHOR="J. Murai and A. Kato", TITLE="Researches in Network Development on {JUNET}", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="68-77", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=16, ABSTRACT="JUNET was developed in order to provide a testing environment for studies of computer networking and distributed processing by connecting a large number of computers and by providing actual services for the users. Research interests in development of the network have been focused on resource name managing, Japanese character handling and communication technologies. For the name management, the hierarchical domain concept is employed to construct a name space for the network, and a mechanism for text message exchange is implemented using the concept. An environment for text message exchange using Japanese character is achieved as results of general discussions to handle 16-bit Kanji codes in computers. Efficient data transmission with the high speed modems are achieved by a new UUCP protocol and the dial-up IP link mechanism developed with a tty driver which provides host-to-modem flow control mechanism. As the result of researches described above, JUNET currently connects various types of organizations relating computer science which are 87 organizations with more than 250 computers in number. It connects universities and major research laboratories in Japan, and the protocols currently used are TCP/IP over leased lines as well as dial-up lines, and UUCP over dial-up lines. The services such as electronic mail and network news have been provided since the network was started, and special technologies for Japanese character handling, name servers, and multimedia mail supports have been developed. In this paper, the current status of JUNET and its research results in development of the network are described.", } @ARTICLE{Mats8708:Computer, AUTHOR="F. J. Matsukata", TITLE="Computer Networking for Large Computers in Universities", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="78-87", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=15, ABSTRACT="N-1 protocol was developed for construction of a computer network which connects universities in Japan. N-1 protocol has been adopted by Inter-University Computer Network and University Library Network. NACSIS has started the construction of Science Information Network which will provide an infrastructure for digital communication for universities in Japan. High speed digital lines has been leased from NTT for that purpose. A local area network was constructed at the Faculty of Engineering at the University of Tokyo. The network consists of an optical fiber backbone network and many IEEE802.3 10Mbps baseband networks connected to the backbone. Connection to large computers was one of the key issues in the planning of that network.", } @ARTICLE{Sait8708:SIGMA, AUTHOR="F. K. Saito", TITLE="The {SIGMA} Network", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="88-97", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=23, ABSTRACT="The Sigma network is one of the most important element of the Sigma system wich is designed to improve productivity of a software. The Sigma network has been developed in order to establish an infrastructure which acts as development environment provided by logically integrated Sigma workstations spread over various companies and inside the companies which approve the concept of the Sigma system. It is also included in the scope of its development to enrich application programs mainly for message communications required by network community. The network supports IEEE802.3 , digital packet exchange (X.25) and serial line under the TCP/IP layer and realizes end-to-end immediate communciation. Sigma network is a name oriented virtual network defined by hierarchical name space (domain) and named objects placed under the domains. Its key feature lies in the network management mechanism, i.e., Name Server.", } @ARTICLE{Rose8708:Overview, AUTHOR="J. Rosenberg and C. Everhart and N. Borenstein", TITLE="An Overview of the Andrew Message System", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="99-108", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=22, } @ARTICLE{Murp8708:Verified, AUTHOR="S. Murphy and A. U. Shankar", TITLE="A Verified Connection Management Protocol for the Transport Layer", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="110-125", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=15, ABSTRACT="We specify and verify a connection management protocol for use between entities connected by channels that can lose, reorder, and duplicate messages. The protocol is symmetric. Each entity is in one of the following states: closed, listen, open, active opening, passive opening, or closing. The first three are stable states to be existed only by user request, while the last three are transient states. Each entity maintains a local incarnation number at all times, and a remote incarnation number only when opening, open and closing. Our protocol employs the 3-way handshake used in TCP and ISO Transport Protocol (Class4). We verify the safety property that when an entity is open, its remote incarnation number matches the remote entity's local incarnation number. This ensures that data messages from past connection instances are not delivered to the user. We verify the following progress properties: an activley opening entity will eventually establish a connection, provided that the remote entity is willing to communicate or is itself actively opening; the states of active opening, passive opening, and closing are transient; if the entities remain closed, the channels will eventually become empty, assuming messages have a maximum lifetime. This protocol specification can be immediately combined with the data transfer protocol specifications presented in [SHAN1,SHAN2,SHAN3] (REF) to provide a transport layer protocol with the functions of connection management and two-way data transfer. The verifications too can be immediately combined to provide a hierarchical verification of the multi-function protocol. This illustrates the power of protocol projections in constructing multi-function protocols.", } @ARTICLE{Lin8708:Protocol, AUTHOR="F. Lin and P. Chu and Minkui Liu", TITLE="Protocol Verification Using Reachability Analysis: The State Space Explosion Problem and Relief Strategies", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="126-135", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=28, ABSTRACT="Reachability analysis has proved to be one of the most effective methods in verifying correctness of communication protocols based on the state transition model. Consequently, many protocol verification tools have been built based on the method of reachability analysis. Nevertheless, it is also well known that state space explosion is the most severe limitation to the applicability of this method. Althoguh researchers in the field have proposed various strategies to relieve this intricate problem when building the tools, a survey and evaluation of these strategies has not been done in the literature. In searching for an appropriate approach to tackling such a problem for a grammar-based validation tool, we have collected and evaluated these relief strategies, and have decided to develop our own from yet another but more systematic approach. The results of our research are now reported in this paper. Essentially, the paper is to serve two purposes: first, to give a survey and evaluation of exisitng relief strategies; second, to propose a new strategy, called PROVAT (PROtocol VAlidation Testing), which is inspired by the heuristic search techniques in Artificial Intelligence. Preliminary results of incorporating the PROVAT strategy into our validation tool are reviewed in the paper. These results show the empirical evidence of the effectiveness of the PROVAT strategy.", } @ARTICLE{Bave8708:New, AUTHOR="Z. Bavel and J. Grzymala-Buse and Y. Hsia", TITLE="New Communication Protocols from Old", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="136-150", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=12, ABSTRACT="The power tier automation (PTA) is introduced as a model of preference for representing and manipulating systems in general, computer architectures and, in particular, communication networks and their protocols. The PTA is superior to Petri nets, both in computing power (Turing machine power) and in ease and selectivity of representation. The tier automation, a species of the PTA, is used to represent networks and protocols to a greater advantage than other existing models. Homomorphisms and reachable-domain (r.d.) homomorphisms on tier automata are introduced and used to manipulate two distinct protocols for reliable full-duplex transmission over half-duplex lines, both of whose images are the same familiar alternating-bit protocol.", } @ARTICLE{Calv8708:Exercise, AUTHOR="Ken Calvert and S. S. Lam", TITLE="An Exercise in Deriving Protocol Conversion", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="151-160", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=8, ABSTRACT="This paper demonstrates formal techniques useful in solving and reasoning about protocol conversion problems. A simple example problem is solved and the resulting conversion system is shown to have certain desired properties, using the projection paradigm. The example problem is representative of some real-world problems in that the protocols involved are similar in function, and even in structure, but have fundamental differences that render them incompatible in the absence of an active translation entity (protocol converter). The use of mappings, as well as images and inverse images of properties, in comparing semantics of protocols is discussed and illustrated.", } @ARTICLE{Lam8708:Modeling, AUTHOR="S. S. Lam and C.-T. Hsieh", TITLE="Modeling, Analysis, and Optimal Routing of Flow-Controlled Communication Networks", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="162-172", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=18, ABSTRACT="Closed queueing networks have been advocated by several authors to be a more desirable model than open queueing networks (Kleinrock's model) for network design. We compare open and closed network models and demonstrate the accuracy of a particular closed network model with experimental results. Te proportional approximation method (PAM) is presented for evaluating performance measures of closed queueing networks. PAM algorithms have computational time and space requirements of O(KM), where M denotes the number of queues and K denotes the number of virtual channels in the network. Thus, PAM is the first (and only) method that can be used for solving industrial-strength network design problems using a closed network model. We formulate the following optimal routing problem: Find a route for a new virtual channel to be added to a network with existing flow-controlled virtual channels. A fast heuristic algorithm is presented. The algorithm uses PAM and exploits the following empirical observation: The route that maximizes the individual throughput of a virtual channel coincides in most cases with the route that maximizes the total network throughput (this is not true in general). We present statistical results from studies of 100 randomly generated networks to demonstrate the accuracy of PAM algorithms and the effectiveness of the optimal routing algorithm. (Exact solutions obtained by the tree convolution algorithm were used as benchmarks in our statistical studies.)", } @ARTICLE{Rose8708:Adaptive, AUTHOR="J. Rosenberg and S. Gruchevsky and D. Piscitello", TITLE="Adaptive Routing in Burroughs Network Architecture", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="173-184", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=6, ABSTRACT="The routing function used for Burroughs Network Architecture (BNA) to determine the best routes or traffic through the network is known as the Burr roughIntsgrated Adaptive Routing System, or BIAS. Based on the algorithm devised for the MERIT Computer Network, BIAS is a decentralized, deterministic system which adapts to changes in network topology automatically. The current BIAS routing architecture incorporates improvements in the original algorithm which significantly reduce the recovery time from failures of nodes or links and is virtually loop-free, even during recovery from those failures. BIAS automatically re-determines the best routes for traffic throughout the network in response to the following changes to the network topology: 1) a node (an end system or intermediate system) is added to the network; 2) a node is removed from the network; 3) the cost of transiting a node is changed; 4) a logical link (LAN, leased or switched circuit, X.25 virtual circuit) is added to the network; 5) a link is removed from the network; and/or 6) the cost of transiting a link is changed.", } @ARTICLE{Tsuc8708:Architecture, AUTHOR="Paul F. Tsuchiya", TITLE="An Architecture for Network-Layer Routing in {OSI}", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="185-190", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=20, ABSTRACT="Work on the standardization of routing protocols for OSI is in progress. The envisioned set of routing protocols is expected to work in nearly all of the environments which constitute OSI networks. Behind these routing protocols is an architecture which outlines problems and goals, establishes a framework upon which to base the development of protocols, and provides a conceptual baseline for continued work on unsolved problems. This architecture defines routing in the OSI network layer, functionally partitions the problem into its components, defines a routing hierarchy and an address hierarchy and discusses their relationship, and discusses arms-length routing relationships between differently administered networks. This paper presents that architecture, and discusses problems which remain to be solved as work progreeses towards a global OSI network.", } @ARTICLE{Mill8708:NSFNET, AUTHOR="D. L. Mills and H. Braun", TITLE="The {NSFNET} Backbone Network", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="191-196", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=22, ABSTRACT="The NSFNET Backbone Network interconnects six supercomputer sites, several regional networks and ARPANET. It supports the DARPA Internet protocol suite and DCN subnet protocols, which provide delay-based routing and very accurate time-synchronization services. This paper describes the design and implementation of this network, with special emphasis on robustness issues and congestion-control mechanisms.", } @ARTICLE{Masa8708:Algorithms, AUTHOR="G. Masapati and G. M. White", TITLE="Algorithms for the Reduction of Timed Finite State Graphs", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="198-216", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=7, ABSTRACT="A set of algorithms to reduce the size of timed finite state graphs are presented. In particular, we develop a more general algorithm for vertex folding than those presently existing. It is based on the law of conservation of transition time. We demonstrate the application of these reduction algorithms to a version of the stop-and-wait protocol. We have also developed a graph reduction software package incorporating all these algorithms which can be used in automated performance prediction. Graph reduction software tools such as these are important and form an integral part of automated protocol performance prediction tools.", } @ARTICLE{Zic8708:Extensions, AUTHOR="J. Zic", TITLE="Extensions to Hoare's Communicating Sequential Processes to Allow Protocol Performance Specification", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="217-227", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=11, ABSTRACT="Formalisms based on Hoare's Communicating Sequential Processes (CSP) and Milner's Calculus of Communicating Systems (CCS) for verifying protocols are currently being used by the International Standards Organization (ISO). However, these models need to be extended if protocol performance specification and verification is to be done, as neither of these models have timing information (other than sequencing) nor a way of specifying controlled loss of information. This paper presents two extensions to Hoare's CSP that are felt by the author to provide suitable mechanisms for specifying protocol performance. Firstly, the effects of introducing time into CSP are presented, based on the work done by Reed and Roscoe. Secondly, the traces model is modified by associating probabilities with event sequences. Finally, some example specifications are given using these two extensions.", } @ARTICLE{Cohe8708:IC, AUTHOR="Danny Cohen and T. Guinther", TITLE="The {IC*} System for Protocol Development", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="228-233", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=15, ABSTRACT="The realization of a new protocol is a long and complicated procedure whose inherent technical difficulty is exacerbated by the scarcity of useful tools. This paper discusses the initial use of a system that is being developed by Bell Communication Research to help in the specification, analysis, and implementation of communications protocols. This paper describes the application of this system to the specification and implementation of an industry standard protocol.", } @ARTICLE{Pete8708:Yellow, AUTHOR="L. L. Peterson", TITLE="A Yellow-Pages Service for a Local Area Network", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="235-242", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=13, ABSTRACT="We introduce a yellow-page service that maps service names into server addresses. The service is novel in that it associates a set of attributes with each server. Clients specify the attributes the server should possess when requesting a service and the yellow-pages service determines what servers satisfy the request. In addition to describing the implementation of the yellow-pages service within a local-area network, we show how that service can be integrated with the available internet communication protocols to enable clients from throughout the internet to access local servers.", } @ARTICLE{Scha8708:Resource, AUTHOR="R. E. Schantz and K. Schroeder and P. Neves", TITLE="Resource Management in the Cronus Distributed Operating System", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="243-244", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=7, } @ARTICLE{Stum8708:Strategies, AUTHOR="Michael Stumm", TITLE="Strategies for Decentralized Resource Management", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="245-253", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=22, ABSTRACT="Decentralized resource management in distributed systems has become more practical with the availability of communication facilities that support multicasting. In this paper we present several example solutions for managing resources in a decentralized fashion, using multicasting facilites. We review the properties of these solutions in terms of scalability, fault tolerance and efficiency. We conclude that decentralized solutions compare favorably to centralized solutions with respect to all three criteria.", } @ARTICLE{Skin8708:Resource, AUTHOR="G. Skinner and J. Wrabets and L. Schreier", TITLE="Resource Management in a Distributed Internetwork Environment", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="254-258", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=9, ABSTRACT="The resource management system is designed to support location- transparent access to resources and to improve performance in a distributed internetwork environment. In this environment, access to one of several machines that have a given resource is determined by the effective bandwidth and reliability of internetwork communications, the ability to interact with the machines offering the resources, and the load on those machines. Using these criteria, the resource management system enables applications to determine and obtain access to the ''best'' copy of a resource. Should the resource become unavailable from one machine, the resource management system can dynamically direct the applications to another machine known to offer the same resource. The paper discusses some of the problems that motivated the design, and implementation for a UNIX workstation environment, and future directions for the resource management system.", } @ARTICLE{Whit8708:Network, AUTHOR="J. Whitescarver and P. Mukherji and Murray Turoff", TITLE="A Network Environment for Computer Supported Collaborative Work", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="260-272", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=16, ABSTRACT="A second generation computer supported cooperative work system called Electronic Information Exchange System (EIES2) is described in this paper. The EIES2 communications environment allows users to network across geographical constraints using asynchronous or synchronous communications. The architecture of the network environment is decentralized, and is implemented using modern standard, and an easy-to-use user interface. At the heart of EIES2 is a high-level, object oriented pseudo machine which incorporates a distributed, communications-oriented databse. The set of tools provided by the EIES2 communications environment is well suited for implementing group communication systems that have an extensive set of user features built into it. These tools are well suited to support the group communication model described by the AMIGO task force (IFIP 6.5 and ISO TC97/SC18/WG64). The EIES2 application layer protocols, using CCITT/ISO X.410 Remote Operations, support a distributed object oriented database.", } @ARTICLE{Fisc8708:Integrating, AUTHOR="K. Fischer and W. F. Racke", TITLE="Integrating {X.400} Message Handling into the {IBM} {VM/SP} Environment", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="273-282", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=12, ABSTRACT="A prototype X.400 message handling system for IBM's VM/SP operating system is discussed. The system is designed to provide smooth integration of X.400 services into the predominantly used means of interpersonal communication in the VM/SP environment (RSCS). The system provides native X.400 services to its users and therefore is not a gateway between RSCS and X.400 protocols.", } @ARTICLE{Lein8708:Telescience, AUTHOR="B. M. Leiner", TITLE="Telescience and Advanced Technologies", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES=292, NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, ABSTRACT="space Station and its associated laboratoris, coupled with the availability of new computing and communications technologies, have the potential of significantly enhancing scientific research. Telescience involves the interaction of scientific researchers and equipment on earth with on-board personnel and equipment as well as with other researchers, remote ground-based resources, mission control personnel, and space station developers. To assure that this potential is met, scientists and managers associated with the Space Station project must gain significant experience with the use of these technologies for scientific research, and this experience must be fed into the development process for Space Station. In this talk, a pilot program is described that is attempting to address this problem. University researchers are conducting rapid prototyping testbeds employing new telescience technologies and ideas. These testbeds are specific research experiments within the scientific discipline areas that will use Space Station laboratories. The experiments are being carried out in a coordinated manner to allow the critical questions to be answered by groups of scientists working with technologists in a rapid prototyping testbed environment. The rapid prototyping testbeds are not like a typical testbed. Rather than being used to evaluate and integrate systems on the way to deployment, the rapid prototyping testbeds constitute a Technology Evaluation Environment (TEE), allowing users to interact with advanced technologies in the conduct of scientific research in order to develop the required base of experience to permit development and evaluation of requirements and specifications.", } @ARTICLE{Blak8708:Models, AUTHOR="M. Blakey", TITLE="Models of a Very Large Distributed Database", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="294-305", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=15, ABSTRACT="The problems inherent in managing a database distributed over a very large number of sites are considered. The applications of such databases to the provision of telecommunications and other public services are discusseed. It is shown that the distribution and maintenance of the directory information describing object locations poses some fundamental problems. A new partially informed class of distributed databases is described which distributes the directory information on a ''needs-to-know'' basis. The class is described by models of the network topology, and by the knowledge available to each site. These proposals are sufficiently general to support the partitioning of data relations into distribution fragments, and for those fragments to be replicated at multiple sites.", } @ARTICLE{Ludw8708:Threaded, AUTHOR="L. F. Ludwig", TITLE="A Threaded/Flow Approach to Service Primitives Architectures", JOURNAL=ccr, PUBLISHER="ACM", VOLUME=17, NUMBER=5, PAGES="306-316", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=12, ABSTRACT="This paper discusses a methodology for managing the assembly, control, and disassembly of large numbers of independent small-scale configurations within large-scale reconfigurable distributed systems. The approach is targeted at service primitives architectures for enhanced telecommunications networks, but can apply to more general settings such as multitasking supercomputers and network operations systems. Study of the methods presented here was a key motivation in founding the Bell Communications Research Integrated Media Architecture Laboratory (IMAL). The Threaded/Flow approach uses data-flow constructs to assemble higher level functions from other distributed functions and resources with arbitrary degrees of decentralization. Equivalence between algorithms and hard and virtual resources is accomplished via threaded-interpretive constructs. Function autonomy, concurrency, conditional branching, pipelining, and setup/execution interaction are implicitly supported. Some elementary performance comparisons are argued. This work is motivated by telecommunications applications involving coordinated multiple-media in open architectures supporting large numbers of users and outside service vendors. In such networks it is desired that services may be flexibly constructed by the network, service vendors, or by users themselves from any meaningful combination of elementary primitives and previously defined services. Reliability, billing, call progress, real-time user control, and network management functions must be explicitly supported. These needs are handled with apparent high performance by the approach.", } @ARTICLE{Flei8708:Distributed, AUTHOR="B. D. Fleisch", TITLE="Distributed Shared Memory in a Loosely Coupled Distributed System", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="317-327", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=27, ABSTRACT="This work outlines the development and performance validation of an architecture for distributed shared memory in a loosely coupled distributed computing environment. This distributed shared memory may be used for communication and data exchange between communicants on different computing sites; the mechanism will operate transparently and in a distributed manner. This paper describes the architecture of this mechanism and metrics which will be used to measure its performance. We also discuss a number of issues related to the overall design and what research contribution such an implementation can provide to the computer science field.", } @ARTICLE{Naka8708:Resource, AUTHOR="O. Nakamura and N. Saito", TITLE="Resource Management Schemes in Distributed Environment", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="328-335", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=3, ABSTRACT="The user interface for distributed computing environment needs several kinds of transparency for resources which are distributed on many sites connected to the network. Access transparency and location transparency are general concept for distributed resources. In distributed environment, there are many resource of the same functions in various sites. For example, cashed resources wich are complete duplicated resources exist on many sites in order to realize high performance. In this paper, the resource management scheme in the distributed environment is described. The sophisticated semantics transparency which is a general scheme for manipulating duplicated resources in distributed environment is provided. The specification language for the environment which provides semantics transparency is also discussed.", } @ARTICLE{Wu8708:Receiver, AUTHOR="Chengke Wu and V. Li", TITLE="Receiver-Initiated Busy-Tone Multiple Access in Packet Radio Networks", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="336-342", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=10, ABSTRACT="The ALOHA and Carrier Sense Multiple Access (CSMA) protocols have been proposed for packet radio networks (PRN). However, CSMA/CD which gives superior performance and has been successful applied in local area networks cannot be readily applied in PRN since the locally generated signals will overwhelm a remote transmission, rendering it impossible to tell whether a collision has occurred or not. In addition, CSMA and CSMA/CD suffer from the ''hidden node'' problem in a multiple PRN. In this paper, we develop the Receiver-Initiated Busy-Tone Multiple Access Protocol to resolve these difficulties. Both fully connected and multihop networks are studied. The busy tone serves as an acknowledgment and prevents conflicting transmissions from other nodes, including ''hidden nodes''.", } @ARTICLE{Erra8708:Reliable, AUTHOR="A. Erramilli and R. Singh", TITLE="A Reliable and Efficient Multicast Protocol for Broadband Broadcast Networks", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="343-352", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=10, ABSTRACT="A reliable and efficient data transfer protocol is proposed for multicast applications in broadband broadcast networks. The protocol is based on negative acknowledgments, with several enhancements so that it matches most of the functionality of a positive acknowledgment based protocol. The protocol makes the best use of resources in the broadband network environment by conserving processing and trading off transmission and storage resources. The performance of this protocol is compared with the positive acknowledgment based protocol on the basis of maximum throughput as a function of group size for lecture and conference applications.", } @ARTICLE{Amer8708:Measurement, AUTHOR="P. D. Amer and L. N. Cassel", TITLE="Measurement Management Service", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="360-367", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=2, } @ARTICLE{Chla8708:LAN, AUTHOR="I. Chlamtac and A. Herman", TITLE="{LAN-HUB:} An Ethernet Compatible Low Cost/High Performance Communication", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="369-380", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=14, ABSTRACT="The LAN-HUB is a new local area network designed to combine the properties of several existing LAN standards to provide highly reliable communication at a relatively lower cost per station, improve network capacity/delay performance and increase the LAN user's flexibility in configuring his network. The LAN-HUB network is configured around the CODEX 4320 LAN-HUB communication controllers which allow up to eight Ethernet/IEEE 802.3 stations to transparently share one network transceiver or RF Modem. Each LAN-HUB controller executes a fair, collision-free, arbitration among its local stations attached to its LAN ports, using a patented collision avoidance algorithm. The HUB's rear panel further provides a Network port which can be attached to a standard 802.3 transceiver, to another HUB or terminated in a loop back mode. The HUBs, thus, allow stations to be organized in a standalone star network, in a ''cascading'' star configuration, or as an integrated bus/star network. When organized as star or cascaded star networks, the HUB controllers provide highly reliable and controlled, collision free, bandwidth allocation suitable for applications such as CPU room clusters. Alternately, in a bus configuration the HUBs suppport an Ethernet type bus network, with random access channel control. In the latter configuration the HUBs provide a lower cost/higher performance solution for bursty traffic users, since they reduce cabling requirements, decrease cost by sharing each transceiver among several LAN stations and improve network throughput/delay performance by eliminating local collisions. The LAN-HUB is thus effective in creating a local communication solution with a significant degree of flexibility in choosing the network layout and the type of service, random or deterministic, provided to the network users.", } @ARTICLE{Varg8708:Transparent, AUTHOR="George Varghese and R. Perlman", TITLE="Transparent Interconnection of Incompatible Local Area Networks Using Bridges", JOURNAL=ccr, VOLUME=17, NUMBER=5, PAGES="381-389", NOTE="SIGCOMM Workshop", MONTH=aug, YEAR=1987, REFERENCES=10, ABSTRACT="No single LAN technology is sufficient to interconnect all the computers in a given plant, campus, or site. Thus it is desirable to combine different types of LANs, using a device called a Bridge, to produce an Extended LAN. Some LANs in the Extended LAN may have incompatible data Link formats. Thus a bridge may need to encapsulate a frame originating on LAN A inside the Data Link header of another (incompatible) LAN B in order to allow the type A frame to travel over LAN B. In general, frames sent between any pair of LANs in the Extended LAN must be encapsulated across every incompatible LAN in the path between the LANs. Bridges learn their routing information from information contained in frames they forward. Besides the problems of distinguishing various kinds of encapsulated and unencapsulated frames, the encapsulating protocol used by bridges must also solve the learning problem. This leads to a new set of considerations and solutions. We begin with a rough solution, and refine it using informal arguments and examples to lead to the final description. The stages in the description roughly mimic the design process.", } @ARTICLE{Feld8708:Extension, AUTHOR="Robert E. Felderman", TITLE="Extension to the {Rude-CSMA} Analysis", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=8, PAGES="848-849", MONTH=aug, YEAR=1987, } @INPROCEEDINGS{Deme87:Epidemic, AUTHOR="Alan Demers and D. H. Greene and Carl Hauser and Wes Irish and John Larson", TITLE="Epidemic Algorithms for Replicated Database maintenance", BOOKTITLE=podc, ADDRESS="Vancouver Canada", PAGES="1-12", MONTH=aug, YEAR=1987, KEYWORDS="Virus", } @TECHREPORT{Rama8708:Congestion, AUTHOR="Kadangode K. Ramakrishnan and D. Chiu and Raj Jain", TITLE="Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part {IV:} A Selective Binary Feedback Scheme for General Topologies", INSTITUTION="DEC", NUMBER="DEC-TR-510", MONTH=aug, YEAR=1987, } @ARTICLE{Came8708:Integrated, AUTHOR="W. H. Cameron and C. LaCerte and J. F. Noyes", TITLE="Integrated Network Operations Architecture and its Application to Network Maintenance", JOURNAL=ieeecm, VOLUME=25, NUMBER=8, PAGES="48-53", MONTH=aug, YEAR=1987, REFERENCES=3, KEYWORDS="Integrated Network; network management", } @INPROCEEDINGS{Ho8709:Infinitesimal, AUTHOR="Yu-Chi Ho and Pirooz Vakili", TITLE="Infinitesimal Perturbation Analysis Algorithm for a Routing Problem", BOOKTITLE="25th Annual Allerton Conference on Communication, Control and Computing", ADDRESS="Monticello, Illinois", PAGES="279-286", MONTH=sep, YEAR=1987, KEYWORDS="perturbation analysis", ANNOTE="IPA; multiclass; estimate of $\partial E[W\_{ij}]/\partial p\_{kj}$", } @INPROCEEDINGS{Bowk8709:Packetized, AUTHOR="D. O. Bowker and C. B. Armitage", TITLE="Performance issues for packetized voice communications", BOOKTITLE=ncf, ORGANIZATION="National Engineering Consortium", ADDRESS="Rosemont, Illinois", VOLUME=41, PAGES="1087-1092", MONTH=sep, YEAR=1987, KEYWORDS="packet voice; subjective quality; field trial; DSI", } @ARTICLE{Alme8709:Edmas, AUTHOR="G. T. Almes and Cara L. Holman", TITLE="Edmas: An Object-Oriented, Locally Distributed Mail System", JOURNAL=ieeese, ADDRESS="Department of Computer Science, University of Washington, Seattle, WA, 98195", VOLUME="SE-13", NUMBER=9, PAGES="1001-1009", MONTH=sep, YEAR=1987, KEYWORDS="computer-mediated communications; computer conferencing; electronic mail; CSCW", ABSTRACT="The Eden Project conducts research in the design and implementation of a distributed computing environment for a local area network. A specific goal in designing Eden was to provide users the advantages of both physical distribution {\it and} logical integration. Edmas, the Eden mail system, provided an early test of Eden as a base for building distributed applications. This paper discusses Edmas, and shows how Eden's advanced functionality aided in structuring a distributed mail system, particularly in the areas of replying and distribution lists.", } @ARTICLE{Mahm8709:System, AUTHOR="Mo A. Mahmood", TITLE="System Development Methods --- A Comparative Investigation", JOURNAL=misq, PAGES="292-311", MONTH=sep, YEAR=1987, KEYWORDS="software engineering", ABSTRACT="This article presents a retrospective comparative study of the use of the system development life cycle (SDLC) and prototyping methods to help select a development approach for a given information systems (IS) project. The respondents were asked (a) to decide independently whether one of the recent IS projects was developed using either the SDLC or prototyping approach and if so, (b) to evaluate the merit of that approach in terms of ease of project management, project requirements, project characteristics, impact on decision making, and user and designer satisfaction. The results indicate: \begin{enumerate} \item Design methods cannot be considered apart from project, environment, and decision characteristics. \item A clear cut preference of one method over the other could not be established. Each method performed better in some areas than in others. \item A framework that can be used by a project director for selecting a design method to develop a system could be postulated. \end{enumerate}", } @ARTICLE{Culn8709:Mapping, AUTHOR="Mary Culnan", TITLE="Mapping the Intellectual Structure of {MIS,} 1980-1985: A Co-Citation Analysis", JOURNAL=misq, PAGES="341-353", MONTH=sep, YEAR=1987, LANGUAGE="English", KEYWORDS="MIS; management information systems", ABSTRACT="This study is the second of two studies which assess the intellectual development of MIS. The present study documents the current intellectual structure of MIS research based on an author co-citation analysis. Five invisible colleges, or informal clusters of research activity, were identified (foundations; psychological approaches to MIS design and use; MIS management; organizational approaches to MIS design and use; and curriculum). When contrasted with the earlier study, these results suggest that MIS has made significant progress toward a cumulative research tradition.", } @ARTICLE{Liva8709:PIOCO, AUTHOR="Juhani Livari and Erkki Koskela", TITLE="The {PIOCO} Model for Information Systems Design", JOURNAL=misq, ADDRESS="University of Oulu, Institute of Data Processing Science, Linnanmaa, SF-90570 OULU 57, Finland", PAGES="401-419", MONTH=sep, YEAR=1987, KEYWORDS="PIOCO; information systems", ABSTRACT="The PIOCO model is a comprehensive methodology for information systems design consisting of a meta-model for an information system, the corresponding description languages, a process model for information systems design, and a model for choice and quality criteria. The meta-model for an information system consists of three levels of abstraction and forms a profound and articulated conceptual basis for the PIOCO model for the IS design process. The article gives an overview of the PIOCO approach from a management perspective, emphasizing the role of IS design as an inquiry process supporting the decision-making concerning the information design, the quality criteria related to the IS design, and the use of the PIOCO model as a macro-framework which integrates more detailed micro-level methodologies, methods, techniques and tools.", } @TECHREPORT{Hank8709:Multiprocessing, AUTHOR="Brian Frederick Hanks", TITLE="Multiprocessing Using Workstations with A Shared File System", TYPE="Technical Report", INSTITUTION="University California, Santa Cruz", NUMBER="UCSC-CRL-88-12", MONTH=sep, YEAR=1987, ABSTRACT="This thesis describes a method for exploiting large grain parallelism on a network of workstations. Parallelism is provided by a collection of C callable library functions and macro expansions, giving the applications programmer the ability to create, execute, and synchronize processes using synchronous message passing. A program using these library calls consists of a main process and a set of created subprocesses executing on multiple workstations in the network. Significant speedup has been obtained with this library.", ANNOTE="Ed. Note: Available for \$4 from Technical Report Librarian Baskin Center for Computer Engineering and Information Sciences, Applied Sciences Building, University of California, Santa Cruz, CA 95064", } @PROCEEDINGS{Sche8709:1st, TITLE="1st German-Soviet seminar on flow control and integrated communication systems", EDITOR="R. Schehrer", ISBN="3-924917-03-5", PUBLISHER="University of Dortmund", ADDRESS="Dortmund", PAGES="ca. 150", MONTH=sep, YEAR=1987, KEYWORDS="Queueing system; random number generation; flow control; routing algorithm; ISDN", ANNOTE="Lazarev: The control of pririty service of call flows; Schehrer: On a cutoff priority delay-loss system with hysteresis; Uhl: A comparison of routing rules; Mertsch: on new possibilities for the choice of random number generations.", } @ARTICLE{Goul8709:Communications, AUTHOR="E. P. Gould and C. D. Pack", TITLE="Communications network planning in the evolving information age", JOURNAL=ieeecm, VOLUME=25, NUMBER=9, PAGES="22-30", MONTH=sep, YEAR=1987, KEYWORDS="Communication network; network planning", } @INPROCEEDINGS{Woel8709:Multimedia, AUTHOR="Woelk and Seung-Hoon Kim", TITLE="Multimedia Information Management in an Object Oriented Database System", BOOKTITLE="International Conference on Very Large Data Bases", MONTH=sep, YEAR=1987, KEYWORDS="multimedia", } @ARTICLE{Ches8709:Protocol, AUTHOR="G. L. Chesson", TITLE="The Protocol Engine Design", JOURNAL=unixr, PAGES="70-77", MONTH=sep, YEAR=1987, } @ARTICLE{Lele8709:Data, AUTHOR="D. A. Lelewer and D. S. Hirschberg", TITLE="Data Compression", JOURNAL=acmcs, VOLUME=19, NUMBER=3, PAGES="261-296", MONTH=sep, YEAR=1987, } @ARTICLE{Zhan8709:Designing, AUTHOR="L. Zhang", TITLE="Designing a New Architecture for Packet Switching Communications Networks", JOURNAL=ieeecm, VOLUME=25, NUMBER=9, MONTH=sep, YEAR=1987, } @INPROCEEDINGS{Yuki8709:Multicast, AUTHOR="Ken-ichi Yukimatsu and Nayoa Watanabe and T. Honda", TITLE="Multicast communication facilities in a high speed packet switching network", BOOKTITLE="8th International Conference on Computer Communication", EDITOR="Paul J. Kuehn", PUBLISHER="North-Holland", ADDRESS="Amsterdam", PAGES="276-81", MONTH=sep, YEAR=1987, ABSTRACT="Discusses the multicast communication facilities in a high speed packet switched network (HSPN) that can accommodate various kinds of terminals such as telephone sets, high speed data terminals and video terminals. The architecture of the HSPN is discussed. Since packet size in the HSPN is determined for each type of information media and allowable network delays in all media are different, packet ordering control with priorities is required. Some packet multiplexing methods, which allow high-priority packets to interrupt long, low-priority packets are proposed. It is proposed to provide multicast communication facilities in the HSPN as functions of the data link and the network layers, instead of the session layer. With these facilities real-time broadcasting can easily be provided. The control mechanism for the multicast packet communications in the HSPN nodes is also described. An information service using the HSPN's multicast is presented.", } @ARTICLE{Wilb8709:Building, AUTHOR="S. R. Wilbur and B. Bacarisse", TITLE="Building Distributed Systems with Remote Procedure Call", JOURNAL="IEE Software Engineering Journal", VOLUME=2, NUMBER=5, PAGES="148-159", MONTH=sep, YEAR=1987, } @TECHREPORT{Cha8709:Safety, AUTHOR="S. S. Cha and N. Leveson and T. J. Shimeall", TITLE="Safety Verification of Ada Programs in {MURPHY}", TYPE="Technical Report", INSTITUTION="University of California, Irvine, Department of Information and Computer Science", NUMBER="ICS-TR-87-23", PAGES=33, MONTH=sep, YEAR=1987, ABSTRACT="MURPHY is a experimental methodology, which will include an integrated tool set, for building safety-critical, real-time software. Although it is language independent, many safety-critical software projects are currently planning to use Ada. This paper presents the semantic templates for the verification of the safety of Ada programs using Software Fault Tree Analysis. An example is shown of applying the technique to an Ada program, and the tools in the MURPHY tool set to aid in this type of analysis are described.", } @TECHREPORT{Cha8709:Dynamic, AUTHOR="S. S. Cha", TITLE="Dynamic Load Balancing Algorithm Complexity", TYPE="Technical Report", INSTITUTION="University of California, Irvine, Department of Information and Computer Science", NUMBER="ICS-TR-87-24", PAGES=12, MONTH=sep, YEAR=1987, ABSTRACT="This paper presents a theoretical analysis of the asymptotic complexity inherent in a load balancing algorithm in a loosely-coupled network, where processor communication is achieved by message passing. The load balancing complexity depends on the network topology and the overhead of processor communication for each polling strategy. The best, worst, and average case analysis of the load balancing algorithms for the various polling topologies are presented. The polling strategies considered are local, global, and random polling. The complexity is presented as a function of the number of processors in the network.", } @ARTICLE{Conk8709:Hypertext, AUTHOR="Jeff Conklin", TITLE="Hypertext: An introduction and survey", JOURNAL=ieeecomp, VOLUME=20, NUMBER=9, PAGES="17-41", MONTH=sep, YEAR=1987, } @TECHREPORT{Spec8709:High, AUTHOR="A. Z. Spector and other", TITLE="High Performance Distributed Transaction Processing in a General Purpose Computing Environment", INSTITUTION="CMU", MONTH=sep, YEAR=1987, KEYWORDS="Camelot", } @INPROCEEDINGS{Akyi8709:Reversible, AUTHOR="Ian Akyildiz", TITLE="Analysis of Reversible and Nonreversible Queueing Networks with Rejection Blocking", BOOKTITLE="Messung, Modellierung und Bewertung von Rechensystemen. 4. GI/ITG-Fachtagung", ADDRESS="Erlange", MONTH=sep, YEAR=1987, KEYWORDS="performance evaluation; queueing network; blocking; equilibrium distribution", } @BOOK{ATT8709:5ESS, AUTHOR="A. T.\&T", TITLE="{5ESS} Switch, The Premier Solution: Feature Handbook", EDITION=4, PUBLISHER="AT\\&T", MONTH=sep, YEAR=1987, ABSTRACT="The book listed the features in 5ESS switch and described every feature in detail.", } @INPROCEEDINGS{Sche87:Cut, AUTHOR="R. Schehrer", TITLE="On a Cut-Off Priority Delay-Loss System with Hysteresis", BOOKTITLE="1. deutsch-sowjetischen Seminar über Flow-Control", ADDRESS="Dortmund, Germany", DAYS=20, MONTH=sep, YEAR=1987, KEYWORDS="Control; overload control", } @UNPUBLISHED{Boye8710:Performance, AUTHOR="P. Boyer and J. Boyer and Gérard Hebuterne and Jean Raymond Louvion and L. Romoeuf", TITLE="Performance Evaluation of an {ATD} Broadband Network", NOTE="Centre National d'Etudes des Télécommunications, Lannion, France", MONTH=oct, YEAR=1987, KEYWORDS="fast packet switches", ANNOTE="uses $Geo/D/1/K$ model", } @ARTICLE{Gong8710:Smoothed, AUTHOR="Wei-Bo Gong and Yu-Chi Ho", TITLE="Smoothed (Conditional) Perturbation Analysis of Discrete Event Systems", JOURNAL=ieeeac, VOLUME="AC-32", NUMBER=10, PAGES="858-866", MONTH=oct, YEAR=1987, KEYWORDS="perturbation analysis; smoothed perturbation analysis", } @ARTICLE{ORei8710:Data, AUTHOR="Peter O'Reilly and Sayeed Ghani", TITLE="Data Performance in Burst Switching When the Voice Silence Periods Have a Hyperexponential Distribution", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=10, PAGES="1109-1112", MONTH=oct, YEAR=1987, KEYWORDS="packet voice; burst switching", } @ARTICLE{Yeh8710:Knockout, AUTHOR="Y.-S. Yeh and M. G. Hluchyj and A. S. Acampora", TITLE="The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1274-1282", NOTE="also ISS 1987 (pp. 801--808)", MONTH=oct, YEAR=1987, KEYWORDS="fast packet switching; ATM; switching block; analysis", ANNOTE="A new high-performance packet-switching architecture, called the Knockout Switch, is proposed. The Knockout Switch uses a fully interconnected switch fabric topology so that no switch blockingoccurs where packets destined for one output interfere with pac-kets going to different outputs. Its architecture has low latency, and is self-routing and nonblocking.", } @INPROCEEDINGS{Karl8710:Sub, AUTHOR="G. Karlsson and M. Vetterli", TITLE="Sub-band coding of video signals for packet-switched networks", BOOKTITLE="Visual Communications and Image Processing II", EDITOR="To R. Hsing", ORGANIZATION="spie", ADDRESS="Cambridge, Massachusetts", VOLUME=845, PAGES="446-456", MONTH=oct, YEAR=1987, KEYWORDS="packet video; subband coding; video coding; layered coding", ABSTRACT="Sub-band coding has been investigated for the novel application of video transmission over packet-switched networks. The scheme, which divides the input signal into frequency bands in all three dimensions, seems promising in that it lends itself to parallel implementation, it is robust enough to handle errors due to lost packets, and it yields high compression with sustained good quality. Moreover, it may be well integrated with the network to handle issues like flow-control and error-handling. The article presents the underlying design goals together with a software implementation and associated results.", } @INPROCEEDINGS{Sen8710:Queueing, AUTHOR="P. K. Sen and Nasser Rikli and B. Maglaris", TITLE="Queueing analysis for packet switched video", BOOKTITLE="Visual Communications and Image Processing II", EDITOR="To R. Hsing", ORGANIZATION="spie", ADDRESS="Cambridge, Massachusetts", VOLUME=845, PAGES="440-445", MONTH=oct, YEAR=1987, KEYWORDS="packet video; source modeling; multiplexer", ABSTRACT="Packet switching for variable bit-rate real-time video sources is a means for the efficient sharing of communication resources, while maintaining a uniform picture quality. Performance analyses for the statistical multiplexing of such video sources are required as a first step towards assessing the feasibility of packet switched video. This paper extends our earlier work in modelling video sources which have been coded using interframe coding schemes, and in carrying out buffer queueing analyses for the multiplexing of several such sources. Our previous models and analysis were suitable for relatively uniform activity scenes. Here we consider models and queueing analysis for more realistic scenes with multiple activity levels where the coder output bit-rates may change violently. We present correlated Markov source models for the corresponding sources, and using a flow-equivalent queueing analysis, obtain common buffer queue distributions and probabilities of packet loss. Our results demonstrate efficient sharing of packetized video on a single link, due to the smoothing effect of multiplexing several variable-rate video sources.", } @ARTICLE{Hui8710:Broadband, AUTHOR="Joseph Hui and E. Arthurs", TITLE="A broadband packet switch for integrated transport", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1264-1273", MONTH=oct, YEAR=1987, KEYWORDS="fast packet switching", ABSTRACT="This paper gives a broadband (total throughput approaching 1 terabit/s) self-routing packet switch design for providing flexible multiple bit-rate broadband services for an end-to-end fiber network. The switch fabric for the slotted broadband packet switch delivers exactly one packet to each output port from one of the input ports which request packet delivery to that output port. The denied requests would try again during the next slot. We discover an effective scheme, implemented by CMOS VLSI with manageable complexity, for performing this function. First, each input port send a request for a port destination through a Batcher sorting network, wbich sorts the request destinations In ascending order so that we may easily purge all but one request for the same destination. The winning request acknowledges its originating port from the output of the Batcher network, with the acknowledgement routed through a Batcher-banyan self-routing switch. The acknowledged input port then sends the full packet through the same Batcher-banyan switch without any conflict. Unacknowledged ports buffer the blocked packet for reentry in the next cycle. We also give several variations for significantly improved performance. We then study switch performance based an some rudimentary protocols for traffic control. For the basic scheme, we analyze tbe throughput-delay characteristics for random traffic, modeled by output port requests and a binomial distribution of packet arrival. We demonstrate with a buffer size of around 20 packets, we can achieve a 50 percent loading with almost no buffer overflow. Maximum througput of switch is 50 percent. Next, we investigate the performance of the switch in the presence of periodic broadband traffic. We then apply circuit switching techniques and packet priority for high bit-rate services in our packet switch environment. We improve the throughput per port to close to 100 percent by means of parallel switch fabric, while maintaining tbe periodic nature of the traffic.", } @ARTICLE{Kate8710:Fast, AUTHOR="M. Katevenis", TITLE="Fast switching and fair control of congested flow in broadband networks", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1315-1326", MONTH=oct, YEAR=1987, KEYWORDS="congestion control; fast packet switching; round-robin scheduling; hardware implementation", ABSTRACT="A new switching architecture is proposed based on the tradeoffs of modern VLSI technology -- inexpensive memory and 2-dimensional layout structures. Today, it is economically feasible to preallocate buffer space individually to each virtual circuit in every node, so that ``congestion'' ceases to have negative effects. On the contrary, when some low-priority circuits offer more traffic than the network can carry, full utilization of the link bandwidth is achieved. In this context, the allocation of bandwidth can be done automatically and in a ``fair'' way, if packets are multiplexed by circularly scanning all virtual circuits and transmitting one packet from each ``ready'' circuit. This multiplexing algorithm equally distributes all the available bandwidth to all the VCs that can use it (other than equal distribution is also possible), while it also guarantees an upper bound for the total packet delay through non-congested VC's (VC's that use less than their share of BW). We present methods for hardware implementation of such fast circular scans, and propose a structure for the switching nodes of such networks, consisting of a cross-bar arrangement like a systolic array that performs merge sorting. It is ideally suited for physical laout on printed circuit boards or with wafer-scale integration.", ANNOTE="round-robin (circular scan) scheduling within priority class, with fixed cell sizes", } @ARTICLE{Ichi8710:High, AUTHOR="H. Ichikawa and M. Aoki and T. Uchiyama", TITLE="High-speed packet switching systems for multimedia communications", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1336-1345", MONTH=oct, YEAR=1987, KEYWORDS="fast packet switching; network architecture", ABSTRACT="High-speed packet switching (HPS) systems can provide flexible, economical, high-quality services for integrated voice, video, and data communications. To realize such HPS systems, methods have been developed to bring about high-speed protocol processing as well as a system architecture for facilitating high-throughput switching. Adopting the paraflel processing algorithm into protocol processing allows us to achieve higb-speed packet protocol processing of about 100 times faster than conventional processing. Furthermore, a fully distributed system architecture in addition to hierarchical interconnection networks can achieve high-upecity packet switching'systems. The proposed HPS system is thus capable of accommodating lines of up to 10-50 Mbits/s, of providing high-throughput switching capability of 1 000 000 Packets/s, and of having an average delay of lessthan 2 ms. Furthermore, an evaluation of network delay performances of video conferencing and voice communications indicate that HPS systems are quite suitable for handling such multimedia communications.", } @ARTICLE{Irvi87:Transmission, AUTHOR="D. R. Irvin", TITLE="An Introduction to the Transmission Performance Capabilities of {IEEE} 802.5 Token-Ring Networks", JOURNAL=ccr, VOLUME=17, NUMBER=4, PAGES="25-34", MONTH=oct, YEAR=1987, REFERENCES=5, KEYWORDS="Token ring; transmission; performance evaluation; workload", ANNOTE="Transmission performance capabilities of 802.5 token-ring networks are explored from the perspective of a network designer. Typical workloads are presented. Several reference networks are presented. The performance of these networks is projected.", } @ARTICLE{Tiwa8710:Lower, AUTHOR="P. Tiwari", TITLE="Lower Bounds on Communication Complexity in Distributed Computer Networks", JOURNAL=jacm, VOLUME=34, NUMBER=4, PAGES="921-938", MONTH=oct, YEAR=1987, } @ARTICLE{Jian8710:New, AUTHOR="Z. H. Jiang", TITLE="New approximation method for inverse Laplace transforms using block-pulse functions", JOURNAL="International Journal of System Science", VOLUME=18, NUMBER=10, PAGES="1873-1888", MONTH=oct, YEAR=1987, KEYWORDS="Laplace transform; inversion; numerical methods", ABSTRACT="A new recursive approach for solving the 1D and 2D inverse Laplace transform problem of rational transfer functions via block-pulse functions is presented. It is shown that the piecewise constant approximations can be calculated recursively from a corresponding difference equation. This approach is thus straightforward, rather simple and suitable for computer programming. Additionally, the calculation size is small. These advantages are valuable, especially when the number of subintervals for block-pulse functions has to be large in order to obtain a satisfactory result, as shown by illustrative examples. By a parallel derivation, similar to the 1D and 2D cases, this approach is also easy to extend to multi-dimensional problems.", } @ARTICLE{Noji8710:Integrated, AUTHOR="S. Nojima and E. Tsutsui and H. Fukuda and M. Hashimoto", TITLE="Integrated services packet network using bus matrix switch", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=8, PAGES="1284-1291", MONTH=oct, YEAR=1987, REFERENCES=8, KEYWORDS="Packet switching; switching system; architecture", ANNOTE="For several years, Fujitsu has been researching and developing high-speed packet switching networks, the result being an integrated multimedia information networks architecture. This archi-tecture has already been applied to LAN systems and can now be applied to wide area corporate networks thanks to the new developments described in this paper. The most important technology - the bus matrix switch - provides a quantum leap in processing", } @TECHREPORT{Souz8710:Calculating, AUTHOR="E. de Souza and S. S. Lavenberg", TITLE="Calculating Joint Queue Length Distributions in Product Form Queueing Networks", TYPE="Research Report", INSTITUTION="IBM", ADDRESS="Yorktown Heights, New York", NUMBER="RC-13235", PAGES="1-26", MONTH=oct, YEAR=1987, KEYWORDS="Queueing network; product form; analysis", } @INPROCEEDINGS{Call8710:CLAM, AUTHOR="L. Call and others", TITLE="{CLAM} - An Open System for Graphical User Interfaces", BOOKTITLE="OOPSLA", MONTH=oct, YEAR=1987, } @TECHREPORT{Cohe8710:Trip, AUTHOR="Danny Cohen", TITLE="Trip Report: A Visit to Planet Earth", INSTITUTION="10th Data Communications Symposium", ADDRESS="Nappa Valley, CA", MONTH=oct, YEAR=1987, } @TECHREPORT{Haas8710:Blazenet, AUTHOR="Z. Haas and D. R. Cheriton", TITLE="Blazenet: A Photonic Implementable Wide-Area Network", INSTITUTION="Dept. of Computer Science, Stanford University", ADDRESS="Stanford, CA", NUMBER="STAN-CS-87-1185", NOTE="Also numbered CSL-TR-87-346", MONTH=oct, YEAR=1987, } @INPROCEEDINGS{Rash8710:Machine, AUTHOR="Richard F. Rashid and others", TITLE="Machine-Independent Virtual Memory Management for Paged Uniprocessor and Multiprocessor Architectures", BOOKTITLE=asplos, PAGES="31-41", MONTH=oct, YEAR=1987, } @INPROCEEDINGS{Borr8710:Special, AUTHOR="Gaetano Borriello and Andrew Cherenson and Peter Danzig and Michael Nelson", TITLE="Special or General-Purpose Hardware for Prolog: A Case Study", BOOKTITLE=asplos, PAGES="136-145", MONTH=oct, YEAR=1987, } @ARTICLE{Bloc8710:Weighted, AUTHOR="Joshua J. Bloch and D. Daniels and A. Z. Spector", TITLE="A Weighted Voting Algorithm for Replicated Directories", JOURNAL=jacm, VOLUME=34, NUMBER=4, PAGES="859-909", MONTH=oct, YEAR=1987, } @TECHREPORT{Schi8710:Finding, AUTHOR="M. Schimmler and H. Schröder", TITLE="Finding All Cut-Points on the Instruction Systolic Array", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-04", MONTH=oct, YEAR=1987, } @TECHREPORT{Boye8710:Modeles, AUTHOR="P. Boyer and A. Gravey and Jean Raymond Louvion", TITLE="Modeles de Files D'Attente Pour un {RNIS} Large Bande", TYPE="Note Technique", INSTITUTION="CNET, Lannion", ADDRESS="Lannion, France", NUMBER="NT/LAA/SLC/228", PAGES=63, MONTH=oct, YEAR=1987, LANGUAGE="French", KEYWORDS="discrete time queue", } @ARTICLE{Ster8710:Mathematical, AUTHOR="L. Sterling", TITLE="Mathematical Reasoning - A Prolog Program Uses Heuristic Methods to Solve Equations", JOURNAL=byte, PAGES="177-180", MONTH=oct, YEAR=1987, KEYWORDS="Prolog", } @ARTICLE{Huff8710:Glue, AUTHOR="A. J. Huffman", TITLE="E-mail--the ''glue'' to Office Automation", JOURNAL=ieeenet, VOLUME=1, NUMBER=4, PAGES="4-10", MONTH=oct, YEAR=1987, REFERENCES=3, ABSTRACT="The key to automating the office lies not in the standardization of hardware and software from one particular vendor, but in providing useful connectivity of all information processing devices in the office. This connectivity can be achieved through the implementation of a carefully designed electronic mail (e-mail) system that interfaces with a wide variety of hardware, software and networking components. This paper presents some criteria which can be used to evaluate and select such an e-mail system to best suit the communication needs of your office. Network design guidelines for implementing this e-mail system at minimal cost are then presented. Finally, in order to illustrate the concepts and issues presented, the AT\&T Private Message Exchange is examined in detail.", } @ARTICLE{Solm8710:Public, AUTHOR="J. V. Solman", TITLE="Design of a Public Electronic Mail System", JOURNAL=ieeenet, VOLUME=1, NUMBER=4, PAGES="11-15", MONTH=oct, YEAR=1987, ABSTRACT="The initial design and subsequent evolution of an electronic mail system is influenced strongly by the environment in which it operates. An electronic mail system used by a common carrier to provide commercial service is subject to constraints and influences which shape its evolution. This article reviews some of these influences and shows how they can affect the development of such a system. Enhancements to an electronic mail system can be broadly summarized into four categories--new features, such as bilingual operation; enhanced reach to non-users and interconnection with other systems; new applications, such as EDI support; and extensive customer support capabilities. A public, network-based electronic mail system, with more than 60,000 users, is used to illustrate the influences described.", } @ARTICLE{Hutc8710:Electronic, AUTHOR="G. Hutchison and C. L. Desmond", TITLE="Electronic Data Interchange", JOURNAL=ieeenet, VOLUME=1, NUMBER=4, PAGES="16-20", MONTH=oct, YEAR=1987, } @ARTICLE{Russ8710:Integration, AUTHOR="T. V. Russotto", TITLE="The Integration of Voice and Data Communication", JOURNAL=ieeenet, VOLUME=1, NUMBER=4, PAGES="21-29", MONTH=oct, YEAR=1987, REFERENCES=21, } @ARTICLE{Duff8710:Effects, AUTHOR="J. Duffy and M. Andreychuk", TITLE="The Effects of Office Automation", JOURNAL=ieeenet, VOLUME=1, NUMBER=4, PAGES="30-34", MONTH=oct, YEAR=1987, } @INPROCEEDINGS{Eich8710:MARS, AUTHOR="M. H. Eich", TITLE="{MARS:} The Design of a Main Memory Database Machine", BOOKTITLE="International Workshop on Database Machines", MONTH=oct, YEAR=1987, } @INPROCEEDINGS{Drie8711:Buffer, AUTHOR="Mark Driedger", TITLE="Buffer control in variable-rate speech coding", BOOKTITLE="IEEE MONTECH Conference on Communications", ORGANIZATION="IEEE", ADDRESS="Montreal, Quebec, Canada", PAGES="195-202", MONTH=nov, YEAR=1987, KEYWORDS="packet voice", ABSTRACT="When variable-rate coding is used to improve channel utilization and enhance the flexibility of a speech transmission system, is a need to buffer the data at the channel interface. In doing so the possibility of buffer overflow and underflow must be considered. Here, a means of providing buffer control with practical ADPCM speech coding methods is investigated. A buffer-controlled coder is simulated with real speech data. Very good buffer control is achieved with a minor influence on the measured and subjective quality of the reconstructed signal. The buffer-controlled coder is also tolerant to small variations in the rate at which data is extracted from the buffer (the channel rate).", } @INPROCEEDINGS{Ilia8711:Generalization, AUTHOR="I. Iliadis and Y. C. Lien", TITLE="A Generalization of Scheduling Policies to Control Resequencing Delay", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Tokyo, Japan", PAGES="222-226", MONTH=nov, YEAR=1987, KEYWORDS="queueing theory", ABSTRACT="Certain scheduling disciplines for analyzing resequencing delay are generalized to a family of policies called fixed position policies (FPPs). The characteristic of these policies is that the resequencing event depends on how the aggregated arrival-departure process evolves time. A novel analytical approach, based on an imbedded Markov chain model, is developed to analyze FPPs. The expected resequencing delays associated with the different policies are dervied in closed-form. For a given threshold, the FPP that minimizes the resequencing delay is obtained based on a simple selection rule. Also, numerical results are presented to demonstrate the existence of an optimal FFP that minimizes the total delay.", } @INPROCEEDINGS{Mats8711:Packet, AUTHOR="Naoki Matsuo and Mitsuhiro Yuito and Yukio Tokunaga", TITLE="Packet Interleaving for Reducing Speech Quality Degradation in Packet Voice Communications", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Tokyo, Japan", PAGES="1787-1791", MONTH=nov, YEAR=1987, KEYWORDS="packet voice; packet loss; packet audio; loss concealment; interleaving; scrambling", ANNOTE="64 kBit $\mu$-law PCM; for $N$-interleaving, pack samples 1, $1+N$, $1+2N$, \ldots in one packet; replace missing samples with previous samples or mean value of adjacent samples; mean value substitution with $N=2$ performs best, with MOS of 3.5 and 3 at 1\% and 5\% loss.", } @INPROCEEDINGS{DeMo8711:Message, AUTHOR="L. F. Moraes", TITLE="Message delay analysis for a {TDMA} scheme operating under a preemptive priority discipline", BOOKTITLE=globecom, ADDRESS="Tokyo, Japan", PAGES="2119-2123", MONTH=nov, YEAR=1987, KEYWORDS="discrete time queue", ABSTRACT="A time-division multiple-access scheme operating under a preemptive message-based priority discipline is considered and analyzed. The system is general, so that an arbitrary number of slots can be allocated to different stations on a uniformly (equally) spaced basis in each frame. Under the assumptions of a Poisson message arrival stream and random message lengths governed by a general distribution, it is shown how the Laplace-Stieltjes transform of the actual message waiting-time and delay distributions can easily be obtained for each priority clas at each of the network stations. Using these results, e plicit formulas for any moment of the message delay for any priority clas can be obtained. In particular, expressions for the first two moments of the message waiting-time and for the average delay of class-$k$ messages are derived.", } @ARTICLE{Sasa8711:Optimal, AUTHOR="Galen Sasaki and B. Hajek", TITLE="Optimal Dynamic Routing in Single Commodity Networks by Iterative Methods", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=11, PAGES="1199-1206", MONTH=nov, YEAR=1987, KEYWORDS="routing", } @INPROCEEDINGS{Wata8711:Error, AUTHOR="Nayoa Watanabe and T. Suda", TITLE="Evaluation of Error Recovery Protocols in High-Speed Packet Switched Networks", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Tokyo, Japan", PAGES="1792-1796 (45.5)", MONTH=nov, YEAR=1987, ANNOTE="Congestion control. Edge error recovery compared to link recovery.", } @INPROCEEDINGS{Yin8711:Congestion, AUTHOR="Nanying Yin and Song Li and T. E. Stern", TITLE="Congestion Control for Packet Voice by Selective Packet Discarding", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Tokyo", PAGES="1782-1786", MONTH=nov, YEAR=1987, KEYWORDS="packet voice; multiplexer; TASI", ABSTRACT="A family of congestion control schemes is proposed to reduce the time delays as well as multiplexer memory requirements in packet voice systems. They are all based on selectively discarding packets, the loss of which will produce the least degradation in quality of the reconstructed voice signal. A mathematical model of the system is analyzed, and queue length distributions are derived. These are used to compute performance measures, including mean waiting time and fractional packet loss. Performance curves for some typical systems are presented, and it is shown that the control procedures can achieve significant performance improvement over uncontrolled systems. The performance improvements are confirmed by informal subjective testing.", ANNOTE="single-stage packet mux; standard TASI on-off model; talkers as birth-death process", } @INPROCEEDINGS{Swin8711:Telephone, AUTHOR="Daniel C. Swinehart", TITLE="Telephone Management in the Etherphone System", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Tokyo, Japan", PAGES="1176-1180", MONTH=nov, YEAR=1987, KEYWORDS="packet voice; Etherphones; telephones; recorded voice; voice system architecture; workstation telephone management; multimedia conferencing; collaborative work", ABSTRACT="Several examples illustrate telephone management features that exist or are planned for the Etherphone system, which is an experimental environment that augments an existing electronic office system with methods for transmitting, storing, and manipulating digital voice. Some Etherphone capabilities are available from any telephone, while more sophisticated functions are obtained through applications running in an associated workstation. Knowledge of the user's identity and preferences form the basis for features not usually available in telephone systems. --- Etherphones have been designed to support the ready implementation of additional applications. Most enhanced telephone options and other voice services can be entirely implemented in the workstation environment. Those that prove particularly useful may migrate to a server in order to extend their availability to stand-alone telephones and to a wide range of operating system environments and workstation types.", } @INPROCEEDINGS{Bowk8711:Speech, AUTHOR="D. O. Bowker and C. A. Dvorak", TITLE="Speech transmission quality of wideband packet technology", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Tokyo, Japan", VOLUME=3, PAGES="1887-1889 (47.7)", MONTH=nov, YEAR=1987, KEYWORDS="packet voice; speech transmission; speech quality", ABSTRACT="In order to explore the need for logically provided, integrated voice/data networks with ``bandwidth-on-demand'' features, AT\\&T has explored the capabilities of wideband packet technology (WPT). In WPT, speech signals can be processed by a variety of techniques for maximum flexibility; regular 64 kbps PCM, or low bit rate (32 kbps or less) speech coding can be used. In addition, when further voice compression is desirable, silence removal is done so that packets are only transmitted during talkspurts. Under loaded network conditions, different strategies may be used to handle packet buffer overflow, including packet dropping and/or dynamic bit rate reduction. This paper presents speech quality rating data for voice signals transmitted through WPT. The data demonstrate that packetized voice communication is feasible and that the resulting speech quality can be just as good as that achievable with circuit-switched connections. For customer applications requiring digital circuit multiplication, WPT can deliver good quality voice with substantial increases in the number of voice trunks that may be carried on a digital transmission facility.", } @INPROCEEDINGS{Magl8711:Statistical, AUTHOR="B. Maglaris and Dimitris Anastassiou and P. K. Sen and G. Karlsson and J. D. Robbins", TITLE="Performance analysis of statistical multiplexing for packet video sources", BOOKTITLE=globecom, ORGANIZATION="IEEE", ADDRESS="Tokyo, Japan", PAGES="1890-1899 (47.8)", MONTH=nov, YEAR=1987, KEYWORDS="packet video; source models; multiplexer; performance evaluation", ABSTRACT="Statistical or Asynchronous Time Division multiplexing of variable bit-rate moving image sources is a first step toward packetized video networks. Its goal is to efficiently ulize a common communications channel, while maintaing uniform picture quality at the receiver. In this paper we present a queueing model of such schemes, and use it to assess its probabilistic behavior. First, we analyze the coding bit-rate of a single video source as a function of time based on experimental data of a video-telephone scene. Various statistical quantities are derived from bit-rate data collected with a conditional replenishment inter-frame coding scheme. A correlated continuous time Markov process is shown to fit the experimental data, and it is used to model the input rates of several independent sources into a statistical multiplexer. The distribution of the common buffer length is subsequently obtained via a flow-equivalent approximate queueing analysis. The analysis is validated with computer simulations. Numerical results are presented with parameters the number of video sources into the multiplexer and the overall channel utilization. Our analysis demonstrates the statistical smoothing effect of packetized video in a single link. Its performance, in terms of the probability of buffering or delaying beyond a certain limit, is shown to improve dramatically as the number of multiplexed sources increases beyond one.", } @MISC{ANSI8711:Accredited, AUTHOR="A. Si", TITLE="Accredited Standards Committee X3S3.3---Information Processing Systems---Data Communications---Intermediate System to Intermediate System Intra-Domain Routing Exchange Protocol", NOTE="X3S3.3/87-150R", MONTH=nov, YEAR=1987, } @TECHREPORT{Call8711:Comparison, AUTHOR="R. Callon", TITLE="A Comparison of ``Link State'' and ``Distance Vector'' Routing Algorithms", INSTITUTION="SRI-NIC", NUMBER="IDEA 0002-00", MONTH=nov, YEAR=1987, KEYWORDS="routing; link state; distance vector", } @INPROCEEDINGS{Birm8711:Exploiting, AUTHOR="K. Birman and T. A. Joseph", TITLE="Exploiting virtual synchrony in distributed systems", BOOKTITLE="11th ACM Symposium on Operating System Principles", PUBLISHER="ACM", ADDRESS="Austin, Texas", PAGES="123-138", MONTH=nov, YEAR=1987, } @INPROCEEDINGS{Dias8711:Multistage, AUTHOR="Daniel M. Dias and M. Kumar and Y. C. Lien", TITLE="Design and analysis of a multistage voice-data switch", BOOKTITLE=globecom, ADDRESS="Tokyo", PAGES="1856-1860", MONTH=nov, YEAR=1987, REFERENCES=8, KEYWORDS="Multistage interconnection network; design; analysis; performance evaluation; fast packet switching; switching network; omega network; shuffle exchange; self routing", ANNOTE="A method for switching integrated voice and data on Multistage Interconnection Networks (MINs) is presented. The MIN is operated in a slotted frame fashion. In each slot, a switch port can make an attempt to transmit a packet through the switch. When two packets contend in the switch, a selection is made based on packet priorities. By giving higher priority to established voice circuits, the protocol ensures that voice packets are", } @INPROCEEDINGS{Fuhr8711:Inequalities, AUTHOR="S. W. Fuhrmann", TITLE="Inequalities for cyclic service systems with limited service disciplines", BOOKTITLE=globecom, ADDRESS="Tokyo", VOLUME=1, PAGES="1-5 (paper 1)", MONTH=nov, YEAR=1987, KEYWORDS="Queueing system; cyclic service; analysis", } @ARTICLE{Falc8711:Programmable, AUTHOR="J. R. Falcone", TITLE="A Programmable Interface Language for Heterogeneous Distributed Systems", JOURNAL=tocs, VOLUME=5, NUMBER=4, PAGES="330-351", MONTH=nov, YEAR=1987, } @MISC{Corp8711:Applied, AUTHOR="Nynex Corporation", TITLE="Applied Research, Joint {MIT/NYNEX} Program", MONTH=nov, YEAR=1987, } @INPROCEEDINGS{Varg8711:Hashed, AUTHOR="George Varghese and T. Lauck", TITLE="Hashed and Hierarchical Timing Wheels: Data Structures for the Efficient Implementation of a Timer Facility", BOOKTITLE="11th ACM Symposium on Operating Systems Principles", ORGANIZATION="acmosrev", ADDRESS="Austin, TX", MONTH=nov, YEAR=1987, } @INPROCEEDINGS{Acam8711:Multichannel, AUTHOR="A. S. Acampora", TITLE="A Multichannel Multihop Local Lightwave Network", BOOKTITLE=globecom, ADDRESS="Tokyo, Japan", PAGES="37.5.1-37.5.9", MONTH=nov, YEAR=1987, } @INPROCEEDINGS{Kana8711:ATM, AUTHOR="T. Kanada and K. Sato and T. Tsuboi", TITLE="An {ATM} Based Transport Network Architecture", BOOKTITLE="IEEE COMSOC Workshop", ADDRESS="Osaka", PAGES="2-2", MONTH=nov, YEAR=1987, } @ARTICLE{Mogu8711:Packet, AUTHOR="J. C. Mogul and Richard F. Rashid and M. J. Accetta", TITLE="The Packet Filter: An Efficient Mechanism for User-level Network Code", JOURNAL=acmosrev, VOLUME=21, MONTH=nov, YEAR=1987, } @TECHREPORT{Pana8711:Computations, AUTHOR="Prakash Panangaden and Eugene W. Stark", TITLE="Computations, Residuals, and the Power of Indeterminacy", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR87-883", PAGES=29, MONTH=nov, YEAR=1987, ABSTRACT="We investigate the power of Kahn-style dataflow networks, with processes that may exhibit indeterminate behavior. Our main result is a theorem about networks of ``monotone'' processes, which shows: (1) that the input/output relation of such a network is a total and monotone relation; and (2) every relation that is total, monotone, and continuous in a certain sense, is the input/output relation of such a network. Now, the class of monotone networks includes networks that compute arbitrary continuous input/output functions, an ``angelic merge'' network, and an ``infinity-fair merge'' network that exhibits countably indeterminate branching. Since the ``fair merge'' relation is neither monotone nor continuous, a corollary of our main result is the impossibility of implementing fair merge in terms of continuous functions, angelic merge, and infinity-fair merge. Our results are established by applying the powerful technique of ``residuals'' to the computations of a network. Residuals, which have previously been used to investigate optimal reduction strategies for the $\lambda$-calculus, have recently been demonstrated by one of the authors (Stark) also to be of use in reasoning about concurrent systems. Here, we define the general notion of a ``residual operation'' on an automaton, and show how residual operations defined on the components of a network induce a certain preorder $\extend$ on the set of computations of the network. For networks of ``monotone port automata,'' we show that the ``fair'' computations coincide with $\extend$-maximal computations. Our results follow from this extremely convenient property.", } @INPROCEEDINGS{Birr8711:Simple, AUTHOR="A. D. Birrell and Mel R. Jones and E. Wobber", TITLE="A Simple and Efficient Implementation for Small Databases", BOOKTITLE=sosp, PAGES="149-154", MONTH=nov, YEAR=1987, } @TECHREPORT{Fuji8711:Measurements, AUTHOR="R. M. Fujimoto", TITLE="Performance Measurements of Distributed Simulation Strategies", INSTITUTION="Computer Science Department, University of Utah", ADDRESS="Salt Lake City, UT 84112", NUMBER="UUCS-87-026a", MONTH=nov, YEAR=1987, } @PHDTHESIS{Hill8711:Aspects, AUTHOR="M. D. Hill", TITLE="Aspects of Cache Memory and Instruction Buffer Performance", SCHOOL="University of California Berkeley", NUMBER="UCB/CSD 87/381", MONTH=nov, YEAR=1987, } @INPROCEEDINGS{Fris8711:Searching, AUTHOR="Mark E. Frisse", TITLE="Searching for information in a hypertext medical handbook", BOOKTITLE="Hypertext Proceedings", ORGANIZATION="ACM", ADDRESS="Chapel Hill, North Carolina", PAGES="57-66", MONTH=nov, YEAR=1987, } @INPROCEEDINGS{Jeff8711:Distributed, AUTHOR="David Jefferson and others", TITLE="Distributed Simulation and the Time Warp Operating System", BOOKTITLE=sosp, ADDRESS="Austin, Texas", PAGES="77-93", MONTH=nov, YEAR=1987, } @INPROCEEDINGS{Jeff8711:Time, AUTHOR="David Jefferson and Brian Beckman and Fred Wieland and L. Blume and M. DiLoreto and P. Hontalas and P. Laroche and K. Sturdevant", TITLE="Time Warp Operating System", BOOKTITLE=sosp, PAGES="77-93", MONTH=nov, YEAR=1987, KEYWORDS="TimeWarp", ABSTRACT="Discrete event simulation with optimistic concurrency control.", } @INPROCEEDINGS{Kawa8711:Aspects, AUTHOR="K. Kawashima", TITLE="Some Aspects of Traffic Engineering for Network Design and Planning in {ISDN}", BOOKTITLE=globecom, ADDRESS="Tokyo, Japan", PAGES="14.3.1-5", MONTH=nov, YEAR=1987, KEYWORDS="ISDN; network planning", } @INPROCEEDINGS{Labe8711:Modelling, AUTHOR="J. Labetoulle", TITLE="Modelling and Traffic Engineering in the Access and Switching Part of the {ISDN}", BOOKTITLE=globecom, ADDRESS="Tokyo, Japan", PAGES="14.6.1-5", MONTH=nov, YEAR=1987, KEYWORDS="Traffic engineering", } @TECHREPORT{Ofek8711:Passive, AUTHOR="Y. Ofek", TITLE="Passive Optical Star as a Building Block of a Distributed System", TYPE="Research Report", INSTITUTION="IBM", NUMBER=13247, MONTH=nov, YEAR=1987, ABSTRACT="The objective of this report is to propose and justify a new architecture for a metropolitan area network. The basic building block of this system is a passive optical star, which operates with a bandwidth of more than one gigabit/second. The system is completely distributed with a protocol for periodic exchange of state information among nodes. Based on this state information algorithms for access control and synchronization algorithm are implemented. A new coding scheme, the conservative code, for bit synchronization is presented and analyzed. The code is characterized by having predefined number of transitions in every codeword, with a known delimiting transition at the end of each codeword. As a result, it is possible to decode the incoming bit-stream without explicitly recovering the receiving clock with a phase-locked loop. Thus, it is possible to receive messages from asynchronous sources without any training period. The architecture is compared with the dual ring topology and the active star network. It is shown that the proposed architecture has advantages both in performance and reliability. Further, this architecture is shown to exploit unique properties of the fiber optic communication-the ability to construct very large passive network with a very high bandwidth. Using the passive star it is possible to implement a larger network, by enabling the nodes access more than one optical star. In this way a network of thousands nodes can be constructed, with aggregate bandwidth of hundreds of gigabit/second. The extended network is called synchronous optical hypergraph, and a complete discussion of its properties is beyond the scope of this report.", } @TECHREPORT{Weir8711:Packet, AUTHOR="Donald A. Weir and William Walsh and Richard C. Slatter", TITLE="Packet switching system", TYPE="U.S. Patent", INSTITUTION="USPTO", NUMBER="4,707,831", MONTH=nov, YEAR=1987, KEYWORDS="packet audio; Internet telephony", ABSTRACT="A packet switching system has both speech and data transmitted as packets over virtual connections set-up in a digital network. The speech and data packets are transmitted at the bit rate of the transmission medium. The speech packets, which have to be handled in real-time, are given priority over the data packets, which are relatively long. Because the speech packets may be subjected to unacceptable delay if the medium is busy with a data packet when a speech packet is to be sent, the system provides that, if a speech packet arrives when a data packet is partly sent, the sending of the data packet is interrupted, the speech packet is sent, and the residue of the data packet is sent when the transmission medium is free of speech. This residue is provided with a new header and handled as if it is a new data packet.", URL="http://www.uspto.gov", } @INPROCEEDINGS{Bona8711:ISDN, AUTHOR="M. Bonatti", TITLE="{ISDN:} A New Challenge for Teletraffic Disciplines", BOOKTITLE=globecom, ADDRESS="Tokyo", PAGES="14.1.1-5", DAYS=15, MONTH=nov, YEAR=1987, KEYWORDS="ISDN; service integration; telephony", } @INPROCEEDINGS{Heff87:Traffic, AUTHOR="H. Heffes", TITLE="Performance Analysis, Traffic Engineering and Congestion Controls for {ISDN} Systems", BOOKTITLE=globecom, ADDRESS="Tokyo", PAGES="14.5.1-7", DAYS=15, MONTH=nov, YEAR=1987, KEYWORDS="Survey; Traffic Engineering; Congestion Control; Performance Evaluation; ISDN", } @INPROCEEDINGS{Pand8711:ITC, AUTHOR="R. N. Pandya", TITLE="{ITC} Seminar on Traffic Engineering for {ISDN} Design and Planning. Review of Session on network Aspects", BOOKTITLE=globecom, ADDRESS="Tokyo, Japan", PAGES="14.4.1-4", DAYS=15, MONTH=nov, YEAR=1987, KEYWORDS="Network planning; ISDN", } @INPROCEEDINGS{Soto8711:Recent, AUTHOR="O. Gonzalez Soto", TITLE="Recent Advances in Services Traffic Modelling and Evaluation", BOOKTITLE=globecom, ADDRESS="Tokyo, Japan", PAGES="14.2.1-5", DAYS=15, MONTH=nov, YEAR=1987, KEYWORDS="Traffic model", } @INPROCEEDINGS{Anan8712:Large, AUTHOR="V. Anantharam", TITLE="How Large Delays Build up in a {GI/G/1} Queue", BOOKTITLE=cdc, ORGANIZATION="IEEE", ADDRESS="Los Angeles, California", PAGES="1871-1872", MONTH=dec, YEAR=1987, KEYWORDS="queueing theory; GI/G/1", ANNOTE="Application to fast simulation of rare events", } @INPROCEEDINGS{Bacc8712:Queueing, AUTHOR="François Baccelli", TITLE="A Queueing Model of Timestamp Ordering in a Distributed System", BOOKTITLE="12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance)", EDITOR="P.-J. Courtois and G. Latouche", ORGANIZATION="IFIP", ADDRESS="Brussels, Belgium", PAGES="413-431", MONTH=dec, YEAR=1987, KEYWORDS="queueing theory", ABSTRACT="This paper is concerned with timestamp ordering mechanisms that are used for preserving the consistency of replicated data in distributed systems and more precisely with the impact of such an algorithm on the performance of a simplified model of a fully replicated database. The interaction of the three types of synchronization primitives that arise in this algorithm, namely ``fork'', ``join'' and ``resequencing'', is described in terms of a queueing network model. Analytical methods and stochastic ordering techniques are combined to provide computable upper bounds on the system response times. In the symmetrical case, it is established that the stability condition of this system is not affected by the consistency algorithm and that the mean time to update all data does not grow faster than the logarithm of the number of replicas.", } @INPROCEEDINGS{Brow8712:Perturbation, AUTHOR="P. Brown and A. Simonian", TITLE="Perturbation of a Periodic Flow in a Synchronous Server", BOOKTITLE="12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance)", EDITOR="P.-J. Courtois and G. Latouche", ORGANIZATION="IFIP", ADDRESS="Brussels, Belgium", PAGES="89-111", MONTH=dec, YEAR=1987, KEYWORDS="discrete time queue", ABSTRACT="The result of mixing traffic flows with different characteristics and different performance constraints is a central issue in the study of resource dimensioning for integrated networks. One aspect of this question is the problem of the superposition in transmission systems of a traffic with severe synchronicity constraints (as produced by applications involving high-quality sound or video) with asynchronous traffic. This paper considers in some detail the question of queue dimensioning for a synchronous transmission system dealing with one periodic flow mixed with random traffic. Disruptive effects on synchronicity are studied and given mathematically in terms of random traffic intensity.", } @INPROCEEDINGS{Coff8712:Two, AUTHOR="E. G. Coffman and G. Fayolle and I. Mitrani", TITLE="Two Queues with Alternating Service Periods", BOOKTITLE="12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance)", EDITOR="P.-J. Courtois and G. Latouche", ORGANIZATION="IFIP", ADDRESS="Brussels, Belgium", PAGES="227-239", MONTH=dec, YEAR=1987, KEYWORDS="queueing theory; packet voice; M/M/1", ABSTRACT="A mathematical model of multiplexed voice/data packet communication is analyzed. The multiplexor alternates service between voice and data traffic by a scheme which limits the time spent away from an active source. We define a Markov queueing model and derive a generating function for the steady-state distribution of the numbers of voice and data packets in the system. Evaluation of the unknown functions in the expression for the generating function is reduced to the solution of certain boundary value problems. The equations providing the solutions to these problems are presented.", ANNOTE="$M/M/1$ system with parameters $\lambda\_i$ and $\mu\_i$.", } @INPROCEEDINGS{Gun8712:Matrix, AUTHOR="Levent Gün and Armand M. Makowski", TITLE="Matrix-Geometric Solution for Finite Capacity Queues with Phase-Type Distributions", BOOKTITLE="12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance)", EDITOR="P.-J. Courtois and G. Latouche", ORGANIZATION="IFIP", ADDRESS="Brussels, Belgium", PAGES="269-282", MONTH=dec, YEAR=1987, KEYWORDS="queueing theory", ABSTRACT="This paper presents a class of quasi-birth-and-death processes with finite state space for which the invariant [steady state] probability vector is found to admit a matrix-geometric representation. The corresponding rate matrix is given explicitly in terms of the model parameters, and the resulting closed-form expression is proposed as a basis for efficient calculation of the invariant probability vector. The framework presented in this paper provides a unified approach to the study of several well-known queueing systems.", ANNOTE="Bounded queue length.", } @TECHREPORT{Heid8712:Sensitivity, AUTHOR="P. Heidelberger and Donald F. Towsley", TITLE="Sensitivity Analysis from Sample Paths Using Likelihoods", TYPE="Technical Report", INSTITUTION="Department of Computer and Information Science, University of Massachusetts", ADDRESS="Amherst, Massachusetts", NUMBER="87-131", MONTH=dec, YEAR=1987, KEYWORDS="perturbation analysis", } @INPROCEEDINGS{Ho8712:Perturbation, AUTHOR="Yu-Chi Ho", TITLE="Perturbation Analysis Explained", BOOKTITLE=cdc, EDITOR="John Baillieul", ORGANIZATION="IEEE", ADDRESS="Los Angeles, California", VOLUME=1, PAGES="243-246", MONTH=dec, YEAR=1987, KEYWORDS="perturbation analysis", } @INPROCEEDINGS{Jean8712:Load, AUTHOR="A. Jean-Marie", TITLE="Load Balancing in a System of Two Queues with Resequencing", BOOKTITLE="12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance)", EDITOR="P.-J. Courtois and G. Latouche", ORGANIZATION="IFIP", ADDRESS="Brussels, Belgium", PAGES="75-88", MONTH=dec, YEAR=1987, KEYWORDS="queueing theory; resequencing; routing; optimal control; queue control", ABSTRACT="This paper considers a system of two independent servers in parallel. The arriving customers can be directed to either of the two waiting lines. We suppose that there are several classes of customers, routing according to Bernoulli processes (with rates depending on class only), and that they have to be resequenced before leaving the system. We determine the routing probabilities that optimize the system sojourn time in the system (resequencing time included).", } @ARTICLE{Karo8712:Input, AUTHOR="Mark Karol and M. G. Hluchyj and Samuel P. Morgan", TITLE="Input versus Output Queueing on a Space-Division Packet Switch", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=12, PAGES="1347-1356", MONTH=dec, YEAR=1987, KEYWORDS="multiplexer; buffer policy; fast packet switch; input queueing; output queueing", } @ARTICLE{Shal87:Exact, AUTHOR="Michael S. Shalmon", TITLE="Exact Delay Analysis of Packet-Switching Concentrating Networks", JOURNAL=ieeecom, VOLUME="COM-35", NUMBER=12, PAGES="1265-1271", MONTH=dec, YEAR=1987, ANNOTE="Tandem queueing network with fixed-length packets and external batch Poisson arrivals at each node. Packets are served FCFS, with fixed and alternating priority for endogeneous arrivals", } @ARTICLE{Knap8712:Deadlock, AUTHOR="E. Knapp", TITLE="Deadlock Detection in Distributed Databases", JOURNAL=acmcs, VOLUME=19, NUMBER=4, PAGES="303-328", MONTH=dec, YEAR=1987, ABSTRACT="systems has undergone extensive study. An important application relates to distributed database schemes. A uniform model in which published algorithms can be cast is given, and the fundamental principles on which distributed deadlock detection schemes are based in presented. These principles represent mechanisms for developing distributed algorithms in general and deadlock detection schemes in particular. In addition, a hierarchy of deadlock models is presented; each model is characterized by the restrictions that are imposed upon the form resource requests can assume. The hierarchy includes the well-known models of resource and communication deadlock. Algorithms are classified according to both the underlying principles and the generality of resource requests they permit. A number of algorithms are discussed in detail, and their complexity in terms of the number of messages employed is compared. The point is made that correctness proofs for such algorithms using operational arguments are cumbersome and error prone, and therefore, that only completely formal proofs are sufficient for demonstrating correctness.", } @TECHREPORT{Sche8712:Pseudo, AUTHOR="G. Scheys", TITLE="A pseudo-polynomial algorithm for constrained shortest path problems", INSTITUTION="Philips research laboratory", ADDRESS="Brussels", NUMBER="M 220", PAGES=36, MONTH=dec, YEAR=1987, KEYWORDS="Routing algorithm; shortest path", } @INPROCEEDINGS{Shan8712:General, AUTHOR="J. G. Shanthikumar and D. Y. David", TITLE="General queuing networks: representation and stochastic monotonicity", BOOKTITLE="26th IEEE Conference on", VOLUME=2, PAGES="1084-1087", MONTH=dec, YEAR=1987, REFERENCES=14, KEYWORDS="Queueing network", ANNOTE="We consider a queueing network with a set of multi-server nodes. The arrival, service and routing process are characterized by arbitrary random sequences. Assume that these are independent of the state of the network. We develop a representation of this general model, relating certain stochastic processes of interest to the above random sequences through a system of equations.", } @TECHREPORT{Bers8712:Watchdogs, AUTHOR="B. N. Bershad and C. B. Pinkerton", TITLE="Watchdogs -- Extending the {UNIX} File System", INSTITUTION="Department of Computer Science, University of Washington", ADDRESS="Seattle, Washington 98195", NUMBER="87-12-06", MONTH=dec, YEAR=1987, } @ARTICLE{BuxW8712:Interconnection, AUTHOR="W. Bux and D. Grill and N. F. Maxemchuk", TITLE="Interconnection of Local Area Networks", JOURNAL=ieeejsac, VOLUME="SAC-5", NUMBER=9, PAGES="1377-1379", MONTH=dec, YEAR=1987, } @UNPUBLISHED{Gard8712:Type, AUTHOR="M. L. Gardner and others", TITLE="Type-of-Service Routing with Loadsharing", NOTE="BBN Communiations Corporation", MONTH=dec, YEAR=1987, } @TECHREPORT{Gomb8712:Model, AUTHOR="Gomberg87", TITLE="A Model of Inter-Administration Network User Authentication and Access Control", INSTITUTION="MITRE Corporation", ADDRESS="McLean, VA", NUMBER="MTR-87W00003", MONTH=dec, YEAR=1987, } @ARTICLE{Mill8712:Reading, AUTHOR="C. B. Mills and L. J. Weldon", TITLE="Reading Text from Computer Screens", JOURNAL=acmcs, VOLUME=19, NUMBER=4, PAGES="329-358", MONTH=dec, YEAR=1987, } @TECHREPORT{Neum8712:Adding, AUTHOR="C. Neuman and W. Yamamoto", TITLE="Adding Packet Radio to the Ultrix Kernel", INSTITUTION="Department of Computer Science, University of Washington", ADDRESS="Seattle, Washington 98195", NUMBER="87-12-07", MONTH=dec, YEAR=1987, ABSTRACT="This paper describes the results of a project in which the standard Amateur Packet Radio network link layer protocol, AX.25 (a modified version of X.25), was added to the Ultrix kernel. By implementing AX.25 under Ultrix, and by taking advantage of the IP implementations that already exist for PCs, it is possible for packet radio users with PCs to access IP-based services running on our server and on the Internet. A MicroVAX is being used as an IP gateway for an Amateur Packet Radio network that stretches from Seattle to Tacoma.", URL="ftp://ftp.cs.washington.edu/tr/PRE-1991/UW-CSE-87-12-07.PS.Z", } @ARTICLE{Padm8712:Dilated, AUTHOR="K. Padmanabhan and A. N. Netravali", TITLE="Dilated Networks for Photonic Switching", JOURNAL=ieeecom, VOLUME="Com-35", NUMBER=12, PAGES="1357-1365", MONTH=dec, YEAR=1987, } @TECHREPORT{Sani8712:RPC, AUTHOR="J. Sanislo and Mark S. Squillante", TITLE="An {RPC/LWP} Implementation for Interconnecting Heterogeneous Systems", INSTITUTION="Department of Computer Science, University of Washington", ADDRESS="Seattle, Washington 98195", NUMBER="87-12-08", MONTH=dec, YEAR=1987, } @INPROCEEDINGS{Lin8712:Imprecise, AUTHOR="Kuang-Shin Lin and Swaminathan Natarajan and Jia Liu", TITLE="Imprecise results: utilizing partial computations in real-time systems", BOOKTITLE="8th IEEE Real-Time Systems Symposium", ADDRESS="San Jose, California", PAGES="210-217", MONTH=dec, YEAR=1987, KEYWORDS="real-time system; operating systems; partial result", ABSTRACT="In real-time systems, a computation may not have enough time to complete its execution before its deadline. In such cases, only intermediate, and often imprecise, results will be available. To achieve the maximum resource utilization, it is desirable to use these results if possible. We propose two approaches which allow computations to return imprecise results. The milestone approach records intermediate results periodically and returns the latest set when a deadline is reached. The sieve approach skips certain predefined sections of code, thereby trading precision for time. This paper presents a general model of imprecise computation that takes into account the effects of the environment, and shows where our approach fits into the model. We also briefly describe the design of the Concord project that supports imprecise computations.", } @TECHREPORT{Marz8712:Supplying, AUTHOR="K. Marzullo and Frank B. Schmuck", TITLE="Supplying High Availability with a Standard Network File System", INSTITUTION="Cornell University, Computer Science Department", NUMBER="TR87-888", PAGES=16, MONTH=dec, YEAR=1987, ABSTRACT="This paper describes the design of a network file service that is tolerant to fail-stop failures and can be run on top of a standard network file service. The fault-tolerance is completely transparent, so the resulting file system can support the same set of heterogeneous workstations and applications as the chosen standard supports. To demonstrate that our design can provide the benefit of highly available files at a reasonable cost to the user, we implemented a prototype based on the Sun NFS protocol. Our approach is not limited to being used with NFS, however. The methodology we used should apply to any network file service built along the client-server model.", } @TECHREPORT{Brec8712:Abelian, AUTHOR="J. Breckling and M. Kastell and E. Valkema", TITLE="Abelian Group Languages: Algebraic and Machine Characterizations", INSTITUTION="Dept. of Computer Science, Australian National University", ADDRESS="Canberra 0200 ACT, Australia", NUMBER="TR-CS-87-05", MONTH=dec, YEAR=1987, } @INPROCEEDINGS{Harr8712:Multi, AUTHOR="R. J. Harris and M. H. Rossiter", TITLE="A Multi-Class, Multi-commodity Flow Model of a Fast Packet Switched Network", BOOKTITLE="2nd Australian Teletraffic Seminar", ADDRESS="Adelaide, Australia", PAGES=14, MONTH=dec, YEAR=1987, KEYWORDS="Atm", } @INPROCEEDINGS{Manf8712:Blocking, AUTHOR="David R. Manfield", TITLE="Blocking on Series Links Carrying {ISDN} Traffic", BOOKTITLE="2nd Australian Teletraffic Seminar", ADDRESS="Adelaide, Australia", PAGES=7, MONTH=dec, YEAR=1987, KEYWORDS="multiserver", ABSTRACT="In low-connectivity portions of the ISDN, in particular the Customer Access Network, significant correlation between blocking on series links carrying mixed services can exist. This will be particularly noticeable for wideband traffic. Previous work in this area applies only to very small systems because it is necessary to calculate all the state probabilities, and is hence subject to acute dimensionality problems. In thi", } @TECHREPORT{Robe8712:Arising, AUTHOR="J. W. Roberts", TITLE="Some Performance Issues Arising in a Fast packet Switching Environment", INSTITUTION="CNET/PAA/ATR", ADDRESS="Paris, France.", PAGES=27, MONTH=dec, YEAR=1987, KEYWORDS="fast packet switching; ATM", ABSTRACT="COST-214; FP", } @ARTICLE{Ofek8712:Integration, AUTHOR="Y. Ofek", TITLE="Integration of Voice Communication on a Synchronous Optical Hypergraph", JOURNAL="IBM Research Report", NUMBER=13341, MONTH=dec, YEAR=1987, ABSTRACT="The optical hypergraph is a novel network architecture in which each edge of the hypergraph is a multiple-access broadcast medium constructed as a passive optical star coupler. Access to each net (edge) is time-slotted, and the system maintains global slot synchronization. The integration of voice into the system is done by reserving time slots in a periodic manner. A packet which contains several voice parcels from different phone conversations is transferred in these slots. These parcels may have different destinations on the optical net. As a result of the global end to end synchronization, the delay from the source to the destination is a known constant, with accuracy of plus or minus half a time slot. In the analysis, it is shown that the system improves its operation as the communication bandwidth increases. In other words, the algorithms and protocols improve in performance as the communication bandwidth increases. Two criteria are used to exhibit this phenomenon (i) the utilization efficiency and (ii) the end to end delay.", }