Pub Date : 1993-10-19DOI: 10.1109/ICNP.1993.340913
X. Jia, Shirley Y. So
The paper proposes a new mechanism for group communication which guarantees the total ordering of message delivery, especially the ordering on the members common to overlapping groups. The mechanism is based on a method which propagates messages to all destinations along trees. The approach has the following advantages over the propagation tree mechanism: (1) greater parallelism (messages can be sent to destinations by using broadcast networks); (2) less latency time (it takes less time to have a message reach all the destinations); and (3) more flexible to dynamic membership changes, (each change of process membership does not involve a restructuring of propagation trees).<>
{"title":"A multicast mechanism with ordering on overlapping groups","authors":"X. Jia, Shirley Y. So","doi":"10.1109/ICNP.1993.340913","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340913","url":null,"abstract":"The paper proposes a new mechanism for group communication which guarantees the total ordering of message delivery, especially the ordering on the members common to overlapping groups. The mechanism is based on a method which propagates messages to all destinations along trees. The approach has the following advantages over the propagation tree mechanism: (1) greater parallelism (messages can be sent to destinations by using broadcast networks); (2) less latency time (it takes less time to have a message reach all the destinations); and (3) more flexible to dynamic membership changes, (each change of process membership does not involve a restructuring of propagation trees).<<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":"116355039","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.340923
H. Mountassir
This paper states the following result. Replacing a pair of actions (rev x; send y) with another pair of actions (send y; rev x) in a machine M cannot introduce deadlocks or unspecified receptions when this machine communicates with another machine N. This result is utilized in identifying for any given machine M a large family of machines (N1, N2, ...) such that the communication between M and any Ni is free from deadlocks and unspecified receptions. Processes exchanged messages through FIFO channels and modelled with finite states machines labelled with actions of receiving and transmitting messages. Some special classes are discussed with guaranteed progress.<>
{"title":"A note on communicating machines with identical symmetrical and dual processes using rewriting systems","authors":"H. Mountassir","doi":"10.1109/ICNP.1993.340923","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340923","url":null,"abstract":"This paper states the following result. Replacing a pair of actions (rev x; send y) with another pair of actions (send y; rev x) in a machine M cannot introduce deadlocks or unspecified receptions when this machine communicates with another machine N. This result is utilized in identifying for any given machine M a large family of machines (N1, N2, ...) such that the communication between M and any Ni is free from deadlocks and unspecified receptions. Processes exchanged messages through FIFO channels and modelled with finite states machines labelled with actions of receiving and transmitting messages. Some special classes are discussed with guaranteed progress.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"8 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":"126635775","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.340929
K. Calvert
This paper considers ways to achieve modularity in protocol architectures without layering. Modularity promotes interoperability by making it easier to port protocol implementations; layering, on the other hand, has been identified as a performance impediment because it enforces sequential processing of messages. Focusing on end-to-end protocols, the authors propose mechanisms (metaheaders and generic interfaces) that support modular parallel or integrated protocol implementations and encourage architecture-independent specifications. An example illustrates interoperability between two systems that support the same protocols, one using traditional layering and the other supporting parallel protocol composition.<>
{"title":"Beyond layering: modularity considerations for protocol architectures","authors":"K. Calvert","doi":"10.1109/ICNP.1993.340929","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340929","url":null,"abstract":"This paper considers ways to achieve modularity in protocol architectures without layering. Modularity promotes interoperability by making it easier to port protocol implementations; layering, on the other hand, has been identified as a performance impediment because it enforces sequential processing of messages. Focusing on end-to-end protocols, the authors propose mechanisms (metaheaders and generic interfaces) that support modular parallel or integrated protocol implementations and encourage architecture-independent specifications. An example illustrates interoperability between two systems that support the same protocols, one using traditional layering and the other supporting parallel protocol composition.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"52 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":"134400315","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.340899
D. Picker, R. Fellman, P. Chau
The scalable coherent interface (SCI) is a newly established IEEE standard which provides bus-like services to a network of nodes connected by very fast, unidirectional links. SCI provides an efficient flow control protocol that fairly allocates bandwidth to all nodes on the network. When global fairness is not required, it is desirable to relax its enforcement, in exchange for increased network utilization. This paper presents an extension to SCI's fairness protocol that increases attainable throughput by enforcing fairness only among conflicting nodes. The authors present extensive simulation results and compare them to the standard SCI protocol and to the desired performance, which is derived in the paper. The comparisons show that, on average, the enhancements substantially increase the performance of the original protocol.<>
{"title":"Enhancing SCI's fairness protocol for increased throughput","authors":"D. Picker, R. Fellman, P. Chau","doi":"10.1109/ICNP.1993.340899","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340899","url":null,"abstract":"The scalable coherent interface (SCI) is a newly established IEEE standard which provides bus-like services to a network of nodes connected by very fast, unidirectional links. SCI provides an efficient flow control protocol that fairly allocates bandwidth to all nodes on the network. When global fairness is not required, it is desirable to relax its enforcement, in exchange for increased network utilization. This paper presents an extension to SCI's fairness protocol that increases attainable throughput by enforcing fairness only among conflicting nodes. The authors present extensive simulation results and compare them to the standard SCI protocol and to the desired performance, which is derived in the paper. The comparisons show that, on average, the enhancements substantially increase the performance of the original protocol.<<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":"128705478","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.340907
Bert Lindgren, M. Ammar, B. Krupczak, K. Schwan
The authors consider the use of parallelism and configurability to increase throughput and reduce protocol processing latencies. They obtain experimental results on parallel protocol performance using a prototype implemented on a shared memory multiprocessor. The results demonstrate the utility of parallel protocol processing, and they indicate the further research necessary for constructing viable communication protocols for large-scale parallel machines. Based on these experiences, the design of an object-oriented framework for parallel protocol programming which facilitates parallel protocol development and helps maximize protocol performance on a wide variety of multiprocessors is presented.<>
{"title":"Parallel and configurable protocols: experiences with a prototype and an architectural framework","authors":"Bert Lindgren, M. Ammar, B. Krupczak, K. Schwan","doi":"10.1109/ICNP.1993.340907","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340907","url":null,"abstract":"The authors consider the use of parallelism and configurability to increase throughput and reduce protocol processing latencies. They obtain experimental results on parallel protocol performance using a prototype implemented on a shared memory multiprocessor. The results demonstrate the utility of parallel protocol processing, and they indicate the further research necessary for constructing viable communication protocols for large-scale parallel machines. Based on these experiences, the design of an object-oriented framework for parallel protocol programming which facilitates parallel protocol development and helps maximize protocol performance on a wide variety of multiprocessors is presented.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"136 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":"123785566","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.340906
K. Britton, Wen-Shyen E. Chen, T. Chung, Allan K. Edwards, J. Mathew, Diane Pozefsky, S. Sarkar, Roger Turner, Willibald A. Doeringer, D. Dykeman
The multiprotocol transport networking (MPTN) architecture proposed in this paper is a general solution to providing interconnectivity for applications. The MPTN architecture provides a protocol-independent system interface that includes most functions provided by existing transport protocols. As a result, the MPTN architecture decouples higher-layer protocols, application programming interfaces, and applications from protocols at the transport layer and below. Using the MPTN architecture, current and new applications can function unmodified over any transport supported under the MPTN interface. In addition, MPTN transport-layer gateways provide an end-to-end communication facility across a number of networks running different protocols. Therefore, a collection of networks running different protocols can serve as a single logical network.<>
{"title":"Multiprotocol transport networking: a general internetworking solution","authors":"K. Britton, Wen-Shyen E. Chen, T. Chung, Allan K. Edwards, J. Mathew, Diane Pozefsky, S. Sarkar, Roger Turner, Willibald A. Doeringer, D. Dykeman","doi":"10.1109/ICNP.1993.340906","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340906","url":null,"abstract":"The multiprotocol transport networking (MPTN) architecture proposed in this paper is a general solution to providing interconnectivity for applications. The MPTN architecture provides a protocol-independent system interface that includes most functions provided by existing transport protocols. As a result, the MPTN architecture decouples higher-layer protocols, application programming interfaces, and applications from protocols at the transport layer and below. Using the MPTN architecture, current and new applications can function unmodified over any transport supported under the MPTN interface. In addition, MPTN transport-layer gateways provide an end-to-end communication facility across a number of networks running different protocols. Therefore, a collection of networks running different protocols can serve as a single logical network.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"49 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":"117156391","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.340902
Kentaro Go, N. Shiratori
An algorithm for transforming LOTOS specifications from monolithic style to constraint-oriented style is proposed. The objective of this transformation is to decompose monolithic LOTOS behavior into two processes composed by the parallel operator. In order to make the behaviors observed congruent before and after the decomposition, the algorithm creates an additional process from the given specification and adds to the decomposed processes using a parallel operator. The additional process consists of n interleaved subprocesses (n /spl ges/ 1). There are no internal interaction gates between decomposed processes and the added process. The interactions among them occur only at the visible gates. This transformation has the following applications: (1) modularization or decomposition of a specification, (2) restructuring of complex specifications, and (3) derivation of protocol specifications from service specifications.<>
{"title":"Modularization of a specification in LOTOS","authors":"Kentaro Go, N. Shiratori","doi":"10.1109/ICNP.1993.340902","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340902","url":null,"abstract":"An algorithm for transforming LOTOS specifications from monolithic style to constraint-oriented style is proposed. The objective of this transformation is to decompose monolithic LOTOS behavior into two processes composed by the parallel operator. In order to make the behaviors observed congruent before and after the decomposition, the algorithm creates an additional process from the given specification and adds to the decomposed processes using a parallel operator. The additional process consists of n interleaved subprocesses (n /spl ges/ 1). There are no internal interaction gates between decomposed processes and the added process. The interactions among them occur only at the visible gates. This transformation has the following applications: (1) modularization or decomposition of a specification, (2) restructuring of complex specifications, and (3) derivation of protocol specifications from service specifications.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"21 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":"127890414","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.340900
C. Alaettinoglu, A. Shankar
An interdomain routing protocol based on superdomains that always finds a valid path if one exists is presented. Both strong and weak constraints are maintained for each visible superdomain. If the strong constraints of superdomains on a path are satisfied, then the path is valid. If the weak constraints of a superdomain are satisfied but the strong constraints are not, the source uses a query protocol to obtain a more detailed "internal" view of the superdomain, and searches again for a valid path. The protocol handles topology changes, including node/link failures that partition superdomains.<>
{"title":"An approach to hierarchical inter-domain routing with on-demand ToS and policy resolution","authors":"C. Alaettinoglu, A. Shankar","doi":"10.1109/ICNP.1993.340900","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340900","url":null,"abstract":"An interdomain routing protocol based on superdomains that always finds a valid path if one exists is presented. Both strong and weak constraints are maintained for each visible superdomain. If the strong constraints of superdomains on a path are satisfied, then the path is valid. If the weak constraints of a superdomain are satisfied but the strong constraints are not, the source uses a query protocol to obtain a more detailed \"internal\" view of the superdomain, and searches again for a valid path. The protocol handles topology changes, including node/link failures that partition superdomains.<<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":"130726523","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.340928
Gurdip Singh
The complexity of designing distributed protocols has led to compositional techniques for designing and verifying protocols. The author proposes a technique based on the notion of parallel composition of protocols. It allows the component protocols to share messages and variables. The composite protocol is an interleaved execution of the component protocols with the constraint that they be synchronized at events updating shared variables or sending/receiving shared messages. All invariants of the component protocols are preserved in the composite protocol. The technique allows modular design and verification of protocols. It can be viewed as an inverse of the projection method for verifying protocols.<>
{"title":"A compositional approach for designing protocols","authors":"Gurdip Singh","doi":"10.1109/ICNP.1993.340928","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340928","url":null,"abstract":"The complexity of designing distributed protocols has led to compositional techniques for designing and verifying protocols. The author proposes a technique based on the notion of parallel composition of protocols. It allows the component protocols to share messages and variables. The composite protocol is an interleaved execution of the component protocols with the constraint that they be synchronized at events updating shared variables or sending/receiving shared messages. All invariants of the component protocols are preserved in the composite protocol. The technique allows modular design and verification of protocols. It can be viewed as an inverse of the projection method for verifying protocols.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"9 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":"124986954","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.340904
Thomas Y. C. Woo, S. Lam
The authors present a new approach to the analysis of authentication protocols. The approach consists of several elements: a specification language for formally specifying authentication protocols, a semantic model for characterizing protocol executions, an assertion language for stating secrecy and correspondence properties, and procedures for verifying these properties. The main emphasis of this paper is on the assertion language, its semantics, and verification procedures. In particular, the authors present a set of proof rules. An example is given to illustrate the approach.<>
{"title":"Verifying authentication protocols: methodology and example","authors":"Thomas Y. C. Woo, S. Lam","doi":"10.1109/ICNP.1993.340904","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340904","url":null,"abstract":"The authors present a new approach to the analysis of authentication protocols. The approach consists of several elements: a specification language for formally specifying authentication protocols, a semantic model for characterizing protocol executions, an assertion language for stating secrecy and correspondence properties, and procedures for verifying these properties. The main emphasis of this paper is on the assertion language, its semantics, and verification procedures. In particular, the authors present a set of proof rules. An example is given to illustrate the approach.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"31 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":"121515287","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
扫码关注我们
求助内容：
应助结果提醒方式：