{"title":"Implementing a CORBA/SNMP gateway with design patterns","authors":"Sun Wenhui, Liu Feng, L. Honghui, Chen Xudong","doi":"10.1109/PDCAT.2003.1236432","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236432","url":null,"abstract":"We describe the design of a CORBA/SNMP gateway framework by means of design patterns. Making use of design patterns can simplify the implementation of the CORBA/SNMP gateway. We propose a CORBA/SNMP gateway model for CORBA-based network management. The CORBA/SNMP gateway manages interactions between CORBA applications and SNMP agents. We give the CORBA/SNMP gateway architecture which is gotten from JIDM working group for CORBA/TMN internetworking. Some design patterns are utilized to implement the CORBA/SNMP gateway.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123680555","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}
Younho Lee, Heeyoul Kim, Byungchun Chung, Jaewon Lee, H. Yoon
{"title":"On-demand secure routing protocol for ad hoc network using ID based cryptosystem","authors":"Younho Lee, Heeyoul Kim, Byungchun Chung, Jaewon Lee, H. Yoon","doi":"10.1109/PDCAT.2003.1236290","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236290","url":null,"abstract":"A routing protocol that is appropriate for an ad hoc network is needed. But research into routing protocols for ad hoc networks so far have mainly targeted efficiency and assume a trusted environment. But these protocols are not well operated in the networks that adversaries exist in. We propose a new on-demand secure routing protocol for ad hoc networks using an ID based cryptosystem. Our protocol can authenticate all nodes in the routing path with less network resource consumption than previous secure routing protocols. And our protocol does not need the fixed infrastructure without unrealistic assumptions because of using an ID based cryptosystem.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124300733","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 quorum-based distributed algorithm for group mutual exclusion","authors":"Mie Toyomura, S. Kamei, H. Kakugawa","doi":"10.1109/PDCAT.2003.1236404","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236404","url":null,"abstract":"The group mutual exclusion problem is a variant of mutual exclusion problem in a sense that only the same group of processes can enter their critical section simultaneously. We propose a quorum-based distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. The message complexity of our algorithm is O(/spl bsol/Q/spl bsol/) in the best case and O(n/spl bsol/Q/spl bsol/) in the worst case, where /spl bsol/Q/spl bsol/ is a quorum size that the algorithm adopts, and n is the number of processes that make requests for resources.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124044622","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":"On a new queue backoff fair algorithm for ad hoc networks","authors":"Chuanxia Wu, J. Feng, P. Fan","doi":"10.1109/PDCAT.2003.1236317","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236317","url":null,"abstract":"The medium access control (MAC) protocol through which mobile nodes can share a common broadcast channel is essential in ad hoc networks. Due to the existence of hidden terminals and multihop feature of ad hoc networks, contention among nodes is not homogeneous. Some nodes are at a disadvantage in access to the shared channel and suffer severe throughput degradation when load to channel is high. This is known as the \"fairness problem\". A new simple yet effective queue backoff fair algorithm is proposed. To quantify the degree of the fairness effect of the algorithm, an improved fairness index (IFI) is also defined. Based on IFI, the goal of achieving channel access fairness relative to effective aggregate throughput becomes equivalent to minimizing the improved fairness index. Analysis and simulation results show that, by choosing appropriate parameters, the new algorithm achieve lower improved fairness index and consequently improve the fairness relative to effective aggregate throughput, compared with the IEEE 802.11 binary exponential backoff (BEB) algorithm and other algorithms.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126514970","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 design and implementation of automatic information classifying","authors":"Wang Lan-bo, Z. Tao, Fan Bing-bing","doi":"10.1109/PDCAT.2003.1236430","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236430","url":null,"abstract":"Information classifying and indexing are the most important services the information navigating system usually provides. One kind of automatic information classifying subsystem used in the internal information navigation system and its implementation is mentioned. The structure and implementation of its classifying subject dictionary is also touched. In the end, the indexing method to the data which is manipulated by the automatic information classifying system is also provided.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125733266","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":"Study on the AS relationship based inter-domain routing","authors":"Ruijun Wang, Hongjun Wang, Cuirong Wang, Yuan Gao","doi":"10.1109/PDCAT.2003.1236255","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236255","url":null,"abstract":"The border gateway protocol (BGP) is the de facto inter-domain routing protocol in the global Internet. L. Gao et al. (2000) proposes a set of guidelines in setting routing policies for autonomous systems (AS) to guarantee route convergence. However, BGP-4 lacks the ability to describe relationships between ASes, which makes it difficult to implement these guidelines. We introduce two new attributes into the inter-domain routing protocol. One is used locally to identify relationships in each eBGP session. The other is a transitive attribute, which is used to identify backup links. We also propose a hierarchical structure violation detection algorithm. An implementation was presented based on the zebra routing software. This design makes it possible that local routing policies can be checked independently and systematically. Comparing with the Internet routing registry R. Govindan et al. (1999) and the simple routing registry L. Gao et al. (2000), we argue that our approach requires a minimal degree of global coordination.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125755576","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 extension of the dual De Casteljau algorithm","authors":"R. Ding, Y. Zhang","doi":"10.1109/PDCAT.2003.1236392","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236392","url":null,"abstract":"Ruled surface design and its applications are widely used in CAGD (computer aided geometric design) and industrial areas. The dual De Casteljau algorithm [K. Sprott et. al., (1997)] is for drawing ruled surfaces. However, it cannot draw any type of ruled surfaces. Here, the algorithm is extended to draw the hyperboloid which could be indefinite if it is drawn by the initial algorithm. The dual characteristics of ruled surfaces created by using the dual method are investigated. The special displacement method of the rulings with two parallel control screws is also discussed. The extension of the dual De Casteljau algorithm has shown the wider usage of the dual approach for drawing ruled surfaces.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127916857","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 practical example of XML semantics","authors":"Y. Kotb, K. Gondow, T. Katayama","doi":"10.1109/PDCAT.2003.1236276","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236276","url":null,"abstract":"We describe a case study applying XML semantics approach to specify the consistency of holy books published in XML format. The goal of the study was to understand the application of XML semantics in a problem domain that is appropriated for the method, and to determine some of the strengths of XML semantics in this domain. The case study uses a new specification language for XML semantics (SLXS) that is employed to specify semantic rules. These semantic rules associated with the holy books, which are written in XML format, to check the variant semantic consistency problems that exist inside these holy books.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132320913","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 collaborative location model for mobile position estimation","authors":"P. Deng, Lin Liu, P. Fan","doi":"10.1109/PDCAT.2003.1236323","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236323","url":null,"abstract":"In cellular networks, several TDOA (time difference of arrival) location algorithms can be applied to mobile position estimation, however, each algorithm has its own limitations and none of them is proved to be the most reliable one under different channel environments. Kleine-Ostmann's data fusion model [T. Kleine-Ostmann et al. (2001)] is modified and a collaborative location model which incorporate position estimate of two major TDOA location algorithms is proposed. It is shown by analysis and simulation that more reliable and accurate estimated mobile position can be achieved based on this model.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134300560","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":"Security issues in National High Performance Computing Environment","authors":"Wang Jianbo, He Dake, Yang Shuyuan","doi":"10.1109/PDCAT.2003.1236294","DOIUrl":"https://doi.org/10.1109/PDCAT.2003.1236294","url":null,"abstract":"We present some practical security issues related to the National High Performance Computing Environment (NHPCE), the computational grid. Based on the security requirements of NHPCE we discuss some existing distributed security technologies and point out why they are not enough. Then the key issues of NHPCE and corresponding solutions to these problems are analyzed. Lastly we put forward our final solution.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129393177","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}