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

Proceedings of the 2013 25th International Teletraffic Congress (ITC)最新文献

筛选
英文 中文
Weighted capacitated Popular Matching for task assignment in Multi-Camera Networks 多摄像机网络任务分配的加权赋权流行匹配
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-11-14 DOI: 10.1109/ITC.2013.6662967
Lin Cui, W. Jia
{"title":"Weighted capacitated Popular Matching for task assignment in Multi-Camera Networks","authors":"Lin Cui, W. Jia","doi":"10.1109/ITC.2013.6662967","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662967","url":null,"abstract":"Multi-Camera Networks (MCN) are becoming increasingly important in today's society needs and daily-life with application-oriented multiple tasks running in each camera such as video surveillance, object tracking and localization etc. The ultimate goal of MCN is to best satisfy such tasks' preferences/expectations required by users, which has not been well-addressed by previous works. This paper investigates such challenge by formulating a novel weighted capacitated Popular Matching for multi-Task assignments (PMT) problem and proposing efficient algorithms to solve the problem. Using the popularity to represent the optimality of task-camera matching, we can find a matching in which the allocation of the most tasks to the corresponding cameras is closest to the tasks' preferences. With extensive simulations, we demonstrate that our approaches can make matching to the satisfaction of all tasks efficiently as compared to those baseline approaches.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125531521","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
Exploring the memory-bandwidth tradeoff in an information-centric network 探索以信息为中心的网络中的内存-带宽权衡
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-09-20 DOI: 10.1109/ITC.2013.6662936
James W. Roberts, Nada Sbihi
{"title":"Exploring the memory-bandwidth tradeoff in an information-centric network","authors":"James W. Roberts, Nada Sbihi","doi":"10.1109/ITC.2013.6662936","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662936","url":null,"abstract":"An information-centric network should realize significant economies by exploiting a favourable memory-bandwidth tradeoff: it is cheaper to store copies of popular content close to users than to fetch them repeatedly over the Internet. We evaluate this tradeoff for some simple cache network structures under realistic assumptions concerning the size of the content catalogue and its popularity distribution. Derived cost formulas reveal the relative impact of various cost, traffic and capacity parameters, allowing an appraisal of possible future network architectures. Our results suggest it probably makes more sense to envisage the future Internet as a loosely interconnected set of local data centers than a network like today's with routers augmented by limited capacity content stores.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126298262","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
Distributed downlink resource allocation in cellular networks through spatial adaptive play 通过空间自适应播放的蜂窝网络分布式下行链路资源分配
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-09-10 DOI: 10.1109/itc.2013.6662949
C. Singh, Chung Shue Chen
{"title":"Distributed downlink resource allocation in cellular networks through spatial adaptive play","authors":"C. Singh, Chung Shue Chen","doi":"10.1109/itc.2013.6662949","DOIUrl":"https://doi.org/10.1109/itc.2013.6662949","url":null,"abstract":"In this work, we develop mathematical and algorithmic tools for distributed resource allocation in downlink of mobile cellular networks. Our algorithms perform power allocation, subcarrier selection and base station association simultaneously. We aim to maximize the aggregate utility of all the users where users' utilities can be arbitrary increasing functions of their throughputs; this allows us to capture both elastic and inelastic traffics. Our solution is via framing the problem as a potential game among users. We propose a highly scalable, asynchronous algorithm that provably converges to a Nash equilibrium of this game. This algorithm requires only local measurements, limited communication between neighboring nodes and limited computation. This algorithm may at times stuck at a local maximum. To alleviate this problem, we propose an enhanced randomized algorithm based on spatial adaptive play that provably converges to a system optimal resource allocation. We also present simulation results to illustrate convergence and performance of the proposed algorithms.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129771473","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}
引用次数: 21
Markovian SIR model for opinion propagation 意见传播的马尔可夫SIR模型
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-09-01 DOI: 10.1109/ITC.2013.6662953
E. D. Cuypere, K. D. Turck, S. Wittevrongel, D. Fiems
{"title":"Markovian SIR model for opinion propagation","authors":"E. D. Cuypere, K. D. Turck, S. Wittevrongel, D. Fiems","doi":"10.1109/ITC.2013.6662953","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662953","url":null,"abstract":"In this work, we propose a new model for the dynamics of single opinion propagation at a size-limited location with a low population turnover. This means that a maximum number of individuals can be supported by the location and that the allowed individuals have a long sojourn time before leaving the location. The individuals can have either no opinion (S), a strong opinion that they want to spread (I), or an opinion that they keep for themselves (R); the letters stem from the popular Susceptible-Infectious-Recovered (SIR) epidemic model. Furthermore, we consider a variable opinion transmission rate. Hence, the opinion spreading is modelled as a Markovian non-standard SIR epidemic model with stochastic arrivals, departures, infections and recoveries. We evaluate the system performance by two complementary approaches: we apply a numerical but approximate solution approach which relies on Maclaurin series expansions and we investigate the fluid limit of the system at hand. Finally, we illustrate our approach by some numerical examples.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121712853","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
An online framework for flow round trip time measurement 流量往返时间在线测量框架
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-09-01 DOI: 10.1109/ITC.2013.6662968
Xinjie Guan, Xili Wan, R. Kawahara, H. Saito
{"title":"An online framework for flow round trip time measurement","authors":"Xinjie Guan, Xili Wan, R. Kawahara, H. Saito","doi":"10.1109/ITC.2013.6662968","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662968","url":null,"abstract":"With the advent of high speed links, online flow measurement for, e.g., flow round trip time (RTT), becomes difficult due to the enormous amount of requirements on computational resources. We address this problem by proposing the double-deletion bloom filter (DDBF) scheme, which alleviates potential hash collisions of a standard bloom filter by explicitly deleting used records and implicitly deleting out-of-date records. As a result, it accurately estimates the current TCP flow RTT distribution with limited memory space, even with the appearance of multipath routing and Syn flooding attacks. Theoretical analysis indicates that the DDBF scheme exhibits desirable accuracy with a constant and small amount of memory. We further validate our scheme using real traces and demonstrate significant memory-saving without degrading accuracy.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"28 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120927742","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
Modeling the interdependency of low-priority congestion control and active queue management 对低优先级拥塞控制和主动队列管理的相互依赖性进行建模
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-03-27 DOI: 10.1109/ITC.2013.6662942
YiXi Gong, D. Rossi, Emilio Leonardi
{"title":"Modeling the interdependency of low-priority congestion control and active queue management","authors":"YiXi Gong, D. Rossi, Emilio Leonardi","doi":"10.1109/ITC.2013.6662942","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662942","url":null,"abstract":"Recently, a negative interplay has been shown to arise when scheduling/AQM techniques and low-priority congestion control protocols are used together: namely, AQM resets the relative level of priority among congestion control protocols. This work explores this issue by (i) studying a fluid model that describes system dynamics of heterogeneous congestion control protocols competing on a bottleneck link governed by AQM and (ii) proposing a system level solution able to reinstate priorities among protocols.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117225554","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}
引用次数: 14
Stochastic service curve and delay bound analysis: A single node case 随机服务曲线与延迟界分析:单节点情况
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2013-03-12 DOI: 10.1109/ITC.2013.6662937
Yuming Jiang
{"title":"Stochastic service curve and delay bound analysis: A single node case","authors":"Yuming Jiang","doi":"10.1109/ITC.2013.6662937","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662937","url":null,"abstract":"A packet-switched network node with constant capacity (in bps) is considered, where packets within each flow are served in the first in first out (FIFO) manner. While this single node system is perhaps the simplest computer communication system, its stochastic service curve characterization and independent case analysis in the context of stochastic network calculus (snetcal) are still basic and many crucial questions surprisingly remain open. Specifically, when the input is a single flow, what stochastic service curve and delay bound does the node provide? When the considered flow shares the node with another flow, what stochastic service curve and delay bound does the node provide to the considered flow, and if the two flows are independent, can this independence be made use of and how? The aim of this paper is to provide answers to these fundamental questions.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121688558","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}
引用次数: 12
On the throughput capacity of information-centric networks 以信息为中心的网络的吞吐量
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2012-10-03 DOI: 10.1109/ITC.2013.6662941
Bita Azimdoost, C. Westphal, H. Sadjadpour
{"title":"On the throughput capacity of information-centric networks","authors":"Bita Azimdoost, C. Westphal, H. Sadjadpour","doi":"10.1109/ITC.2013.6662941","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662941","url":null,"abstract":"Wireless information-centric networks consider storage one of the network primitives, and propose to cache data within the network in order to improve latency to access content and reduce bandwidth consumption. We study the throughput capacity of an information-centric network when the data cached in each node has a limited lifetime. The results show that with some fixed request and cache expiration rates, the network can have the maximum throughput order of 1/√n and 1/log n in cases of grid and random networks, respectively. Comparing these values with the corresponding throughput with no cache capability (1/n and 1/√(n log n) respectively), we can actually quantify the asymptotic advantage of caching. Moreover, since the request rates will decrease as a result of increasing download delays, increasing the content lifetimes according to the network growth may result in higher throughput capacities.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113966193","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}
引用次数: 40
Modeling energy consumption in cellular networks 蜂窝网络能量消耗建模
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 2012-09-06 DOI: 10.1109/ITC.2013.6662944
L. Decreusefond, T. Vu, P. Martins
{"title":"Modeling energy consumption in cellular networks","authors":"L. Decreusefond, T. Vu, P. Martins","doi":"10.1109/ITC.2013.6662944","DOIUrl":"https://doi.org/10.1109/ITC.2013.6662944","url":null,"abstract":"In this paper we present a new analysis of energy consumption in cellular networks. We focus on the distribution of energy consumed by a base station for one isolated cell. We first define the energy consumption model in which the consumed energy is divided into two parts: The additive part and the broadcast part. The broadcast part is the part of energy which is oblivious of the number of mobile stations but depends on the farthest terminal, for instance, the energy effort necessary to maintain the beacon signal. The additive part is due to the communication power which depends on both the positions, mobility and activity of all the users. We evaluate by closed form expressions the mean and variance of the consumed energy. Our analytic evaluation is based on the hypothesis that mobiles are distributed according to a Poisson point process. We show that the two parts of energy are of the same order of magnitude and that substantial gain can be obtained by power control. We then consider the impact of mobility on the energy consumption. We apply our model to two case studies: The first one is to optimize the cell radius from the energetic point of view, the second one is to dimension the battery of a base station in sites that do not have access to permanent power supply.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116156572","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
A test probe for TSV using resonant inductive coupling 一种采用谐振电感耦合的TSV测试探头
Proceedings of the 2013 25th International Teletraffic Congress (ITC) Pub Date : 1900-01-01 DOI: 10.1109/itc.2013.6917153
Rashid Rahsidzadeh, Iftekhar Basitih
{"title":"A test probe for TSV using resonant inductive coupling","authors":"Rashid Rahsidzadeh, Iftekhar Basitih","doi":"10.1109/itc.2013.6917153","DOIUrl":"https://doi.org/10.1109/itc.2013.6917153","url":null,"abstract":"A contactless TSV probe based on the principle of resonant inductive coupling is presented in this work. The proposed scheme allows TSV data observation up to 2Gbps when the pobe and TSV are 15μm apart.","PeriodicalId":252757,"journal":{"name":"Proceedings of the 2013 25th International Teletraffic Congress (ITC)","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":"115444616","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
首页 上一页 下一页 尾页
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学术官方微信