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

筛选
英文 中文
Performance analysis of the congestion control scheme in signaling system no.7 7号信令系统拥塞控制方案的性能分析
K. J. Lee, Y. Lim
{"title":"Performance analysis of the congestion control scheme in signaling system no.7","authors":"K. J. Lee, Y. Lim","doi":"10.1109/INFCOM.1989.101517","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101517","url":null,"abstract":"The performance is analyzed of the congestion control scheme in signaling system no.7 (SS7). Unlike many other congestion control schemes used in data networks, a threshold control along with a choking mechanism is used in this scheme. Two analytic models are developed that are used to study the steady-state performance and the triggering behavior of the congestion control scheme. Both models are amenable to simple solution techniques. Numerical examples are provided that reveal the dynamics of the congestion control scheme with respect to various control parameters. From these results, a set of guidelines is elaborated for the determination of congestion control parameters that will result in good performance of the signaling network.<<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":"132706593","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}
引用次数: 22
Recursive computation of steady-state probabilities in priority queues 优先级队列中稳态概率的递归计算
I. Cidon, M. Sidi
{"title":"Recursive computation of steady-state probabilities in priority queues","authors":"I. Cidon, M. Sidi","doi":"10.1109/INFCOM.1989.101432","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101432","url":null,"abstract":"Recursive formulas are derived for computing the state probabilities in priority queuing systems (preemptive and nonpreemptive). The derivation is based only on the general structure of the generating function involved, and thus is similar and more general than previous methods. Also discussed are the applications of the method to other queuing systems.<<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":"130021716","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
Fairness of optimal routing in virtual circuit data networks 虚拟电路数据网络中最优路由的公平性
W. Tsai, P. Cantrell, Jeffrey Goos
{"title":"Fairness of optimal routing in virtual circuit data networks","authors":"W. Tsai, P. Cantrell, Jeffrey Goos","doi":"10.1109/INFCOM.1989.101444","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101444","url":null,"abstract":"Fairness in multiple-path optimal routing algorithms in virtual circuit data networks is investigated. Fairness measures are developed to evaluate optimal routings. Several objective functions are considered to be possible replacements of the average packet delay objective function that is widely used in optimal routing algorithms, and evaluated for various network and traffic configurations. A numerical study using the fairness measures developed shows that the objective function which is in the integral form of the average packet delay achieves perfect fairness while sacrificing only a nominal increase in the average packet delay. The numerical study also confirms the conjecture by D.P. Bertsekas and R.G. Gallager (1987) that the form of objective function does not affect the average packet delay in any significant way.<<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":"130177219","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
Why we need gigabit networks 为什么我们需要千兆网络
J. Turner
{"title":"Why we need gigabit networks","authors":"J. Turner","doi":"10.1109/INFCOM.1989.101441","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101441","url":null,"abstract":"Gigabit networks are but one element of technological revolution, albeit a particularly important one as they will provide the glue that allows the other pieces to interact. The applications of gigabit networks that will have the widest impact will be those that rely on visual information in one form or another, in part because such applications require the higher bandwidths that gigabit networks can provide and in part because they will make the new technology useful to a much wider population of users. There are many applications of such networks that can readily be envisioned, but this technology will certainly enable many applications that cannot yet be foreseen.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"80 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":"132273637","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
Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network 异构骨干集群与pc接口网络的配置综合
J. Betser, Alberto Avritzer, J. Carlyle, W. Karplus
{"title":"Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network","authors":"J. Betser, Alberto Avritzer, J. Carlyle, W. Karplus","doi":"10.1109/INFCOM.1989.101480","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101480","url":null,"abstract":"The design is discussed of the Locus family of networks rendering PC interface (PCI) service. Given are the expected user workload, the hardware costs, and the performance constraints. The workload consists of three classes of users: interactive, highly-interactive, and communication-intensive. The number of PCs is given and is equal to the number of users. It is shown that the problem can be reduced to a discrete capacity and flow assignment (CFA) problem. The backbone capacity assignment is inspired by the Lagrangian decomposition approach. It starts from a backbone capacity assignment which matches the initial flow and chooses a backbone server upgrade that gives the greatest response-time reduction per dollar. At this point, the flow deviation method is applied and iteration is continuous until the constraints are met. Several computational examples of network configuration synthesis are presented that emphasize the significance and generality of the results obtained.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"169 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":"133800606","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
Multistage, multifaceted analysis of telecommunications network architectures 电信网络架构的多阶段、多面分析
E. E. McCoy, P. Zave
{"title":"Multistage, multifaceted analysis of telecommunications network architectures","authors":"E. E. McCoy, P. Zave","doi":"10.1109/INFCOM.1989.101438","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101438","url":null,"abstract":"It is shown that a multilanguage approach can provide more useful feedback than the use of any single specification language by itself. The point is illustrated by an architectural model written in two executable specification languages, PAISLey and CSP. The model can be subjected to formal type checking, protocol analysis and timing analysis. In all three cases, a notion of consistency between developmental stages of the model is enforced.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"350 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133819324","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
Wrapping and merging reconfiguration mechanism of a counter-rotating dual ring 反向旋转双环缠绕合并重构机理
S. Nakayashiki, Jiro Kashio, T. Harakawa, Seiichiro Yamamoto
{"title":"Wrapping and merging reconfiguration mechanism of a counter-rotating dual ring","authors":"S. Nakayashiki, Jiro Kashio, T. Harakawa, Seiichiro Yamamoto","doi":"10.1109/INFCOM.1989.101550","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101550","url":null,"abstract":"A counter-rotating dual ring incorporates a reconfiguration capability that significantly increases the reliability of a ring local area network. Automatic wrapping and merging reconfiguration techniques without specific supervising station are presented. Stations are connected by two link pairs, each consisting of an incoming signal link and an autograph signal link. In normal operation two rings are formed. A primary ring is used for user data transmission, and a secondary is used for backup. When a failure occurs on the primary ring, either ring switch or wrapping takes place. Ring switch means that the secondary ring assumes the roll of the primary ring. Wrapping means that the signal from the input side of one link pair is turned around to the output side of the same link pair to avoid the failure. This automatic wrapping mechanism restores a closed ring and can be used with the case of MAC (media access control) layer failure as well as physical layer failure. The station continues to monitor the failed links; when the failure is remedied, the failed portion forms another wrapped ring. The two wrapped rings are then combined together (merging) after it is certified that they are both functioning properly. If another failure occurs on the wrapped ring, the same wrapping mechanism enables smaller wrapped rings to be formed.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"122 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":"132985935","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
ISDN conformance test system development at COS COS的ISDN一致性测试系统开发
J. Gadre
{"title":"ISDN conformance test system development at COS","authors":"J. Gadre","doi":"10.1109/INFCOM.1989.101462","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101462","url":null,"abstract":"Summary form only given. Use of a single set of ISDN specifications, and conformance test systems for these specifications, is crucial for achieving universal interworking of ISDN networks. A standardized conformance testing methodology is currently being developed jointly by ISO and CCITT. The output of this activity is documented as CCITT X.290. The test methodology used in the design of the COS ISDN test system is in accordance with this standard and uses the remote single-layer test method. The initial release of the COS ISDN conformance test system includes capabilities for testing the provision of a connection-mode network service over ISDN packet-mode operation.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"65 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":"133173348","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
FLOWS: performance guarantees in best effort delivery systems 流程:最佳努力交付系统中的性能保证
D. Comer, R. Yavatkar
{"title":"FLOWS: performance guarantees in best effort delivery systems","authors":"D. Comer, R. Yavatkar","doi":"10.1109/INFCOM.1989.101442","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101442","url":null,"abstract":"A network-level communication abstraction called flow is discussed as a communication channel that has specific performance characteristics associated with its traffic. The underlying delivery system guarantees to meet performance requirements of a flow once it accepts a flow request. Upper layers use flows to implement transport-level protocols and high performance applications. The authors describe the concept of flows in detail and present algorithms that implement flows in a high-speed packet-switched network under development at Purdue University.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"68 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":"121783492","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}
引用次数: 25
Performance considerations on resolvable-contention-ring networks for fiber optic LANs 光纤局域网中可争用环网的性能考虑
H. Okada, Suvepon Saekol, Y. Tezuka
{"title":"Performance considerations on resolvable-contention-ring networks for fiber optic LANs","authors":"H. Okada, Suvepon Saekol, Y. Tezuka","doi":"10.1109/INFCOM.1989.101555","DOIUrl":"https://doi.org/10.1109/INFCOM.1989.101555","url":null,"abstract":"The objectives of this study are: (1) to show numerically the performance advantages of the resolvable-contention-ring (ReC-ring) in comparison with typical ring control methods like IEEE 802.5 token-ring, ANSI FDDI I token-ring, slotted-ring and contention-ring, and (2) to consider the possibility of using the priority mechanism of the ReC-ring for multimedia high-speed communications networks. The authors present a simple priority control mechanism based on the time-token scheme for multimedia communications of ReC-rings. The performance of the prioritized and nonprioritized ReC-rings is compared by computer simulation, and the priority mechanism presented is proved to have sufficient validity for multimedia communications networks.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"695 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":"125868179","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学术官方微信