{"title":"The construction of a novel agent fault-tolerant migration model","authors":"Yichuan Jiang, Zhengyou Xia, Yiping Zhong, Shiyong Zhang","doi":"10.1109/ISCC.2004.1358372","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358372","url":null,"abstract":"In agent migration process, malicious hosts can compromise the agent. To solve the problem, the paper introduces the measure of agent integrity verification and constructs a novel agent fault-tolerant migration model. The model avoids much agent replicas in migration process. By simulation experiment, the results prove that the model provided by the paper is feasible and efficient, and can save network resource much than other relative works.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114676500","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}
Takeshi Takahashi, Miikka Tammi, Heikki Vatiainen, R. Lehtonen, J. Harju
{"title":"Implementation and performance evaluation of multicast control protocol","authors":"Takeshi Takahashi, Miikka Tammi, Heikki Vatiainen, R. Lehtonen, J. Harju","doi":"10.1109/ISCC.2004.1358677","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358677","url":null,"abstract":"Multicast control protocol has been proposed to control multicast traffic transparently from the sources and the receivers. We have been developing and implementing this protocol, and this paper introduces the framework of our implementation in the Linux environment and proposes some performance enhancements brought by implementation specific features. This paper also shows the performance evaluation of our implementation. Finally, we clarify the effectiveness and the scalability of this protocol.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123113344","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}
{"title":"A heuristic approach to optimization of the decision-directed maximum-likelihood feedforward carrier phase error detection algorithm","authors":"R. Danesfahani, T. Jeans","doi":"10.1109/ISCC.2004.1358605","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358605","url":null,"abstract":"Using a heuristic approach, the performance of the self-synchronized decision-directed maximum-likelihood (ML) feedforward (FF) carrier phase error detection (PED) algorithm has been optimized. Compared to the original algorithm, it has been shown that for uncoded single channel (O)QPSK modems the optimized algorithm has a better phase error variance at low to medium signal to noise ratio (SNR). Further simulations have shown that the noise performance of the optimized algorithm at medium to high SNRs is superior to that of some well-known algorithms; the noise performance approaches the Cramer-Rao bound (CRB). This proves that the optimized algorithm has less tracking jitter at medium to high SNR which is a desirable feature in improving the BER performance.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124779057","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. Hong, Chun-Hao Chen, Yu-Lung Wu, Yeong-Chyi Lee
{"title":"Using divide-and-conquer GA strategy in fuzzy data mining","authors":"T. Hong, Chun-Hao Chen, Yu-Lung Wu, Yeong-Chyi Lee","doi":"10.1109/ISCC.2004.1358391","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358391","url":null,"abstract":"Data mining is most commonly used in attempts to induce association rules from transaction data. Transactions in real-world applications, however, usually consist of quantitative values. This work thus proposes a fuzzy data-mining algorithm for extracting both association rules and membership functions from quantitative transactions. A GA-based framework for finding membership functions suitable for mining problems is proposed. The fitness of each set of membership functions is evaluated using the fuzzy-supports of the linguistic terms in the large 1-itemsets and the suitability of the derived membership functions. The proposed framework thus maintains multiple populations of membership functions, with one population for one item's membership functions. The final best set of membership functions gathered from all the populations is used to effectively mine fuzzy association rules.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124859933","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}
{"title":"A heuristic buffer management scheme for tree-based reliable multicast","authors":"Jinsuk Baek, Jehan-Francois Pâris","doi":"10.1109/ISCC.2004.1358690","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358690","url":null,"abstract":"Tree-based reliable multicast protocols provide scalability by distributing error-recovery tasks among several repair nodes. These repair nodes integrate the status information of their receiver nodes and perform local error recovery for these nodes using the data stored in their buffers. In order to provide scalability and reliability, these buffers should be managed in an efficient manner. We propose a heuristic buffer management scheme that uses both positive and negative acknowledgments to achieve this goal. Under our scheme, receiver nodes send negative acknowledgments to their repair nodes to request packet retransmissions while some representative nodes send positive acknowledgments to indicate which packets can be discarded from the repair node's buffer. Our scheme provides scalability, because it significantly reduces the number of feedbacks sent by the receiver nodes, in addition, it provides fast recovery of transmission errors, since the packets requested from the receiver nodes are almost always available in their buffers.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125079856","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}
Toru Sumitomo, Y. Kadoya, M. Fuketa, K. Morita, S. Kashiji, J. Aoe
{"title":"An new E-mail filtering technique using time priority measurement","authors":"Toru Sumitomo, Y. Kadoya, M. Fuketa, K. Morita, S. Kashiji, J. Aoe","doi":"10.1109/ISCC.2004.1358392","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358392","url":null,"abstract":"Although E-mail systems are one of the most useful communication tools for business, education, etc., missing important E-mail messages becomes very serious problems. It is very useful filtering supports for users to pick up important messages or to neglect unnecessary messages. This work presents a method of determining the time priority for E-mail messages. Multiattribute rules are defined to detect complex time expressions and a set pattern-matching machine is proposed. It enables us to protect missing messages with important time information because the presented method can classify and rank them according to time priority measurement automatically. From the simulation results of determining time priority, it turned out that the presented pattern-matching method is from about 4 times faster than the traditional string pattern-matching method. From the results of filtering 5,172 sentences, it is verified that precision and recall of the presented method becomes 95% and 96%, respectively. From the experimental results of determining 10 highest messages among 100 E-mail, it is verified that filtering time by the proposed measurement is from 9.7 to 16.6 faster than that of a nonfiltering method.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125264562","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}
{"title":"A workflow-based dynamic scheduling approach for Web services platforms","authors":"Muhammed S. Peerbocus, Z. Tari","doi":"10.1109/ISCC.2004.1358377","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358377","url":null,"abstract":"Several techniques have been proposed to deal with task assignment in workflow systems. An \"appropriate\" service provider is selected using specific details about tasks (such as task type and price). The matching of the specific requirements of a task is performed and the task is then assigned to an appropriate provider. These solutions work well, however they do not produce good performance in terms of the mean flow time and the mean slow down. Existing solutions also do not deal with the issues of reliability (i.e. failure of the service provider), server load (i.e. the amount of tasks in the queue) and processing capacity of the service provider. This paper addresses these limitations by assigning tasks to the solution provider with lower load, higher processing capacity and better reliability. We introduce the concept of \"delay factor\", which is computed for each server to characterise the reliability of a service provider. For a given server with a specific load and processing capacity, we measure the mean flow time of tasks. The dispatcher then assigns tasks to the service provider that has the lower mean flow time and the smallest delay factor. With extensive performance testing, we demonstrate that proposed approach out-performs existing load distribution strategies.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122520690","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}
{"title":"Protecting integrity and confidentiality for data communication","authors":"Fangyong Hou, Zhiying Wang, Yuhua Tang, Z. Liu","doi":"10.1109/ISCC.2004.1358430","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358430","url":null,"abstract":"This work presents a scheme to build data communication system that can effectively protect data integrity and confidentiality. Firstly, This work briefly introduces the situation of integrity and confidentiality protection. Then, This work brings forward a new cipher, which uses a keystream generator to produce infinite number of frame secret keys basing on an infinite root key space, and use a unique one-off frame secret key for each data encryption/decryption. Basing on this cipher, we construct a data communication system. This work illustrates how to build such a system and analyze its protections of data integrity and confidentiality. With the character of cipher, it offers high resistance against cryptanalysis to prevent data disclosure, and it gives little opportunities to those intractable attacks that can compromise data integrity.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123028479","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}
{"title":"Hybrid checkpoint protocol for cell-dependent infrastructured networks","authors":"Masakazu Ono, T. Hirakawa, H. Higaki","doi":"10.1109/ISCC.2004.1358672","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358672","url":null,"abstract":"For supporting mission-critical applications in a mobile network system, hybrid checkpointing has been proposed. In a recent mobile network, wireless LAN protocols such as IEEE 802.11 and HlPERLAN are getting popular and communication with mobile computers is realized by using mobile IP in the Internet. This paper proposes a novel hybrid checkpoint protocol. Here, message logging for mobile computers is achieved based on broadcast property of wireless LAN protocols. In addition, by extending mobile IP, network overload in recovery is avoided. For both check- pointing and recovery in the proposed protocol, all required information is piggied back to messages. That is, no additional message is required.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123038325","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}
{"title":"Finding suitable differential characteristics for block ciphers with Ant colony technique","authors":"A. G. Bafghi, B. Sadeghiyan","doi":"10.1109/ISCC.2004.1358440","DOIUrl":"https://doi.org/10.1109/ISCC.2004.1358440","url":null,"abstract":"We present a new model for finding a suitable differential characteristics with applying intelligent techniques. We describe the model for Serpent, and find suitable differential characteristics with it through an approach which we call forward-backward technique. Our description may be generalized to find suitable differential characteristics for any block cipher. The model represents the problem of finding the best differential characteristic for a block cipher algorithm as the problem of finding the shortest path in a weighted directed graph. Then, we applied Ant-colony technique for finding the shortest path in the directed graph. In this way, we reached two advantages. Firstly, by applying this method, one can obtain a suitable result without examining the whole search space. Secondly, intelligent techniques such as Ant-colony technique may reduce dependency of cryptanalysis to cryptanalyser.","PeriodicalId":378030,"journal":{"name":"Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129262559","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}