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

International Conference on Future Generation Communication and Networking最新文献

筛选
英文 中文
A Scale-Free Routing Algorithm in Wireless Sensor Networks 无线传感器网络中的一种无标度路由算法
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2008.11
Ye Xu, Zhuo Wang
{"title":"A Scale-Free Routing Algorithm in Wireless Sensor Networks","authors":"Ye Xu, Zhuo Wang","doi":"10.1109/FGCN.2008.11","DOIUrl":"https://doi.org/10.1109/FGCN.2008.11","url":null,"abstract":"A scale-free routing protocol and algorithm in wireless sensor networks are studied in this paper. The algorithm could be used to form a WSN with a scale-free-network-like topology which helps shorten the length of the routing path. Together with the information fusion function involved in the scale-free routing protocol, the algorithm could dramatically reduce the redundancies of the datagram transferred in the WSN and thus improve the life cycle of WSN.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124578144","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}
引用次数: 4
XOR Hashing Algorithms to Measured Flows at the High-Speed Link 高速链路流量测量的异或散列算法
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2008.110
Guang Cheng, Wei Zhao, J. Gong
{"title":"XOR Hashing Algorithms to Measured Flows at the High-Speed Link","authors":"Guang Cheng, Wei Zhao, J. Gong","doi":"10.1109/FGCN.2008.110","DOIUrl":"https://doi.org/10.1109/FGCN.2008.110","url":null,"abstract":"Flow sampling algorithms and data streaming algorithms have widely adopted the hashing algorithms to detect flow information at the high-speed links for the applications of the flow distribution, the number of flow, the heavy-tailed flow, and so on. Hashing algorithms involve transforming a key inside a hash value. The hashing algorithms used in high-speed networks have some specific properties: uniformity of distribution, computation speed. In this paper, we analyze the XOR operator in the hash-based flow selection function at the high-speed links, and prove that bit XOR operator can increase the uniformity of distribution. The hashing algorithms on the XOR operate are evaluated by mathematical analysis and trace-driven experiments on CERNET.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126145905","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
Research on Recognition Methods for Traffic Signs 交通标志识别方法研究
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2008.16
Zhenghe Song, Bo Zhao, Zhong-xiang Zhu, Meng Wang, Enrong Mao
{"title":"Research on Recognition Methods for Traffic Signs","authors":"Zhenghe Song, Bo Zhao, Zhong-xiang Zhu, Meng Wang, Enrong Mao","doi":"10.1109/FGCN.2008.16","DOIUrl":"https://doi.org/10.1109/FGCN.2008.16","url":null,"abstract":"In order to insure safety of driving vehicle in the driver assistance system and effective navigation in the automatic driving system, a new recognition method based on the neural network and the invariant moments for traffic signs was proposed in this paper. Firstly, the area of the traffic sign was located from the complicated image background. Secondly, the features of each traffic sign were obtained by Hu invariant moments. Finally, the traffic signs were recognized by the BP neural network. Experimental results proved that the recognition method can be used for fast and efficient recognition of the traffic signs with high accuracy. This research can provide technological supports to the autonomous vehicles and the vehicle safety driving assistance.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133970372","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
BGP-ESOM: BGP Egress Selection Optimization Model Based on Traffic Demand BGP- esom:基于流量需求的BGP出口选择优化模型
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2007.80
L. Yaping, He Junfeng, Gong Zhenghu
{"title":"BGP-ESOM: BGP Egress Selection Optimization Model Based on Traffic Demand","authors":"L. Yaping, He Junfeng, Gong Zhenghu","doi":"10.1109/FGCN.2007.80","DOIUrl":"https://doi.org/10.1109/FGCN.2007.80","url":null,"abstract":"Presently, the most common egress selection algorithm that we used in transit AS (Autonomous System) is hot-potato algorithm. However, the hot- potato algorithm has many problems which have been discussed in some papers. Prior research has considered a range of possible techniques, but has mostly focused on how to make the best static assignment. There is a need for good model and framework that consider how to make the best static assignment and how to adapt to changes (such as intra-domain topology change and traffic change) at the same time. In this paper, we propose a BGP egress selection optimization model (BGP-ESOM), which consists of two phases: the static phase and the dynamic phase. An implementation framework (BGP-RCS) is also developed for it. In the static phase, the assignment is realized by converting the BGP egress problem into the problem of making the best configuration of the IGP (Interior Gateway Protocol) metrics. In the dynamic phase, some algorithms are used to adapt to the topology changes. The main idea is that we use the static phase to make the long-term static optimization, and use the dynamic phase to make the short-term but timely dynamic optimization.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116702331","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 DMR Fair Algorithm for Realtime Scheduler 一种实时调度的DMR公平算法
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2008.98
Shijun Zhang, Xin Yu, Shao-hua Yu, Benxiong Huang
{"title":"A DMR Fair Algorithm for Realtime Scheduler","authors":"Shijun Zhang, Xin Yu, Shao-hua Yu, Benxiong Huang","doi":"10.1109/FGCN.2008.98","DOIUrl":"https://doi.org/10.1109/FGCN.2008.98","url":null,"abstract":"Earliest deadline first (EDF) is one of the most popular soft real time (SRT) scheduling algorithms being widely used. Slack time and overrun are the two key factors that will affect the performance. Reclaiming slack is a favorite approach that has been introduced to EDF. Adaptations of EDF tend to concentrate on reducing average deadline miss ratio (DMR) and improving average tardiness, while paying little attention to fairness of the service quality between tasks, which is important for streaming media applications. A DMR fair EDF algorithm is proposed in this paper, which use expectative execution time as a factor, in addition to its deadline, when a task¿s priority needs to be determined. In comparison with SLAD and BACKSLASH algorithm, the proposed algorithm brings a fair deadline miss ratio among tasks, with an acceptable ADMR and ATRD between SLAD¿s and BACKSLASH¿s.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116854164","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
Research on Simulation Framework of Structured P2P Network 结构化P2P网络仿真框架研究
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2007.193
Wei Gao, Chunhe Xia, Nan Li, Haiquan Wang
{"title":"Research on Simulation Framework of Structured P2P Network","authors":"Wei Gao, Chunhe Xia, Nan Li, Haiquan Wang","doi":"10.1109/FGCN.2007.193","DOIUrl":"https://doi.org/10.1109/FGCN.2007.193","url":null,"abstract":"This paper presents a simulation framework for structured P2P (peer-to-peer) networks, which can be utilized in research of P2P networks. The framework provides foundational modules needed in structured P2P network simulation, presents a primitive set for structured P2P network simulation, and supports developing simulation environments for variety kinds of structured P2P network protocols and applications based on the framework. Furthermore, the framework concerns about the detailed model of underlying network, and it connects GTNetS simulation platform to accomplish packet-level simulation. The structure of the framework is described in detail and then applicability of the framework is validated by experiments.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116856070","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 Spectral Density Approach in Research of Internet Topology Properties 互联网拓扑特性研究中的谱密度方法
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2008.10
Ye Xu, Zhuo Wang
{"title":"A Spectral Density Approach in Research of Internet Topology Properties","authors":"Ye Xu, Zhuo Wang","doi":"10.1109/FGCN.2008.10","DOIUrl":"https://doi.org/10.1109/FGCN.2008.10","url":null,"abstract":"Spectral density approach for distinguishing graphs was studied in this paper. Firstly, spectral density approach was testified for being effective in distinguishing different graphs by making comparisons among the spectrums of three different kind of graphs, the ER random graph, BA scale-free graph and the Internet topology graph. Secondly, we focused our studies on the properties of Internet graph that its spectrum could represent, and found that in standard spectral density analysis part, we found that the spectral density plot of Internet graph has a feature of having a maximum when ¿=0 and the second maximum when ¿=0.5 around. In SLS analysis part, we found the SLS spectrum had a set of highest tuples when SLS=1 and second highest tuples when SLS>2. Besides, a relationship of the power law distribution was observed when SLS>2, but there is no power-law relationship found when SLS. What was found here could be used to identify an Internet topology graph properties.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115278802","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
Research and Implementation of NAT Traversal for SIP in Softswitch 软交换中SIP NAT穿越的研究与实现
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2008.185
Guang Hu, Yan Liu, Xin Yu
{"title":"Research and Implementation of NAT Traversal for SIP in Softswitch","authors":"Guang Hu, Yan Liu, Xin Yu","doi":"10.1109/FGCN.2008.185","DOIUrl":"https://doi.org/10.1109/FGCN.2008.185","url":null,"abstract":"SIP (Session Initiation Protocol) plays a very important role in softswitch which is the core technology of the NGN (Next Generation Network). NAT (Network Address Translator) traversal for SIP has been the exchange of operational impact on the rapid popularization of softswitch service. In this paper, we introduce SBC (Session Border Controller) and ALG (Application Level Gateway), which are recognized as very suitable solutions for the current softswitch network environment, to solve this problem. Further more, we propose an implementation of ALG. Our proposed solution has been adopted in our high-end firewall and put into the market.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128429470","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}
引用次数: 4
Translator Trust for the Internet Inter-domain Routing Internet域间路由的翻译信任
International Conference on Future Generation Communication and Networking Pub Date : 1900-01-01 DOI: 10.1109/FGCN.2007.221
Xiangjiang Hu, Peidong Zhu, Z. Gong
{"title":"Translator Trust for the Internet Inter-domain Routing","authors":"Xiangjiang Hu, Peidong Zhu, Z. Gong","doi":"10.1109/FGCN.2007.221","DOIUrl":"https://doi.org/10.1109/FGCN.2007.221","url":null,"abstract":"Inter-domain routing protocol security has become a significant issue for the future Internet. The scalability of traditional trust models makes it hard to adapt to the quick development of Internet at AS-level. In this paper, we study the current architecture property of inter-domain routing system and predict its tendency. A notion of AS Alliance is given, which establishes cooperation method between ASes. Based on it, the translator trust model (TTM) is proposed as a new special trust model for the inter-domain routing system. Analytical results demonstrate the TTM satisfies the request of inter-domain routing security and has good scalability for the future Internet. The number of the used certificates is about 1% of the traditional models.","PeriodicalId":125089,"journal":{"name":"International Conference on Future Generation Communication and Networking","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130518205","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
首页 上一页
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学术官方微信