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

Proceedings of ICNP - 1994 International Conference on Network Protocols最新文献

筛选
英文 中文
Throughput efficiency of a link management procedure for LEO satellite systems 低轨道卫星系统链路管理程序的吞吐量效率
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344379
C. Ward, S. Mitra, T. Phillips
{"title":"Throughput efficiency of a link management procedure for LEO satellite systems","authors":"C. Ward, S. Mitra, T. Phillips","doi":"10.1109/ICNP.1994.344379","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344379","url":null,"abstract":"This paper introduces a new link management protocol, LAMSLM, appropriate for low Earth orbit (LEO) satellite networks. The procedure is based on the reliable link initialization procedure (RLIP) proposed by Baratz and Segal (1988) for use between terrestrial nodes connected by point-to-point links. The principal criterion for the design of LAMSLM is to minimize the time spent in link initialization during the period a link is active so that data transmission time can be extended. Unlike their terrestrial counterparts, LEO satellite systems are periodic. This implies that satellite links are repeatedly broken and reestablished. The proposed procedure uses a unique link closure mechanism at the conclusion of each active period that permits link reinstallation at a later point. The paper includes the algorithm design and a first order analysis of throughput efficiency.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133012116","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
Automated synthesis of protocol specifications with message collisions and verification of timeliness 带有消息冲突和时效性验证的协议规范的自动合成
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344366
Y. Kakuda, Hirotaka Igarashi, T. Kikuno
{"title":"Automated synthesis of protocol specifications with message collisions and verification of timeliness","authors":"Y. Kakuda, Hirotaka Igarashi, T. Kikuno","doi":"10.1109/ICNP.1994.344366","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344366","url":null,"abstract":"Protocol synthesis is used to derive a protocol specification based on a service specification. In the previous protocol synthesis methods, if the service specification includes simultaneous transmission of primitives, then the derived protocol specification includes protocol errors of unspecified receptions caused by message collisions. This paper extends a class of derived protocol specifications to include message collisions which often happen in real communication protocols, and proposes a protocol synthesis method such that (1) simultaneous transmission of primitives causing message collisions can be described in the service specifications, and (2) transitions for avoiding protocol errors of unspecified receptions can be generated by new transition synthesis rates. This paper also proposes a verification method for determining a real-time bound in the synthesized protocol specification using the task scheduling algorithm for multiprocessor systems.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"493 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124412131","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}
引用次数: 8
Fault-tolerant reconfiguration of trees and rings in networks 网络中树和环的容错重构
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344357
A. Arora, Ashish Singhai
{"title":"Fault-tolerant reconfiguration of trees and rings in networks","authors":"A. Arora, Ashish Singhai","doi":"10.1109/ICNP.1994.344357","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344357","url":null,"abstract":"We design two protocols that maintain the nodes of any computer network in a rooted spanning tree and in a unidirectional ring, respectively, in the presence of any finite number of fail-stop failures and repairs of network nodes and communication channels. Our protocols are fully distributed, have optimal time and space complexity, and illustrate two different methods for the design of nonmasking fault-tolerant protocols.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115011623","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}
引用次数: 8
Test path selection based on effective domains 基于有效域的测试路径选择
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344375
Liang-Seng Koh, Ming T. Liu
{"title":"Test path selection based on effective domains","authors":"Liang-Seng Koh, Ming T. Liu","doi":"10.1109/ICNP.1994.344375","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344375","url":null,"abstract":"In this paper a method is proposed to produce test paths that check both data flow and control flow for a protocol specified in the extended finite state machine (EFSM) model. The method first identifies a set of paths from a given specification to cover a data flow selection criterion, then it appends state check sequences to some transitions in this set of paths for checking control flow. The criterion that our method employs for selecting these transitions is called effective domain for testing. Effective domain for testing is used to evaluate how effective a transition can be tested in a given path in terms of the range of values that the variables in this transition can have. Since each transition can appear in several paths, our method is to append state check sequences to its occurrences that have distinct effective domains. In addition, our method will compute the path domain for each path and make some inexecutable paths executable.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133290136","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
Symbolic simulation: theory and application to protocol modeling and validation 符号仿真:协议建模与验证的理论与应用
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344369
Ritu Chadha, Isil Sebüktekin
{"title":"Symbolic simulation: theory and application to protocol modeling and validation","authors":"Ritu Chadha, Isil Sebüktekin","doi":"10.1109/ICNP.1994.344369","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344369","url":null,"abstract":"We present a novel technique called symbolic simulation, and its application to protocol modeling and validation. Whereas simulation produces a trace of the behavior of a system for certain fixed parameter values, symbolic simulation allows one to simulate the behavior of a system for entire ranges of parameter values. This in turn allows verification of certain properties of the system behavior for those ranges of values. This paper lays the theoretical foundation for symbolic simulation, and describes its application to proving safety and liveness properties of protocols. As an example, we have modeled a timer-based connection management protocol and validated one of its safety properties. We conclude that symbolic simulation is a useful means for modeling and validation of complex, real-time communication protocols.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114843033","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
Multicast transport protocols for high speed networks 高速网络的多播传输协议
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344382
S. Paul, Krishan K. Sabnani, D. Kristol
{"title":"Multicast transport protocols for high speed networks","authors":"S. Paul, Krishan K. Sabnani, D. Kristol","doi":"10.1109/ICNP.1994.344382","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344382","url":null,"abstract":"This paper presents the design and analysis of three reliable multicast transport protocols for high speed networks. The novelty of these protocols lies in the technique used in combining the acknowledgments of individual destinations along the underlying multicast tree to prevent acknowledgement implosion and in the technique used in preventing unnecessary retransmission by performing local multicasts. These protocols use the periodic exchange of complete state information between the source and the destinations and a block-based Selective Repeat retransmission scheme to improve the overall performance in a high speed networking environment. Performance of each protocol is analyzed in terms of throughput, end-to-end delay, buffer requirement, acknowledgment traffic and retransmission traffic. Based on this analysis and the complexity of implementation, one of the three protocols is recommended for reliable multicasting in high speed networks.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117061930","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}
引用次数: 82
Distributed synchronization protocols for multimedia services on Internet Internet上多媒体业务的分布式同步协议
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344359
Z. Ali, Miae Woo, A. Ghafoor
{"title":"Distributed synchronization protocols for multimedia services on Internet","authors":"Z. Ali, Miae Woo, A. Ghafoor","doi":"10.1109/ICNP.1994.344359","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344359","url":null,"abstract":"In this paper we present a distributed architecture for the existing and the emerging Internet for providing synchronized virtual channels (SVCs) to support presentation of multimedia information. The SVC architecture (SVCA) provides both intra-stream and inter-stream synchronization using resources available over the Internet and implementing distributed transmission scheduling mechanisms. We also propose a set of quality of presentation (QOP) parameters that quantify the quality of multimedia presentation from the user's point of view. Based on these parameters, we evaluate the proposed architecture and provides trade-offs between the QOP parameters and the required network resources to maintain this quality. Subsequently, these trade-offs are used to generate an optimal schedule for transmission of multimedia information over the SVCA. We also present protocol mechanisms to realize the SVCA.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131416100","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}
引用次数: 8
Dynamics of token ring protocols 令牌环协议的动态
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344355
J. Waclawsky, Mahendran Velauthapillai
{"title":"Dynamics of token ring protocols","authors":"J. Waclawsky, Mahendran Velauthapillai","doi":"10.1109/ICNP.1994.344355","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344355","url":null,"abstract":"We present a new approach for analyzing token ring LANs. The token ring model presented supports the behavior obtained from actual ring measurements. Using this model, employing deterministic bounds analysis techniques, we prove several theorems which lead to some interesting conclusions that support observed ring performance. The results obtained give insight into practical behavior of a token ring environments.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133214265","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
Fault-tolerant convergence routing 容错收敛路由
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344356
B. Yener, I. Bhandari, Y. Ofek, M. Yung
{"title":"Fault-tolerant convergence routing","authors":"B. Yener, I. Bhandari, Y. Ofek, M. Yung","doi":"10.1109/ICNP.1994.344356","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344356","url":null,"abstract":"This paper presents fault-tolerant protocols for fast packet switch networks with convergence routing. The objective is to provide, after a link or a node (switch) failure, fast reconfiguration and continuous host-to-host communication. Convergence routing is a variant of deflection routing, which combines in a dynamic fashion, the on-line routing decision with the traffic load inside the network. Unlike other deflection techniques, convergence routing guarantees that packets will reach or converge to their destinations. This fault-tolerant solution is designed for a switch-based (i.e., arbitrary topology) LAN architecture called MetaNet. The original MetaNet's convergence routing scheme has been modified in order to facilitate the property that the packet header need not be recomputed after a failure and/or a reconfiguration. This is achieved by having, at the network interface, a translator that maps the unique destination address to a virtual address. The virtual addresses are stored at the packet header, and used for convergence routing, with a global sense of direction over (i) a single spanning tree, and (ii) over two edge-disjoint spanning trees, for redundancy (fault tolerance) and greater efficiency.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134335630","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}
引用次数: 4
A simulation study of the impact of mobility on TCP/IP 移动性对TCP/IP影响的仿真研究
Proceedings of ICNP - 1994 International Conference on Network Protocols Pub Date : 1994-10-25 DOI: 10.1109/ICNP.1994.344360
P. Manzoni, D. Ghosal, G. Serazzi
{"title":"A simulation study of the impact of mobility on TCP/IP","authors":"P. Manzoni, D. Ghosal, G. Serazzi","doi":"10.1109/ICNP.1994.344360","DOIUrl":"https://doi.org/10.1109/ICNP.1994.344360","url":null,"abstract":"This paper presents a simulation analysis of the impact of mobility on data transport protocols. We consider the TCP/IP protocol augmented with features to support host mobility in wide area networks. Our results show that the existing version of TCP can yield low throughput in highly mobile environments due to the fact that TCP cannot discriminate packets dropped due to hand-offs with those dropped due to congestion in one or more network resources. We investigate a proposal in which the transport layer explicitly receives information from the network layer of any ongoing mobility. We show that by effectively capitalizing this information, TCP can appropriately extend the slow-start phase in the recovery process and achieve higher throughput. Based on the simulation analysis we also show the robustness of this scheme in the presence of both host mobility and network congestion.<<ETX>>","PeriodicalId":275870,"journal":{"name":"Proceedings of ICNP - 1994 International Conference on Network Protocols","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133472811","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}
引用次数: 12
下一页 尾页
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学术官方微信