1993 International Conference on Network Protocols最新文献

筛选
英文 中文
Reverse-engineering of communication protocols 通信协议的逆向工程
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340917
David Lee, Krishan K. Sabnani
{"title":"Reverse-engineering of communication protocols","authors":"David Lee, Krishan K. Sabnani","doi":"10.1109/ICNP.1993.340917","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340917","url":null,"abstract":"The authors study the problem of locating the differences between a protocol specification and its implementation. They give an exact procedure for solving this problem. If there is only one difference between the implementation and the specification, then the algorithm will locate the difference and therefore identify the implementation machine. Otherwise, it will detect that the implementation machine has more than one change. The run time of the algorithm is a low-degree polynomial in the number of states and inputs of the machine. Both a brute-force version of the algorithm with a cost O(pn/sup 5/), where n is the number of states of the specification machine and p is the number of inputs, and a fast algorithm with a cost O(pn/sup 3/ log n) are described. An improvement for which the cost on the average is O(pn/sup 2/ log n) is also given. A heuristic procedure that uses a test of comparable length to a conformance test sequence which has been used successfully in practice is described.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132930847","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
On token protocols for high-speed multiple-ring networks 高速多环网络令牌协议研究
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340898
W. Dobosiewicz, P. Gburzynski
{"title":"On token protocols for high-speed multiple-ring networks","authors":"W. Dobosiewicz, P. Gburzynski","doi":"10.1109/ICNP.1993.340898","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340898","url":null,"abstract":"A token ring protocol which restricts the transmission rights to the station possessing the token is not a good candidate for driving a gigabit network. As the network's transmission rate becomes higher, the impact of the token transition time (which is idle) becomes more pronounced and the effective throughput of the network becomes a smaller and smaller fraction of the nominal channel capacity. The authors present a family of token passing protocols for ring networks which are devoid of this unpleasant property. The protocols are simple and inexpensive, yet they possess a number of advantageous properties: high capacity (similar to METARING and independent of the propagation length of the ring), fairness, and natural accommodation of synchronous and isochronous traffic.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115846820","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}
引用次数: 9
The FCVC (flow-controlled virtual channels) proposal for ATM networks: a summary ATM网络的FCVC(流控虚拟通道)方案:综述
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340926
H. T. Kung, A. Chapman
{"title":"The FCVC (flow-controlled virtual channels) proposal for ATM networks: a summary","authors":"H. T. Kung, A. Chapman","doi":"10.1109/ICNP.1993.340926","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340926","url":null,"abstract":"Link-by-link flow-controlled virtual channels are proposed for asynchronous transfer mode (ATM) networks. The flow control mechanism efficiently uses leftover bandwidth after guaranteed traffic has been served, thus achieving high network utilization. Compatible with existing ATM standards, this proposal is called FCVC, (for flow-controlled virtual channels). Three increasingly memory-efficient credit-based flow control schemes, named N123, N123+ and N23, are described for implementing link-by-link flow control. These credit-based flow control schemes have been used in an experimental 622-Mbps ATM switch currently under development. Simulations based on the switch design have confirmed that the flow control mechanism is indeed able to provide sufficiently rapid feedback to let a network adapt to load changes and maximize its performance.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"40 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113224","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}
引用次数: 85
Galileo: A tool for simulation and analysis of real-time networks 伽利略:模拟和分析实时网络的工具
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340911
E. Knightly, G. Ventre
{"title":"Galileo: A tool for simulation and analysis of real-time networks","authors":"E. Knightly, G. Ventre","doi":"10.1109/ICNP.1993.340911","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340911","url":null,"abstract":"Galileo is a flexible tool for simulation of heterogeneous real-time communication networks and for development and validation of network protocols. Galileo provides several unique features that make it particularly suitable for the simulation and analysis of networks that provide quality-of-service guarantees. First, its object-oriented programming environment provides the means for a modular, hierarchical, heterogeneous description of networks. Second, its multimedia device interface provides the tools for a qualitative analysis of network protocols. Finally, Galileo's network interface provides interaction with actual networks to access real data and simulate realistic multimedia scenarios.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120977679","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
Automatic test case generation for Estelle Estelle的自动测试用例生成
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340915
Chang-Jia Wang, Ming T. Liu
{"title":"Automatic test case generation for Estelle","authors":"Chang-Jia Wang, Ming T. Liu","doi":"10.1109/ICNP.1993.340915","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340915","url":null,"abstract":"An automatic test case generation method for Estelle is proposed. A formal model is introduced to describe the dynamic properties of Estelle specifications so as to verify the difference between the behavior of the specification and the behavior of its models. Based on the difference, an algorithm is presented to produce test cases that can detect such implementation faults. The algorithm can generate test cases not only for single module specifications but also for systems containing multiple modules that run concurrently. In addition, heuristics are suggested to improve the performance of the test case generation process.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114954537","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}
引用次数: 17
Flow theory: Verification of rate-reservation protocols 流量理论:费率保留协议的验证
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340918
J. Cobb, M. Gouda
{"title":"Flow theory: Verification of rate-reservation protocols","authors":"J. Cobb, M. Gouda","doi":"10.1109/ICNP.1993.340918","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340918","url":null,"abstract":"The authors develop a simple theory of flows and show how to use this theory in verifying rate-reservation protocols in computing networks. The theory is based on discrete and nondeterministic mathematics, rather than the customary continuous or probabilistic mathematics. The theory features two types of flows, smooth and uniform, and four types of flow operators, limiters, compactors, expanders, and filters. Many rate-reservation protocols can be represented as linear networks of these flow operators. It is proved that, if the input flow to any of these networks is smooth or uniform, then the internal buffer and the delay in each operator in the network are bounded. This method is used to prove that a number of rate-reservation protocols (for example, stop-and-go, hierarchical round-robin, fair queuing and virtual clock) require bounded buffering and introduce bounded delay.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115517991","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
An approach to evaluating the performance of communication protocols based on formal specifications 基于形式化规范的通信协议性能评估方法
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340891
Shenmin Zhang, S. Chanson
{"title":"An approach to evaluating the performance of communication protocols based on formal specifications","authors":"Shenmin Zhang, S. Chanson","doi":"10.1109/ICNP.1993.340891","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340891","url":null,"abstract":"This paper proposes an approach to modeling and evaluating the performance of communication protocols based on formal specifications. A combined extended finite state machine (EFSM) and queueing network model is presented which is more sophisticated than either technique alone. Furthermore, the model avoids the state space explosion problem which may arise by the use of reachability analysis on an EFSM. The approach is illustrated using a simple sliding window protocol written in the formal description technique Estelle.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123995677","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
The generic flow control (GFC) protocol: a performance assessment 通用流控制(GFC)协议:一种性能评估
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340924
Yoon Chang, D. Su, S. Wakid, Xiaomei Qian, D. Vaman
{"title":"The generic flow control (GFC) protocol: a performance assessment","authors":"Yoon Chang, D. Su, S. Wakid, Xiaomei Qian, D. Vaman","doi":"10.1109/ICNP.1993.340924","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340924","url":null,"abstract":"Two candidate protocols for the generic flow control of the broadband integrated services digital network (B-ISDN) are currently being considered by the Accredited Standards Committee T1 (ASC T1). One proposal advocates the use of a distributed queue dual bus (DQDB)-like mechanism with a three level priority scheme. The other proposal is based on a slotted ring with control terminal equipment (C-TE), assigning periodic credit authorizations to the transmitting stations. This paper analyzes the performance behavior of the two protocols according to traffic scenarios and boundary conditions defined by the International Telephone and Telegraph Consultative Committee (CCITT) and T1.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"2006 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127634526","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
A highly parallelized architecture for a DQDB node 用于DQDB节点的高度并行化架构
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340905
Liitfullah Kusdemir, S. Bilgen
{"title":"A highly parallelized architecture for a DQDB node","authors":"Liitfullah Kusdemir, S. Bilgen","doi":"10.1109/ICNP.1993.340905","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340905","url":null,"abstract":"This paper proposes a highly parallelized architecture for a distributed queue dual bus (DQDB) MAC layer protocol processor, that is expected to improve the speed of execution of the protocol significantly to match the gigabit per second transmission rates. The architecture is based on pipelines of service blocks operating in parallel. Also the receive and transmit functions are separated and parallelized. Thus, basically, the isochronous, connection-oriented and MAC services are defined as three parallel blocks, each consisting of parallel receive and send functions. Fundamental to the architecture are multiport global receive and send memories which allow manipulation of separate data units in parallel without having to physically transfer data between different service stages. Each service block is divided into parallel subblocks, thereby exploiting the possibility of parallelism and pipelining as much as possible.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114076307","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
Improved randomized broadcast protocols in multi-hop radio networks 改进的多跳无线网络随机广播协议
1993 International Conference on Network Protocols Pub Date : 1993-10-19 DOI: 10.1109/ICNP.1993.340914
Chungki Lee, J. Burns, M. Ammar
{"title":"Improved randomized broadcast protocols in multi-hop radio networks","authors":"Chungki Lee, J. Burns, M. Ammar","doi":"10.1109/ICNP.1993.340914","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340914","url":null,"abstract":"This paper presents a suite of randomized broadcast protocols for the problem of broadcasting a message in multihop radio networks. The protocols are compared with the randomized broadcast protocol by R. Bar-Yehuda et al. (1989, 1991, 1992). The time complexity of one of the randomized broadcast protocols presented in this paper is shown, by simulation, to be much better than those of other protocols in most of the typical cases.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114259577","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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书