Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030850
Aloke Mukherjee, B. Esfandiari, Neal Arthorne
A simple method is proposed for peer-to-peer description and discovery of resource-sharing communities as well as the resources themselves. An XML Schema document describes a shared resource. By applying transformations, specified in XSL, the schema is used to generate an application with the ability to publish and search for the defined object. Meta-data is indexed and searchable allowing complex objects to be discovered. We propose to solve the problem of discovery for resource-sharing communities by treating a community as a shared resource. An XML Schema description of resource-sharing communities is used to generate a P2P system for community discovery.
{"title":"U-P2P: a peer-to-peer system for description and discovery of resource-sharing communities","authors":"Aloke Mukherjee, B. Esfandiari, Neal Arthorne","doi":"10.1109/ICDCSW.2002.1030850","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030850","url":null,"abstract":"A simple method is proposed for peer-to-peer description and discovery of resource-sharing communities as well as the resources themselves. An XML Schema document describes a shared resource. By applying transformations, specified in XSL, the schema is used to generate an application with the ability to publish and search for the defined object. Meta-data is indexed and searchable allowing complex objects to be discovered. We propose to solve the problem of discovery for resource-sharing communities by treating a community as a shared resource. An XML Schema description of resource-sharing communities is used to generate a P2P system for community discovery.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115730918","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030751
J. Funasaka, K. Ishida, K. Amano, Yukiyoshi Jutori
Internet auctions have got attention with the sensational diffusion of the Internet, because we are able to trade various goods for a desirable price. Many Internet auctions adopt the English auction The English auction is the mechanism to settle a successful bidder Conventional Internet auction systems are using one logical server called an auction server that is constructed with one or several servers. So, if simultaneous bids occur, the load of the auction server increases. Besides, when congestion at circumference of the auction server occurs, the response time will increase. We propose a new Internet auction method using decentralized selection servers which will reduce superfluous information derived from bidders. The proposed method tends to hold down the increase of the response time by lightening the processing load at an auction server and cutting down congestion around the auction server In order to evaluate the proposed method concisely, we assume a typical auction service and a network. We evaluate the proposed and the conventional methods by simulation experiments using a network simulator OPNET Modeler Consequently, it is shown that the proposed method is more scalable and can be deployed with smaller cost.
{"title":"An Internet auction method using decentralized selection servers","authors":"J. Funasaka, K. Ishida, K. Amano, Yukiyoshi Jutori","doi":"10.1109/ICDCSW.2002.1030751","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030751","url":null,"abstract":"Internet auctions have got attention with the sensational diffusion of the Internet, because we are able to trade various goods for a desirable price. Many Internet auctions adopt the English auction The English auction is the mechanism to settle a successful bidder Conventional Internet auction systems are using one logical server called an auction server that is constructed with one or several servers. So, if simultaneous bids occur, the load of the auction server increases. Besides, when congestion at circumference of the auction server occurs, the response time will increase. We propose a new Internet auction method using decentralized selection servers which will reduce superfluous information derived from bidders. The proposed method tends to hold down the increase of the response time by lightening the processing load at an auction server and cutting down congestion around the auction server In order to evaluate the proposed method concisely, we assume a typical auction service and a network. We evaluate the proposed and the conventional methods by simulation experiments using a network simulator OPNET Modeler Consequently, it is shown that the proposed method is more scalable and can be deployed with smaller cost.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124322661","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030828
E. D. Nitto, M. Pianciamore
In the last few years the event-based paradigm has been largely studied and considered as a promising approach to develop the communication infrastructure of distributed systems. It is particularly interesting when easy reconfiguration and decoupling among components is required. In fact, it allows events to be propagated in a way that is completely hidden to the component that has generated them as well as to the receivers. As a consequence, a component can operate in the system without being aware of the existence of other components. Also, it is always possible to plug a component in and out of the architecture without affecting the other components directly. These two effects guarantee a high compositionality and reconfigurability of a software architecture. In the context of this paper we report our experience in exploiting the event-based paradigm to develop an e-commerce platform called OPELIX.
{"title":"Exploiting an event-based system to develop a distributed e-commerce infrastructure","authors":"E. D. Nitto, M. Pianciamore","doi":"10.1109/ICDCSW.2002.1030828","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030828","url":null,"abstract":"In the last few years the event-based paradigm has been largely studied and considered as a promising approach to develop the communication infrastructure of distributed systems. It is particularly interesting when easy reconfiguration and decoupling among components is required. In fact, it allows events to be propagated in a way that is completely hidden to the component that has generated them as well as to the receivers. As a consequence, a component can operate in the system without being aware of the existence of other components. Also, it is always possible to plug a component in and out of the architecture without affecting the other components directly. These two effects guarantee a high compositionality and reconfigurability of a software architecture. In the context of this paper we report our experience in exploiting the event-based paradigm to develop an e-commerce platform called OPELIX.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"33 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125042968","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030843
W. Vogels, Christopher Ré, R. V. Renesse, K. Birman
In this paper we describe the model used for the NewsWire collaborative content delivery system. The system builds on the robustness and scalability of Astrolabe to weave a peer-to-peer infrastructure for real time delivery of news items. The goal of the system is to deliver news updates to hundreds of thousands of subscribers within tens of seconds of the moment of publishing. The system significantly reduces the compute and network load at the publishers and guarantees delivery even in the face of publisher overload or denial of service attacks.
{"title":"A collaborative infrastructure for scalable and robust news delivery","authors":"W. Vogels, Christopher Ré, R. V. Renesse, K. Birman","doi":"10.1109/ICDCSW.2002.1030843","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030843","url":null,"abstract":"In this paper we describe the model used for the NewsWire collaborative content delivery system. The system builds on the robustness and scalability of Astrolabe to weave a peer-to-peer infrastructure for real time delivery of news items. The goal of the system is to deliver news updates to hundreds of thousands of subscribers within tens of seconds of the moment of publishing. The system significantly reduces the compute and network load at the publishers and guarantees delivery even in the face of publisher overload or denial of service attacks.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128325903","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030774
B. Jong, T. Lin, W. Yang, Kun Shyan Jong
Combining virtual reality and network multimedia techniques in applications is becoming popular. 3D geometry models are used in such applications. It is difficult to build mathematical models manually, but reverse engineering for building such models. Such a model is suitable for Internet transmission. However, there is still a bottleneck in using reverse engineering to reconstruct a relationship between vertices. The /spl alpha/-Shapes is an old method used for this purpose, and we propose methods to improve its efficiency. Our method can generate a compact model, and the average storage space required by our method is about half that of the original method. The advantage of our method is not the storage space but also reconstruction time.
{"title":"An improved /spl alpha/-Shapes algorithm for geometric reconstruction","authors":"B. Jong, T. Lin, W. Yang, Kun Shyan Jong","doi":"10.1109/ICDCSW.2002.1030774","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030774","url":null,"abstract":"Combining virtual reality and network multimedia techniques in applications is becoming popular. 3D geometry models are used in such applications. It is difficult to build mathematical models manually, but reverse engineering for building such models. Such a model is suitable for Internet transmission. However, there is still a bottleneck in using reverse engineering to reconstruct a relationship between vertices. The /spl alpha/-Shapes is an old method used for this purpose, and we propose methods to improve its efficiency. Our method can generate a compact model, and the average storage space required by our method is about half that of the original method. The advantage of our method is not the storage space but also reconstruction time.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128260366","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030775
T. Kushida, Y. Shibata
A packet switched network such as the Internet provides only the best-effort service for users. Recent studies of the characteristics of packet arrival on a packet switched network have shown a self-similar property with long-range dependence, and also show a heavy-tailed distribution. This paper investigates end-to-end performance of the Internet empirically. It focuses on the inter-arrival process of packets and the property of packet loss between end-to-end hosts. We show that both the inter-arrival process and loss events are self-similar with a long-range dependence property. The inter-arrival process of packets has a heavy-tailed distribution which sums up the difference of all queues in intermediate routers.
{"title":"Empirical study of inter-arrival packet times and packet losses","authors":"T. Kushida, Y. Shibata","doi":"10.1109/ICDCSW.2002.1030775","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030775","url":null,"abstract":"A packet switched network such as the Internet provides only the best-effort service for users. Recent studies of the characteristics of packet arrival on a packet switched network have shown a self-similar property with long-range dependence, and also show a heavy-tailed distribution. This paper investigates end-to-end performance of the Internet empirically. It focuses on the inter-arrival process of packets and the property of packet loss between end-to-end hosts. We show that both the inter-arrival process and loss events are self-similar with a long-range dependence property. The inter-arrival process of packets has a heavy-tailed distribution which sums up the difference of all queues in intermediate routers.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132507301","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030780
W. Hsieh, Chuan-Fu Wu, Jeng-Yi Huang, Jyh-Long Lin, B. Sher
In this paper, a general concept called the n+k/n method is introduced. In the n+k/n method, a special mapping function is defined to map an intermediate set with n+k bits into a n bit information set. In the embedding process, the intermediate set is embedded into a cover image rather than embedding the information set. If the distance between features of the cover image and the bits of the intermediate set is less than that between the features and information bits, the better the cover image quality. According to the idea of the n+k/n method, a special case called the n+1/n method is proposed. In this method, the mapping function is an exclusive-or operation. When an information set is given, two sets which satisfy the mapping function can be obtained. That which has a smaller distance from feature bits is selected as an intermediate set. In the paper, it is proved that the maximum distance between the intermediate set and feature set is less than the average distance between the information set and the feature set. The reduction rate of feature modification for the n+1/n method will reach 25%, and the improving quality in the embedded cover image is more than 2.5 db.
{"title":"An efficient method to improve the quality of watermarked cover image","authors":"W. Hsieh, Chuan-Fu Wu, Jeng-Yi Huang, Jyh-Long Lin, B. Sher","doi":"10.1109/ICDCSW.2002.1030780","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030780","url":null,"abstract":"In this paper, a general concept called the n+k/n method is introduced. In the n+k/n method, a special mapping function is defined to map an intermediate set with n+k bits into a n bit information set. In the embedding process, the intermediate set is embedded into a cover image rather than embedding the information set. If the distance between features of the cover image and the bits of the intermediate set is less than that between the features and information bits, the better the cover image quality. According to the idea of the n+k/n method, a special case called the n+1/n method is proposed. In this method, the mapping function is an exclusive-or operation. When an information set is given, two sets which satisfy the mapping function can be obtained. That which has a smaller distance from feature bits is selected as an intermediate set. In the paper, it is proved that the maximum distance between the intermediate set and feature set is less than the average distance between the information set and the feature set. The reduction rate of feature modification for the n+1/n method will reach 25%, and the improving quality in the embedded cover image is more than 2.5 db.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125409923","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030813
E. Kasten, P. McKinley, S. M. Sadjadi, R. Stirewalt
Many middleware platforms use computational reflection to support adaptive functionality. Most approaches intertwine the activity of observing behavior (introspection) with the activity of changing behavior (intercession). This paper explores the use of language constructs to separate these parts of reflective functionality. This separation and "packaging" of reflective primitives is intended to facilitate the design of correct and consistent adaptive middleware. A prototype language, called Adaptive Java, is described in which this functionality is realized through extensions to the Java programming language. A case study is described in which "metamorphic" socket components are created from regular socket classes and used to realize adaptive behavior on wireless network connections.
{"title":"Separating introspection and intercession to support metamorphic distributed systems","authors":"E. Kasten, P. McKinley, S. M. Sadjadi, R. Stirewalt","doi":"10.1109/ICDCSW.2002.1030813","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030813","url":null,"abstract":"Many middleware platforms use computational reflection to support adaptive functionality. Most approaches intertwine the activity of observing behavior (introspection) with the activity of changing behavior (intercession). This paper explores the use of language constructs to separate these parts of reflective functionality. This separation and \"packaging\" of reflective primitives is intended to facilitate the design of correct and consistent adaptive middleware. A prototype language, called Adaptive Java, is described in which this functionality is realized through extensions to the Java programming language. A case study is described in which \"metamorphic\" socket components are created from regular socket classes and used to realize adaptive behavior on wireless network connections.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121312176","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030831
M. Bauer, K. Rothermel
In this paper the event concept is applied to support the interaction between mobile users and distributed location-aware systems. Taking a number of examples, the components of an event specification language are derived that can be used beyond the domain of location-aware systems.
{"title":"Towards the observation of spatial events in distributed location-aware systems","authors":"M. Bauer, K. Rothermel","doi":"10.1109/ICDCSW.2002.1030831","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030831","url":null,"abstract":"In this paper the event concept is applied to support the interaction between mobile users and distributed location-aware systems. Taking a number of examples, the components of an event specification language are derived that can be used beyond the domain of location-aware systems.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121424785","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}
Pub Date : 2002-07-02DOI: 10.1109/ICDCSW.2002.1030783
A. Miyakawa, M. Sugimoto, Mikako Hosokawa, Y. Shibata
In this paper we propose a user-friendly three-dimensional computer graphics (CG) presentation system for a typical traditional Japanese crafting industry based on agent and virtual reality functions over Japan gigabit network (JGN) which is a testbed for the high-speed backbone network with 2.4 Gbps. A large number of traditional Japanese fittings in a local city are redesigned by 3D computer graphics into CAD data and stored in the database servers distributed over JGN. Although each fitting data consists of more than several Mbytes size, the user can interactively retrieve the desired fittings and put them into the traditional Japanese interior to design more creative and original houses, hotels and other buildings in real-time. We present a prototype system using VRML and Java on networked CG workstations. The user can walk through the desired virtual space organized by various Japanese traditional fittings and interactively change those fittings by selecting from the database and replacing them by simple operations. As a result, our suggested system is useful not only for Japanese crafting but also for worldwide design industries.
{"title":"Interactive traditional Japanese crafting system using virtual reality technique over highspeed network","authors":"A. Miyakawa, M. Sugimoto, Mikako Hosokawa, Y. Shibata","doi":"10.1109/ICDCSW.2002.1030783","DOIUrl":"https://doi.org/10.1109/ICDCSW.2002.1030783","url":null,"abstract":"In this paper we propose a user-friendly three-dimensional computer graphics (CG) presentation system for a typical traditional Japanese crafting industry based on agent and virtual reality functions over Japan gigabit network (JGN) which is a testbed for the high-speed backbone network with 2.4 Gbps. A large number of traditional Japanese fittings in a local city are redesigned by 3D computer graphics into CAD data and stored in the database servers distributed over JGN. Although each fitting data consists of more than several Mbytes size, the user can interactively retrieve the desired fittings and put them into the traditional Japanese interior to design more creative and original houses, hotels and other buildings in real-time. We present a prototype system using VRML and Java on networked CG workstations. The user can walk through the desired virtual space organized by various Japanese traditional fittings and interactively change those fittings by selecting from the database and replacing them by simple operations. As a result, our suggested system is useful not only for Japanese crafting but also for worldwide design industries.","PeriodicalId":382808,"journal":{"name":"Proceedings 22nd International Conference on Distributed Computing Systems Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114176357","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
扫码关注我们
求助内容：
应助结果提醒方式：