Pub Date : 2003-03-27DOI: 10.1109/AINA.2003.1192930
Song Xiao, Fang Zhang, Chengke Wu, Yunsong Li, Y. Yan
A new revised multiple description SPIHT coding is proposed to combat packet loss. According to the region of interest of human eyes, the method reorders the zero trees of wavelets and assigns different coding rates to redundant trees. Simulation results show that the method can improve the image quality both objectively and subjectively compared to other multiple description coding methods in the case of packet loss.
{"title":"A new robust multiple description coding method based on region of interest","authors":"Song Xiao, Fang Zhang, Chengke Wu, Yunsong Li, Y. Yan","doi":"10.1109/AINA.2003.1192930","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192930","url":null,"abstract":"A new revised multiple description SPIHT coding is proposed to combat packet loss. According to the region of interest of human eyes, the method reorders the zero trees of wavelets and assigns different coding rates to redundant trees. Simulation results show that the method can improve the image quality both objectively and subjectively compared to other multiple description coding methods in the case of packet loss.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132784759","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192954
Song Fu, Z. Jin, Peipei Chen
This paper presents a RAte-based Multicast Protocol for lArge-scale Reliable Transport (RAMPART), which is designed to provide scalable, TCP-friendly and responsive reliable multicast transport service for applications of bulk-data transfer. We proposed a dual-bitmap mechanism to solve the problem of duplicate packets and eliminate unnecessary retransmissions. A new scalable indirect RTT measurement algorithm is introduced. And Specific Receiver selection process is distributed among all group members with records of Local/spl I.bar/SR/spl I.bar/rate and Global/spl I.bar/SR/spl I.bar/rate assuring correct SR selection and avoiding frequent SR changes. Control tree is constructed with the aid of multicast routers using a label-based sorting algorithm. RAMPART protocol was implemented on NS. Simulations were conducted with respect to RTT measurement, throughput analysis and TCP-friendliness. The results show RAMPART is effective.
{"title":"A rate-based multicast protocol for large-scale reliable transport","authors":"Song Fu, Z. Jin, Peipei Chen","doi":"10.1109/AINA.2003.1192954","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192954","url":null,"abstract":"This paper presents a RAte-based Multicast Protocol for lArge-scale Reliable Transport (RAMPART), which is designed to provide scalable, TCP-friendly and responsive reliable multicast transport service for applications of bulk-data transfer. We proposed a dual-bitmap mechanism to solve the problem of duplicate packets and eliminate unnecessary retransmissions. A new scalable indirect RTT measurement algorithm is introduced. And Specific Receiver selection process is distributed among all group members with records of Local/spl I.bar/SR/spl I.bar/rate and Global/spl I.bar/SR/spl I.bar/rate assuring correct SR selection and avoiding frequent SR changes. Control tree is constructed with the aid of multicast routers using a label-based sorting algorithm. RAMPART protocol was implemented on NS. Simulations were conducted with respect to RTT measurement, throughput analysis and TCP-friendliness. The results show RAMPART is effective.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130195318","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192873
Donghyun Kim, B. Hong, Byunggu Yu, Eun Suk Hong
This paper introduces a novel reprocessing-transaction model that handles the update conflicts between mobile transactions without abortion. The proposed model executes a new subtransaction, called a reprocessing transaction, which reupdates only conflicted objects using foreign conflicted objects. We also propose a progressive reprocessing scheme to allow the non-conflicted objects of a mobile transaction to be incrementally exposed to other concurrent transactions in order to alleviate starvation of reprocessing transactions.
{"title":"Validation-based reprocessing scheme for updating spatial data in mobile computing environments","authors":"Donghyun Kim, B. Hong, Byunggu Yu, Eun Suk Hong","doi":"10.1109/AINA.2003.1192873","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192873","url":null,"abstract":"This paper introduces a novel reprocessing-transaction model that handles the update conflicts between mobile transactions without abortion. The proposed model executes a new subtransaction, called a reprocessing transaction, which reupdates only conflicted objects using foreign conflicted objects. We also propose a progressive reprocessing scheme to allow the non-conflicted objects of a mobile transaction to be incrementally exposed to other concurrent transactions in order to alleviate starvation of reprocessing transactions.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116714787","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192913
T. Shih, Wen-Chih Chang, Nigel H. Lin, Louis H. Lin, Hun-Hui Hsu, C. Hsieh
In order to reuse and integrate all resources, many distance learning standards have appeared. The most famous is the Shareable Content Object Reference Model (SCORM). SCORM is composed of a run-time environment (RTE), a content agreement model and LMS. SOAP allows objects or code of any kind, on any platform, in any language to communicate. .Net Web Service combines XML and some programming IDE to develop a server, which uses SOAP to implement the launch mechanism and AICC CMI data model. Java script is used to implement the client side.
为了重用和整合所有资源，出现了许多远程学习标准。其中最著名的是可共享内容对象参考模型(SCORM)。SCORM由运行时环境(RTE)、内容协议模型和LMS组成。SOAP允许任何类型、任何平台、任何语言的对象或代码进行通信。net Web Service结合XML和一些编程IDE开发服务器，该服务器使用SOAP实现启动机制和AICC CMI数据模型。使用Java脚本实现客户端。
{"title":"Using SOAP and .NET Web Service to build SCORM RTE and LMS","authors":"T. Shih, Wen-Chih Chang, Nigel H. Lin, Louis H. Lin, Hun-Hui Hsu, C. Hsieh","doi":"10.1109/AINA.2003.1192913","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192913","url":null,"abstract":"In order to reuse and integrate all resources, many distance learning standards have appeared. The most famous is the Shareable Content Object Reference Model (SCORM). SCORM is composed of a run-time environment (RTE), a content agreement model and LMS. SOAP allows objects or code of any kind, on any platform, in any language to communicate. .Net Web Service combines XML and some programming IDE to develop a server, which uses SOAP to implement the launch mechanism and AICC CMI data model. Java script is used to implement the client side.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134280513","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192956
C. Chiou, S. Tseng
The dual-bus optical network with non-regenerative stations has become popular. In general, the non-regenerative implementation is better than the generative implementation. In this paper, two protocols are proposed to improve the performance of this network. These two protocols are "synchronous wavelength sharing protocol (SWSP)" and "synchronous wavelength reusing/sharing protocol (SWRP)". The simulation results show that the network throughput is better than those of SWSP in the situation of a limited number of wavelengths, tunable receivers and heavy traffic loading.
{"title":"Synchronous wavelength reusing/sharing protocols for non-regenerative dual bus optical networks","authors":"C. Chiou, S. Tseng","doi":"10.1109/AINA.2003.1192956","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192956","url":null,"abstract":"The dual-bus optical network with non-regenerative stations has become popular. In general, the non-regenerative implementation is better than the generative implementation. In this paper, two protocols are proposed to improve the performance of this network. These two protocols are \"synchronous wavelength sharing protocol (SWSP)\" and \"synchronous wavelength reusing/sharing protocol (SWRP)\". The simulation results show that the network throughput is better than those of SWSP in the situation of a limited number of wavelengths, tunable receivers and heavy traffic loading.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133080160","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192973
M. David, K. Sakurai
The paper proposes ways to counter the cyber terrorist (CT) advantages of surprise and anonymity. It recommends the creation of a Cyberint Analysis Center to develop and evaluate methods to improve the ability to detect, identify and deter cyber terrorist attacks. It also proposes ways to implement responsible, accountable and identifiable use of the Internet, and deny anonymity to the attackers.
{"title":"Combating cyber terrorism: countering cyber terrorist advantages of surprise and anonymity","authors":"M. David, K. Sakurai","doi":"10.1109/AINA.2003.1192973","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192973","url":null,"abstract":"The paper proposes ways to counter the cyber terrorist (CT) advantages of surprise and anonymity. It recommends the creation of a Cyberint Analysis Center to develop and evaluate methods to improve the ability to detect, identify and deter cyber terrorist attacks. It also proposes ways to implement responsible, accountable and identifiable use of the Internet, and deny anonymity to the attackers.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116093348","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192929
Yan Bai, M. Ito
Packet scheduling is typically designed to support the delay requirements of video communication. In this paper, a new innovative use of packet scheduling to provide loss guarantees is proposed. A packet scheduling scheme at a router that assures that intra and interstream loss requests for video transportation are met was developed and evaluated using real video data. The results show that the proposed scheme can significantly improve the quality of each video. It can also provide different classes of videos with different levels of loss guarantees, while maintaining service fairness among all competing videos.
{"title":"A packet scheduling scheme for satisfying intra and inter-stream loss requirements in video communication","authors":"Yan Bai, M. Ito","doi":"10.1109/AINA.2003.1192929","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192929","url":null,"abstract":"Packet scheduling is typically designed to support the delay requirements of video communication. In this paper, a new innovative use of packet scheduling to provide loss guarantees is proposed. A packet scheduling scheme at a router that assures that intra and interstream loss requests for video transportation are met was developed and evaluated using real video data. The results show that the proposed scheme can significantly improve the quality of each video. It can also provide different classes of videos with different levels of loss guarantees, while maintaining service fairness among all competing videos.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116581998","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192931
F. Xu, Dazheng Huang, Guangwen Yang
Cluster is an aggregation of computers to obtain powerful computing energy. In this paper, we discuss the ability of its power to provide remote service. We focus on the convenience for remote users to submit their tasks, providing a friendly environment to run the tasks efficiently, and maintaining the equity of the service between each user. To achieve this outcome, the scheduling method must avoid the properties that will benefit the system performance but impair the equity between users as well. We also supply users with limited means to enhance their task running speed and executive environment. These means exert a considerable influence on the system performance, but at the same time expend more than the average approach. The variance is embodied in the final evaluation of the service quality the user obtains. With the above character, the system presents a little differently than traditional ones, which consider mostly the cluster load balance and performance. We also regard the system balance as an important standard. However, this concern is based on sustaining a credible service.
{"title":"TMSS: a task management and scheduler system in cluster for remote computing service","authors":"F. Xu, Dazheng Huang, Guangwen Yang","doi":"10.1109/AINA.2003.1192931","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192931","url":null,"abstract":"Cluster is an aggregation of computers to obtain powerful computing energy. In this paper, we discuss the ability of its power to provide remote service. We focus on the convenience for remote users to submit their tasks, providing a friendly environment to run the tasks efficiently, and maintaining the equity of the service between each user. To achieve this outcome, the scheduling method must avoid the properties that will benefit the system performance but impair the equity between users as well. We also supply users with limited means to enhance their task running speed and executive environment. These means exert a considerable influence on the system performance, but at the same time expend more than the average approach. The variance is embodied in the final evaluation of the service quality the user obtains. With the above character, the system presents a little differently than traditional ones, which consider mostly the cluster load balance and performance. We also regard the system balance as an important standard. However, this concern is based on sustaining a credible service.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"54 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124860744","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192951
F. Tinetti, A. Barbieri
This paper introduces a natural implementation for broadcasting data on Ethernet based clusters used for parallel computing. Initially, it will be shown that libraries for Message Passing between processes such as PVM and implementations of MPI do not implement efficiently this operation or there is no reliability in terms of its performance. An implementation for broadcast messages is presented, taking into account the Ethernet based hardware layer found in most of the clusters used for parallel computing. The proposed implementation for broadcasting data is compared with the broadcast message available in PVM and LAM/MPI. Also, some comments are made about the proposed broadcast messages when the hardware layer is not Ethernet based. Finally, it will be shown by experimentation how the proposed broadcast message is used in the context of parallel linear algebra operations, specifically for parallel matrix multiplication.
{"title":"An efficient implementation for broadcasting data in parallel applications over Ethernet clusters","authors":"F. Tinetti, A. Barbieri","doi":"10.1109/AINA.2003.1192951","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192951","url":null,"abstract":"This paper introduces a natural implementation for broadcasting data on Ethernet based clusters used for parallel computing. Initially, it will be shown that libraries for Message Passing between processes such as PVM and implementations of MPI do not implement efficiently this operation or there is no reliability in terms of its performance. An implementation for broadcast messages is presented, taking into account the Ethernet based hardware layer found in most of the clusters used for parallel computing. The proposed implementation for broadcasting data is compared with the broadcast message available in PVM and LAM/MPI. Also, some comments are made about the proposed broadcast messages when the hardware layer is not Ethernet based. Finally, it will be shown by experimentation how the proposed broadcast message is used in the context of parallel linear algebra operations, specifically for parallel matrix multiplication.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125921901","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 : 2003-03-27DOI: 10.1109/AINA.2003.1192960
Y. Kidawara, Shunsuke Shinomiya, Takeshi Sakurada, H. Nagata, S. Nakagawa
Recently, much attention has been focused on potential Internet technology for delivering medical care. Many researchers are trying to adapt network technologies to telemedicine. Network technology, which makes possible instant communication over great distances, could control devices in remote places in real time. In particular, the broadband Internet achieves transmission of high quality video image data and other huge amounts of data to distant places. Therefore, transmitting high-quality video images that medical doctors request should not be so difficult. The IPv6 network technology that will be applied to the Next-Generation Internet will provide a large increase of global IP addresses. Many people anticipate that various medical devices will be connected to networks with ease. We report research conducted to examine the effectiveness of device cooperation for medical purposes. To this end, we developed a remote-control microscope that we are proposing as next-generation remote-control medical equipment. We developed this microscope by using a technology called "Network Accessible Device on the Internet Architecture" (NADIA). In an effort to create a remote medical system for use with the next-generation Internet, we developed and confirmed the effectiveness of the ProcessStorageMicroscopeNAD, a machine that combines three devices.
{"title":"Device cooperation and content management for remote-control microscope for medical use","authors":"Y. Kidawara, Shunsuke Shinomiya, Takeshi Sakurada, H. Nagata, S. Nakagawa","doi":"10.1109/AINA.2003.1192960","DOIUrl":"https://doi.org/10.1109/AINA.2003.1192960","url":null,"abstract":"Recently, much attention has been focused on potential Internet technology for delivering medical care. Many researchers are trying to adapt network technologies to telemedicine. Network technology, which makes possible instant communication over great distances, could control devices in remote places in real time. In particular, the broadband Internet achieves transmission of high quality video image data and other huge amounts of data to distant places. Therefore, transmitting high-quality video images that medical doctors request should not be so difficult. The IPv6 network technology that will be applied to the Next-Generation Internet will provide a large increase of global IP addresses. Many people anticipate that various medical devices will be connected to networks with ease. We report research conducted to examine the effectiveness of device cooperation for medical purposes. To this end, we developed a remote-control microscope that we are proposing as next-generation remote-control medical equipment. We developed this microscope by using a technology called \"Network Accessible Device on the Internet Architecture\" (NADIA). In an effort to create a remote medical system for use with the next-generation Internet, we developed and confirmed the effectiveness of the ProcessStorageMicroscopeNAD, a machine that combines three devices.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123337202","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
扫码关注我们
求助内容：
应助结果提醒方式：