Pub Date : 2004-03-29DOI: 10.1109/AINA.2004.1283812
Tzung-Shi Chen, Kuo-Lian Chen
With the rapid growth of information stored in worldwide Web servers, searching and capturing data on Internet become a common behavior for us. In order to increase the availability as well as avoid the overload of the single Web server, using Web server cluster is one of main solutions. We take the contents/services types into consideration for balancing workload of Web servers. For different contents requested by clients, the workload for each Web server would be different. Hereby, we focus on proposing a new load balance algorithm for supporting fast response and load balancing for scalable Web server clusters. In addition, we demonstrate our simulation experiments to show that our proposed approach, as compared to existing approaches. This proposed approach can be applied to various applications, especially for resolving e-learning systems with needs of a great deal of requests with different service types simultaneously issued by worldwide users.
{"title":"Balancing workload based on content types for scalable Web server clusters","authors":"Tzung-Shi Chen, Kuo-Lian Chen","doi":"10.1109/AINA.2004.1283812","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283812","url":null,"abstract":"With the rapid growth of information stored in worldwide Web servers, searching and capturing data on Internet become a common behavior for us. In order to increase the availability as well as avoid the overload of the single Web server, using Web server cluster is one of main solutions. We take the contents/services types into consideration for balancing workload of Web servers. For different contents requested by clients, the workload for each Web server would be different. Hereby, we focus on proposing a new load balance algorithm for supporting fast response and load balancing for scalable Web server clusters. In addition, we demonstrate our simulation experiments to show that our proposed approach, as compared to existing approaches. This proposed approach can be applied to various applications, especially for resolving e-learning systems with needs of a great deal of requests with different service types simultaneously issued by worldwide users.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129448550","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283977
Tim Schattkowsky, C. Loeser, Wolfgang Müller
The interconnection of software components is a key to enabling collaborative work. However, technology differences and security barriers like firewalls often hinder establishing collaborative infrastructures between enterprises or even within a single enterprise. We introduce a peer-to-peer based network infrastructure that transparently overcomes these problems using relay and routing mechanisms as well as different underlying transport protocols. We discuss the application of this technology to interconnect Web services.
{"title":"Peer-to-peer technology for interconnecting Web services in heterogeneous networks","authors":"Tim Schattkowsky, C. Loeser, Wolfgang Müller","doi":"10.1109/AINA.2004.1283977","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283977","url":null,"abstract":"The interconnection of software components is a key to enabling collaborative work. However, technology differences and security barriers like firewalls often hinder establishing collaborative infrastructures between enterprises or even within a single enterprise. We introduce a peer-to-peer based network infrastructure that transparently overcomes these problems using relay and routing mechanisms as well as different underlying transport protocols. We discuss the application of this technology to interconnect Web services.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126846215","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283982
Yu Lung Wu, T. Chan, B. Jong, T. Lin, Y. Liang
This paper suggests the solution to build a full virtual reality learning environment, and we have built both virtual and real laboratories on the Web, in which students practice their experiments as in a conventional one. In our system, the experiment may be undertaken by a single student or by many students cooperating via networks. We have developed many teaching materials and tools to support experimental operations in a distance-learning environment. Our study suggests a virtual-reality laboratory which is an effective way for experimental operations to be carried out on the Web. It is a good experience for us to integrate both virtual reality and cooperative learning for education.
{"title":"A Web-based dual mode virtual laboratory supporting cooperative learning","authors":"Yu Lung Wu, T. Chan, B. Jong, T. Lin, Y. Liang","doi":"10.1109/AINA.2004.1283982","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283982","url":null,"abstract":"This paper suggests the solution to build a full virtual reality learning environment, and we have built both virtual and real laboratories on the Web, in which students practice their experiments as in a conventional one. In our system, the experiment may be undertaken by a single student or by many students cooperating via networks. We have developed many teaching materials and tools to support experimental operations in a distance-learning environment. Our study suggests a virtual-reality laboratory which is an effective way for experimental operations to be carried out on the Web. It is a good experience for us to integrate both virtual reality and cooperative learning for education.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130680803","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283962
Jie Zhang, Henry C. B. Chan
This paper presents an auction system based on mobile agents. By using a proxy server, a user can generate a mobile auction agent by giving the bidding information, including the maximum bidding price. The agent then moves to the required server to participate in the auction according to the user's requirements. A major contribution of the paper is that it presents a mathematical model to analyze the commonly used "proxy bidding method." Based on the distribution of the maximum bidding price, the model can be used to find the probability of stopping at a certain price and, hence, the average winning price. Simulation and analytical results are presented to demonstrate the behavior of the system.
{"title":"A mathematical model for analyzing the proxy bidding method for mobile agent-based auction services","authors":"Jie Zhang, Henry C. B. Chan","doi":"10.1109/AINA.2004.1283962","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283962","url":null,"abstract":"This paper presents an auction system based on mobile agents. By using a proxy server, a user can generate a mobile auction agent by giving the bidding information, including the maximum bidding price. The agent then moves to the required server to participate in the auction according to the user's requirements. A major contribution of the paper is that it presents a mathematical model to analyze the commonly used \"proxy bidding method.\" Based on the distribution of the maximum bidding price, the model can be used to find the probability of stopping at a certain price and, hence, the average winning price. Simulation and analytical results are presented to demonstrate the behavior of the system.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123904570","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 : 2004-03-29DOI: 10.1142/S0219265904001180
M. M. Deris, B. Nathrah, M. Suzuri, M. Osman
Replication is an important technique in peer-to-peer environment, where it increases data availability and accessibility to users despite site or communication failure. However, determining the number of replication and where to replicate the data are the major issues. This paper proposes a hybrid replication model for fixed and ad hoc network in order to achieve high data availability. For the fixed network, a data will be replicated synchronously in a diagonal manner of logical grid structure, while for the ad hoc network, a data will be replicated asynchronously based on commonly visited sites for each user. In comparison to the grid structure technique, diagonal replication technique (DRG) on fixed network requires lower communication cost for an operation, while providing higher data availability, which is preferred for large systems.
{"title":"Improving data availability using hybrid replication technique in peer-to-peer environments","authors":"M. M. Deris, B. Nathrah, M. Suzuri, M. Osman","doi":"10.1142/S0219265904001180","DOIUrl":"https://doi.org/10.1142/S0219265904001180","url":null,"abstract":"Replication is an important technique in peer-to-peer environment, where it increases data availability and accessibility to users despite site or communication failure. However, determining the number of replication and where to replicate the data are the major issues. This paper proposes a hybrid replication model for fixed and ad hoc network in order to achieve high data availability. For the fixed network, a data will be replicated synchronously in a diagonal manner of logical grid structure, while for the ad hoc network, a data will be replicated asynchronously based on commonly visited sites for each user. In comparison to the grid structure technique, diagonal replication technique (DRG) on fixed network requires lower communication cost for an operation, while providing higher data availability, which is preferred for large systems.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121704265","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}
In a server-proxy-client 3-tier architecture of the wireless mobile network, proxies should be dynamically assigned to serve mobile hosts according to geographical dependency and the network situation. The goal of proxy handoff is to allow a mobile host still can receive packets from the corresponding server even though its served proxy is switched from the current one to the other one. A 3-tier multimedia mobile transmission platform, called MMTP, is proposed to solve the proxy handoff problem in the IPv6-based wireless mobile network. In MMTP, a proxy handoff scheme, which is based on the application layer anycast technique, is proposed to select from a number of candidate proxies according to the load balance concern and wireless network situation concern.
{"title":"A location-aware layer 7 proxy handoff mechanism over the mobile network environment","authors":"Chung-Ming Huang, Chao-Hsien Lee, Chung-Yi Lai, Yuan-Tse Yu","doi":"10.1109/AINA.2004.1283802","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283802","url":null,"abstract":"In a server-proxy-client 3-tier architecture of the wireless mobile network, proxies should be dynamically assigned to serve mobile hosts according to geographical dependency and the network situation. The goal of proxy handoff is to allow a mobile host still can receive packets from the corresponding server even though its served proxy is switched from the current one to the other one. A 3-tier multimedia mobile transmission platform, called MMTP, is proposed to solve the proxy handoff problem in the IPv6-based wireless mobile network. In MMTP, a proxy handoff scheme, which is based on the application layer anycast technique, is proposed to select from a number of candidate proxies according to the load balance concern and wireless network situation concern.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126473088","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283848
S. Chan, J. K. Shiu
We describe the development of Metaria, a Web metasearch engine designed to provide flexible and adaptive Web metasearching in mobile environments. Metaria employs an adaptive Web proxy system that allows more efficient metasearching and allows users to specify their information needs in detail, reducing the excessive cost of retrieving irrelevant data and metasearch results. By automatically detecting the capabilities and the contextual information of client devices, Metaria can also reformat the presentation of metasearch results to best suit the limitations of the client devices or the user's preferences. It can further improve the efficiency of metasearching by automatically transferring the metasearch results to clients.
{"title":"Web metasearching for mobile environment using Metaria","authors":"S. Chan, J. K. Shiu","doi":"10.1109/AINA.2004.1283848","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283848","url":null,"abstract":"We describe the development of Metaria, a Web metasearch engine designed to provide flexible and adaptive Web metasearching in mobile environments. Metaria employs an adaptive Web proxy system that allows more efficient metasearching and allows users to specify their information needs in detail, reducing the excessive cost of retrieving irrelevant data and metasearch results. By automatically detecting the capabilities and the contextual information of client devices, Metaria can also reformat the presentation of metasearch results to best suit the limitations of the client devices or the user's preferences. It can further improve the efficiency of metasearching by automatically transferring the metasearch results to clients.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126494780","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283778
S. Ueda, N. Kawaguchi, H. Shigeno, Ken-ichi Okada
We propose a streaming authentication scheme for the use over the IP telephony. To clear the strict real-time transmission requirements of the IP telephony, the latency and interval between signatures are adjusted dynamically according to the transmission quality of the network. This provides efficient signing and continuous authentication during real-time streaming. We show our scheme's advantages over previously proposed schemes by comparing delay on the sender and receiver side, and tolerance to packet loss.
{"title":"Stream authentication scheme for the use over the IP telephony","authors":"S. Ueda, N. Kawaguchi, H. Shigeno, Ken-ichi Okada","doi":"10.1109/AINA.2004.1283778","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283778","url":null,"abstract":"We propose a streaming authentication scheme for the use over the IP telephony. To clear the strict real-time transmission requirements of the IP telephony, the latency and interval between signatures are adjusted dynamically according to the transmission quality of the network. This provides efficient signing and continuous authentication during real-time streaming. We show our scheme's advantages over previously proposed schemes by comparing delay on the sender and receiver side, and tolerance to packet loss.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132402026","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283926
T. Enokido, M. Takizawa
We discuss a group protocol which supports applications with group communication service in change of QoS supported by networks and required by applications. An autonomic group protocol is realized by cooperation of multiple autonomous agents. Each agent autonomously takes a class of each protocol junction. Classes taken by an agent are required to be consistent with but might be different from the others. A group is composed of views. Each view is a subset of the agents where the agents autonomously take protocol classes consistent with each other. We make clear what combination of classes can be autonomously taken by agents in a view. We also present how to autonomously change retransmission ways.
{"title":"An autonomic group communication","authors":"T. Enokido, M. Takizawa","doi":"10.1109/AINA.2004.1283926","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283926","url":null,"abstract":"We discuss a group protocol which supports applications with group communication service in change of QoS supported by networks and required by applications. An autonomic group protocol is realized by cooperation of multiple autonomous agents. Each agent autonomously takes a class of each protocol junction. Classes taken by an agent are required to be consistent with but might be different from the others. A group is composed of views. Each view is a subset of the agents where the agents autonomously take protocol classes consistent with each other. We make clear what combination of classes can be autonomously taken by agents in a view. We also present how to autonomously change retransmission ways.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134110708","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283762
Hideaki Asahi, Kazuo Takahata, Y. Shibata
So far, we have developed effective wide area disaster information network (WDN) using Internet over the combination of both wired and wireless network. In this information network, two important functions including resident safety information system and bidirectional video communication system between evacuation places and disaster information center are provided. However, in this WDM, system failure of network and computing facilities by disaster was not considered. In order to recover the information system as soon as possible from the system failure, network protocol has to deal with those requirements. We introduce Wireless Recovery Protocol (WRP) to temporally recover WDM with minimum configuration as soon as possible even though some of network and computing facilities were damaged by disaster, using network management and GPS functions. The design and implementation of the WRP is precisely described. The prototype system and its hardware and software environment to evaluate its functionality are also precisely described.
{"title":"Recovery protocol for dynamic network reconstruction on disaster information system","authors":"Hideaki Asahi, Kazuo Takahata, Y. Shibata","doi":"10.1109/AINA.2004.1283762","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283762","url":null,"abstract":"So far, we have developed effective wide area disaster information network (WDN) using Internet over the combination of both wired and wireless network. In this information network, two important functions including resident safety information system and bidirectional video communication system between evacuation places and disaster information center are provided. However, in this WDM, system failure of network and computing facilities by disaster was not considered. In order to recover the information system as soon as possible from the system failure, network protocol has to deal with those requirements. We introduce Wireless Recovery Protocol (WRP) to temporally recover WDM with minimum configuration as soon as possible even though some of network and computing facilities were damaged by disaster, using network management and GPS functions. The design and implementation of the WRP is precisely described. The prototype system and its hardware and software environment to evaluate its functionality are also precisely described.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134157889","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
扫码关注我们
求助内容：
应助结果提醒方式：