2013 International Conference on Computing, Networking and Communications (ICNC)最新文献_第10页

Rate selection analysis under semi-persistent scheduling in LTE networks LTE网络半持久调度下的速率选择分析

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504261

Donald Parruca, J. Gross

{"title":"Rate selection analysis under semi-persistent scheduling in LTE networks","authors":"Donald Parruca, J. Gross","doi":"10.1109/ICCNC.2013.6504261","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504261","url":null,"abstract":"Upcoming LTE networks have basically two different modes for scheduling data in the down-link by the base station. Dynamic scheduling brings the advantage of exploiting instantaneous channel state information while it puts on the other hand a significant burden on the system in terms of overhead and computation requirements. Especially for small packets that show up periodically, the overhead is typically too high. Therefore, the base station can serve such packet flows by the semi-persistent scheduling mode. In this mode, a certain resource allocation is fixed to a periodic schedule. While this does not allow any longer to exploit instantaneous channel states, it requires much less overhead. In this paper, we address the problem of selecting a modulation and coding scheme for such semi-persistent scheduling grants. The problem lies here in the stochastic characterization of the resource blocks over the next few seconds while on the other hand estimating based on such a characterization the blok error rate (and hence the average goodput). We provide a novel scheme, which outperforms all previously presented schemes significantly. The underlying model that we provide can also be used for any other long-term decision in an LTE system with semi-persistent scheduling such as interference coordination, handover decision etc.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134209550","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}

引用次数: 11

EgyHet: An energy-saving routing protocol for wireless heterogeneous sensor networks EgyHet:一种面向无线异构传感器网络的节能路由协议

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504187

Xiao Chen, Zanxun Dai, Hongchi Shi

引用次数: 3

Deadline-aware co-scheduling using anycast advance reservations in wavelength routed lambda grids 在波长路由的lambda网格中使用任意cast提前预约的截止日期感知协同调度

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504091

H. Kulkarni, A. Gadkar, V. Vokkarane

{"title":"Deadline-aware co-scheduling using anycast advance reservations in wavelength routed lambda grids","authors":"H. Kulkarni, A. Gadkar, V. Vokkarane","doi":"10.1109/ICCNC.2013.6504091","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504091","url":null,"abstract":"As grid applications evolve, the need for user controlled network infrastructure is apparent in order to support emerging dynamic and interactive services. Due to the inherent bandwidth offered by optical wavelength division multiplexed (WDM) networks, they prove to be a potential candidate to support the bandwidth intensive grid applications. In a grid environment, the available resources can be classified into two broad categories: grid resources which consist of computing and storage components that reside on each node of the network and network resources which provide bandwidth for the execution of a grid application. A typical grid application (job) is usually divided into a number of smaller tasks which need to be scheduled, on possibly different nodes of the network in order to ensure job completion. There usually exists some dependency between these tasks and a strict time-deadline within which the job needs to be completed. Rather than using an independent scheduling approach (at the grid and network levels), we address the co-scheduling problem in lambda-grids for advance reservation requests and aim at minimizing the job blocking probability. We use the anycasting communication paradigm referred to as co-anycasting, to allocate grid and network resources to all tasks of a job. We propose three heuristics: first free (FF), shortest hop (SH), and least used (LU) to solve the co-scheduling problem. Moreover, we compare the proposed co-anycasting approach to a grid-anycasting approach, wherein the anycasting flexibility is offered only at the grid level, and show through extensive simulations the performance benefit of using co-anycasting to support grid applications in a time-deadline environment.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130539720","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

A priority-aware channel selection scheme for real-time data transmission in cognitive radio networks 认知无线网络中实时数据传输的优先级感知信道选择方案

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504179

N. Motamedi, Sunil Kumar, Fei Hu, Nathaniel W. Rowe

引用次数: 4

Optimal Byzantine attacks on distributed detection in tree-based topologies 基于树的拓扑中分布式检测的最优拜占庭攻击

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504085

B. Kailkhura, Swastik Brahma, P. Varshney

引用次数: 26

Traffic classification: Issues and challenges 流量分类:问题和挑战

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.12720/jcm.8.4.240-248

Y. Xue, Luoshi Zhang, Dawei Wang

引用次数: 33

Caching for IPTV distribution with time-shift 带时移的IPTV分发缓存

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504212

H. Abrahamsson, M. Björkman

引用次数: 19

Dynamic RMSA in spectrum-sliced elastic optical networks for high-throughput service provisioning 面向高吞吐量业务提供的频谱切片弹性光网络动态RMSA

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504113

Liang Zhang, W. Lu, Xiaoping Zhou, Zuqing Zhu

{"title":"Dynamic RMSA in spectrum-sliced elastic optical networks for high-throughput service provisioning","authors":"Liang Zhang, W. Lu, Xiaoping Zhou, Zuqing Zhu","doi":"10.1109/ICCNC.2013.6504113","DOIUrl":"https://doi.org/10.1109/ICCNC.2013.6504113","url":null,"abstract":"We propose several novel dynamic routing, modulation and spectrum assignment (RMSA) algorithms for high-throughput service provisioning in spectrum-sliced elastic optical networks. The proposed algorithms can be applied to network provisioning, where a network operator needs to figure out an efficient way to serve each dynamic connection request based on current network status. The proposed algorithms can be categorized into two categories, dynamic RMSA using online path computation and dynamic RMSA using path-set updates. The former one updates link metrics based on their spectrum utilization status dynamically, and performs RMSA with online routing path computation for each request. The latter one pre-computes K shortest routing paths as the path-set for each source-destination pair in the network topology, performs RMSA based on different path-selection policies during dynamic provisioning, and updates a path-set by adding a new path in when a path in the set is not available for a request. We evaluate the proposed algorithms with simulations using the Poisson traffic model in a 14-node NSFNET topology. Simulation results indicate that the proposed algorithms outperform existing dynamic RMSA algorithm by providing lower bandwidth blocking probability, and reduce the blocking probability by one magnitude or more when the traffic load is light (≤ 700 Erlangs). The comparisons on network resource utilization also indicate that the proposed algorithms achieve larger resource utilization and hence provide higher throughput for network operations.","PeriodicalId":229123,"journal":{"name":"2013 International Conference on Computing, Networking and Communications (ICNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186618","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}

引用次数: 31

Wireless network virtualization 无线网络虚拟化

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.12720/jcm.8.5.337-344

Xin Wang, P. Krishnamurthy, D. Tipper

引用次数: 91

Performance analysis of hierarchical selection diversity combining in Rayleigh fading 瑞利衰落中分层选择分集组合的性能分析

2013 International Conference on Computing, Networking and Communications (ICNC) Pub Date : 2013-01-28 DOI: 10.1109/ICCNC.2013.6504224

Sébastien Roy

引用次数: 3