We model the relationships between the message formats of a business system and their semantics in a machine-processable knowledge base. We describe a message-mapping technique that extracts the relationships between the message formats of several systems semiautomatically by using the class characteristics of the semantics and stores these relationships as past system design knowledge. In addition, we propose process-mapping, which is a technique that discovers suitable software components for system cooperation. We evaluate these methods using the interface specifications of actual service management systems and show that the frequency of interface adjustment can be reduced.
{"title":"Flexible Interface Mapping for System Cooperation and Its Evaluation","authors":"M. Nakatsuji, Y. Miyoshi, Y. Otsuka, Hirano Miki","doi":"10.2197/IPSJDC.3.661","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.661","url":null,"abstract":"We model the relationships between the message formats of a business system and their semantics in a machine-processable knowledge base. We describe a message-mapping technique that extracts the relationships between the message formats of several systems semiautomatically by using the class characteristics of the semantics and stores these relationships as past system design knowledge. In addition, we propose process-mapping, which is a technique that discovers suitable software components for system cooperation. We evaluate these methods using the interface specifications of actual service management systems and show that the frequency of interface adjustment can be reduced.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130628918","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}
Traditional information retrieval evaluation relies on both precision and recall. However, modern search environments such as the Web, in which recall is either unimportant or immeasurable, require precision-oriented evaluation. In particular, finding one highly relevant document is very important for practical tasks such as known-item search and suspected-item search. This paper compares the properties of five evaluation metrics that are applicable to the task of finding one highly relevant document in terms of the underlying assumptions, how the system rankings produced resemble each other, and discriminative power. We employ two existing methods for comparing the discriminative power of these metrics: The Swap Method proposed by Voorhees and Buckley at ACM SIGIR 2002, and the Bootstrap Sensitivity Method proposed by Sakai at SIGIR 2006. We use four data sets from NTCIR to show that, while P(+)-measure, O-measure and NWRR (Normalised Weighted Reciprocal Rank)are reasonably highly correlated to one another, P(+)-measure and O-measure are more discriminative than NWRR, which in turn is more discriminative than Reciprocal Rank. We therefore conclude that P(+)-measure and O-measure, each modelling a different user behaviour, are the most useful evaluation metrics for the task of finding one highly relevant document.
{"title":"On the Properties of Evaluation Metrics for Finding One Highly Relevant Document","authors":"T. Sakai","doi":"10.2197/IPSJDC.3.643","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.643","url":null,"abstract":"Traditional information retrieval evaluation relies on both precision and recall. However, modern search environments such as the Web, in which recall is either unimportant or immeasurable, require precision-oriented evaluation. In particular, finding one highly relevant document is very important for practical tasks such as known-item search and suspected-item search. This paper compares the properties of five evaluation metrics that are applicable to the task of finding one highly relevant document in terms of the underlying assumptions, how the system rankings produced resemble each other, and discriminative power. We employ two existing methods for comparing the discriminative power of these metrics: The Swap Method proposed by Voorhees and Buckley at ACM SIGIR 2002, and the Bootstrap Sensitivity Method proposed by Sakai at SIGIR 2006. We use four data sets from NTCIR to show that, while P(+)-measure, O-measure and NWRR (Normalised Weighted Reciprocal Rank)are reasonably highly correlated to one another, P(+)-measure and O-measure are more discriminative than NWRR, which in turn is more discriminative than Reciprocal Rank. We therefore conclude that P(+)-measure and O-measure, each modelling a different user behaviour, are the most useful evaluation metrics for the task of finding one highly relevant document.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114065444","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}
Almost all traditional methods of advertisement distribution have been concerned only with primary information distribution via certain kinds of media. However, the rapid growth of the Internet and interactive media have demonstrated the power and efficiency of secondary information distribution of information by consumers such as words of mouth and free-mail. However, an advertisement distribution model which can be used to analyze and measure the effectiveness of such secondary distribution has never been discussed. Therefore, in this paper, we propose an advertisement distribution model and show how to use the model to analyze both primary and secondary information distributions. Our experiment and analytical results are also discussed. The experimental result shows that the proposed model can be used to measure and analyze the effectiveness of advertisement distribution.
{"title":"On Content Distribution Model and Analyzing Distribution Effectiveness","authors":"Pao Sriprasertsuk, A. Seki, W. Kameyama","doi":"10.2197/IPSJDC.3.492","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.492","url":null,"abstract":"Almost all traditional methods of advertisement distribution have been concerned only with primary information distribution via certain kinds of media. However, the rapid growth of the Internet and interactive media have demonstrated the power and efficiency of secondary information distribution of information by consumers such as words of mouth and free-mail. However, an advertisement distribution model which can be used to analyze and measure the effectiveness of such secondary distribution has never been discussed. Therefore, in this paper, we propose an advertisement distribution model and show how to use the model to analyze both primary and secondary information distributions. Our experiment and analytical results are also discussed. The experimental result shows that the proposed model can be used to measure and analyze the effectiveness of advertisement distribution.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117193506","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}
We propose a low-stretch scheme for locating mobile objects in wide-area computing environments. Locating mobile objects in distributed computing systems is a non-trivial problem and has been investigated for decades. The forwarding address algorithm, perhaps the most popular algorithm, requires the previous holder of the object to point to the successive holder, and to forward all requests along this pointer. However, this approach cannot provide any access stretch bounds for wide-area settings, and can incur unlimited communication overhead. This is unacceptable when a large number of objects simultaneously move or when numerous referencers attempt to access an object that has moved. We propose an active update method where nodes in the vicinity of the object's location are notified of its new location via localized update messages. Moreover, we will utilize the overlay topology information to minimize these messages. Referencers beyond the scope of the update will still be able to safely access the object. We will demonstrate that these updates maintain access stretches low even in wide-area settings.
{"title":"A Low-stretch Object Migration Scheme for Wide-area Environments","authors":"Ken Hironaka, K. Taura, T. Chikayama","doi":"10.2197/IPSJDC.3.528","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.528","url":null,"abstract":"We propose a low-stretch scheme for locating mobile objects in wide-area computing environments. Locating mobile objects in distributed computing systems is a non-trivial problem and has been investigated for decades. The forwarding address algorithm, perhaps the most popular algorithm, requires the previous holder of the object to point to the successive holder, and to forward all requests along this pointer. However, this approach cannot provide any access stretch bounds for wide-area settings, and can incur unlimited communication overhead. This is unacceptable when a large number of objects simultaneously move or when numerous referencers attempt to access an object that has moved. We propose an active update method where nodes in the vicinity of the object's location are notified of its new location via localized update messages. Moreover, we will utilize the overlay topology information to minimize these messages. Referencers beyond the scope of the update will still be able to safely access the object. We will demonstrate that these updates maintain access stretches low even in wide-area settings.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123055705","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}
†† † † † This paper proposes a method to mine rules from a software project data set that contains a number of quantitative attributes such as staff months and SLOC. The proposed method extends conventional association analysis methods to treat quantitative variables in two ways: (1) the distribution of a given quantitative variable is described in the consequent part of a rule by its mean value and standard deviation so that conditions producing the distinctive distributions can be discovered. To discover optimized conditions, (2) quantitative values appearing in the antecedent part of a rule are divided into contiguous fine-grained partitions in preprocessing, then rules are merged after mining so that adjacent partitions are combined. The paper also describes a case study using the proposed method on a software project data set collected by Nihon Unisys Ltd. In this case, the method mined rules that can be used for better planning and estimation of the integration and system testing phases, along with criteria or standards that help with planning of outsourcing resources.
{"title":"Mining Quantitative Rules in a Software Project Data Set","authors":"Shuji Morisaki, Akito Monden, Haruaki Tamada, Tomoko Matsumura, Ken-ichi Matsumoto","doi":"10.2197/IPSJDC.3.518","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.518","url":null,"abstract":"†† † † † This paper proposes a method to mine rules from a software project data set that contains a number of quantitative attributes such as staff months and SLOC. The proposed method extends conventional association analysis methods to treat quantitative variables in two ways: (1) the distribution of a given quantitative variable is described in the consequent part of a rule by its mean value and standard deviation so that conditions producing the distinctive distributions can be discovered. To discover optimized conditions, (2) quantitative values appearing in the antecedent part of a rule are divided into contiguous fine-grained partitions in preprocessing, then rules are merged after mining so that adjacent partitions are combined. The paper also describes a case study using the proposed method on a software project data set collected by Nihon Unisys Ltd. In this case, the method mined rules that can be used for better planning and estimation of the integration and system testing phases, along with criteria or standards that help with planning of outsourcing resources.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130815602","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}
Yamada Naoharu, Kenji Sakamoto, G. Kunito, Yoshinori Isoda, K. Yamazaki, Satoshi Tanaka
This paper proposes human activity recognition based on the actual semantics of the human's current location. Since no predefined semantics of location can adequately identify human activity, we automatically identify the semantics from things by focusing on the association between things and human activities with the things. Ontology is used to deal with the various possible representations (terms) of each thing, identified by a RFID tag, and a multi-class Naive Bayesian approach is applied to detect multiple actual semantics from the terms. Our approach is suitable for automatically detecting possible activities even given a variety of object characteristics including multiple representations and variability. Simulations with actual thing datasets and experiments in an actual environment demonstrate its noise tolerance and ability to rapidly detect multiple actual semantics from existing things.
{"title":"Applying Ontology and Probabilistic Model to Human Activity Recognition from Surrounding Things","authors":"Yamada Naoharu, Kenji Sakamoto, G. Kunito, Yoshinori Isoda, K. Yamazaki, Satoshi Tanaka","doi":"10.2197/IPSJDC.3.506","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.506","url":null,"abstract":"This paper proposes human activity recognition based on the actual semantics of the human's current location. Since no predefined semantics of location can adequately identify human activity, we automatically identify the semantics from things by focusing on the association between things and human activities with the things. Ontology is used to deal with the various possible representations (terms) of each thing, identified by a RFID tag, and a multi-class Naive Bayesian approach is applied to detect multiple actual semantics from the terms. Our approach is suitable for automatically detecting possible activities even given a variety of object characteristics including multiple representations and variability. Simulations with actual thing datasets and experiments in an actual environment demonstrate its noise tolerance and ability to rapidly detect multiple actual semantics from existing things.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126421128","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}
Recent advancements in wireless communication technologies have attracted ad-hoc networking, which enables mobile users to communicate with each other without any infrastructure. While many ad-hoc routing protocols have been proposed, ad-hoc communication and its applications are not widespread. To expedite the widespread use of ad-hoc communications, we turn our attention to the handiest wireless device, namely, a mobile phone terminal. More mobile phones have been equipped with short distance wireless interfaces such as wireless LAN and Bluetooth. When ad-hoc communication is realized on such mobile phones with these wireless interfaces, ad-hoc communications will be available almost anytime and anywhere, which we believe will become a driving force for ad-hoc networking technology. On the other hand, while the performance of mobile phones has improved greatly over the past several years, their resources are still limited compared to laptop PCs. Therefore, to realize ad-hoc communication in mobile phones, this limitation should be considered. In this paper, we first set the design principles for mobile ad-hoc communications based on the assumed use cases and implement ad-hoc networking protocols as well as their applications on mobile phone terminals to verify their effectiveness. Through the performance evaluations, we discuss performance characteristics and potential application areas.
{"title":"Design and Implementation of Ad Hoc Communication and Applications on Mobile Phone Terminals","authors":"Yujin Noishiki, H. Yokota, A. Idoue","doi":"10.2197/IPSJDC.3.480","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.480","url":null,"abstract":"Recent advancements in wireless communication technologies have attracted ad-hoc networking, which enables mobile users to communicate with each other without any infrastructure. While many ad-hoc routing protocols have been proposed, ad-hoc communication and its applications are not widespread. To expedite the widespread use of ad-hoc communications, we turn our attention to the handiest wireless device, namely, a mobile phone terminal. More mobile phones have been equipped with short distance wireless interfaces such as wireless LAN and Bluetooth. When ad-hoc communication is realized on such mobile phones with these wireless interfaces, ad-hoc communications will be available almost anytime and anywhere, which we believe will become a driving force for ad-hoc networking technology. On the other hand, while the performance of mobile phones has improved greatly over the past several years, their resources are still limited compared to laptop PCs. Therefore, to realize ad-hoc communication in mobile phones, this limitation should be considered. In this paper, we first set the design principles for mobile ad-hoc communications based on the assumed use cases and implement ad-hoc networking protocols as well as their applications on mobile phone terminals to verify their effectiveness. Through the performance evaluations, we discuss performance characteristics and potential application areas.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115829241","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}
T. Shikama, T. Matsuda, Y. Terashima, Takashi Watanabe, T. Mizuno
This paper studies the situation where multiple IP flows are aggregated over a single wireless channel and an error recovery by retransmissions is performed by Selective-Repeat (SR) ARQ. We propose MQ-PFRS (Multi-QoS Per-Flow Resequencing) ARQ that provides a differentiated service for an IP flow depending on its QoS class, such as real-time or non-real-time. MQ-PFRS ARQ eliminates interferences among IP flows by resequencing received packets independently for each IP flow. It also controls the maximum packet delay by limiting the persistency of retransmissions and the maximum resequencing time for each packet. This paper also presents an analysis of the probability distribution of real-time packet delays. Simulation results show that the delay variation of real-time traffic is effectively controlled by proposed MQ-PFRS ARQ and the packet delay distribution is quite consistent with the results of the analysis. This means that MQ-PFRS is effective for handling multiple QoS classes of IP flows and the quality of real-time traffic transferred by the scheme can be predicted by the analysis.
{"title":"A Proposal for Service Differentiation by a Link Layer Protocol Based on SR ARQ and Its Evaluation","authors":"T. Shikama, T. Matsuda, Y. Terashima, Takashi Watanabe, T. Mizuno","doi":"10.2197/IPSJDC.3.456","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.456","url":null,"abstract":"This paper studies the situation where multiple IP flows are aggregated over a single wireless channel and an error recovery by retransmissions is performed by Selective-Repeat (SR) ARQ. We propose MQ-PFRS (Multi-QoS Per-Flow Resequencing) ARQ that provides a differentiated service for an IP flow depending on its QoS class, such as real-time or non-real-time. MQ-PFRS ARQ eliminates interferences among IP flows by resequencing received packets independently for each IP flow. It also controls the maximum packet delay by limiting the persistency of retransmissions and the maximum resequencing time for each packet. This paper also presents an analysis of the probability distribution of real-time packet delays. Simulation results show that the delay variation of real-time traffic is effectively controlled by proposed MQ-PFRS ARQ and the packet delay distribution is quite consistent with the results of the analysis. This means that MQ-PFRS is effective for handling multiple QoS classes of IP flows and the quality of real-time traffic transferred by the scheme can be predicted by the analysis.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121669829","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}
Several directional MAC protocols for ad hoc networks using directional antennas have been proposed recently. Although directional antennas have great potential such as high spatial reuse and range extension, directional MAC protocols inherently introduce new prob- lems arising from directivity. Deafness is one of the major problems and reduces the performance, caused by a lack of state information from neighbor nodes. This paper presents two directional MAC protocols, DMAC/DA (Directional MAC with Deafness Avoidance) and RI-DMAC (Receiver-Initiated Directional MAC), which handle the deafness problem, and mainly evaluates these protocols through extensive simulation study. DMAC/DA is a proactive handling method for deafness. In DMAC/DA, WTS (Wait To Send) frames are transmitted to notify the on-going communication to potential transmitters that may experience deafness. In this paper, DMAC/DA is enhanced by the next packet notification, called DMAC/DA with NPN, to distinguish transmitters from neighbors. On the other hand, RI-DMAC handles deafness reactively using a combination of sender-initiated and receiver-initiated operations. In RI-DMAC, each node polls a potential deafness node using RTR (Ready To Receive) after the completion of every dialog. The experimental results show that our proposed protocols outperform existing directional MAC protocols in terms of throughput, control overhead and packet drop ratio.
近年来，针对定向天线自组织网络提出了几种定向MAC协议。虽然定向天线在空间复用和范围扩展等方面具有很大的潜力，但定向MAC协议本身也引入了指向性带来的新问题。由于缺乏来自邻居节点的状态信息，导致的失聪是影响性能的主要问题之一。本文提出了两种处理失聪问题的定向MAC协议DMAC/DA (directional MAC with Deafness Avoidance)和RI-DMAC (Receiver-Initiated directional MAC)，并通过大量的仿真研究对这两种协议进行了评价。DMAC/DA是一种针对耳聋的主动处理方法。在DMAC/DA中，发送WTS(等待发送)帧来通知正在进行的通信到可能经历失聪的潜在发送器。在本文中，DMAC/DA通过下一个数据包通知(称为带NPN的DMAC/DA)来增强，以区分发送者和邻居。另一方面，RI-DMAC使用发送方发起和接收方发起的操作组合来反应性地处理耳聋。在RI-DMAC中，每个节点在每个对话完成后使用RTR (Ready To Receive)轮询一个潜在的耳聋节点。实验结果表明，我们提出的协议在吞吐量、控制开销和丢包率方面都优于现有的定向MAC协议。
{"title":"Performance Evaluation of Directional MAC Protocols for Deafness Problem in Ad Hoc Networks","authors":"M. Takata, M. Bandai, Takashi Watanabe","doi":"10.2197/IPSJDC.3.468","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.468","url":null,"abstract":"Several directional MAC protocols for ad hoc networks using directional antennas have been proposed recently. Although directional antennas have great potential such as high spatial reuse and range extension, directional MAC protocols inherently introduce new prob- lems arising from directivity. Deafness is one of the major problems and reduces the performance, caused by a lack of state information from neighbor nodes. This paper presents two directional MAC protocols, DMAC/DA (Directional MAC with Deafness Avoidance) and RI-DMAC (Receiver-Initiated Directional MAC), which handle the deafness problem, and mainly evaluates these protocols through extensive simulation study. DMAC/DA is a proactive handling method for deafness. In DMAC/DA, WTS (Wait To Send) frames are transmitted to notify the on-going communication to potential transmitters that may experience deafness. In this paper, DMAC/DA is enhanced by the next packet notification, called DMAC/DA with NPN, to distinguish transmitters from neighbors. On the other hand, RI-DMAC handles deafness reactively using a combination of sender-initiated and receiver-initiated operations. In RI-DMAC, each node polls a potential deafness node using RTR (Ready To Receive) after the completion of every dialog. The experimental results show that our proposed protocols outperform existing directional MAC protocols in terms of throughput, control overhead and packet drop ratio.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"21 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120998968","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}
Trace analysis for a security protocol represents every possible run as a trace and analyzes whether any insecure run is reachable. The number of traces will be infinite due to (1) infinitely many sessions of a protocol, (2) infinitely many principals in the network, and (3) infinitely many messages that intruders can generate. This paper presents an on-the-fly model checking method by restricting/abstracting these infinite factors to a finite model. First, we restrict a typed process calculus to avoid recursive operations, so that only finitely many sessions are considered. Next, a bound variable is introduced as an index of a message to represent its intended destination, so that an unbounded number of principals are finitely described. Then, messages in which irrelevant parts are reduced in a protocol are unified to a parametric message based on the type information. We implement the on-the-fly model checking method using Maude, and automatically detect the flaws of several security protocols, such as the NSPK protocol and the Woo-Lam protocol, etc..
{"title":"On-the-fly Model Checking of Security Protocols and Its Implementation by Maude","authors":"Guoqiang Li, Mizuhito Ogawa","doi":"10.2197/IPSJDC.3.343","DOIUrl":"https://doi.org/10.2197/IPSJDC.3.343","url":null,"abstract":"Trace analysis for a security protocol represents every possible run as a trace and analyzes whether any insecure run is reachable. The number of traces will be infinite due to (1) infinitely many sessions of a protocol, (2) infinitely many principals in the network, and (3) infinitely many messages that intruders can generate. This paper presents an on-the-fly model checking method by restricting/abstracting these infinite factors to a finite model. First, we restrict a typed process calculus to avoid recursive operations, so that only finitely many sessions are considered. Next, a bound variable is introduced as an index of a message to represent its intended destination, so that an unbounded number of principals are finitely described. Then, messages in which irrelevant parts are reduced in a protocol are unified to a parametric message based on the type information. We implement the on-the-fly model checking method using Maude, and automatically detect the flaws of several security protocols, such as the NSPK protocol and the Woo-Lam protocol, etc..","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114134585","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
扫码关注我们
求助内容：
应助结果提醒方式：