发布求助
文献互助 智能选刊 最新文献

2009 First International Conference on Future Information Networks最新文献

筛选
英文 中文
Peer-to-peer based intrusion detection modeling and analysis 基于点对点的入侵检测建模与分析
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339561
Zhang Xiaosong, Chen Ting, M. Yue, Li Hua
{"title":"Peer-to-peer based intrusion detection modeling and analysis","authors":"Zhang Xiaosong, Chen Ting, M. Yue, Li Hua","doi":"10.1109/ICFIN.2009.5339561","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339561","url":null,"abstract":"This paper proposes a model of intrusion detection based on peer-to-peer (p2p) mechanism. The crux of our research is that quantitatively analyze the response rate of the global intrusion detection system (IDS). The principal approaches are modeling, deduction and numerical simulation. Theoretical proof and experiments demonstrate that our model is reliable and robust. Based on this model, we draw the following conclusions. First, this model is insensitive to network scale so it is adaptable to large-scale network. Second, response rate depends mostly on peer's degree. Third, our model does not care about how many peers are aware of intrusion in the beginning. In a word, with proper parameters our model can achieve an extremely rapid response rate.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"18 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":"125303826","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
A distributed routing algorithm based on available multi-nexthop in IP networks IP网络中基于可用多下一跳的分布式路由算法
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339589
Li-an Guan, Binqiang Wang, Xuan-yong Zhu, Dan Li
{"title":"A distributed routing algorithm based on available multi-nexthop in IP networks","authors":"Li-an Guan, Binqiang Wang, Xuan-yong Zhu, Dan Li","doi":"10.1109/ICFIN.2009.5339589","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339589","url":null,"abstract":"Traditional routing algorithms have many drawbacks such as worse resource utilization and stability. Present investigations focus on how to mitigate them in traditional algorithms rather than design a new algorithm to terminate them. In this paper, a novel distributed routing algorithm based on available multi-nexthop is proposed. This is different from traditional single-nexthop schemes. The nodes are orderly planned (assign different heights to different nodes based on some node) by improved breadth-first search algorithm(IBFS). Then, the network topology form a directed acyclic graph based on one destination node and other nodes can forward packets to it by available multi-nexthop which is derived from different heights. Simulation results show that the proposed algorithm has low computation complexity and makes network traffic tend to equilibrium due to the reduction of the traffic fluctuation in links. So the algorithm has a high resource utilization rate and can mitigate network congestions greatly.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"1 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":"129942957","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}
引用次数: 0
Static throughput optimal scheduling for wireless multicast 无线组播静态吞吐量最优调度
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339580
Jiang Yu, Youyun Xu, Wei Xie
{"title":"Static throughput optimal scheduling for wireless multicast","authors":"Jiang Yu, Youyun Xu, Wei Xie","doi":"10.1109/ICFIN.2009.5339580","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339580","url":null,"abstract":"wireless multicast can exploit both multiuser diversity and broadcast gain together simultaneously, which are the special virtues of wireless communication. However, we have to adopt appropriate tradeoff between multiuser diversity gain and broadcast gain in order to achieve optimal system throughput. This paper studied the problem of wireless multicast scheduling, and proposed a static optimal wireless scheduling algorithm which achieve optimal throughput in sense of probability. This scheme determines the optimal threshold of the channel gain and the optimal number of active users according to the probability distribution function of the envelope of the fading channel. The system throughput of the scheme can approach the upper bounder of system throughput if the number of the system is large enough. Only when the average SNR (signal to noise ratio) changes the scheme has to adjust the multicast threshold and number of users. It has a very low complexity, and is easy to implement. At last, we prove the proposed algorithm achieve higher system throughput than other multicast algorithms by simulations.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"42 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":"123211658","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}
引用次数: 1
A scheme of issuing inter-domain trust certificate based on proxy signature 一种基于代理签名的域间信任证书颁发方案
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339555
Chen Bo, Gu Li-ze, Cui Bao-jiang
{"title":"A scheme of issuing inter-domain trust certificate based on proxy signature","authors":"Chen Bo, Gu Li-ze, Cui Bao-jiang","doi":"10.1109/ICFIN.2009.5339555","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339555","url":null,"abstract":"To solve the problem of carrying trust value, we use trust certificate which is issued by the Trust Management Center in the Trust Management System to carry it. Each Trust Management Center should only be in charge of auditing and issuing trust certificate in its own domain. Face to the problem of how to get an inter-domain trust certificate, we provide a scheme that apply the proxy signature to generate trust certificate. This scheme can solve the problem of issuing trust certificate in inter-domain efficiently.","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":"130930338","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}
引用次数: 0
Shortest path routing with reliability requirement in delay tolerant networks 时延容忍网络中具有可靠性要求的最短路径路由
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339556
Huai-En Lian, Chien Chen, Je-Wei Chang, Chien-Chung Shen, R. Jan
{"title":"Shortest path routing with reliability requirement in delay tolerant networks","authors":"Huai-En Lian, Chien Chen, Je-Wei Chang, Chien-Chung Shen, R. Jan","doi":"10.1109/ICFIN.2009.5339556","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339556","url":null,"abstract":"The topology of a delay tolerant network (DTN) over time has been modeled by a space-time graph. However, the mobility of nodes, such as buses, may not be completely predictable due to factors such as traffic load, road condition, the number of passengers getting on and off the buses, and the operations of traffic lights. In this paper, we adapt the space-time graph by augmenting each horizontal edge with a direct contact probability to model the uncertainty of connectivity. With such an augmented space-time graph, our goal is to compute a shortest routing path satisfying a given end-to-end delivery reliability in a DTN. To facilitate such computation, we adapt the Floyd-Warshall algorithm to compute the maximum contact probability matrix at each time interval. By using an iterative matrix multiplication scheme on a maximum contact matrix, we can compute the shortest path satisfying the reliability constraint. Simulation results validate the performance of our solution which achieves a good balance between delay and reliability.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"191 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132570029","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}
引用次数: 16
A hierarchical route optimization scheme in nested mobile network with source routing binding update 基于源路由绑定更新的嵌套移动网络分层路由优化方案
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339569
Tianhan Gao, Nan Guo, Zhiliang Zhu
{"title":"A hierarchical route optimization scheme in nested mobile network with source routing binding update","authors":"Tianhan Gao, Nan Guo, Zhiliang Zhu","doi":"10.1109/ICFIN.2009.5339569","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339569","url":null,"abstract":"In nested mobile network, traffic should be encapsulated and tunneled for each level of nesting, which leads to increased overhead and sub-optimal routing. In this paper, we investigate a localized mobility management framework and propose a source routing binding update mechanism based on mobile anchor point (MAP) to optimize the route of nested mobile network that supports NEMO basic support protocol (NBS). Following superiority can be achieved with this scheme: 1) An one-way tunnel is built between top level mobile router (TLMR) and its home agent (HA) to accomplish route optimization. 2) The localized framework reduces mobility registration overhead and boosts the mobility management performance. We also builds an analysis model for performance evaluation, through quantitative comparisons with existing schemes, our scheme triumphs in terms of packet delivery overhead and mobility registration costs.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"16 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":"131897142","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
Authenticated key distribution protocol in universal network 通用网络中认证密钥分发协议
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339565
Lijuan Zheng, Zhen Han, Rui Zhang, Tongrang Fan
{"title":"Authenticated key distribution protocol in universal network","authors":"Lijuan Zheng, Zhen Han, Rui Zhang, Tongrang Fan","doi":"10.1109/ICFIN.2009.5339565","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339565","url":null,"abstract":"Universal network and pervasive service is one kind of new network architecture. In this architecture, in order to guarantee the security of access network and terminal, terminal access control and access network authentication must both be implemented. Terminal unified access control method based on identifier realizes unified access control of various terminals, authentication of authentication center, and key negotiation between access switching router and terminal. But it does not consider the authentication of access switching router. So the attacker can impersonate legitimate access switching router to acquire the information of the terminal, thus brings threats to terminal's security. Aiming at this problem, a provably secure authenticated key distribution protocol AKDP is put forward in this paper. This new protocol can effectively protect unauthorized terminal access network, prevent unauthentic authentication center from cheating the terminal, avoid impersonation of illegal access switching router, and guarantee the freshness of the session key. It is provably secure based on BR extended model. Through performance analysis, the protocol has high efficiency.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"25 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":"114783030","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
Poisonedwater: an adaptive approach to reducing the reputation ranking error in P2P networks 毒水:一种减少P2P网络声誉排名误差的自适应方法
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339607
Yufeng Wang, A. Nakao
{"title":"Poisonedwater: an adaptive approach to reducing the reputation ranking error in P2P networks","authors":"Yufeng Wang, A. Nakao","doi":"10.1109/ICFIN.2009.5339607","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339607","url":null,"abstract":"This paper preliminarily proposes a reputation ranking algorithm called “Poisonedwater” to resist front peer attack—peers that gain high reputation values by always cooperating with other peers and then promote their malicious friends through passing most of their reputation values to those malicious peers. Specifically, we introduce a notion of Poisoned Water (PW) that iteratively floods from identified malicious peers in the reverse direction of the incoming trust links towards other peers. Furthermore, we propose the concept of Spreading Factor (SF) that is logistically correlated to each peer's PW level. Then, we design the new reputation ranking algorithm seamlessly integrated with peers' recommendation ability (represented as SF), to infer the more accurate reputation ranking for each peer. Simulation results show that, in comparison with Eigentrust, Poisonedwater can significantly reduce the ranking error ratio up to 20%, when P2P systems exist many malicious peers and front peers.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"52 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":"117163064","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
A rate adapted TCP acceleration for mobile wireless network 一种适用于移动无线网络的TCP加速速率
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339568
Sungwon Lee
{"title":"A rate adapted TCP acceleration for mobile wireless network","authors":"Sungwon Lee","doi":"10.1109/ICFIN.2009.5339568","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339568","url":null,"abstract":"FAST Transmission Control Protocol (TCP) was previously proposed for high capacity with long delay network environments, and ‘FAST TCP with Snoop’ performs better than conventional TCP enhancements within mobile wireless network environments. However, FAST TCP has limitations when dealing with a dynamic mobile wireless link where high Frame Error Ratio (FER) and frequent delay changes due to variable rate. We propose an enhanced TCP acceleration algorithm at the TCP sender side which efficiently adapt to the maximum transmission rate of a mobile wireless link using Round Trip Time (RTT) and virtual Receiver Window (RWND) information. Also, the proposed algorithm provides superior performance over mobile wireless network environments.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"6 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":"123921102","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}
引用次数: 0
Routing optimization for inter-domain traffic engineering under separation and mapping architecture 分离映射架构下的域间流量工程路由优化
2009 First International Conference on Future Information Networks Pub Date : 2009-11-20 DOI: 10.1109/ICFIN.2009.5339604
Nan Yao, Ming Wan, Ke Xiong, Hongke Zhang
{"title":"Routing optimization for inter-domain traffic engineering under separation and mapping architecture","authors":"Nan Yao, Ming Wan, Ke Xiong, Hongke Zhang","doi":"10.1109/ICFIN.2009.5339604","DOIUrl":"https://doi.org/10.1109/ICFIN.2009.5339604","url":null,"abstract":"To resolve the scalability problem in the existing Internet, there are many researches proposing the idea of separating the Internet into two independent evolving spaces, the access network and the core network, respectively. Such separation provides us opportunities to reconsider the methods of implementation of inter-domain traffic engineering under the new network environment. Based on the existing architecture of universal network, we propose a new method for implement traffic engineering and give detailed contrast between the newly proposed method and traditional method being used in current Internet. And we give feasibility analysis of the method.","PeriodicalId":123746,"journal":{"name":"2009 First International Conference on Future Information Networks","volume":"05 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":"129408225","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}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信