IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies最新文献

筛选
英文 中文
Design and implementation of a heterogeneous distributed database management system 一个异构分布式数据库管理系统的设计与实现
C. Chung
{"title":"Design and implementation of a heterogeneous distributed database management system","authors":"C. Chung","doi":"10.1109/INFCOM.1989.101475","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101475","url":null,"abstract":"The architectural design is presented of DATAPLEX, a heterogeneous distributed database management system, and a prototype DATAPLEX. The objective of DATAPLEX is to integrate existing diverse databases as well as emerging new databases within an organization for organization-wide date sharing and data consistency. The architecture of DATAPLEX is based on the relational data model as a common data model and the structured query language (SQL) as a standard query language. A method to decompose distributed queries in this architecture is developed. The prototype system interfaces an IMS hierarchical database management system (DBMS) on IBM/MVS and an INGRES relational DBMS on DEC/VMS.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125645625","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
LAN based real time audio-graphics conferencing system 基于局域网的实时视听会议系统
L. Soares, S. L. Martins, T. Bastos
{"title":"LAN based real time audio-graphics conferencing system","authors":"L. Soares, S. L. Martins, T. Bastos","doi":"10.1109/INFCOM.1989.101507","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101507","url":null,"abstract":"LANBRETA-GCS, an LAN-based real-time audio-graphics teleconferencing system, is presented. The environment which the system is being implemented is introduced, and the specification decisions are justified. Although LANBRETA-GCS is being implemented in a local area network environment, utilizing an IBM token ring and the functions of DOS, NETBIOS, and the PC LAN program, its implementation is much more general. The organization of the system, to handle conferencing groups or individual messages, is described.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Message and packet access delays in CSMA-CD local area networks CSMA-CD局域网中的消息和分组访问延迟
A. Fapojuwo, D. Irvine-Halliday, W. Chan
{"title":"Message and packet access delays in CSMA-CD local area networks","authors":"A. Fapojuwo, D. Irvine-Halliday, W. Chan","doi":"10.1109/INFCOM.1989.101535","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101535","url":null,"abstract":"The effects of the message length statistics on the mean message response time and message and packet access delays are investigated for variable-length multipacket messages transmitted over CSMA-CD (carrier-sense multiple-access with collision detection) local area networks. The steady-state distribution of the number of messages in the system is determined using the imbedded Markov chain technique and limiting results from renewal theory. Application of Little's law then yields the mean message response time, from which the mean message and packet access delays are determined easily due to the gated transmission strategy adopted. Sample numerical results are presented for geometrically and truncated Poisson-distributed message lengths. It is concluded from the numerical results that the access delays as well as the mean response time are sensitive not only to the message length statistics but also to the message length distribution and the node buffer size.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126181663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Dynamic control of the p/sub i/-persistent protocol using channel feedback 使用信道反馈的p/sub i/-persistent协议的动态控制
B. Mukherjee, A. C. Lantz, N. Matloff, M. Moh
{"title":"Dynamic control of the p/sub i/-persistent protocol using channel feedback","authors":"B. Mukherjee, A. C. Lantz, N. Matloff, M. Moh","doi":"10.1109/INFCOM.1989.101536","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101536","url":null,"abstract":"The p/sub i/-persistent protocol is an excellent candidate for multiaccess communication over very long and very high-speed (unidirectional) fiber-optic bus networks because it does not suffer from the distance and bandwidth limitations of round-robin-type access mechanisms. The authors develop this protocol further to make it easily implementable, by allowing it to be sensitive to changing load conditions. In particular, they provide and study various properties of a simple algorithm which stations execute independently by using channel feedback information. This results in a fully distributed control mechanism that continuously adjusts the station probabilities p/sub i/ at their proper levels as governed by the ordered traffic, where the p/sub i/ are parameters of the p/sub i/-persistent protocol.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122046568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Traffic relationships in networks of tasks 任务网络中的流量关系
C. Woodside, G. Yee
{"title":"Traffic relationships in networks of tasks","authors":"C. Woodside, G. Yee","doi":"10.1109/INFCOM.1989.101467","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101467","url":null,"abstract":"A network of communicating software tasks in a distributed system is considered. Over the period of interest they are permanent concurrent entities, statically allocated to processors. Tasks communicate by messages sent to ports, sockets, or entries. A task execution is such that for each message received on a certain port, a known average number of other actions takes place, including sending of messages and waiting for replies, or reception of messages on some designated port. Various interesting special cases occur. From the behavior model and parameters of each task, network-wide relationships are obtained that govern the rates of intertask messaging. Certain rates may be taken as independent and they determine the remaining rates. In some cases, a narrowly constrained operating subspace results which contains all feasible task-throughput combinations. The relationships cover a variety of types of tasks and types of communication mechanisms, including rendezvous as well as nonblocking send with blocking receive.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131533563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Application of a rearrangement algorithm for digital cross-connect system control 一种重排算法在数字交叉连接系统控制中的应用
N. Fujii
{"title":"Application of a rearrangement algorithm for digital cross-connect system control","authors":"N. Fujii","doi":"10.1109/INFCOM.1989.101458","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101458","url":null,"abstract":"A rearrangement-type digital cross-connect system (DCS) control algorithm is discussed. First, a time-space-time (TST) switch applicable to DCSs and a typical rearrangement algorithm are introduced, and the conditions for realizing a nondisturbing rearrangement are summarized. Next, a switch capability evaluation method is proposed and the effect of using this evaluation method to select a switch timeslot for accommodating a connection is shown. By analyzing general DCS control algorithms, a prearrangement technique is also developed that decreases blocking in a large-scale DCS control.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123145168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Integrated voice and data transmission in packet radio network 分组无线网中话音和数据的综合传输
K. Ching, Hyong-Woo Lee
{"title":"Integrated voice and data transmission in packet radio network","authors":"K. Ching, Hyong-Woo Lee","doi":"10.1109/INFCOM.1989.101483","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101483","url":null,"abstract":"A multiaccess scheme, that is a variation of movable slot time-division multiplexing and p-persistent carrier-sense multiple-access is proposed for voice only or integrated voice and data transmission in a packet radio network. Simulations are performed to examine the performance characteristics of the proposed scheme under various system parameter values. Three different sets of parameters are selected for voice transmission, and a particular set of parameters is used for integrated voice and data transmission.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133506251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Analysis for token ring networks operating under message priorities and delay limits 在消息优先级和延迟限制下运行的令牌环网分析
Z. Tsai, I. Rubin
{"title":"Analysis for token ring networks operating under message priorities and delay limits","authors":"Z. Tsai, I. Rubin","doi":"10.1109/INFCOM.1989.101471","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101471","url":null,"abstract":"A symmetric priority-based token network is considered. Messages are divided into two priority classes. High-priority messages are assumed to require tight delay constraints. As a result, each station is allowed to establish, at any time, at most a single real-time high-priority access connection. High-priority messages are guaranteed access onto the channel within a prescribed limited period. In turn, regular priority messages are only served when the system determines, through the repetitive use of circulating tokens, (as used by IEEE 802.5 token ring type protocol) that no high-priority messages are currently waiting in the system. Two token schemes, using different service disciplines, are used to provide network access. Exact mean delay formulas for both message classes are derived. Approximate message delay analysis approaches are also investigated for networks containing large numbers of stations. Numerical results are then exhibited to illustrate the network performance under various traffic conditions.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132170013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Modeling of computer networks for performance evaluation and control under nonstationary conditions 非平稳条件下性能评价与控制的计算机网络建模
D. Tipper, M. Sundareshan
{"title":"Modeling of computer networks for performance evaluation and control under nonstationary conditions","authors":"D. Tipper, M. Sundareshan","doi":"10.1109/INFCOM.1989.101543","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101543","url":null,"abstract":"Three distinct approaches for modeling computer networks under nonstationary conditions are presented. The first approach uses a queuing-theoretic formulation to develop numerical techniques for determining the nonstationary queue dynamics and for estimating the settling time for the queue. In the second approach, discrete-event simulation techniques are used for the evaluation of network performance during nonstationary periods. The third approach develops a nonlinear state model for representing the dynamics of the packet queues at the various transmission links of the network and establishes a framework for formulating optimal control problems for designing routing and flow control strategies that ensure optimal network performance under both transient and steady-state conditions.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132257385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Performance study of a tree LAN with collision avoidance 树状局域网避碰性能研究
T. Suda, K. Goto
{"title":"Performance study of a tree LAN with collision avoidance","authors":"T. Suda, K. Goto","doi":"10.1109/INFCOM.1989.101434","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101434","url":null,"abstract":"The design is presented of a broadcast star network that uses a collision-avoidance switch. This network combines the benefits of random access (low delay when traffic is light; simple, distributed, and therefore robust protocols) with excellent network utilization. Performance analyses of a slotted broadcast star network are then presented to obtain distributions of the transmission delay: an exact analysis for a network with an infinite number of stations, and an approximate analysis for a network with a finite number of stations.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132347699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信