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

2010 Second International Conference on Future Networks最新文献

筛选
英文 中文
The Pivotal Role of Tera-scale Performance in Future Networks: Sequoia vs Multi-core Teraflop Chip 兆级性能在未来网络中的关键作用:红杉与多核兆级浮点运算芯片
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.97
Samreen Amir, M. Asif, M. Mustafa
{"title":"The Pivotal Role of Tera-scale Performance in Future Networks: Sequoia vs Multi-core Teraflop Chip","authors":"Samreen Amir, M. Asif, M. Mustafa","doi":"10.1109/ICFN.2010.97","DOIUrl":"https://doi.org/10.1109/ICFN.2010.97","url":null,"abstract":"With the increasing greed for the high data rates and maximum bandwidth utilization, the technology improvement and enhancement is been exponential in the current decade. Researchers hope that massive parallel processing (MPP) computing equipment will provide processing rates of 10 trillion or quadrillion floating-point operations per second. It would allow scientists to build models of phenomena that have never before been imitated. Many vendors are busy in the research and development of such speedy machines. This paper will provide a comparative analysis of the future high computing machines in terms of speed, size applications, architecture and affordability. A predictive conclusion regarding the dominance of one on the other will also be drawn on the basis of this comparison.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131789934","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 Conceptual Approach against Next Generation Security Threats: Securing a High Speed Network Protocol - UDT 一种对抗下一代安全威胁的概念方法:保护高速网络协议- UDT
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.80
D. Bernardo, D. Hoang
{"title":"A Conceptual Approach against Next Generation Security Threats: Securing a High Speed Network Protocol - UDT","authors":"D. Bernardo, D. Hoang","doi":"10.1109/ICFN.2010.80","DOIUrl":"https://doi.org/10.1109/ICFN.2010.80","url":null,"abstract":"Various technologies have emerged since the Internet protocols were first introduced. Many of these technologies were compellingly complex to implement that it was thought that the existing Internet would have to be redesigned in order to accommodate them. While these proved to be false, security, however, remains to be a major challenge that current and future network designs should accommodate to achieve survivable and secure networks. This paper reaffirms that future network security can be effectively addressed on the lower-level by introducing an identity packet for network protocols. In this paper, we will focus on the newly developed network protocols, such as UDT, a considered next generation protocol. This original work is aimed at providing another way of securing high speed network protocols such as UDT.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130513795","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}
引用次数: 17
Tomlinson-Harashima Precoding in the Physical Network Coded Two Way MIMO Relay Channels 物理网络编码双向MIMO中继信道中的Tomlinson-Harashima预编码
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.36
Peng Gong, Jie Xu, Lin Qiu
{"title":"Tomlinson-Harashima Precoding in the Physical Network Coded Two Way MIMO Relay Channels","authors":"Peng Gong, Jie Xu, Lin Qiu","doi":"10.1109/ICFN.2010.36","DOIUrl":"https://doi.org/10.1109/ICFN.2010.36","url":null,"abstract":"This paper considers precoding schemes in physical network coded two-way MIMO relay channels. We propose a lattice reduction aided Tomlinson-Harashima Precoding(THP) scheme at first, and compare it with the existing amplify-and-forward (AF) scheme zero-forcing (ZF) schemes traditional decode-and-forward (DF) scheme and network coding (NC) scheme. Simulations show that the proposed scheme outperforms the existing schemes. This improvement is because we have combined the advantages of both THP and lattice reduction thus the effective transmitting power is significantly increased.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133769079","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
A load-balancing scheme based on Bloom Filters 一种基于布隆过滤器的负载均衡方案
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.37
C. Gou, Rongcai Zhao, Jing Diao
{"title":"A load-balancing scheme based on Bloom Filters","authors":"C. Gou, Rongcai Zhao, Jing Diao","doi":"10.1109/ICFN.2010.37","DOIUrl":"https://doi.org/10.1109/ICFN.2010.37","url":null,"abstract":"Traditional intrusion detection equipments hardly satisfy the application requirements as the data rates of modern networks rise. Adaptive load balancing algorithm (Adaptive HRW Hashing) may make attacks undetected due to flow remapping. So, the load balancing algorithms in network intrusion detection system (NIDS) are firstly studied, and then a load balancing algorithm based on Bloom Filters is proposed. Experimental data shows that the algorithm has the similar load balancing effect, but with a lower rate of flow remapping.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134293475","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
The Research on the Mutual Benefit Stereotypia of Product Theory and Empirical Based on the Relationship Value 基于关系价值的产品互利刻板印象理论与实证研究
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.81
Jingdong Chen, Jiao Xue
{"title":"The Research on the Mutual Benefit Stereotypia of Product Theory and Empirical Based on the Relationship Value","authors":"Jingdong Chen, Jiao Xue","doi":"10.1109/ICFN.2010.81","DOIUrl":"https://doi.org/10.1109/ICFN.2010.81","url":null,"abstract":"Product benefits positioning theory has been well-known; it can create differences in product value. However, the product development to post-industrial society, not only the interests of the differences, but also produced a level of mutual (mutual benefit create relationship value). In this paper, the mutual benefit stereotypic Theory which based on relationship value is put forward. From the goods, services and network three-pronged and take fit as the intermediary, to build mutual benefit stereotyped theoretical model, and select the car as the empirical object of study, verify the relationship between the key dimensions of mutual benefit and the relationship value.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"598 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133868098","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
A Survey on Topology Control in Wireless Sensor Networks 无线传感器网络拓扑控制研究进展
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.31
Zheng Gengzhong, Liu Qiumei
{"title":"A Survey on Topology Control in Wireless Sensor Networks","authors":"Zheng Gengzhong, Liu Qiumei","doi":"10.1109/ICFN.2010.31","DOIUrl":"https://doi.org/10.1109/ICFN.2010.31","url":null,"abstract":"Topology control is one of the fundamental problems in WSNs (wireless sensor networks). It is of great importance for prolong lifetime, reducing radio interference, for prolong lifetime, increasing the efficiency of MCA (media access control)protocols and routing protocols, ensure the quality of connectivity and coverage, increasing the network service and so on. In this survey paper, different network models are presented, and discusses several graph models used in topology control, the representative research works are introduced through analyses power control and sleep scheduling. The present hot spots and the future trends on the research of topology control are summarized also.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123975513","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}
引用次数: 76
A New Shared Access Method for IMS-Based Services 基于ims的业务共享访问新方法
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.99
Xue-xia Li, Fan Zhang, P. Verma
{"title":"A New Shared Access Method for IMS-Based Services","authors":"Xue-xia Li, Fan Zhang, P. Verma","doi":"10.1109/ICFN.2010.99","DOIUrl":"https://doi.org/10.1109/ICFN.2010.99","url":null,"abstract":"IMS as an IP connectivity and service control architecture is increasingly drawing more attention as the future architecture of the core network. At the same time, the cellular backhauled Wi-Fi has been constantly gaining ground as data rates of commercial cellular network continue to increase rapidly while the cost of data services declines at a similar pace. This paper presents a methodology using which IMS-based services can be offered to multiple user devices across a Wi-Fi network. The primary user in the case considered is a bona fide IMS user and Wi-Fi network backhauled by a cellular network. The proposed shared services method will enable sharing of IMS-based services that a UMTS/IMS user has subscribed to, by taking advantage of the authentication scheme specified in 3GPP TR 33.978 security aspects of early IMS, and the availability of cellular backhauled Wi-Fi network.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127817844","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
Behavioural Correlation for Detecting P2P Bots 检测P2P机器人的行为相关性
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.72
Yousof Al-Hammadi, U. Aickelin
{"title":"Behavioural Correlation for Detecting P2P Bots","authors":"Yousof Al-Hammadi, U. Aickelin","doi":"10.1109/ICFN.2010.72","DOIUrl":"https://doi.org/10.1109/ICFN.2010.72","url":null,"abstract":"In the past few years, IRC bots, malicious programs which are remotely controlled by attackers through IRC servers, have become a major threat to the Internet and for users. These bots can be used in different malicious ways such as issuing distributed denial of services attacks to shut down other networks and services, keystrokes logging, spamming,traffic sniffing cause serious disruption on networks and users. New bots use peer to peer (P2P) protocols start to appear as the upcoming threat to Internet security due to the fact that P2P bots do not have a centralized point to shutdown or trace back, thus making the detection of P2P bots is a real challenge. In response to these threats, we present an algorithm to detect an individual P2P bot running on a system by correlating its activities. Our evaluation shows that correlating different activities generated by P2P bots within a specified time period can detect these kind of bots.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124238429","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}
引用次数: 20
A Robust Particle Filter for People Tracking 一种用于人跟踪的鲁棒粒子滤波器
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.34
Bo Yang, Xinting Pan, Aidong Men, Xiaobo Chen
{"title":"A Robust Particle Filter for People Tracking","authors":"Bo Yang, Xinting Pan, Aidong Men, Xiaobo Chen","doi":"10.1109/ICFN.2010.34","DOIUrl":"https://doi.org/10.1109/ICFN.2010.34","url":null,"abstract":"Among various tracking algorithms, particle filtering (PF) is a robust and accurate one for different applications. It also allows data fusion from different sources due to its inherent property without increasing the dimension of the state vector. In this paper, we propose three strategies to improve the performance of particle filters. First, our approach combines the foreground region with the particle initialization and similarity measure step to lower the background distraction. Second, we form the proposal distribution for particle filters from the dynamic model predicted from the previous time step. The combination of the two approach leads to fewer failure than traditional particle filters. Fusion of multiple cues including the spatial-color cues and edge cues is also used to improve the estimation performance. It is shown that with the improved proposal distribution above, the particle filter can provide greatly improved estimation accuracy and robustness for complicated tracking problems.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130783069","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
Optimal Power Control for Cognitive Relay Networks over Fading Channels 衰落信道认知中继网络的最优功率控制
2010 Second International Conference on Future Networks Pub Date : 2010-01-22 DOI: 10.1109/ICFN.2010.57
Wenjing Yue, B. Zheng, Qing-min Meng
{"title":"Optimal Power Control for Cognitive Relay Networks over Fading Channels","authors":"Wenjing Yue, B. Zheng, Qing-min Meng","doi":"10.1109/ICFN.2010.57","DOIUrl":"https://doi.org/10.1109/ICFN.2010.57","url":null,"abstract":"In this paper, we study the outage performance of proposed cognitive relay network which is defined by a source, a destination and a group of clusters each of which consists of a cognitive relay node and a primary node. In suggested model, a source is assisted by cognitive relay nodes which allow coexisting with primary nodes by imposing severe constraints on the transmission power so that they operate below the noise floor of primary nodes. Here, we mainly focus on understanding that the cognitive relay node impacts on the outage performance of proposed system model for Rayleigh fading channels under interference power constraints. A relay transmission scheme, namely, regenerative decode-and-forward (RDF) is considered. Considering a scenario with two relays, we derive the optimal power control policies of the cognitive relay nodes to achieve the minimum outage probability under both the peak and average interference power constraints over Rayleigh fading channels. Finally, the numerical results are presented to validate our theoretical results. Numerical performance results show that outage probability performance improves with the increase of the average interference power constraint and peak interference power constraint, and the power control policy under the average interference power constraint is more effective than that under the peak interference power constraint.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130999377","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}
引用次数: 7
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信