2013 IEEE Global Communications Conference (GLOBECOM)最新文献_第8页

Hop-based Probabilistic Caching for Information-Centric Networks 基于跳点的信息中心网络概率缓存

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831385

Yu Wang, Mingwei Xu, Zhenyang Feng

{"title":"Hop-based Probabilistic Caching for Information-Centric Networks","authors":"Yu Wang, Mingwei Xu, Zhenyang Feng","doi":"10.1109/GLOCOM.2013.6831385","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831385","url":null,"abstract":"Transmission efficiency of the current Internet routing system has witnessed a continuous degradation with the increasing popularity of content-oriented applications (e.g., YouTube). As a future Internet architecture, Information-Centric Networking (ICN) is proposed to solve this problem partly by in-network caching which means ICN routers are aware of and able to cache the content being delivered. In this paper, we present a Hop-based Probabilistic Caching (HPC) for ICN. When delivering the data back to the requester, each content router caches the data with a probability determined by the number of the hops between the responder and the router itself. First, we design an approach to computing the hop-based caching probability with a small amount of overhead. Second, we provide a caching weight based on the mean residence time of the cached contents, which guarantees that the cached contents remain in a router for an expected duration. The simulation results show that HPC achieves a caching hit ratio of 60% and extensively improves the transmission efficiency, compared with 20%, 43% and 46% of LRU, LFU and ProbCache, a recently proposed scheme for ICN, respectively.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115739733","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}

引用次数: 32

Constructing stochastic model of TCP throughput on basis of stationarity analysis 基于平稳性分析，构建TCP吞吐量的随机模型

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831293

H. Yoshida, K. Satoda, T. Murase

引用次数: 28

Combating time-duration uncertainty of spectrum resources: A risk-reduced auction approach 对抗频谱资源持续时间的不确定性:降低风险的拍卖方法

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831191

Guangen Wu, Pinyi Ren, Li Sun, Qinghe Du

{"title":"Combating time-duration uncertainty of spectrum resources: A risk-reduced auction approach","authors":"Guangen Wu, Pinyi Ren, Li Sun, Qinghe Du","doi":"10.1109/GLOCOM.2013.6831191","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831191","url":null,"abstract":"Dynamic spectrum auction has been widely recognized as a promising solution to spectrum allocation in cognitive radio networks. However, the performance of dynamic spectrum auction is significantly affected by the uncertainty of the available time of spectrum opportunities. To combat this uncertainty, we propose risk-reduced auction (RRA) mechanism in this paper. Specifically, we study the scenario where a cognitive base station (CBS) auctions spectrum opportunities to secondary users (SUs). Modeling the traffic pattern of primary users (PUs) as an alternating renewal process, we derive the optimal auction time to maximize the auctioneer's utility to combat the time-duration uncertainty. In the meantime, a collision probability constraint is imposed to protect the PU's priority on spectrum utilization. We show analytically that both the auctioneer and the SUs are truthful and there is a weakly dominant equilibrium in the RRA algorithm. Moreover, the SUs bidding risk can be effectively reduced. Also conducted is a set of simulation evaluations which demonstrate the improvement of both auctioneers and SUs' utilities achieved by using our proposed RRA algorithm.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124261133","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

Dual-hop Vs multihop AF relaying systems 双跳与多跳对焦中继系统

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831749

Samy S. Soliman, N. Beaulieu

{"title":"Dual-hop Vs multihop AF relaying systems","authors":"Samy S. Soliman, N. Beaulieu","doi":"10.1109/GLOCOM.2013.6831749","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831749","url":null,"abstract":"Closed-form expression for the outage probability of dual-hop amplify-and-forward (AF) systems with relay selection from N independent and non-identically (i.ni.d.) distributed dual-hop branches is obtained. Closed-form expression for the probability density function of the end-to-end signal-to-noise ratio (SNR) is also obtained for such systems, and is used to obtain the exact average symbol error probability for systems operating over i.ni.d. Nakagami-m fading links. It is found that the limiting slopes of the outage probability and the average symbol error probability curves are proportional to the sum of the minimums of the fading parameters of the source-to-relay and relay-to-destination links of each branch. The modified generalized transformed characteristic function (M-GTCF) is used to obtain exact, integral solutions for the outage probability and the average symbol error probability of multihop AF relaying systems operating over N i.ni.d. Nakagami-m fading links. It is found that the limiting slopes of the performance metrics curves are proportional to the minimum of the fading parameters of the individual links. Dual-hop AF systems with relay selection from N available relays are compared to multihop AF systems with N intermediate relays. It is found that dual-hop AF systems can significantly outperform multihop AF systems. The findings are used to propose multiple criteria for practical design of wireless cooperative systems.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124293163","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}

引用次数: 8

Simple and causal twisted-pair channel models for G.fast Systems G.fast系统的简单因果双绞线信道模型

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831504

Diogo Acatauassu, S. Höst, Chenguang Lu, M. Berg, A. Klautau, P. Börjesson

引用次数: 17

100+ Gbps IPv6 packet forwarding on multi-core platforms 100+ Gbps多核平台IPv6报文转发

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831384

Thilan Ganegedara, V. Prasanna

{"title":"100+ Gbps IPv6 packet forwarding on multi-core platforms","authors":"Thilan Ganegedara, V. Prasanna","doi":"10.1109/GLOCOM.2013.6831384","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831384","url":null,"abstract":"The migration from IPv4 to IPv6 addressing is gradually taking place with the exhaustion of IPv4 address space. This requires the network infrastructure to have the capability to process and route IPv6 packets. However, with the increased complexity of the lookup operation and storage requirements, performing IPv6 lookup at wire-speed is challenging. In this work, we propose a high-performance IPv6 lookup engine solution for multi-core platforms that deliver state-of-the-art line card throughput rates. In order to exploit the parallelism offered on modern multi-core platforms, we propose a routing table partitioning scheme that forms disjoint and balanced partitions, given a IPv6 routing table. These partitions are represented as range trees to perform the lookup operation. Due to the disjoint nature of the proposed partitioning scheme, the individual range trees are able to operate independently, improving the parallelism of the lookup engine. Our experimental results on state-of-the-art multi-core processors show that throughputs of 100+ Gbps can be achieved for 2 million entry IPv6 routing tables using the proposed scheme. Compared with existing literature, the proposed solution achieves 10× higher throughput and is on par with performance delivered by hardware IP lookup engines.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114460461","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

Minimal Maximum-Level Programming: Faster memory access via multi-level cell sharing 最小最大级别编程:通过多级单元共享更快的内存访问

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831483

A. Berman, Y. Birk

引用次数: 4

Channel estimation and feedback with continuous time domain parameters 基于连续时域参数的信道估计与反馈

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831750

Xiao-an Wang, S. Wicker

引用次数: 7

Adaptive key management for wireless sensor networks 无线传感器网络的自适应密钥管理

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831103

Tony Cheneau, M. Ranganathan

{"title":"Adaptive key management for wireless sensor networks","authors":"Tony Cheneau, M. Ranganathan","doi":"10.1109/GLOCOM.2013.6831103","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831103","url":null,"abstract":"Network security protocols for wireless sensor networks (WSN) require each node to store context information, such as cryptographic keys, for each active security association that it maintains with its peers. While the storage requirements for such context information is generally small enough to be overlooked in regular networks, it becomes an important issue in memory-constrained WSN. Under such constraints, a WSN node may become memory saturated and thereby become unable to accommodate new nodes dynamically. What can be done to keep expanding the network with newly joining nodes under such memory constraints? How many security associations are `enough' and how does the choice of the number of associations affect performance and coverage? To address these issues, we introduce a novel authentication and key management mechanism called Adaptive Key Management (AKM) that is robust and scalable under limited memory constraints and works along with the RPL routing protocol to provide strong security guarantees. We present a simulation study of AKM to demonstrate its scalability and to provide insight on how to allocate a node's memory to store a sufficient number of security associations.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116944051","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 two-tier positioning algorithm for wireless networks with diverse measurement types 多测量类型无线网络的两层定位算法

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831060

Zimu Yuan, Shuhui Yang, Wei Li

引用次数: 2