2006 Asia-Pacific Conference on Communications最新文献_第8页

Next-Hop Selection Algorithm over ECMP ECMP下一跳选择算法

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255770

Jaeyoung Kim, Byungjun Ahm

{"title":"Next-Hop Selection Algorithm over ECMP","authors":"Jaeyoung Kim, Byungjun Ahm","doi":"10.1109/APCC.2006.255770","DOIUrl":"https://doi.org/10.1109/APCC.2006.255770","url":null,"abstract":"A novel algorithm for next-hop selection over a set of equal cost multiple paths (ECMP) in a router is presented, which provides for load sharing among multiple routes. The main idea of proposed algorithm called prime number modulo-N (PMN) is that the remainders are distributed equally when the multiples of a number are divided by prime number. Based on this specific property, PMN assigns incoming flows to a next-hop selected. The hashed value of flow is divided by the number of multiple paths. If a next-hop pointed the remainder is available, this next-hop selected to forward packet. But if not, prime number not exceeding the remainder divides the hashed value and a next-hop is selected using this remainder. The disruption characteristic is remarkably improved using prime number division scheme The lookup performance of PMN is an optimal O(1) and disruptive behavior is between 0.14 and 0.54 in case N is the number of next-hops and N is equal to eight. And the disruption average of PMN is 0.32. In case N is equal to sixteen, disruptive behavior is between 0.07 and 0.61 and the disruption average is 0.26. The optimal disruption average is 0.16 where N is equal to sixteen. As compared with other algorithm decided which next-hop to use, the performance of PMN like modulo-N is an optimal O(1), disruptive behavior of PMN is better than that of modulo-N and that of hash-threshold algorithm. But highest random weight (HRW)'s disruptive behavior with 1/N is better than that of PMN. Load balancing per flow is nearly good if each flow has the same distribution in input packet streams","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121116728","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}

引用次数: 5

Home Address allocation to mobile terminal over mobile IP environments 在移动IP环境下为移动终端分配家庭地址

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255874

Sang-Eon Kim, Dae-Young Kim

引用次数: 2

A Multihoming Mechanism to Support Network Mobility in Next Generation Networks 支持下一代网络中网络移动性的多宿主机制

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255777

Younghwan Choi, Bongsoo Kim, Sang-Ha Kim, Minkyo In, Seungyun Lee

{"title":"A Multihoming Mechanism to Support Network Mobility in Next Generation Networks","authors":"Younghwan Choi, Bongsoo Kim, Sang-Ha Kim, Minkyo In, Seungyun Lee","doi":"10.1109/APCC.2006.255777","DOIUrl":"https://doi.org/10.1109/APCC.2006.255777","url":null,"abstract":"One of major tasks at IETF NEMO WG is for supporting the seamless connectivity of mobile networks based on IPv6. This seamless connectivity can be provided by multiple accesses to multiple service providers with multiple wireless network interfaces. Classifications for possible multihoming cases must be one of the most important issues in order to find the scheme for supporting mobility in various multihomed mobile networks. The classification of various multihoming cases is the current target for mobility support in mobile networks at IETF NEMO WG. The main issue of these schemes is to extract the multihoming factors with mutually independent and orthogonal properties to each other. In order to get the factors, this paper firstly divides the routing path into three segments, secondly extracts three multihoming factors, which should have independent and orthogonal properties because each of them are from different segment, and finally classifies multihoming cases of mobile networks based on these factors. In addition to this novel scheme of classification, this paper also proposes a new scheme to support network mobility in the most general multihoming environment. This validation of this scheme is attained by network simulator-2","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129530499","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}

引用次数: 6

Enhanced Downlink Performance of TD-SCDMA LTE System with Multiuser MIMO SDM 多用户MIMO SDM增强TD-SCDMA LTE系统下行性能

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255828

Guangyi Liu, Jianhua Zhang, Jianchi Zhu

引用次数: 4

Near-Optimal Selection of Joint Transmit-Receive Antennas for MIMO Channel based on Maximizing Channel Capacity 基于最大信道容量的MIMO信道联合收发天线的近最优选择

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255880

Hyo Shil Kim, Y. Byun

引用次数: 1

A Packet Scheduling Scheme for Audio-Video Transmission with IEEE 802.11e HCCA and its Application-Level QoS Assessment 基于IEEE 802.11e HCCA的音视频传输分组调度方案及其应用级QoS评估

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255842

Z. Noh, Takahiro Suzuki, S. Tasaka

引用次数: 9

Performance Analysis of a Constant-Amplitude Multi-Code-Bi-orthogonal Modulation 恒幅多码双正交调制的性能分析

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255860

Sung-Jin Kang, Dae-Ki Hong, Jin-Woong Cho

引用次数: 0

Reachability and Goodput Enhancement via Fragmentation in Public IEEE 802.11b WLAN 基于分片的公共IEEE 802.11b无线局域网的可达性和Goodput增强

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255787

Seongkwan Kim, Jongseok Kim, Sekyu Park, Sunghyun Choi, J. Lee, H. Jung

{"title":"Reachability and Goodput Enhancement via Fragmentation in Public IEEE 802.11b WLAN","authors":"Seongkwan Kim, Jongseok Kim, Sekyu Park, Sunghyun Choi, J. Lee, H. Jung","doi":"10.1109/APCC.2006.255787","DOIUrl":"https://doi.org/10.1109/APCC.2006.255787","url":null,"abstract":"In wireless packet networks, such as IEEE 802.11 wireless LAN, users can suffer from bad channel quality at cell boundaries, and wireless stations may not overcome the bad communication condition, in spite of using the lowest transmission rate via link adaptation. Unless handoff is considered due to the deployment of APs, the case of initial access to a WLAN network, and so on in such an area, fragmentation can be a unique and compatible solution for coping with the channel limitation. We have evaluated a public WLAN service network, called NESPOT, which is operated by Korea Telecom, especially the case of initial access. We evaluate delay and error performances of NESPOT initial access procedure via both mathematical analysis and simulations. From the results, we conclude that WLAN user can experience enhanced goodput, enlarged reachability, and shortened delay via fragmentation. We also propose a practical method, TCP maximum segment size spoofing to get the same effect as fragmentation. Finally, we propose a policy, called cut-off delay, for WLAN users not to wait too long time to get an IP address without severe performance degradation","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115179968","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}

引用次数: 3

Polyphase Structure with Periodically Time-Varying Coefficients: a Realization for Minimizing Hardware Subject to Computational Speed Constraint 具有周期性时变系数的多相结构:一种受计算速度限制的最小化硬件的实现

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255897

S. Tantaratana

{"title":"Polyphase Structure with Periodically Time-Varying Coefficients: a Realization for Minimizing Hardware Subject to Computational Speed Constraint","authors":"S. Tantaratana","doi":"10.1109/APCC.2006.255897","DOIUrl":"https://doi.org/10.1109/APCC.2006.255897","url":null,"abstract":"It is well known that polyphase realizations of multirate converters reduce the constraint on computational speed of the hardware, namely, the filter is decomposed into several filters which operate at a slower speed. With a slower speed, the speed requirement of hardware is relaxed. The speed reduction depends on the signal conversion rate. However, there is no hardware saving since the amount of hardware is similar to that of the original filter. Recently, periodically time-varying (PTV) structures have been proposed to reduce the hardware of multirate converters. By using each hardware multiplier for realizing several filter coefficients by means of sharing in a periodic manner, we achieve hardware reduction. The amount of hardware reduction depends on the signal conversion rate. However, the processing speed of each multiplier is the same as the that of the original filter. Each of the two techniques above achieve one objective while the other factor is unchanged. We show that by combining the two techniques to obtain a polyphase structure with PTV coefficients, we can obtain both hardware saving and reduction in computation speed requirement. We can trade the hardware saving and the reduction in computation requirement. From the viewpoint that we wish to obtain hardware realization of a multirate converters when the processing speed is limited by the hardware's computation speed, the proposed PTV polyphase structure offers minimum hardware under such limitation. The decimator is used in this paper to demonstrate the idea","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123523496","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}

引用次数: 2

Ricean K-factor Estimation in Cellular Communications Using Kolmogorov-Smirnov Statistic 基于Kolmogorov-Smirnov统计量的蜂窝通信Ricean k因子估计

2006 Asia-Pacific Conference on Communications Pub Date : 2006-12-11 DOI: 10.1109/APCC.2006.255906

Bo-Chieh Liu, Ken-Huang Lin, Ju-Ya Chen

引用次数: 6