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

An efficient multiple-access method for the binary adder channel 二进制加法器信道的一种高效多址方法

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.101567

I. Bar-David, E. Plotnik, R. Rom

引用次数: 2

Multiple packet multiple channel CSMA/CD protocols for local area networks 用于局域网的多分组多通道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.101449

D. Du, Shu-Ping Chang, Ghanta Subbaro

{"title":"Multiple packet multiple channel CSMA/CD protocols for local area networks","authors":"D. Du, Shu-Ping Chang, Ghanta Subbaro","doi":"10.1109/INFCOM.1989.101449","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101449","url":null,"abstract":"Multiple-channel architectures have been proposed for broadcasting-based local area networks to overcome the problem of deteriorating performance when a very high speed communication channel is used. Such networks are called multiple-channel local area networks (M-LANs). In a carrier-sense multiple-access with collision detection (CSMA/CD) protocol designed for M-LANs (M-CSMA/CD), a ready station selects only one channel to transmit its packet according to some channel selection mechanism. A new CSMA/CD protocol for M-LAN architecture is proposed by which a station may select and try to transmit the same packet on K channels (K>or=1). If it has been successfully transmitted on more than one channel after the end-to-end propagation delay, it randomly selects one channel to finish its transmission and immediately stops its transmission on the rest of the channels. This is called the multipacket multichannel CSMA/CD protocol (MM-CSMA/CD). The performance of the proposed MM-CSMA/CD protocol can be shown to be potentially better than that of the M-CSMA/CD protocol and the traditional CSMA/CD protocol.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"59 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":"125929965","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}

引用次数: 15

Performance analysis of mobile packet radio 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.101562

R. Chang, V. Li

引用次数: 4

A communication system architecture for the office 办公室的通信系统架构

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.101478

A. Benkiran, G. Durand, R. Kraemer, M. Tag

引用次数: 0

Performance analysis of message delay limited synchronous communication and queueing systems 消息延迟限制同步通信和排队系统的性能分析

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.101433

I. Rubin, M. Ouaily

引用次数: 1

A characterization of telecommunication services in the 1990s 1990年代电信服务的特征

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.101508

D. J. Wright, M. To

引用次数: 5

Asymptotic performance analysis of hybrid ARQ protocols in slotted direct-sequence code division multiple-access networks 开槽直接序列码分多址网络中混合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.101502

J. M. Hanratty, Gordon L. Stüber

引用次数: 9

Recursive solution of a class of non-product form protocol models 一类非乘积形式协议模型的递归解

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.101431

T. Robertazzi

引用次数: 10

An efficient near-optimal algorithm for the joint traffic and trunk routing problem in self-planning 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.101445

Ming-Jeng Lee, J. Yee

引用次数: 15

Routing in a circuit-switched network with priority classes 具有优先级的电路交换网络中的路由

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.101528

G. Gopal, Ashok Kumar, A. Weinrib

{"title":"Routing in a circuit-switched network with priority classes","authors":"G. Gopal, Ashok Kumar, A. Weinrib","doi":"10.1109/INFCOM.1989.101528","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101528","url":null,"abstract":"The problem of routing in a circuit-switched network with different classes of traffic is examined. The authors consider the case of two priority classes, assuming that a relatively small fraction of traffic comprises the high-priority class requiring a better grade of service, with the rest being treated as lower priority normal traffic. These high-priority calls might be used to provide a premium service with lower blocking probability, or to implement services in which failure is expensive to the network such as a multiparty conference call. The authors identify several routing schemes that give preference to high-priority calls, either by explicitly reserving capacity or by allowing more resource sharing. The performance of these schemes is studied in terms of blocking probabilities for the two classes, protection of priority traffic against overload of normal traffic, and adaptability to variations in offered priority traffic. The authors compare the schemes by the different total revenues they earn and discuss the implementation complexity. They find that some resource-sharing schemes display good performance, having the potential to provide low blocking for priority calls with minimal impact on the remaining normal traffic.<<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":"130308333","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