Pub Date : 1993-04-01DOI: 10.1109/ICNP.1993.340889
Jadranka Alilovic-Curgus, S. Vuong
The authors extend the testing theory based on formal specifications by formalizing testing for interoperability with a new relation, intop. Intuitively, P intop Q if, for every event offered by either P or Q, the concurrent execution of P and Q will be able to proceed with the traces in S, where S is their (common) specification. This theory is applicable to formal description methods that allow a semantic interpretation of specifications in terms of labeled transition systems. Some existing notions of implementation relations in protocol testing theory are placed in this framework and their discriminating power for identifying processes which will interoperate is examined. As an example, a subset of the ST-II protocol is formally specified and its possible implementations are shown to interoperate if each implementation satisfies the intop relation with respect to S, the specification of the ST-II protocol (subset).<>
{"title":"A framework for interoperability testing of network protocols","authors":"Jadranka Alilovic-Curgus, S. Vuong","doi":"10.1109/ICNP.1993.340889","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340889","url":null,"abstract":"The authors extend the testing theory based on formal specifications by formalizing testing for interoperability with a new relation, intop. Intuitively, P intop Q if, for every event offered by either P or Q, the concurrent execution of P and Q will be able to proceed with the traces in S, where S is their (common) specification. This theory is applicable to formal description methods that allow a semantic interpretation of specifications in terms of labeled transition systems. Some existing notions of implementation relations in protocol testing theory are placed in this framework and their discriminating power for identifying processes which will interoperate is examined. As an example, a subset of the ST-II protocol is formally specified and its possible implementations are shown to interoperate if each implementation satisfies the intop relation with respect to S, the specification of the ST-II protocol (subset).<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127372406","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-03-01DOI: 10.1109/ICNP.1993.340903
A. Shankar, David Lee
To provide reliable connection management, a transport protocol uses 3-way handshakes in which user incarnations are identified by bounded incarnation numbers from some modulo-N space. Recently, several caching schemes have been proposed to reduce the 3-way handshake to a 2-way handshake. The authors define a class of caching protocols and determine the minimum value of N needed as a function of real-time constraints (e.g., message lifetime, incarnation creation rate, inactivity duration, cache residency times, etc.). The protocols use the client-server architecture and handle failures and recoveries. Both clients and servers generate incarnation numbers from a local counter (e.g., a clock). These protocols assume a maximum duration for each incarnation; without this assumption, there is a very small probability of misinterpretation of incarnation numbers. This restriction can be overcome with some additional caching.<>
{"title":"Modulo-N incarnation numbers for cache-based transport protocols","authors":"A. Shankar, David Lee","doi":"10.1109/ICNP.1993.340903","DOIUrl":"https://doi.org/10.1109/ICNP.1993.340903","url":null,"abstract":"To provide reliable connection management, a transport protocol uses 3-way handshakes in which user incarnations are identified by bounded incarnation numbers from some modulo-N space. Recently, several caching schemes have been proposed to reduce the 3-way handshake to a 2-way handshake. The authors define a class of caching protocols and determine the minimum value of N needed as a function of real-time constraints (e.g., message lifetime, incarnation creation rate, inactivity duration, cache residency times, etc.). The protocols use the client-server architecture and handle failures and recoveries. Both clients and servers generate incarnation numbers from a local counter (e.g., a clock). These protocols assume a maximum duration for each incarnation; without this assumption, there is a very small probability of misinterpretation of incarnation numbers. This restriction can be overcome with some additional caching.<<ETX>>","PeriodicalId":439161,"journal":{"name":"1993 International Conference on Network Protocols","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442214","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
扫码关注我们
求助内容：
应助结果提醒方式：