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

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

筛选
英文 中文
Input queuing of an internally nonblocking packet switch with two 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.101497
J. Chen, R. Guérin
{"title":"Input queuing of an internally nonblocking packet switch with two priority classes","authors":"J. Chen, R. Guérin","doi":"10.1109/INFCOM.1989.101497","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101497","url":null,"abstract":"An N*N nonblocking packet switch with two priority classes which can be used to support traffics with different requirements is analyzed. Real-time traffic such as voice is assigned high priority to satisfy its strict delay requirement, while data traffic uses a lower priority and utilizes the remaining system capacity. The switch operation is slotted, and at each time slot packets arrivals at the inputs have Bernoulli distributions with different probabilities for high-priority and low-priority classes. Packets of both priority classes can be queued when waiting for service; the service discipline is FCFS (first-come first-served) within each priority class. The authors provide explicit expressions for blocking probabilities and average delays. They also study system stability and show that the maximum throughput can in fact be higher than with no priority.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"6 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":"115392392","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
RITA, a realization of remote ISDN testing through packet networks RITA，通过分组网络实现远程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.101570
W. M. Chan, Q. Tu
{"title":"RITA, a realization of remote ISDN testing through packet networks","authors":"W. M. Chan, Q. Tu","doi":"10.1109/INFCOM.1989.101570","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101570","url":null,"abstract":"RITA (remote ISDN test access), which was developed to support remote testing of ISDN protocols via packet-switched data networks, is discussed. The use of RITA in conjunction with Northern Telecom's NTS (network test system) allows centralization of testing facilities and hence increases both the efficiency and the quality of the tests. From the perspective of OSI architecture, RITA allows the testing of single protocol layer by extending the adjacent lower layer over a packet data network.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"26 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":"124833859","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
An error control technique for high data rate communication 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.101504
S. Wicker
{"title":"An error control technique for high data rate communication networks","authors":"S. Wicker","doi":"10.1109/INFCOM.1989.101504","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101504","url":null,"abstract":"A new method is discussed for modifying majority-logic convolutional decoders for use in a type-I hybrid-ARQ protocol. In standard forward error correcting (FEC) operation, these decoders generate reliability information in the form of orthogonal sets of parity check sums. The modified decoder uses this information to identify received packets whose decoded data may be unreliable and to request retransmission of these packets. It is shown through analysis and simulation that the resulting error control system provides substantially higher data reliability than its FEC counterpart at the expense of a very small reduction in data throughput.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"45 1 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":"123584596","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
Generalized parallel delta networks: a new class of rearrangeable interconnection 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.101457
F. Bernabei, M. Listanti
{"title":"Generalized parallel delta networks: a new class of rearrangeable interconnection networks","authors":"F. Bernabei, M. Listanti","doi":"10.1109/INFCOM.1989.101457","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101457","url":null,"abstract":"The definition is presented of a class of N*N multistage interconnection networks called generalized parallel delta networks (GPDNs). This class includes the already known replicated delta networks (RDNs) and parallel delta networks (PDNs). For GPDNs, the rearrangeability condition is given and a routing algorithm for the establishment of any set of connection requests is presented. The proposed algorithm operates for GPDNs composed of 2/sup q/*2/sup q/ switching elements and it is able to set up any permutation with a time complexity equal to O(N log/sub 2/ N). The applicability of RDNs, PDNs, and other GPDNs for the implementation of rearrangeable topologies is investigated. In particular, it is proved that if large networks (N>256) have to be implemented, GPDNs require a smaller number of switching elements than RDNs or PDNs.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"784 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":"122988554","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
A new free-access collision resolution algorithm based connection request procedure for land mobile satellite 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.101558
H. Tan, T. Yan
{"title":"A new free-access collision resolution algorithm based connection request procedure for land mobile satellite systems","authors":"H. Tan, T. Yan","doi":"10.1109/INFCOM.1989.101558","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101558","url":null,"abstract":"A novel connection request procedure for a land mobile satellite system (LMSS) is described. The procedure is based on a binary-feedback free-access collision resolution algorithm (CRA) operating over a number of parallel channels. This protocol is shown to achieve a much higher stable throughput than the previously recommended modified slotted ALOHA protocol for making connection requests. The complexity involved in implementing such a protocol is inherently low. Furthermore, this protocol is superior to other multiple-channel obvious blocked-access CRA protocols. By interleaving the time slots among individual channels, it can be applied to multiple-channel land mobile satellite type systems. Simulation results are obtained that demonstrate stable performance up to capacity. Moreover, the delay throughput characteristic is extremely flat over a wide range of traffic input rates.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"123 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":"117320652","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
Access and switching techniques in an ATM user-oriented satellite system 面向ATM用户的卫星系统中的接入和交换技术
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.101509
F. D. Priscoli, M. Listanti, A. Roveri, A. Vernucci
{"title":"Access and switching techniques in an ATM user-oriented satellite system","authors":"F. D. Priscoli, M. Listanti, A. Roveri, A. Vernucci","doi":"10.1109/INFCOM.1989.101509","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101509","url":null,"abstract":"A study has been carried out to ascertain the potential benefits of asynchronous transfer mode (ATM) in the context of satellite communications and to determine the most suitable system architectures. System design guidelines are examined, and the network architecture, transmission arrangements, multiplexing and switching schemes, medium access control, and protocol layering are discussed. Particular consideration is given to the definition of the onboard switch structure.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"11 1 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":"129520312","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
Delay analysis of an asymmetric, buffered random access system 非对称缓冲随机存取系统的延迟分析
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.101500
A. Behroozi-Toosi, R. Rao
{"title":"Delay analysis of an asymmetric, buffered random access system","authors":"A. Behroozi-Toosi, R. Rao","doi":"10.1109/INFCOM.1989.101500","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101500","url":null,"abstract":"A random multiple access system with a finite population of buffered, asymmetric users is studied. An upper bound is found to the mean total delay experienced by a user, including the queuing delay. The analysis facilitates an understanding of the interrelationship among delay, burstiness, the degree of asymmetry, and the number of users. The role of asymmetry is also studied and it is shown that the delay in an asymmetric system is smaller than the delay in a symmetric system for the same total arrival rate.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"208 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":"127602503","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
CSMa/CD with two persistence factors: a unified performance model for CSMA/CD 具有两个持久性因素的CSMa/CD:统一的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.101448
A. Kamal
{"title":"CSMa/CD with two persistence factors: a unified performance model for CSMA/CD","authors":"A. Kamal","doi":"10.1109/INFCOM.1989.101448","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101448","url":null,"abstract":"CSMA/CD (carrier-sense multiple-access with collision detection) protocols with two persistence factors is presented. One factor is used to define the protocol action if a station becomes ready when the channel is busy, and the other one is the normal persistence factor used to determine transmission rights. A family of new protocols is described which corresponds to different values of the persistence factors. The performance model of this protocol also acts as a unified performance model for the slotted CSMA/CD protocol with finite population. The non-persistent, 1-persistent and p-persistent variants of the CSMA/CD protocol can all be modeled as special cases of this general model. In addition to average performance measures, the output process and the packet delay time distributions are evaluated.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"1 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":"126000613","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
Generalized access control strategies for token passing 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.101472
J. Pang, F. Tobagi
{"title":"Generalized access control strategies for token passing systems","authors":"J. Pang, F. Tobagi","doi":"10.1109/INFCOM.1989.101472","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101472","url":null,"abstract":"A very large class of access control strategies is proposed and studied for token passing systems, generalized from the timer-based approach. The idea is to assign transmission quotas dependent on past service times to control the token cycles dynamically while utilizing the token channel efficiently. The dynamics inherent in the control scheme are identified as an important issue and, under heavy load and a few other assumptions, it is shown that the proposed strategies have stable dynamics. Furthermore, the ability of the proposed strategies to control the token cycles is demonstrated. Theoretical results are derived, followed by a thorough discussion on the crucial properties of the new strategies.<<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":"115834618","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
Application of Norton's theorem on queueing networks with finite capacities 诺顿定理在有限容量排队网络中的应用
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.101542
I. Akyildiz, J. Liebeherr
{"title":"Application of Norton's theorem on queueing networks with finite capacities","authors":"I. Akyildiz, J. Liebeherr","doi":"10.1109/INFCOM.1989.101542","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101542","url":null,"abstract":"A method is developed which allows the application of Norton's theorem on queuing networks with finite capacities. A node is arbitrarily selected and the subnetwork containing all remaining nodes is replaced by a composite node with infinite capacity; thus the entire network is reduced to a two-node network having the node of interest and the composite node. Although blocking causes interdependencies between nodes in the network, the selected node is totally isolated from the rest of the network by constructing phases in the server which reflect the blocking events. An algorithm is given to compute the parameters of the phases. Several examples are discussed to demonstrate the efficiency and generality of the technique. Comparisons with simulation results show that the proposed technique provides accurate results for throughput values.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"1 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":"130231675","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
下一页 尾页
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学术官方微信