发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Interconnection of CSMA/CD LANs via an N-port bridge 通过n端口桥接CSMA/CD局域网的互连
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101430
L. Merakos, Hai Xie
{"title":"Interconnection of CSMA/CD LANs via an N-port bridge","authors":"L. Merakos, Hai Xie","doi":"10.1109/INFCOM.1989.101430","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101430","url":null,"abstract":"The interconnection of CSMA/CD LANs using an N-port bridge is considered. The stability and throughput-delay performance of the interconnected system is analyzed approximately by decomposing it into N consistent but otherwise independent LAN subsystems. The performance of a LAN subsystem with bridge priority is evaluated, and the results are used for the performance evaluation of the interconnected system. Simulation results indicate that the decomposition approach provides reasonably accurate performance prediction. The bridge interconnection system is compared to a system in which the bridge is replaced by a repeater, and the performance advantages of the former system over the latter are quantified.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"41 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":"126802503","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}
引用次数: 7
Design of a distributed isochronous channel management protocol for IEEE 802.6 MAN QPSX IEEE 802.6城域网QPSX分布式同步信道管理协议的设计
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101465
W. Jeon, Chongsang Kim, Dong K. Kim
{"title":"Design of a distributed isochronous channel management protocol for IEEE 802.6 MAN QPSX","authors":"W. Jeon, Chongsang Kim, Dong K. Kim","doi":"10.1109/INFCOM.1989.101465","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101465","url":null,"abstract":"A fully distributed isochronous channel management protocol based on QPSX which is a major candidate for the IEEE 802.6 metropolitan area network (MAN) is proposed. The system transmits asynchronous traffic and call-setup packets using the distributed queue protocol of QPSX. In the proposed protocol, each station assigns, maintains and deallocates its isochronous channels without communicating with other stations. In order to allocate minimum bandwidth to isochronous traffic, bandwidth allocated to silence calls is used to transmit nonisochronous traffic. At the time of system reconfiguration, channel information is easily modified and communication can continue during recovery. The proposed protocol is compared with the centralized isochronous channel management protocol by simulation. The proposed protocol has shorter data delay, higher isochronous channel utilization, and fewer isochronous slots for same volume of traffic than the centralized protocol.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"121 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":"128469859","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
Queueing disciplines and passive congestion control in byte-stream networks 字节流网络中的排队规则和被动拥塞控制
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101519
S. P. Morgan
{"title":"Queueing disciplines and passive congestion control in byte-stream networks","authors":"S. P. Morgan","doi":"10.1109/INFCOM.1989.101519","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101519","url":null,"abstract":"The performance is compared of first-in-first-out and round-robin packet service disciplines at the trunk nodes of byte-stream networks, including priority service for single-packet messages. Delay and throughput characteristics are surveyed as a function of traffic mix, packet size, traffic intensity, and the ratio of trunk speed to access line speed. Exact and approximate analyses are compared with the results of simulations. Under normal traffic conditions, most disciplines will give acceptable mean delay if the ratio of trunk speed to access line speed is sufficiently high. Under congestion, round-robin disciplines have better fairness properties than first-in-first-out disciplines, in that they protect well-behaved users against hogs.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"7 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":"127296612","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}
引用次数: 47
Delay minimization of the adaptive go-back-N ARQ protocols for point-to-multipoint communication 点对多点通信中自适应回退n ARQ协议的时延最小化
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101503
Jonathan L. Wang, J. Silvester
{"title":"Delay minimization of the adaptive go-back-N ARQ protocols for point-to-multipoint communication","authors":"Jonathan L. Wang, J. Silvester","doi":"10.1109/INFCOM.1989.101503","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101503","url":null,"abstract":"Some data-link layer error control go-back-N ARQ (automatic repeat-request) protocols are studied that are suitable for point-to-multipoint communication over broadcast channels where data are delivered to the destinations in the order they are sent. A series of protocols differing in the way that the sender uses the outcomes of the previous transmissions are studied. The system delay, rather than the throughput, is the optimization measure. The optimal number of copies that the sender should transmit to minimize the time between when the sender first transmits a data frame and when the data frame is accepted by all the receivers is determined. The results show that sending the optimum number of copies of a data frame instead of just a single copy significantly improved the delay performance.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"46 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":"128043441","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}
引用次数: 14
Formalization of ISDN LAPD for conformance testing 用于一致性测试的ISDN LAPD的形式化
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101459
Teddy Boyce, T. Grenier, R. Probert, H. Ural
{"title":"Formalization of ISDN LAPD for conformance testing","authors":"Teddy Boyce, T. Grenier, R. Probert, H. Ural","doi":"10.1109/INFCOM.1989.101459","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101459","url":null,"abstract":"Usefulness of a formalization of the specification of ISDN LAPD is demonstrated for designing and developing a comprehensive set of conformance tests. Since many protocol standards are specified in a natural language (i.e., English), a method for formalizing protocol specifications with a view to a number of validation activities, including conformance testing, is also presented. In particular, it is shown how to utilize the state-transition-oriented approach to automatically generate a major component of standard conformance test suites. The use of formalized specifications is also illustrated for verifying the specification by selective executions, and for validating conformance test cases against the specification.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"40 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":"134185298","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
Reduction of crosspoints in one-sided crosspoint switching networks 单侧交叉点交换网络中交叉点的减少
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101545
A. Varma, S. Chalasani
{"title":"Reduction of crosspoints in one-sided crosspoint switching networks","authors":"A. Varma, S. Chalasani","doi":"10.1109/INFCOM.1989.101545","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101545","url":null,"abstract":"The authors establish upper and lower bounds for the number of crosspoints required in a one-sided crosspoint switching network to provide a given level of connectivity. Two modes of operation are considered, namely, nonblocking and rearrangeable. A complete nonblocking switch matrix with N ports has N/sup 2//2 crosspoints. The authors show that this number can be reduced by at most N/2-1 crosspoints for nonblocking operation. If rearrangeable operation is allowed, however, as many as 25% of the crosspoints can be removed. An analysis is made of the relationship between the number of crosspoints removed and the maximum number of rearrangements of connections needed. Also introduced are algorithms for rearrangement of connections in both single-chip and partitioned implementations with reduced numbers of crosspoints.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"13 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":"132151380","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
On the behavior of control token protocols with asynchronous and synchronous traffic 异步和同步流量下控制令牌协议的行为
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101474
A. Valenzano, P. Montuschi, L. Ciminiera
{"title":"On the behavior of control token protocols with asynchronous and synchronous traffic","authors":"A. Valenzano, P. Montuschi, L. Ciminiera","doi":"10.1109/INFCOM.1989.101474","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101474","url":null,"abstract":"Timed token protocols are both used to handle, on the same local area network, both real-time and non-real-time traffic. The authors analyze this type of protocols, giving worst-case values for the throughput of non-real-time traffic and the average token rotation time. The results were obtained for synchronous traffic generated according to a generic periodic pattern, under heavy traffic conditions. Finally, it is shown that the difference between the values obtained under worst-case assumptions are close to those obtained under best-case assumptions. Therefore, the method presented here may be used to provide important guidelines so as to properly tune timed token protocol parameters for each specific network installation.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"41 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":"133209243","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}
引用次数: 18
Packet radio and the factory of the future 分组无线电和未来的工厂
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101454
E. Coyle, J. Lehnert
{"title":"Packet radio and the factory of the future","authors":"E. Coyle, J. Lehnert","doi":"10.1109/INFCOM.1989.101454","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101454","url":null,"abstract":"Progress is reported in the design and analysis of spread-spectrum packet radio networks for the factory of the future. This progress includes the accurate analysis of the probability of packet success in a direct-sequence spread-spectrum communication channel and analytical results on the transient behavior of packet radio networks. The first use of these networks will be to provide communications between a transport system controller and a fleet of autonomous guided vehicles.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"65 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133392103","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}
引用次数: 0
A synchronization model for protocol conversion 协议转换的同步模型
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101466
J. C. Shu, Ming T. Liu
{"title":"A synchronization model for protocol conversion","authors":"J. C. Shu, Ming T. Liu","doi":"10.1109/INFCOM.1989.101466","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101466","url":null,"abstract":"A formal model is presented to analyze two aspects of conversion problems: translation and synchronization. The purpose of the translation is to map messages in one protocol to those in another protocol, whereas the synchronization is to hold matched messages for carrying out the translation. An algorithm is given to construct a valid converter. The algorithm is low in space complexity, and yields a converter with several merits: concurrent processing, easy debugging, minimum work on development, and easy implementation for half-gateways.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"2 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":"115544299","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}
引用次数: 40
Blocking in an ISDN switch ISDN交换机阻塞
IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI: 10.1109/INFCOM.1989.101552
J. F. Hayes, G. Stamatelos
{"title":"Blocking in an ISDN switch","authors":"J. F. Hayes, G. Stamatelos","doi":"10.1109/INFCOM.1989.101552","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101552","url":null,"abstract":"Broadband optical networks which carry a wide range of traffic classes in an integrated fashion are considered. The focus is on so-called stream traffic in which each class is allocated different quantities of bandwidth for the duration of a call. An exact analysis of the blocking conditions experienced by different classes of traffic demanding transmission through an N/sub 1/*N/sub 0/ switch is presented. No particular structure is assumed for the switch besides its capability of resolving output port contention by rearranging the input traffic. A two-dimensional generalization of an analysis for a single trunk is considered. Its efficiency rests on the linearity of the necessary computations, thus the relative independence from the dimensionality of the switch.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"20 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":"124313269","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
首页 上一页 下一页 尾页
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学术官方微信