{"title":"A Channel Prediction Scheme for Closed Loop Transmit Diversity in High Speed Downlink Packet Access","authors":"Junsu Kim, J. Chung, D. Sung","doi":"10.1109/APCC.2005.1554089","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554089","url":null,"abstract":"A closed loop transmit diversity (CLTD) scheme is specified in high speed downlink packet access (HSDPA) to provide high data rates by obtaining a diversity gain in mobile radio channels. However, if mobile channel varies rapidly, i.e. mobile speed becomes faster, it is hard to obtain a diversity gain because of the feedback delay of channel quality information from UEs to NodeB. To mitigate such a performance degradation in the closed loop transmit diversity, we propose a channel prediction scheme. This proposed scheme improves the performance of the closed loop transmit diversity through channel prediction using a channel transition history","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123758537","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":"Behaviors of Active Lightpath Restoration in All-Optical Networks with and without Wavelength Converters","authors":"M. Azim, Xiaohong Jiang, P. Ho, S. Horiguchi","doi":"10.1109/APCC.2005.1554201","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554201","url":null,"abstract":"Survivability is the ability of the network to continue operating in the event of failure. Lightpath restoration is a cost efficient approach to guaranteeing certain degree of survivability in WDM optical networks and active restoration (AR) is a novel lightpath restoration scheme proposed recently. In this paper, we study the performance of AR. In particular, we develop analytical models for approximating the restoration probability for circuit-switched WDM networks employing AR scheme. Extensive simulations have been conducted to verify the proposed models. The simulation results show clearly that our models are quite efficient for approximating the restoration probability for WDM networks employing active restoration","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121818904","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}
D. Shimazaki, E. Oki, I. Nishioka, S. Kano, A. Nagata, M. Nanba, K. Morita, M. Tanabe, K. Kusama, P. Linwong, T. Hirai, K. Okazaki
{"title":"Global Interoperability Trial for Next-Generation Photonic IP Network – GMPLS/OUNI Protocols and Applications –","authors":"D. Shimazaki, E. Oki, I. Nishioka, S. Kano, A. Nagata, M. Nanba, K. Morita, M. Tanabe, K. Kusama, P. Linwong, T. Hirai, K. Okazaki","doi":"10.1109/APCC.2005.1554151","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554151","url":null,"abstract":"We confirm three GMPLS technologies: GMPLS/MPLS inter-working, OUNI, and the multi-CoS recovery mechanism, using the MPLS/GMPLS multi-region network connected between PIL site in Japan and ISOCORE site in USA. The combination provides wideband video data transmission service and auto route selection according to content data volume","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122185675","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":"Analysis of Capacity Variation for MIMO-OFDM Systems","authors":"I-Hsueh Li, E. Li, Shyue-Win Wei","doi":"10.1109/APCC.2005.1554064","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554064","url":null,"abstract":"In this paper, robust transmission capacity of the multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems is evaluated through the COST 207 and the IEEE 802.11a channel models. Moreover, this paper also discusses the influence of the number of antennas and the number of sub-channels on the variation of the channel capacity of the MIMO-OFDM systems. At last, the MIMO-WLAN system is selected as an example for our investigation. The optimum design for the number of MIMO antennas for the IEEE 802.11a system is pursued","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121105914","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 of the Link Security Module in an EPON Access Network","authors":"Kwang-Ok Kim, Kyeong-Soo Han, T. Yoo","doi":"10.1109/APCC.2005.1554006","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554006","url":null,"abstract":"In this paper, the link security module developed by draft standard of IEEE 802.1AE in order to protect all frames from a listening or attacking of a malicious user at an EPON link. And it applied at an EPON OLT (optical line terminal)/ONU (optical network unit) and is provided a link security about the maximum 64 ONUs. It also used a 128 bits GCM-AES (Galois/counter mode-advanced encryption standard) of an authenticated encryption mode that was mandatory-to-implement crypto- algorithm in draft standard. So, link security module can provide the user data confidentiality and frame data integrity, and data origin authenticity to subscribers, and support a link security at the maximum 2 Gbps EPON using the parallel CTR-AES (counter-AES) in the GCM-AES","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"94 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129070874","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":"K Pairs of Disjoint Paths Algorithm for Protection in WDM Optical Networks","authors":"Q. V. Phung, D. Habibi, H. Nguyen, K. Lo","doi":"10.1109/APCC.2005.1554044","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554044","url":null,"abstract":"Survivable routing in wavelength division multiplexing (WDM) optical networks has been proven to be NP-hard problem. There is a trade-off between the computational time and the optimality of solutions in existing approaches to the problem. Existing heuristic approaches purely based the graph algorithms are efficient in computational time but do not offer optimal solutions and may fail in some cases even when a solution exists. Meanwhile, the integer linear programming (ILP) models offer optimal solutions but are intractable even with moderate scale networks. In this paper, we introduce a new algorithm for finding K pairs of disjoint paths which are employed as K candidate pairs for each connection in the ILP models. We introduce an ILP model for dedicated path protection in which the number of decision variables is mainly dependant on traffic requests and the constant K, not on the network size","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127374190","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":"Blocking MSN: A Case Study of Preventing the Abuse of IM","authors":"Zhenyu Hu, Zaiqiang Liu, Purui Su, D. Feng","doi":"10.1109/APCC.2005.1554237","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554237","url":null,"abstract":"This paper discusses how to effectively block MSN communication. Based on the analysis of the MSN messenger protocol, five effective blocking methods and a message-driven algorithm are proposed. Experimental results are also presented to compare the performances of different methods. The work done in this paper provides practicable and effective solutions to preventing and controlling the abuse of MSN and other kinds of IM","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"72 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133587864","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":"On Finite Dimensional Approximation in MIMO","authors":"G. Dickins, L. Hanlen","doi":"10.1109/APCC.2005.1554154","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554154","url":null,"abstract":"We consider measures of richness in multipath wireless channels. We examine bounds on the dimensionality of spatially constrained wireless signals. We show that the continuous system-model bounds on dimensionality rely on an implicit model for noise. We consider dimensionality bounds where the noise model is made an explicit parameter. We show that the dimensionality of a spatially constrained field may be considered as a parameter for a virtual antenna model. We propose a simple antenna model which incorporates spatial dimensionality and relate this to the current point-like model used in MIMO channel models","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130444074","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":"Distributed Dynamic Call Admission Control and Channel Allocation Using SARSA","authors":"N. Lilith, K. Dogangay","doi":"10.1109/APCC.2005.1554084","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554084","url":null,"abstract":"This paper introduces novel reinforcement learning agent-based solutions to the problems of call admission control (CAC) and dynamic channel allocation (DCA) in multi-cellular telecommunications environments featuring multi-class traffic and intercell handoffs. Both agents providing the CAC and DCA functionality make use of an on-policy reinforcement learning technique known as SARSA and are designed to be implemented at the cellular level in a distributed manner. Furthermore, both are capable of on-line learning without any initial training period. Both of the reinforcement learning agents are examined via computer simulations and are shown to provide superior results in terms of call blocking probabilities and revenue raised under a variety of traffic conditions","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130693972","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":"Feedback-based Load Balancing Routing for Optical Burst Switching Networks","authors":"H. Pan, T. Abe, Y. Mori, Youngbok Choi, H. Okada","doi":"10.1109/APCC.2005.1554221","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554221","url":null,"abstract":"An optical burst switching (OBS) network provides preferable broadband infrastructure, and is a promising strong candidate for the future optical Internet. However, there is a major deficiency of the OBS, which occurs when multiple bursts contend for the same link and leads to bursts loss. As an effective method to resolve the above important issue of OBS networks, deflection routing has been proposed. A simple deflection routing without proper routing control cannot sufficiently distribute the traffic of bursts and guarantee ideal performance of OBS particularly for heavy traffic condition. In this paper, we propose a new approach for deflection routing in order to reduce the burst loss and minimize end-to-end delay. The simulation results show that the proposed scheme improves the network utilization and minimize both the burst loss probability and end-to-end delay","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131406900","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}