{"title":"Research on Grid Resource Discovery Mechanism Based on Mobile Agent","authors":"Tian Miao, Jiang Bo","doi":"10.1109/NPC.2007.189","DOIUrl":"https://doi.org/10.1109/NPC.2007.189","url":null,"abstract":"This paper proposes a kind of grid resource discovery model which is compartmentalized into three layers including ordinary node layer, super node layer and directory node layer, in order to reduce network traffic and enhance communications efficiency. In this model, mobile Agent is used to carry on the interaction between two layers. On the super node layer and the directory node layer, LDAP directory servers acts as a unified interface of the grid information's storage and access, and the metadata of ontology's concept cluster is used to describe the node information in the leaf nodes of the LDAP directory server. Thus, by using the LDAP directory structure, the ontology is introduced and a semantic grid of spatial information is constructed in order to enhance the intelligence of the grid resource discovery and obtain a better result. At last, resources' registration process in the LDAP server and the step of resource discovery is described.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116548939","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 Link Evaluation Model Based on Gauss Distribution for Wireless Sensor Networks","authors":"Sun Pei-gang, Xu Jiu-qiang, Zhao Hai, Zhang Xi-yuan, Zhu Jian, Zhu Si-yuan","doi":"10.1109/NPC.2007.151","DOIUrl":"https://doi.org/10.1109/NPC.2007.151","url":null,"abstract":"Communication link evaluation plays an important role in the design of upper layer protocols for wireless sensor networks. The paper firstly investigates the existing typical link evaluation metrics in wireless sensor networks based on the platform ofMicaZ, then takes packet reception rate as the evaluation metric to experimentally study the characteristics of communication link, and according to the statistic analysis of large amount of sampling values, a link evaluation model based on Gauss distribution is brought forward and validated by the tests. This research is expansible, therefore, the established link evaluation model can provide guidance for application, and also can provide valuable references for the simulation research of upper layer protocols.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"3103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127469575","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 New Chaos Encryption Algorithm Based on Parameter Randomly Changing","authors":"X. Tong, M. Cui","doi":"10.1109/NPC.2007.65","DOIUrl":"https://doi.org/10.1109/NPC.2007.65","url":null,"abstract":"The paper proposed a new encryption algorithm of one dimension chaotic map, which based on parameter randomly changing. Through the randomly changing of parameter and iteration times, the complicated degree of chaotic sequences and cryptographic specific property are strengthened, and improved algorithm has n times long cycle compared to original function. Theory analysis to the mapping is well-distributed, and self-correlation and mutual-correlation is also good property. Through encryption test, it shows that new algorithm has high security , is realized easily ,and the encryption speed is very fast.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127445017","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}
XU Kai-ping, Wang Qi, Hong Pei-lin, Lu Han-cheng, Hu Ming-xiu
{"title":"A Conceptual Incentive Mechanism of P2P File Sharing Systems Based on Game Theory","authors":"XU Kai-ping, Wang Qi, Hong Pei-lin, Lu Han-cheng, Hu Ming-xiu","doi":"10.1109/NPC.2007.22","DOIUrl":"https://doi.org/10.1109/NPC.2007.22","url":null,"abstract":"Selfish adaptive peers are widespread in Peer to Peer(P2P) file sharing systems, whose actions greatly reduce the system's performance. So how to maintain significant levels of cooperation to encourage collaborative is an important aspect of P2P research. In this paper, the cooperation models of P2P file sharing systems are constructed based on the Prisoner's Dilemma Game (PDG) and the Snowdrift Game (SG), which add a new viewpoint to P2P file sharing systems understanding. In particular, the performances of the two models are investigated in three aspects: the frequency of cooperation, the equilibrium-time, and the full completion time, which indicate that both the PDG and the SG can effectively motive cooperation against free riding. In addition, the SG performs better than the PDG in promoting peers to share what they have, which suggests theoretic guidelines to design a good incentive mechanism in the future.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127456759","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 Secure Ring Signcryption Scheme for Private and Anonymous Communication","authors":"Ling-ling Wang, Guoyin Zhang, Chunguang Ma","doi":"10.1109/NPC.2007.8","DOIUrl":"https://doi.org/10.1109/NPC.2007.8","url":null,"abstract":"We present a new model of verifiable certificateless ring signcryption schemes (VCRSS). We argue that it is an important cryptographic primitive for private and anonymous communication. We also propose an efficient VCRSS scheme based on bilinear pairing. In anonymous communications, our scheme allows the message sender to send the message anonymously, while the confidentiality and authenticity of the message are realized at the same time. If necessary, the real sender can prove his/her identity. Since the previous constructions of ring signcryption rely on the identity-based cryptology, key escrow problem is inevitable. We show that in our new scheme, the problem of key escrow is eliminated. We also prove that our scheme is secure in random oracle model.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126631045","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":"Network Traffic Emulation for IDS Evaluation","authors":"Wang Yang, J. Gong, W. Ding, Xiong Wu","doi":"10.1109/NPC.2007.125","DOIUrl":"https://doi.org/10.1109/NPC.2007.125","url":null,"abstract":"The network traffic emulation is used in generating background traffic for IDSs evaluation. The Background traffic can be used to evaluate the false positive level and the performance of the misuse IDSs and help training normal behavior profiles for anomaly IDSs. Currently the emulation methods for the background traffic are either restricted by the performance bottleneck of the software and hardware, or lack of the semantic of flow and session. So they can 't satisfy the IDS evaluation requirement in highspeed network environment. After analyzing the requirement of IDSs evaluation and the characteristics of network traffic, this paper proposes a differential equation model of active flow rate. Based on the equation, a structural simulation model of network flow is constructed and used in the network traffic emulation for IDS evaluation. This model is both simple for high performance and similar to the reality. The experiments show that the model proposed can generate traffic both realistic and controllable.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114952914","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":"Stream Data Management Based on Integration of a Stream Processing Engine and Databases","authors":"H. Kitagawa, Y. Watanabe","doi":"10.1109/NPC.2007.171","DOIUrl":"https://doi.org/10.1109/NPC.2007.171","url":null,"abstract":"Developments in network and sensor device technologies enable us to easily obtain real-world information, such as locations of moving objects, weather information, news, and stock prices. These data are continuously supplied, and they are regarded as data streams. Because of the dramatical increase of streaming data, their management and utilization has become more and more important. This paper describes a data stream management system named Harmonica. Harmonica employs an architecture combining our stream processing engine named stream-spinner and relational DBMSs. Based on the architecture, the system processes both continuous queries and traditional one-shot queries. Moreover, Harmonica supports continuous persistence requirements for streaming data as well as queries including selection, join, projection, and user-defined functions over data streams. Users can also specify continuous queries that integrate streaming data and persistent data stored in databases. Using the Harmonica API, users can develop a variety of applications coping with different continuous steaming data and data stored in databases. Our system can be deployed in network environments to achieve efficient and dependable distributed stream processing.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115099861","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":"Sharing Software Resources with Floating License In Grid Environment","authors":"Wei Fu, Nong Xiao, Xicheng Lu","doi":"10.1109/NPC.2007.12","DOIUrl":"https://doi.org/10.1109/NPC.2007.12","url":null,"abstract":"Software resources are always important and expensive for users. Sharing existing software resources and paying for their usages become big challenges in grid environment. While existing license management systems are only suitable for LAN environment, a novel grid middleware, named LicTraveler, is developed for global license sharing across various domains. The two-leveled hierarchical architecture allows both autonomous local service and cooperative global service. It provides strong security and flexible reservation & quota policies for licensing activities. Flexible license distributing and scheduling policies are also provided. Experiments show that LicTraveler helps corporations reducing their redundant investments and promoting license efficiencies as much as 50%.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122412115","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 Digital Signature Schemes Without Using One-way Hash and Message Redundancy and Its Application on Key Agreement","authors":"Hua Zhang, Zheng Yuan, Q. Wen","doi":"10.1109/NPC.2007.78","DOIUrl":"https://doi.org/10.1109/NPC.2007.78","url":null,"abstract":"Digital signature schemes based on public-key cryptosystems are important building blocks of key agreement protocols. They are vulnerable by existential forgery attack. A usual method to prevent existential forgery attack is on-way hash function and message redundancy. In 2004, Chang and Chang proposed a new digital signature scheme. The scheme is without using one-way hash function and any redundancy padding, which is very interesting to many designers. Recently, Chien found an existential forgery attack. In this paper, we show another forgery attack on it and propose an improved scheme without oracle, which is secure against existential forgery attacks. Then we proposed a key agreement protocol by amending the signature slightly.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121865311","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":"Distributed collaborating system design via electronic institutional calculus","authors":"G. Cai, Ji Gao, Junyan Qian, Lingzhong Zhao","doi":"10.1109/NPC.2007.69","DOIUrl":"https://doi.org/10.1109/NPC.2007.69","url":null,"abstract":"Developing distributed collaboration system is still a challenge work in an open and heterogeneous environment. The paper proposes to design distributed collaboration system starting from electronic institutional model. Software architecture is designed directly based on electronic institution. The main architectural element is a scene manager. An electronic institution oriented calculus language is presented to specify the complex interaction patterns appearing in architectural design level. Through the formal defined operational semantic rules, some system norms can be verified in the designed architectural specification. A proof of concept implementation has been working out. The experience shows a lot of advantages in this approach when developing such type of interaction complicated systems in open environments.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"323 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121926656","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}