{"title":"Dynamic survivable RWA strategy on IP over WDM networks","authors":"Chen-Shie Ho, S. Kuo","doi":"10.1109/ITRE.2005.1503084","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503084","url":null,"abstract":"To provide the robust message delivery capability with traffic flows in the networks, survivability become a key issue for the service provider to guarantee the service level agreement to the customers. In this paper, we propose the group-based routing and wavelength assignment policy for dynamic traffic demands under WDM optical networks on IP/GMPLS/WDM environment. We consider the survivable routing and wavelength assignment strategy for dynamic traffic demands under static partitioned network. The extensive simulation results show the efficiency of the proposed protection approach.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126137452","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":"Forecasting error tolerable resource allocation for All-IP networks","authors":"Y. Lien, Yi-Min Chen","doi":"10.1109/ITRE.2005.1503157","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503157","url":null,"abstract":"This paper discuss some resource allocation methods that can tolerate forecast errors under the budget-based management infrastructure, BBQ, which is designed to offer end-to-end QoS assurance for All-IP networks. BBQ takes pre-planning approach to forecast incoming traffic based on historic statistics and allocates link resources accordingly. Traffic forecast may not be perfectly accurate due to traffic fluctuation and imperfect forecast. Forecasting errors may lead to poor resource allocation. We have designed some mechanisms that can compensate forecasting errors and thus may reduce performance degradation accordingly.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128468463","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":"Exploitation of disk cache for VOD services in network-attached storage systems","authors":"Eunsam Kim, Jonathan C. L. Liu","doi":"10.1109/ITRE.2005.1503080","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503080","url":null,"abstract":"Modern storage systems become network-accessible. One of the leading network-attached storage systems is the Fiber Channel Arbitrated Loop (FC-AL). In order to further exploit the performance of the FC-AL-based video systems, we have built the end-to-end emulation by putting all system components together. The results showed that the system improved performance compared to conventional SCSI-based systems, but disk cache utilization among disks is similar but quite low. In this paper, in order to exploit the unused disk cache blocks, we employ prefetching. We describe how to determine FC-AL acquisition order and time among disks in advance. Then we propose a cache replacement policy to take full advantage of the sequential access pattern of video files and show how to estimate the maximum number of prefetched blocks. By analysis and simulations based on one-disk configuration, we show that the prefetching not only increases the total number of concurrent streams, but it also further utilizes the FC-AL.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127257276","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":"Dependable WDM networks with reconfigurable edge-disjoint p-cycles","authors":"C. Sue, M. Shieh, Chin-Yu Huang","doi":"10.1109/ITRE.2005.1503082","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503082","url":null,"abstract":"In this paper, we propose a fault tolerant mechanism on the optical WDM network design with edge-disjoint p-cycles (EDPC) that is reconfigurable according failure scenarios. EDPC is a special type of traditional p-cycles, that is, no common edges are allowed to exist between any two p-cycles. One p-cycle provides guaranteed protection against to single link failure, but it can't protect against simultaneous failures to two links on one p-cycle. If failures of multiple links happen in such way, all working spans protected by the p-cycle will crumble down. Our method called local reconfiguration recovers the protection environment to enable its protection ability. The results show that the EDPC method can tolerate more link failures and improve the restoration efficiency for traditional p-cycles with the decrease of two working units for every two p-cycles. When the protection environment crumbles down, the local reconfiguration method can speed up the recovering time instead of time consuming scheme, which blocks whole network and takes reconfiguration.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125357531","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":"Using cooperative sharing approach to improve the efficiency of range queries","authors":"Chow-Sing Lin, Y.-H. Chang","doi":"10.1109/ITRE.2005.1503166","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503166","url":null,"abstract":"When numerous mobile hosts (MHs) issue queries to base stations (BSs) at the same time, the BSs must consume numerous resources to calculate those queries and that will abate the performances of the BSs. If these query results can be reused, the BSs will avoid calculating these queries repeatedly. In this paper, we propose a reforming query process to improve the service performances of the BSs. MHs can avoid issuing new queries or can narrow the query range by utilizing the results of nearby MHs. Consequently, BSs can reduce the loads for calculating these queries and that will improve the service performance. We also define four approaches to select MHs to download results. They are first come first download (FCFD), largest range first download (LRFD), smallest range first download (SRFD), and largest non-overlap download (LNOD). The experiment results show that we should use different approaches or a hybrid approach in different environments to get a balanced status between the performance of BSs and the loads of MHs.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"707 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116967499","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":"Reliable image matching via modified Hausdorff distance with normalized gradient consistency measure","authors":"C. Yang, S. Lai, Long-Wen Chang","doi":"10.1109/ITRE.2005.1503090","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503090","url":null,"abstract":"Reliable image matching is important to many problems in computer vision, image processing and pattern recognition. Hausdorff distance and many of its variations have been employed for image matching with success. In this paper we propose an improved image matching method based on a modified Hausdorff distance with normalized gradient consistency measure. The proposed new image matching algorithm integrates the geometric Hausdorff distance with the photometric intensity gradient information to obtain a better image similarity measure. To show the improvement of the proposed algorithm, we test it with some previous image matching methods on the problem of face recognition under lighting changes. Experimental results show the proposed method produces more accurate face recognition than the previous methods.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131040896","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":"Conceptual inferred TAM by gender in cyberlearning","authors":"Tzong-Song Wang, Din Jong, Shu-Chen Liu","doi":"10.1109/ITRE.2005.1503144","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503144","url":null,"abstract":"The pace of adoption of cyberlearning is influenced by gender factors that need to be confronted. The technology acceptance model (TAM) designed by Davis in 1989 can be useful to measure the pace of receptivity to use of online resources. Writers try to show that Taiwanese women in highly technical programs are more resistant to computing and Web online distance courses than men. Educational programs need to be designed to encourage women to lead in diffusion of cyberlearning. The writers desire to use the TAM approach in a study of university students in Taiwan and try to find that gender, computing skills, and prior experiences with computing were the most significant factors to predict acceptance or resistance to change. Finally, the writers would like to create an overall conceptual model, which inferred from original TAM constructs relationships for showing that cyberspace advocates have yet to promote a concept.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129116837","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}
Zhang Tao, S. Madhani, A. Dutta, E. V. D. Berg, Y. Ohba, K. Taniuchi, Shantidev Mohanty
{"title":"Implementation and evaluation of autonomous collaborative discovery of neighboring networks","authors":"Zhang Tao, S. Madhani, A. Dutta, E. V. D. Berg, Y. Ohba, K. Taniuchi, Shantidev Mohanty","doi":"10.1109/ITRE.2005.1503055","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503055","url":null,"abstract":"Emerging mobile devices often want to discover neighboring networks in real time. For example, a mobile may want to know the capabilities of the surrounding WiFi networks so that it can inteliigently determine which one to use next and avoid wasting scarce battery power io attempt to connect the wrong networks. Knowing the address of the authentication server in a neighboring network may allow a mobile device to authenticate with the neighboring network while the device is still using the current network to transport its user traffic, even before the device detects the radio signal from the neighboring network. The Internet Engineering Task Force (IETF) is developing a Candidate Access Router Discovery (CARD) protocol for a mobile device to discover the address and capabilities of access routers in a neighboring aehnork. However, it requires all neighboring access routers to implement CARD and to dynamically exchange network information with each other and with the mobiles, which is diffkult to implement especially when neighboring networks belong to different network providers. Furthermore, CARD can only aUow a mobile to obtain the information a local network provider configures its CARD protocol to provide, making it difficult to provide consistent information from network to network and to support mobile devices that may need different information depending on their different networking Capabilities and user npplications. This paper proposes and evaluates a new approach for real time discovery of neighboring network information: Autonomous Collaborative Discovery (ACD). It is nutonornous because regdar mobile users and their devices act autonomously to collect information and make the information available to other mobile users and devices. It is collaborative as the autonomous actions of the mobile users and devices help each other to discover the information they want.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127772703","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}
K. Shih, Chih-Yung Chang, Hung-Chang Chen, Sheng-Shih Wang
{"title":"A self-regulated learning system with scaffolding support for self-regulated e/m-learning","authors":"K. Shih, Chih-Yung Chang, Hung-Chang Chen, Sheng-Shih Wang","doi":"10.1109/ITRE.2005.1503060","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503060","url":null,"abstract":"The paper proposes a self-regulated learning system with scaffold support for self-regulated e/m-learning. With the support of the self-regulated system, the learner can identify his best way for learning, where a learner can get supports from the environmental resources in a scaffolding manner and improve his performance of self-regulated learning. Based on the self-regulatory learning and scaffolding theories, two subsystems, \"learning scheduler subsystem\" and \"content accessibility subsystem\", are proposed. The learning scheduler subsystem helps learners schedule their learning process and enhance the capability of self-regulated learning. With the use of the content accessibility subsystem, the instructor can organize the contents and teaching materials such that different level of supports can be dynamically provided to learners. Comprehensively, the proposed self-regulated learning system not only assists the learner to cultivate his self-regulated learning behavior, but also provides the learner a mobile, portable, and personalized learning environment.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129422281","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 voting system for small-scale election","authors":"Chun-Hua Chen, Chi-Min Lan, G. Horng","doi":"10.1109/ITRE.2005.1503133","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503133","url":null,"abstract":"Voting is common in our daily life, from electing president to electing committee; we need to set up a complete electronic voting scheme suitable for all kinds of voting with safe guaranty where the voter's privacy can be protected. However, most present electronic voting schemes are still in experimental stage. People often question about the security of electronic voting because all schemes require the verification of trusted centers. And these trusted centers add the complexity of processing. In this paper, we present a one-server private information retrieval (PIR) electronic voting scheme with secure coprocessor (SC). In the scheme, we not only protect personal privacy but also increase the security of the voting procedure. Besides, using only one server can lower the cost. This idea can be used in small-scale election practically, because of its high security, low cost and good efficiency. By this novel and practical electronic voting system, electronic voting can be applied more easily in everyday life.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134195939","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}