Wen-Ting Wu, Jyh-cheng Chen, Kai-Hsiu Chen, Kuo-Pao Fan
{"title":"Design and implementation of WIRE Diameter","authors":"Wen-Ting Wu, Jyh-cheng Chen, Kai-Hsiu Chen, Kuo-Pao Fan","doi":"10.1109/ITRE.2005.1503158","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503158","url":null,"abstract":"This paper presents the design and implementation of WIRE Diameter. The WIRE Diameter is an open source implementation of Diameter Based Protocol and Diameter EAP application developed by the Wireless Internet Research & Engineering (WIRE) Laboratory. Research has shown that traditional RADIUS protocol may suffer performance degradation and data loss in a large system. Diameter, thus, was proposed to address the deficiencies in RADIUS. Both 3GPP and 3GPP2 have adopted Diameter as their AAA protocol. The WIRE Diameter could be used to authenticate and authorize 802.1x supplicant. It provides various authentication schemes, including EAP-MD5, EAP-TLS, EAP-TTLS, and PEAP. The WIRE Diameter is developed to be independent of OS as much as possible. Currently it supports Linux, FreeBSD and various versions of MS Windows. It is believed that the WIRE Diameter is the first open source implementation of Diameter EAP Application in the world. The source code can be downloaded freely. The WIRE Diameter should be useful for the research community. This paper demonstrates the design and implementation of the WIRE Diameter.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"42 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":"127100972","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":"An efficient network architecture with guaranteed QoS and very high availability for real-time on-line learning","authors":"M. Gamage, M. Hayasaka, T. Miki","doi":"10.1109/ITRE.2005.1503145","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503145","url":null,"abstract":"Connection oriented networks such as MPLS can better meet the QoS guarantees required by the emerging e-learning applications that are mostly real-time in nature. These connection oriented networks are more prone to network failures and they can be classified into link/path failures and degraded failures. Virtual path hopping (VPH) concept discussed here eliminates all degraded type failures due to control plane failures. Dynamic virtual path allocation (DVPA) algorithm proposed here can achieve very fast recovery from link/path failures while keeping the utilization efficiency of network resources high. This recovery time consists of two main parts; time taken to detect failures and time taken to activate the backup path (BP). DVPA algorithm virtually makes the time taken to activate the BP 'zero' for premium traffic (PT). The Active BP (ABP) will be always used by best effort traffic (BET) when there aren't any failures. Simulation results obtained were impressive. Implementing DVPA algorithm in conjunction with VPH concept in connection oriented networks can achieve the QoS and very high availability requirements of the future e-learning over the Internet.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"28 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":"128090873","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}
Chih-Feng Chao, Ying-Hong Wang, Jenhui Chen, Yi-Chien Lin
{"title":"A cache sharing interface for data access in mobile ad hoc networks","authors":"Chih-Feng Chao, Ying-Hong Wang, Jenhui Chen, Yi-Chien Lin","doi":"10.1109/ITRE.2005.1503070","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503070","url":null,"abstract":"Nowadays mobile communication is widespread in the world and has become a necessity in our daily lives. Unlike infrastructured wireless networks, mobile ad hoc networks (MANETs) have no fixed infrastructure such as base stations or access points, and the framework is dynamic owing to frequent changes in both topology and mobile nodes. Most researches, however, focus on the discussion of the shortest path or the highest bandwidth; issues related to the data transmission in MANETs are rarely considered. To deal with the intrinsic properties of MANETs, this paper proposes a cache sharing interface for data access. Under the operation of the proposed mechanism, routes and time span to access data are shortened and the data reusable rate is enhanced to save the use of bandwidth and power consumption of mobile nodes.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"3 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":"128092681","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":"Retrieval and reasoning of multimedia documents about time","authors":"A. Y. Chang","doi":"10.1109/ITRE.2005.1503075","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503075","url":null,"abstract":"We propose a temporal reasoning engine uses an algebraic system to analyze temporal relations from multimedia documents. The synchronization models are generalized by composing point temporal relations with qualitative and quantitative functions. We also construct an automatic reasoning framework in which to help user design presentation more easily. Temporal semantics can be extracted from the solutions. Authors could easily describe the temporal behavior of multimedia presentation associate hyperlinks with media object over Internet.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"177 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":"131831184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The implementation and evaluation of educational online gaming system","authors":"Kuang-Chao Yu, H. Hsiao, F. Tsai","doi":"10.1109/ITRE.2005.1503137","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503137","url":null,"abstract":"An educational online game is proposed in the paper. We then examine the impact of learners' online-game experience and their self-efficacy on learning effects. Meanwhile, the relationships among main factors, which influence the learning effects are analyzed. We found that a significant correlation between learners' online-game experience and their self-efficacy is revealed. Path analysis indicates that the learning performance is only directly influenced by learners' academic achievement and learning time. Learners' online game experience only affects learning performance indirectly through learning time. The online game-based learning system in this study is worthy to be popularized since it can attract more learners' attention.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"63 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":"131029329","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}
Guo Jianbing, Gan Liangcai, Xie Ling, Wu Shuangyuan
{"title":"A high speed HF frequency hopping system based on turbo codes","authors":"Guo Jianbing, Gan Liangcai, Xie Ling, Wu Shuangyuan","doi":"10.1109/ITRE.2005.1503156","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503156","url":null,"abstract":"According to the characteristic of differential hopping frequency scheme that takes data information in adjacent frequencies and the correlation of the turbo codes, a high speed high frequency differential hopping frequency system based on turbo codes is presented in this paper. The system is designed by making good use of the excellent performance of turbo codes, DDS and DSP technology. The numeric simulation results show that when signal-to-noise is 0.2 dB and 3.8 dB in AWGN and Rayleigh channel respectively, the bit error rate could be reduced to 10/sup -5/, and the system could achieve a good reliability under partial-band jamming situation.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"52 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":"115684756","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":"Ontology-based information retrieval and extraction","authors":"Chen-Yu Lee, V. Soo","doi":"10.1109/ITRE.2005.1503119","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503119","url":null,"abstract":"Using domain knowledge and semantics to conduct effective information retrieval (IR) is one of the major challenges in IR. In this paper we introduce a framework that can facilitate information retrieval based on a sharable domain ontology. Specifically we conduct semantic annotation on the descriptive metadata of images or articles and convert metadata automatically into machine readable format in terms of semantic Web representation. The retrieval of an image instance or information extraction of an historic question can then be conducted by matching the semantic and structural descriptions of the user query based on those of the annotated descriptive metadata. We show that with aid of domain ontology, an IR system can achieve a better performance than the keyword-based information retrieval systems.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"24 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":"114990089","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":"Prepaid mechanism of VoIP and messaging services","authors":"Sok-Ian Sou, Quincy Wu, Yi-Bing Lin, Che-Hua Yeh","doi":"10.1109/ITRE.2005.1503117","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503117","url":null,"abstract":"Session initiation protocol (SIP) is used for voice over IP (VoIP) signaling and call control. Billing mechanisms for messaging and VoIP are typically deployed for postpaid services. Prepaid mechanisms for SIP-based VoIP calls toward public switched telephone network (PSTN) are seldom discussed. In this paper, we propose a prepaid mechanism that can simultaneously process messaging and VoIP calls. This prepaid mechanism is implemented in a VoIP platform developed under National Science & Technology Program for Telecommunications (NTP). Unlike previous VoIP prepaid approaches which require modifications to end points, our mechanism can be easily integrated to a VoIP platform without modifying existing network components.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"43 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":"117143923","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}
Tzu-Fang Sheu, N. Huang, Hung-Shen Wu, Ming-Chang Shih, Yuang-Fang Huang
{"title":"On the design of network-processor-based gigabit multiple-service switch","authors":"Tzu-Fang Sheu, N. Huang, Hung-Shen Wu, Ming-Chang Shih, Yuang-Fang Huang","doi":"10.1109/ITRE.2005.1503114","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503114","url":null,"abstract":"As the increasing users and services over the Internet, people demand faster data fetching and more reliable network services. However, the increasing network services and equipment causes the network management much more difficult. In this paper, we propose and implement a chassis-based multiple gigabit multiple-service switch (GMSS). This chassis-based GMSS aggregates several advanced network services and also provides easy upgrade and efficient management system. The architecture of GMSS and the designed of the advanced services are introduced. The implemented prototype of the GMSS is also presented in this paper.","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":"116165211","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":"An efficient distributed approach for dynamic multicast trees","authors":"L. Gatani, G. Re","doi":"10.1109/ITRE.2005.1503098","DOIUrl":"https://doi.org/10.1109/ITRE.2005.1503098","url":null,"abstract":"In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or leave, and it triggers a \"stirring\" process that locally rearranges the tree, when its degradation exceeds a given threshold.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"13 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":"122095100","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}