Proceedings of International Conference on Network Protocols最新文献

筛选
英文 中文
A routing protocol for finding two node-disjoint paths in computer networks 在计算机网络中寻找两个节点不相交路径的一种路由协议
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524850
K. Ishida, Y. Kakuda, T. Kikuno
{"title":"A routing protocol for finding two node-disjoint paths in computer networks","authors":"K. Ishida, Y. Kakuda, T. Kikuno","doi":"10.1109/ICNP.1995.524850","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524850","url":null,"abstract":"In this paper, we present a routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology such as an adjacent node on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load. The concept of spanning tree-based kernel construction is introduced to synchronize procedures under the distributed control of the protocol. The routing scheme based on the protocol possesses the enhanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Furthermore, even if topology changes occur which damage the obtained disjoint paths, the paths themselves can be updated efficiently.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129871626","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}
引用次数: 73
A timing-based schema for stabilizing information exchange 用于稳定信息交换的基于时间的模式
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524848
A. Arora, D. M. Poduska
{"title":"A timing-based schema for stabilizing information exchange","authors":"A. Arora, D. M. Poduska","doi":"10.1109/ICNP.1995.524848","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524848","url":null,"abstract":"The paradigm of information exchange provides a basis for nodes in a network to stay up-to-date with the recent information in the network. In this paradigm, nodes cooperate with each other to share their current information. We present a simple and uniform schema for building information exchange protocols that are stabilizing, in the following strong sense. Starting from arbitrary state, the protocols reach within bounded real-time a state from where all nodes remain up-to-date with recent information in the network. The ability to stabilize in bounded time is achieved by using timing-based actions. The timing constraints on these actions can be systematically adapted to suit a variety of network loads, delay requirements, and scheduling restrictions and to tolerate out-of-phase and drift-prone node clocks. Our schema also tolerates any number of topological changes in the network. Moreover, it accommodates information that is time-varying as well as it does information that is fixed. It is thus well-suited to dynamic high speed networks.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631055","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
Multimedia synchronization for live presentation using the N-buffer approach 使用n缓冲方法进行实时演示的多媒体同步
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524839
Chung-Ming Huang, Ruey-Yang Lee
{"title":"Multimedia synchronization for live presentation using the N-buffer approach","authors":"Chung-Ming Huang, Ruey-Yang Lee","doi":"10.1109/ICNP.1995.524839","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524839","url":null,"abstract":"The demand of bringing multimedia information systems into distributed environments makes multimedia synchronization more difficult. In order to eliminate the side effects which result from delay jitters, we propose a bounded buffer allocation scheme, in which the audio stream adopts the blocking synchronization scheme and the video stream adopts the non-blocking synchronization scheme, for live audio and video presentations in this paper. The forward synchronization schemes are performed to overcome the asynchrony anomalies. Once some anomalies of presentations are detected, a forward re-synchronization scheme is triggered to eliminate the asynchrony anomalies. Neither a global clock nor a feedback mechanism is needed using the proposed method. Based on the proposed method, trade-offs between the presentation qualities and networking resources are mathematically calculated. According to these calculable trade-offs, users can derive their own (acceptable) presentation qualities of live video and live audio media based on their available networking resources.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130352578","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
A reliable ordered delivery protocol for interconnected local area networks 一种用于互联局域网的可靠的有序传输协议
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524853
D. Agarwal, L. Moser, P. Melliar-Smith, R. K. Budhia
{"title":"A reliable ordered delivery protocol for interconnected local area networks","authors":"D. Agarwal, L. Moser, P. Melliar-Smith, R. K. Budhia","doi":"10.1109/ICNP.1995.524853","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524853","url":null,"abstract":"We present-the Totem multiple-ring protocol, a novel reliable ordered multicast protocol for multiple interconnected local-area networks. The protocol exhibits excellent performance and maintains a consistent network-wide total order of messages despite network partitioning and remerging, or processor failure and recovery with stable storage intact. The Totem protocol is designed for fault-tolerant distributed systems, which replicate data to guard against failures and must ensure that replicated data remain consistent despite failures. The network-wide total order of messages provided by Totem simplifies the maintenance of consistency of replicated data, and, thus, eases the development of fault-tolerant distributed systems.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115697306","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}
引用次数: 65
Protocol architectures for delivering application specific quality of service 用于交付特定于应用程序的服务质量的协议体系结构
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524847
Parag K. Jain, N. Hutchinson, S. Chanson
{"title":"Protocol architectures for delivering application specific quality of service","authors":"Parag K. Jain, N. Hutchinson, S. Chanson","doi":"10.1109/ICNP.1995.524847","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524847","url":null,"abstract":"With the advent of high speed networks, the future communication environment is expected to comprise a variety of networks with widely varying characteristics. The next generation multimedia applications require transfer of a wide variety of data such as voice, video, graphics, and text which have widely varying access patterns such as interactive, bulk transfer, and real-time guarantees. Traditional protocol architectures have difficulty in supporting multimedia applications and high-speed networks because they are neither designed nor implemented for such a diverse communication environment. In this paper, we analyze the drawbacks of traditional protocol architectures and propose two alternative architectures for the next generation high-speed network environment: Direct Application Association and Integrated Layered Logical Multiplexing. We implement sample protocol stacks for each of the above models using the most widely used protocol stack (TCP/UDP-IP-Ethernet) in the context of the x-kernel. The performance of these protocol architectures is shown to be comparable to that of a traditional protocol architecture. They win by enabling the key requirements (Application specific Quality of Service) and optimizations (Integrated Layer Processing) necessary for future communication environments.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116490850","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
Multimedia transport in multihop dynamic packet radio networks 多跳动态分组无线网络中的多媒体传输
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524836
C. Lin, M. Gerla
{"title":"Multimedia transport in multihop dynamic packet radio networks","authors":"C. Lin, M. Gerla","doi":"10.1109/ICNP.1995.524836","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524836","url":null,"abstract":"The paper presents a distributed architecture which relies on code division access scheme for multimedia transport in a wireless mobile radio network without a fixed infrastructure. The proposed multicluster architecture has the capability of rapid deployment and dynamic reconfiguration. Without the need of base stations, this architecture can operate in areas without a wired back-bone infrastructure. The presented architecture has two main advantages. First, this architecture can provide spatial reuse of the bandwidth due to node clustering. Second, computer simulation reveals that our cluster structure is robust in the face of topological changes due to node motion, node failure, and/or new node addition. In all, this architecture provides a stable infrastructure for the integration of different types of traffic in a dynamic radio network.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125997558","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
Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions 具有不确定性和内部转换的循环协议的广义公平可达性分析
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524813
Hong Liu, Raymond E. Miller
{"title":"Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions","authors":"Hong Liu, Raymond E. Miller","doi":"10.1109/ICNP.1995.524813","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524813","url":null,"abstract":"In this paper, we extend the generalized fair reachability notion to cyclic protocols with nondeterministic and internal transitions. By properly incorporating internal transitions into the formulation of fair progress vectors, we prove that with only a few modifications, all the results established for cyclic protocols without nondeterministic and internal transitions still hold even if nondeterministic and internal transitions are allowed. We identify indefiniteness as a new type of logical error resulting from reachable internal execution cycles and show that it can also be detected for the class of cyclic protocols with finite fair reachable state spaces with finite extension.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"75 2-3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116698348","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
Performance analysis of an ATM switch with multiple paths 多路径ATM交换机性能分析
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524824
Byungho Kim, Boseob Kwon, Jinchun Kim, H. Yoon, J. Cho
{"title":"Performance analysis of an ATM switch with multiple paths","authors":"Byungho Kim, Boseob Kwon, Jinchun Kim, H. Yoon, J. Cho","doi":"10.1109/ICNP.1995.524824","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524824","url":null,"abstract":"An ATM switch based on multistage interconnection networks with multiple paths can support higher bandwidth than that of buffered networks with single path by passing multiple packets to the same destination simultaneously. These multiple packets are buffered in the output buffer of the destination. The performance of output buffer in the switch with multiple paths is closely dependent on the output traffic distribution, which is the packet arrival rate at each output link destined to a given output port. As the nonuniformity of the output traffic distribution becomes higher, the performance of the output buffer as like delay and packet loss probability gets better. In this paper, we propose a new self-routing switch architecture with multiple paths called Fly network and analyze the performance of the switching network and the output buffer focusing on the output traffic distribution. It is shown that the Fly network supports best throughput and latency of the output buffer by producing a high degree of the nonuniform output traffic distribution.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122920497","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
Extension of protocol synthesis to structured entities 将协议综合扩展到结构化实体
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524820
B. B. Bista, A. Togashi, N. Shiratori
{"title":"Extension of protocol synthesis to structured entities","authors":"B. B. Bista, A. Togashi, N. Shiratori","doi":"10.1109/ICNP.1995.524820","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524820","url":null,"abstract":"Entities in communication systems behave under sets of communication rules (protocols) and their behaviours are related to each other. Using this relationship, we present a synthesis algorithm to derive a structured protocol model by generating a peer entity from a given entity automatically. The given entity is in the form of a communicating process, which is natural in the context of communication protocols. We prove that the synthesized protocol model consisting of the generated entity and the peer entity is safe: i.e. logical errors free, collectively represented as deadlock free and is bisimulated by both entities. Unlike many previous works, where FSMs (Finite State Machines) are used to synthesize protocol model we present our synthesis algorithm for the process-algebraic language LOTOS, which is one of the FDTs developed by ISO.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133376393","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
A fuzzy decision maker for source traffic control in high speed networks 高速网络源流量控制的模糊决策方法
Proceedings of International Conference on Network Protocols Pub Date : 1995-11-07 DOI: 10.1109/ICNP.1995.524828
V. Catania, G. Ficili, S. Palazzo, D. Panno
{"title":"A fuzzy decision maker for source traffic control in high speed networks","authors":"V. Catania, G. Ficili, S. Palazzo, D. Panno","doi":"10.1109/ICNP.1995.524828","DOIUrl":"https://doi.org/10.1109/ICNP.1995.524828","url":null,"abstract":"Most of the policing techniques proposed so far in high speed networks using the ATM technique are based on conventional approaches which use a crisp decision making logic. They don't meet the selectivity and responsiveness requirements needed to make a policing efficient. In this paper we propose a policing mechanism based on fuzzy logic. The main characteristics of the proposed fuzzy policer are simplicity and the capacity to combine a high degree of responsiveness with a selectivity close to that of an ideal policer. Moreover, it can easily be implemented in hardware, thus enhancing both cost and processing performance. The simulation results reported show that the performance of our fuzzy policer is much better than that of conventional policing mechanisms.","PeriodicalId":350665,"journal":{"name":"Proceedings of International Conference on Network Protocols","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121081615","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
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学术官方微信
小红书