{"title":"Plenary Panel Session B: Future Trends of Distributed Computing Systems","authors":"Hongji Yang","doi":"10.1109/FTDCS.2008.47","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.47","url":null,"abstract":"As there are still many grand challenges for distributed computing systems, this panel will focus on the future trends of distributed computing systems. Each panelist will discuss certain aspects of the future trends based on their expertise.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121500190","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}
K. Mahmood, Y. Horikoshi, S. Niki, Xiaodong Lu, K. Mori
{"title":"Progressive Ripple-Based Service Discovery for High Response Time in Autonomous Decentralized Community System","authors":"K. Mahmood, Y. Horikoshi, S. Niki, Xiaodong Lu, K. Mori","doi":"10.1109/FTDCS.2008.25","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.25","url":null,"abstract":"Location based services (LBS) are expected to play crucial role in future of e-commerce. Although, LBS consider service provision on the basis of location, but don't take into consideration time aspect and user's interests. We propose incorporation of time-awareness and demand-oriented contexts along with location to develop idea of community pervasive services (CPS).To identify appropriate service provider subjected to real-time constraint in highly dynamic operational environment of autonomous decentralized community system (ADCS), efficient searching technique is required. Many existing resource discovery strategies in area of peer to peer and wireless ad hoc network can be captured by the n-ring model, which can't meet real time requirements in highly unpredictable and dynamic operating environment of ADCS. Therefore, we present novel idea of steady expanding search coupled with snail's pace advancement and swift boundary confining mechanism to seek appropriate service provider. Simulation results verify the effectiveness of the proposed technique.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128592351","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":"Using Multi-Core Processors to Support Network Security Applications","authors":"Y. Xiang, Wanlei Zhou","doi":"10.1109/FTDCS.2008.16","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.16","url":null,"abstract":"Multi-core processors represent a major evolution in computing hardware technology. Multi-core provides a network security application with more processing power from the hardware perspective. However, there are still significant software design challenges that must be overcome. In this paper, we present new architecture for multi-core supported network security applications, which aims at providing network security processing without causing performance penalty to normal network operations. We also provide an instance of this architecture - a multi-core supported intrusion detection system based on neural network. While hardware-based parallelisms have shown their advantage on throughput performance, parallelisms based multi-core provides more flexible, high performance, comprehensive, intelligent, and scalable solutions to network security applications.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130385420","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":"Using Historical Role to Speed up Subsequent Negotiations","authors":"Yizhu Zhao, Hongwei Lu","doi":"10.1109/FTDCS.2008.19","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.19","url":null,"abstract":"Trust negotiation (TN) is an approach to establish trust between strangers through iterative disclosure of digital credentials. Speeding up subsequent negotiations between the same negotiators is a problem worth of research. This paper introduces the concept of visiting card, and presents a historical role based trust negotiation model (HRBTN). HRBTN creates an account for the counterpart at the first negotiation. When the negotiators construct a new credential disclosure sequence in a trust negotiation, both negotiators records the roles designed to the counterpart according to the credentials disclosed in the negotiations associated with the credential disclosure sequence constructed in the negotiation in his HIB. When they conduct a new negotiation, the resource provider checks that if the requester has a role that is permitted to access the resource. If such a role exists, the negotiators can disclose credentials according to the credential disclosure sequence associated with the role, instead of recalculating them again. HRBTN speeds up subsequent negotiations between the entities that interact with each other frequently without impairing the privacy preservation.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131903936","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}
Masakazu Fujii, Kenichi Takahashi, Y. Hori, K. Sakurai
{"title":"Intrusion Detection Using Third-Parties Support","authors":"Masakazu Fujii, Kenichi Takahashi, Y. Hori, K. Sakurai","doi":"10.1109/FTDCS.2008.32","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.32","url":null,"abstract":"Intrusions are one of the most important issues in the current Internet environment. Therefore, a lot of researchers and companies elaborated countermeasure techniques such as intrusion detection systems (IDS) and intrusion prevention systems (IPS). These systems detect intrusions and prevent attackers from succeeding in their intrusion attempts. They usually rely on pattern matching and therefore, work efficiently on known-attacks. However, they do not work efficiently on unknown-attacks such as zero-day attacks and targeted attacks. This means, we should assume that our machines can be corrupted anytime. Therefore, we should consider what we can do under this assumption for a next generation security framework. In this paper, we propose a new intrusion detection methodology using the support of other machines. In our proposal, when an attacker tries to attack other machines from a corrupted machine that the attacker has already intruded, other machines notify it to the administrator of the corrupted machine. Then, the attacker may lose the corrupted machine. Therefore, the attacker restrains itself from imprudently attacking other machines. This will suppress the propagation of corrupted machines in the Internet.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123810395","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":"The BCD View Model: Business Analysis View, Service Composition View and Service Design View for Service Oriented Software Design and Development","authors":"Joonseok Park, Mikyeong Moon, Keunhyuk Yeom","doi":"10.1109/FTDCS.2008.24","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.24","url":null,"abstract":"Service-Oriented Architecture (SOA) is a conceptual architecture that was proposed for supporting service-oriented computing. To obtain a successful design and development of service-oriented software, an architectural view model to represent and document various aspects of service-oriented software based on the SOA conceptual template is required. Various architectural view models have been proposed to support the design and development of objectoriented and component-based software, e.g., the 4+1 view model and Soni's architecture. However, research and academic literature on architectural approaches for service-oriented software are still scarce. We propose a practical and simple architectural view model focused on the design and development of service-oriented software called BCD, which consists of a Business analysis view, a service Composition view, and a service Design view. Using the BCD architectural view model, stakeholders in service-oriented software design and development can reduce development, communication, and maintenance costs, and improve product quality. Our view can also improve the efficiency of the design and development of service-oriented software by providing defined templates.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122681511","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":"GSON: A Group Based Hierarchically Structured Overlay Network","authors":"Rui Wang, Qinglin Zhu, D. Qian, Danfeng Zhu","doi":"10.1109/FTDCS.2008.10","DOIUrl":"https://doi.org/10.1109/FTDCS.2008.10","url":null,"abstract":"In a structured peer-to-peer (P2P) overlay network, the stability of the entire network will be greatly affected by simultaneous join-in and drop-out of large amount of nodes. Aiming at reducing the overhead of handling this activity, we propose a group-based hierarchically structured overlay network, GSON. GSON is also a structured P2P overlay network using distributed hash table (DHT). In GSON, nodes that are physically close to each other or under a common administrative control form a group by using a self-organizing protocol. Each group has a delegate to join the DHT on behalf of other nodes in the group. The information about the resource and membership is shared within the group. The delegate is responsible for passing information to all group members and publishing group resource to other groups. The resource of each group is mapped into the DHT. Simulation results show that GSON is more scalable, and can reach stable state more quickly than normal chord system under the circumstances that a large number of nodes joining and quitting the system simultaneously.","PeriodicalId":414800,"journal":{"name":"2008 12th IEEE International Workshop on Future Trends of Distributed Computing Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127951181","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}