Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340897
F. Reichmeyer, S. Hariri, Wang Song, K. Jabbour
The authors present an all-optical hypercube-based multichannel network, implemented on a ring topology, using wavelength division multiplexed channels. For a network of size N, only log/sub 2/N distinct channels are required. They design an optical network interface unit (ONIU), which employs free-space optics to perform routing and switching functions. The design eliminates the electronic bottleneck at intermediate nodes and is capable of performing high speed packet switching. ONIU can be reconfigured in the GHz range and provides the high bandwidth necessary to perform distributed and parallel computing in a local area network environment.<>
{"title":"An optical network interface unit for multichannel ring networks","authors":"F. Reichmeyer, S. Hariri, Wang Song, K. Jabbour","doi":"10.1109/ICNP.1993.340897","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340897","url":null,"abstract":"The authors present an all-optical hypercube-based multichannel network, implemented on a ring topology, using wavelength division multiplexed channels. For a network of size N, only log/sub 2/N distinct channels are required. They design an optical network interface unit (ONIU), which employs free-space optics to perform routing and switching functions. The design eliminates the electronic bottleneck at intermediate nodes and is capable of performing high speed packet switching. ONIU can be reconfigured in the GHz range and provides the high bandwidth necessary to perform distributed and parallel computing in a local area network environment.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"37 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":"132072184","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340909
T. J. Baumgartner, D. Kristol, J. D. Milleville, P. Parikh
The authors describe efforts to develop the Q.931 protocol software for the 5ESS Central Office Switch. Q.931 is a layer-3 message-based, user/network interface protocol for the integrated services digital network (ISDN). The approach uses a single formal specification written in the Augmented Protocol Specification Language to model the 1.931 protocol as a set of communicating extended finite state machines. From this specification, tools validate the protocol and generate the bulk of a C language implementation. The authors successfully integrated this code, along with other handwritten code, into a working system in the lab. Their results demonstrate that protocol tools can be used effectively to develop high quality protocol software quickly from formal specifications.<>
{"title":"From formal specification to implementation: experience with protocol tools","authors":"T. J. Baumgartner, D. Kristol, J. D. Milleville, P. Parikh","doi":"10.1109/ICNP.1993.340909","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340909","url":null,"abstract":"The authors describe efforts to develop the Q.931 protocol software for the 5ESS Central Office Switch. Q.931 is a layer-3 message-based, user/network interface protocol for the integrated services digital network (ISDN). The approach uses a single formal specification written in the Augmented Protocol Specification Language to model the 1.931 protocol as a set of communicating extended finite state machines. From this specification, tools validate the protocol and generate the bulk of a C language implementation. The authors successfully integrated this code, along with other handwritten code, into a working system in the lab. Their results demonstrate that protocol tools can be used effectively to develop high quality protocol software quickly from formal specifications.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"147 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":"116621935","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340888
Jan Huus, H. Ural
The authors present an efficient method for extracting a behavior description of a process (communicating finite state machine), as constrained by a given protocol. In the case where the constrained behavior corresponds to the unconstrained behavior depicted by the process specification, the process is said to be effective. The authors call the derived behavior description a process event graph (PEG). By comparing the PEG with the process specification, they determine whether a process in a protocol is effective. Two extensions to the basic algorithm are given, one to introduce parallelism to reachability analysis and one to detect traces that lead to process blockage. The authors focus initially on the two-process case, and then consider implications of more general protocols.<>
{"title":"Language-based analysis of communicating finite state machines","authors":"Jan Huus, H. Ural","doi":"10.1109/ICNP.1993.340888","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340888","url":null,"abstract":"The authors present an efficient method for extracting a behavior description of a process (communicating finite state machine), as constrained by a given protocol. In the case where the constrained behavior corresponds to the unconstrained behavior depicted by the process specification, the process is said to be effective. The authors call the derived behavior description a process event graph (PEG). By comparing the PEG with the process specification, they determine whether a process in a protocol is effective. Two extensions to the basic algorithm are given, one to introduce parallelism to reachability analysis and one to detect traces that lead to process blockage. The authors focus initially on the two-process case, and then consider implications of more general protocols.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"42 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":"116763571","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340895
Chung-Ming Huang, Jenq-Muh Hsu, Huei-Yang Lai, J. Pong, Duen-Tay Huang
Formal description techniques (FDTs) provide formal and abstract ways to specify what protocols have to do and what the features of the protocols need. Protocol verification is a process for detecting logical errors, such as deadlock, unspecified receptions, and channel overflow errors, in communication protocols. Estelle is a FDT defined by the International Organization for Standardization (ISO) for protocol specifications. The authors present an incremental protocol verification technique and an Estelle interpreter which accepts Estelle protocol specifications for incremental protocol verification.<>
{"title":"An Estelle interpreter for incremental protocol verification","authors":"Chung-Ming Huang, Jenq-Muh Hsu, Huei-Yang Lai, J. Pong, Duen-Tay Huang","doi":"10.1109/ICNP.1993.340895","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340895","url":null,"abstract":"Formal description techniques (FDTs) provide formal and abstract ways to specify what protocols have to do and what the features of the protocols need. Protocol verification is a process for detecting logical errors, such as deadlock, unspecified receptions, and channel overflow errors, in communication protocols. Estelle is a FDT defined by the International Organization for Standardization (ISO) for protocol specifications. The authors present an incremental protocol verification technique and an Estelle interpreter which accepts Estelle protocol specifications for incremental protocol verification.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"24 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":"123013860","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340893
V. Marbukh
A new routing and, performed by the leaky bucket regulators, congestion control strategy in ATM networks is proposed. The "potential" source provides the network with its characteristics and required quality of service. Based on this information, the network makes the admission and routing decisions and selects parameters of the leaky bucket "regulators" reinforcing the contract. The strategy minimizes the weighted average delay in the network, subject to the constraints on the average delays for the individual sessions and on the nodes buffers' overflow probabilities.<>
{"title":"Routing and congestion control in ATM networks","authors":"V. Marbukh","doi":"10.1109/ICNP.1993.340893","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340893","url":null,"abstract":"A new routing and, performed by the leaky bucket regulators, congestion control strategy in ATM networks is proposed. The \"potential\" source provides the network with its characteristics and required quality of service. Based on this information, the network makes the admission and routing decisions and selects parameters of the leaky bucket \"regulators\" reinforcing the contract. The strategy minimizes the weighted average delay in the network, subject to the constraints on the average delays for the individual sessions and on the nodes buffers' overflow probabilities.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"337 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":"124310169","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340927
T. Plagemann, M. Vogt, B. Plattner, T. Walter
Da CaPo provides an environment for the dynamic configuration of protocols. Configuration is done with respect to application requirements, properties of the offered network services, and the available resources in the end systems. The goal of the configuration is to provide a service with minimal necessary functionality for each request, i.e., to diminish protocol complexity and so to increase protocol performance. Modules serve as basic building blocks for the protocol configuration. Common software engineering principles like encapsulation and information hiding as well as a unified module interface allow the unconstrained configuration of modules to protocols. The Da CaPo runtime environment links modules to protocols in one UNIX process and realizes an efficient data transport inside the end systems because performance reducing operations like data copying or process switches are minimized.<>
Da CaPo为协议的动态配置提供了一个环境。配置是根据应用程序需求、提供的网络服务的属性和终端系统中的可用资源来完成的。配置的目标是为每个请求提供具有最小必要功能的服务，即减少协议复杂性，从而提高协议性能。模块是协议配置的基本构建块。通用的软件工程原理，如封装和信息隐藏，以及统一的模块接口，允许模块对协议的无约束配置。Da CaPo运行时环境将模块连接到一个UNIX进程中的协议，并在终端系统内实现有效的数据传输，因为数据复制或进程切换等降低性能的操作被最小化。
{"title":"Modules as building blocks for protocol configuration","authors":"T. Plagemann, M. Vogt, B. Plattner, T. Walter","doi":"10.1109/ICNP.1993.340927","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340927","url":null,"abstract":"Da CaPo provides an environment for the dynamic configuration of protocols. Configuration is done with respect to application requirements, properties of the offered network services, and the available resources in the end systems. The goal of the configuration is to provide a service with minimal necessary functionality for each request, i.e., to diminish protocol complexity and so to increase protocol performance. Modules serve as basic building blocks for the protocol configuration. Common software engineering principles like encapsulation and information hiding as well as a unified module interface allow the unconstrained configuration of modules to protocols. The Da CaPo runtime environment links modules to protocols in one UNIX process and realizes an efficient data transport inside the end systems because performance reducing operations like data copying or process switches are minimized.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"27 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":"122134108","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340925
N. Morita, I. Inoue, M. Mito, T. Akaike
The service specific connection oriented protocol is now being studied for use as the ATM adaptation layer protocol for connection oriented data communication and UNI/NNI signaling in the B-ISDN. The key feature of this protocol is a numbered poll mechanism that enables status information to be exchanged frequently and that is helpful for selective retransmission for frame loss. This paper examines this mechanism from the viewpoints of polling interval and frame length. Because this protocol was designed to perform selective retransmission for error recovery, some requirements, such as saving buffer, are not met. Two enhancements are therefore proposed: one consists of a Go-back-N-like procedure and nonassured credit, and the other is an SD PDU with a P bit. Guidelines to determine the POLL PDU interval are given.<>
{"title":"Service specific connection oriented protocol for the ATM adaptation layer","authors":"N. Morita, I. Inoue, M. Mito, T. Akaike","doi":"10.1109/ICNP.1993.340925","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340925","url":null,"abstract":"The service specific connection oriented protocol is now being studied for use as the ATM adaptation layer protocol for connection oriented data communication and UNI/NNI signaling in the B-ISDN. The key feature of this protocol is a numbered poll mechanism that enables status information to be exchanged frequently and that is helpful for selective retransmission for frame loss. This paper examines this mechanism from the viewpoints of polling interval and frame length. Because this protocol was designed to perform selective retransmission for error recovery, some requirements, such as saving buffer, are not met. Two enhancements are therefore proposed: one consists of a Go-back-N-like procedure and nonassured credit, and the other is an SD PDU with a P bit. Guidelines to determine the POLL PDU interval are given.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"63 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":"115046326","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340896
K. Tai, P. Koppol
The authors present an incremental strategy for reachability analysis of communication protocols modeled as sets of communicating finite state machines (CFSMs) with synchronous communication and direct naming. A set of CFSMs is organized into a hierarchy. The authors present an algorithm that, for a given hierarchy of a set M of CFSMs, incrementally composes and reduces subsets of CFSMs in M and finally produces a minimum CFSM describing the external behavior of M. It is also showed that this incremental reachability analysis guarantees the detection of global deadlocks. An algorithm for selecting a hierarchy for a set of CFSMs and some empirical results are provided.<>
{"title":"Hierarchy-based incremental analysis of communication protocols","authors":"K. Tai, P. Koppol","doi":"10.1109/ICNP.1993.340896","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340896","url":null,"abstract":"The authors present an incremental strategy for reachability analysis of communication protocols modeled as sets of communicating finite state machines (CFSMs) with synchronous communication and direct naming. A set of CFSMs is organized into a hierarchy. The authors present an algorithm that, for a given hierarchy of a set M of CFSMs, incrementally composes and reduces subsets of CFSMs in M and finally produces a minimum CFSM describing the external behavior of M. It is also showed that this incremental reachability analysis guarantees the detection of global deadlocks. An algorithm for selecting a hierarchy for a set of CFSMs and some empirical results are provided.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"1644 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":"122704783","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340901
Rieko Tanaka, M. Tsukamoto
A protocol for supporting mobile end systems (ESs) that move within an area in a connectionless-mode network protocol (CLNP) environment is proposed. Traffic caused by control protocol data units under frequent ES migration can be reduced by separating the roles of intermediate systems (ISs) into two roles: (1) generating and propagating the information of the default location of an ES, and (2) communicating directly to the ES and notifying the IS performing the role (1) of the current location of the ES. In addition, ISs may use a new caching mechanism for efficiency. This protocol has the following advantages: First, there is no need for mobile ESs to be changed. Second, ISs implementing this protocol can coexist with the conventional ISs. Third, it does not require any change to the areas which do not have mobile ESs, so it is easy to apply to the existing networks.<>
{"title":"A CLNP-based protocol for mobile end systems within an area","authors":"Rieko Tanaka, M. Tsukamoto","doi":"10.1109/ICNP.1993.340901","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340901","url":null,"abstract":"A protocol for supporting mobile end systems (ESs) that move within an area in a connectionless-mode network protocol (CLNP) environment is proposed. Traffic caused by control protocol data units under frequent ES migration can be reduced by separating the roles of intermediate systems (ISs) into two roles: (1) generating and propagating the information of the default location of an ES, and (2) communicating directly to the ES and notifying the IS performing the role (1) of the current location of the ES. In addition, ISs may use a new caching mechanism for efficiency. This protocol has the following advantages: First, there is no need for mobile ESs to be changed. Second, ISs implementing this protocol can coexist with the conventional ISs. Third, it does not require any change to the areas which do not have mobile ESs, so it is easy to apply to the existing networks.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"23 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":"129116323","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}
Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340930
Alvaro Guillen, Ramin Najmabadi Kia, B. Sales
With the emergence of multimedia applications, networks have to provide more and more bandwidth and should guarantee the quality of the communication between users. To address these issues, high speed architectures based on a virtual circuit model such as ATM have been designed and successfully implemented. The current trends in telecommunication deployment indicate that very large Internets based on such model will be available in the near future. This paper addresses the routing problem in this context and analyzes the existing solutions. It is concluded that the network has to provide precomputed and on-demand routes using a variation of the distance vector algorithm. Among other things, source routing and complete route recording are used to prevent loop formation.<>
{"title":"An architecture for virtual circuit/QoS routing","authors":"Alvaro Guillen, Ramin Najmabadi Kia, B. Sales","doi":"10.1109/ICNP.1993.340930","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340930","url":null,"abstract":"With the emergence of multimedia applications, networks have to provide more and more bandwidth and should guarantee the quality of the communication between users. To address these issues, high speed architectures based on a virtual circuit model such as ATM have been designed and successfully implemented. The current trends in telecommunication deployment indicate that very large Internets based on such model will be available in the near future. This paper addresses the routing problem in this context and analyzes the existing solutions. It is concluded that the network has to provide precomputed and on-demand routes using a variation of the distance vector algorithm. Among other things, source routing and complete route recording are used to prevent loop formation.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"386 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":"127589938","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：