{"title":"A novel mobility management mechanism based on an efficient Locator/ID separation scheme","authors":"Zhiwei Yan, Huachun Zhou, Hongke Zhang, Sidong Zhang","doi":"10.1109/ICFIN.2009.5339610","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339610","url":null,"abstract":"The challenge to provide seamless mobility in the near future emerges as a key topic in various standardization bodies. In this paper, on the basis of an efficient and scalable Locator/ID separation (LIDS) architecture, a mobility management mechanism is designed. There are two contributions of our solution. Firstly, we separate the access network from the core network. Besides, to provide the seamless mobility support, locator/ID separation is used which can provide transparency to the upper layer applications. Then, the performance analysis is presented for both horizontal and vertical handover scenarios. The results show that our LIDS based architecture provides an outstanding network-based mobility management with route optimization support compared with the IP based approaches Mobile IPv6 and Proxy Mobile IPv6).","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129140567","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}
Lu Ning-ning, Zhou Hua-chun, Dong Kai-hong, Zhang Hong-ke
{"title":"Optimized design of SPD for NGI","authors":"Lu Ning-ning, Zhou Hua-chun, Dong Kai-hong, Zhang Hong-ke","doi":"10.1109/ICFIN.2009.5339563","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339563","url":null,"abstract":"IPsec is also an important security protocol for next generation internet (NGI) and it has become a hot topic in security communication research to increase IPsec's performance without any security decreasing. In this article, we analyze the implementation of IPsec's security policy database (SPD) and its searching method. We also proposed an optimized design for the SPD with hash table based on chaining addressing to improve its performance and scalability. Finally, we compare our new method with the existing one and find that our new SPD design could effectively reduce the average searching length of security policy.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"464 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131954666","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 new radio access scheme based on CDMA for B3G wireless communications","authors":"Yi Zhang, Qi Liu, Lan-yin Xie","doi":"10.1109/ICFIN.2009.5339571","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339571","url":null,"abstract":"a new scenario of multiple access technology for beyond 3G wireless communications named CDD- dual-CDMA is proposed. CDD (code-division duplex) is a method to improve the spectrum efficiency by adding smart codes into time-division duplex (TDD) technology. The concept of dual-CDMA (dual-code division multiple access) is dividing traffic channels by both LAS (large area synchronous) codes and LS (loosely synchronous) cods, in order to eliminate inter-symbol interference (ISI) and multiple access interference (MAI). At the same time, the problem that the number of available smart codes is limited could also be solved. In the paper, the performance of CDD- dual-CDMA is analyzed. The result of simulation shows that BER (bit error rate) performance of CDD- dual-CDMA is much better than traditional random codes. Additionally, CDD- dual-CDMA scenario is a flexible scheme, and can be used for improvement of TD-SCDMA system. Therefore, CDD- dual-CDMA scenario is more suitable for the future mobile communications.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132216480","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":"Research on the resource-control technology in the reconfiguration router unit component composition process","authors":"Liu Qiang, Binqiang Wang, Jiang Nan, Wang Jin","doi":"10.1109/ICFIN.2009.5339591","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339591","url":null,"abstract":"The reconfiguration router unit (RRU) is one of the most effective solutions to improve router function extend. It can satisfy the urgent need of multi-network and multi-business. Component composition and compositional reasoning are the core technologies and frontier research areas in RRU. In the process of component composition, resource-control of router is the most important factor. How to detect the resource of router and reconfiguration the router by the router limit is an important research field. Based on the characteristics of RRU and software components and inspired by software component reusing, component composition algorithm is proposed in this paper to integrate software components simply and conveniently. In the algorithm, the reconfiguration process is divide into three grade: business reconfiguration, modual composition, component composition. Moreover, based on the using environment of the router, this paper take an example as change Ipv6 router to Ipv4 router.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132807871","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":"ID management among clouds","authors":"Xin Huang, Tingting Zhang, Yifan Hou","doi":"10.1109/ICFIN.2009.5339583","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339583","url":null,"abstract":"In the following years, the desktop-based applications will be changed to cloud computing gradually. Since all users' profile and context data will be stored on the service supplier side based on their ID. ID is becoming a security bottleneck: attackers can trace all other information via user ID. Increasingly, a simple service may be involved in a chain of service clouds; each cloud is able to access data in its cloud without the control of any technology. With ID and password cross utilization in clear text, leakage of ID profile and password in one cloud may propagate to the whole cloud chain. Without proper protection, the success of cloud computing will be threatened by ID privacy leakage. In this paper, privacy preserved ID profile utilizing protocol (PPID) is proposed to prevent this privacy flaw. PPID together with its extension ID anonymity protocol (IDA) separate ID and services. With these two protocols, threaten from crash of whole cloud chain caused by ID privacy leakage is minimized.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133182588","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}
X. Sanchez-Loro, J. Casademont, J. Paradells, J. Ferrer, A. Vidal
{"title":"Proposal of a clean slate network architecture for ubiquitous services provisioning","authors":"X. Sanchez-Loro, J. Casademont, J. Paradells, J. Ferrer, A. Vidal","doi":"10.1109/ICFIN.2009.5339598","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339598","url":null,"abstract":"The Pervasive Computing field is almost always addressed from application, middleware, sensing or Human Computer Interaction perspective. Thus, solutions are usually designed at application level or involve developing new hardware. Although current layered network architectures (mainly TCP/IP stack) have enabled internetworking of lots of different devices and services, they are neither well-suited nor optimized for pervasive computing applications. Hence, we firmly believe that we should have an underlying network architecture providing the flexible, context-aware and adaptable communication infrastructure required to ease the development of ubiquitous services and applications. Herein, we propose a clean slate network architecture to deploy ubiquitous services in a Pervasive and Ubiquitous Computing environment. The architecture is designed to avoid hierarchical layering, so we propose a service-oriented approach for a flow-oriented context-aware network architecture where communications are composed on the fly (using reusable components) according to the needs and requirements of the consumed service.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116616866","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":"Traffic characterization and service performance in FON network","authors":"Alia Asheralieva, T. Erke, K. Kilkki","doi":"10.1109/ICFIN.2009.5339600","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339600","url":null,"abstract":"This paper reports on the results of service performance in FON network - Wi-Fi network where each hotspot has its owner, Fonero, who has priority in service, and the right to grant access to the limited number of visitors of his hotspot. Simulation model developed assuming that users in FON behave similar to the users in Wi-Fi, and taking into account service priority of Fonero. Results of simulation show that service rate for visitors in FON is a random value changing according to Fonero's behavior. Quality of service perceived by individual visitor depends mainly on his workload. High peakedness of users' workload during observation increases losses and delays in the system. Limitation in number of visitors at the spot does not necessarily improve service quality. Service accessibility degrades when peakedness of system occupation is increasing.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115933926","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":"Local-map-based candidate node-encircling pre-configuration cycles construction in survivable mesh networks","authors":"Taifei Zhao, Xizheng Ke, Peilin Yang","doi":"10.1109/ICFIN.2009.5339614","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339614","url":null,"abstract":"This paper studies the protection problem of pre-configuration cycles (p-cycles) in survivable mesh networks. A new algorithm called Local-map-based Finding p-Cycles Algorithm (LFCA) is proposed to find the candidate p-cycles. The major difference between the previous algorithms of finding cycles and LFCA is that LFCA can find node-encircling p-cycles and some special link p-cycles which must contain some fixed nodes. The performance of LFCA is evaluated by computer simulations on the real world network topology. ;","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131078437","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":"Transporting voice using MBS in a WiMAX multi-hop relay environment","authors":"Chengxuan He, O. Yang, Guoqiang Wang, D. Gao","doi":"10.1109/ICFIN.2009.5339577","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339577","url":null,"abstract":"This paper evaluates the QoS performance of transporting voice using WiMAX MBS (Multicast/Broadcast Service). Our results demonstrate that the proposed MBS architecture can address several design issues arising from the mobility of the relay stations and the mobile stations. The service architecture is feasible for voice transport in the WiMAX multi-hop network.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114071416","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 PCU resource scheduling algorithm based on Nash Equilibrium","authors":"Yunfei Ma, Yu Gao, Lu Wang","doi":"10.1109/ICFIN.2009.5339588","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339588","url":null,"abstract":"An efficient scheduling algorithm can make full use of the network resources, particularly in the high-load network. In this paper, a new PCU scheduling algorithm is given, which is based on Nash Equilibrium, and aiming at making sure that all users in the network (both GPRS and EDGE users) can get the best speed as possible.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129009919","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}