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

IEEE INFOCOM Workshops 2009最新文献

筛选
英文 中文
Modeling P2P-TV Traffic Using Hidden Markov Models 使用隐马尔可夫模型建模P2P-TV流量
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072165
M. A. Garcia, Ana Paula Couto da Silva
{"title":"Modeling P2P-TV Traffic Using Hidden Markov Models","authors":"M. A. Garcia, Ana Paula Couto da Silva","doi":"10.1109/INFCOMW.2009.5072165","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072165","url":null,"abstract":"We propose the use of discrete-time Hidden Markov model (DT-HMM) for representing the P2P-TV traffic. The objective is to develop synthetic traffic generators; or, in other terms, we aim at defining models whose generated synthetic traces are as much as possible “similar” to the real traces. Following the definition presented in [3], a Hidden-Markov model is a doubly embedded stochastic process with an underlying stochastic process that is not observable (it is hidden), but can only be observed through another stochastic process that produces a sequence of observations. In each state of the chain there is a different pattern of bitrate generation. The Hidden-Markov chain is derived by means of a training phase, during which the best fitting with the real trace is looked for. We refer the reader to [3] for a formal presentation of the DT-HMM.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126138575","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
Applying Network Coding to Cyclic Networks 网络编码在循环网络中的应用
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072113
Liang Wang, Jiaqing Huang, Hui Li
{"title":"Applying Network Coding to Cyclic Networks","authors":"Liang Wang, Jiaqing Huang, Hui Li","doi":"10.1109/INFCOMW.2009.5072113","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072113","url":null,"abstract":"This work addresses the application of network coding on cyclic networks. Cycles and delay are indispensable factors when designing and implementing data networks. However, most attention in the literature of network coding has been on acyclic networks. Hence, in order to bridge the gap of network coding and the practical networks, Convolutional Network Coding (CNC) with delay as an essential part was proposed for network coding on cyclic networks.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126743559","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
Simulating Wireless Sensor Network Protocols and Energy Consumption on a Hades Tool Extension 在Hades工具扩展上模拟无线传感器网络协议和能耗
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072187
Vitor Barbosa Carlos de Souza, Mauro Nacif Rocha, Ricardo dos Santos Ferreira
{"title":"Simulating Wireless Sensor Network Protocols and Energy Consumption on a Hades Tool Extension","authors":"Vitor Barbosa Carlos de Souza, Mauro Nacif Rocha, Ricardo dos Santos Ferreira","doi":"10.1109/INFCOMW.2009.5072187","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072187","url":null,"abstract":"I.INTRODUCTION The advances on mobile technology have permitted a larger use of sensor networks to allow the monitoring of an area aiming the occurrence detection of one or more event kinds and the sending of data referring to these observed events. These data are transported across the network towards a central station, where they can be processed. The data transport is done through an ad-hoc network containing numerous tiny, intelligent and wireless sensor nodes and due to the large number of sensor nodes required, and the type of applications sensor networks are expected to support, sensor nodes should be small and low cost. In order to achieve these requirements, sensor nodes have important characteristics like the use of small batteries, with low charge capacity, and limited communication power. To get along with these limitations, the development of Wireless Sensor Networks (WSN) specific protocols is necessary. Thus, the use of simulators, allowing a previous evaluation of the developing protocols, becomes essential, since its real world implementation aiming test realizations is","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132818060","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
QoS-Constrained Multi-Path Routing for High-End Network Applications 高端网络应用的qos约束多路径路由
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072182
Xiaomin Chen, M. Chamania, A. Jukan, A. Drummond, N. D. da Fonseca
{"title":"QoS-Constrained Multi-Path Routing for High-End Network Applications","authors":"Xiaomin Chen, M. Chamania, A. Jukan, A. Drummond, N. D. da Fonseca","doi":"10.1109/INFCOMW.2009.5072182","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072182","url":null,"abstract":"We present a multi-path computation algorithm to find a set of paths for the given demand and use Integer Linear Programming (ILP) approach to derive an optimal solution to maximize the achievable bandwidth and minimize the required memory size. We discuss the applicability of the proposed methods in multi-domain settings and present three application schemes in a multi-homing environment. Numerical and simulation results show that the proposed multi-path routing algorithm has better performance in bandwidth as compared to traditional single path routing. Especially the multi-path multidomain application schemes can provision more bandwidth even with partial visibility. Therefore, it can be used as a viable solution to accommodate the emerging high-end applications with extremely high bandwidth requirements in current networks.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128339243","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
Low Complexity Link State Multipath Routing 低复杂度链路状态多路径路由
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072161
P. Mérindol, Jean-Jacques Pansiot, S. Cateloin
{"title":"Low Complexity Link State Multipath Routing","authors":"P. Mérindol, Jean-Jacques Pansiot, S. Cateloin","doi":"10.1109/INFCOMW.2009.5072161","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072161","url":null,"abstract":"Link state routing protocols such as OSPF or IS-IS currently use only best paths to forward IP packets throughout a domain. The optimality of subpaths ensures consistency of hop by hop forwarding although paths, calculated using Dijkstra's algorithm, are recursively composed. According to the link metric, the diversity of existing paths can be underestimated using only best paths. Hence, it reduces potential benefits of multipath applications such as load balancing and fast rerouting. In this paper, we propose a low time complexity multipath computation algorithm able to calculate at least two paths with a differentfirst hop between all pairs of nodes in the network if such next hops exist. Using real and generated to pologies, we evaluate and compare the complexity of our proposition with severa techniques. Simulation results suggest that the path diversity achieved with our proposition is approximatively the same that the one obtained using consecutive Dijsktra computations, but with a lower time complexity.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128344007","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}
引用次数: 13
Measuring the Likelihood of Models for Network Evolution 测量网络演化模型的可能性
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072162
R. Clegg, R. Landa, H. Haddadi, M. Rio
{"title":"Measuring the Likelihood of Models for Network Evolution","authors":"R. Clegg, R. Landa, H. Haddadi, M. Rio","doi":"10.1109/INFCOMW.2009.5072162","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072162","url":null,"abstract":"Many researchers have hypothesised models which explain the evolution of the topology of a target network. The framework described in this paper gives the likelihood that the target network arose from the hypothesised model. This allows rival hypothesised models to be compared for their ability to explain the target network. A null model (of random evolution) is proposed as a baseline for comparison. The framework also considers models made from linear combinations of model components. A method is given for the automatic optimisation of component weights. The framework is tested on simulated networks with known parameters and also on real data.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"59 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133453114","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 Generalized Group Communication Network Stack and its Application to Hybrid Multicast 一种广义组通信网络栈及其在混合组播中的应用
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072096
M. Wahlisch, T. Schmidt, G. Wittenburg
{"title":"A Generalized Group Communication Network Stack and its Application to Hybrid Multicast","authors":"M. Wahlisch, T. Schmidt, G. Wittenburg","doi":"10.1109/INFCOMW.2009.5072096","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072096","url":null,"abstract":"Group communication services are most efficiently implemented on the lowest layer available. Network layer multicast transparently delegates group distribution to the link layer wherever possible. Native multicast deployment, though, has been mainly limited to 'walled gardens' within provider domains. Overlay multicast overcomes these deployment restrictions on the price of a performance penalty. Current activities focus on hybrid approaches which dynamically combine multicast in overlay and underlay, and adaptively optimize group communication. The basic requirement for such a flexibly deployable architecture is a layer-transparent group communication stack that integrates variable multicast protocols by a common API. In this paper, we present a common group communication stack which serves the requirements of data distribution and maintenance for multicast and broadcast on a middleware abstraction layer, suitable for underlay and overlay communication. We discuss its application in the context of hybrid multicast schemes.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128848564","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
Towards a Taxonomy of Task Allocation in Sensor Networks 传感器网络任务分配分类学研究
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072199
D. Pizzocaro, A. Preece
{"title":"Towards a Taxonomy of Task Allocation in Sensor Networks","authors":"D. Pizzocaro, A. Preece","doi":"10.1109/INFCOMW.2009.5072199","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072199","url":null,"abstract":"A sensor network often consists of a large number of sensing devices of different types. These can vary from very simple sensors with limited capabilities such as motes, to very complex systems such as Unmanned Aerial Vehicles (UAV). Upon deployment in the field, these different sensors form an ad hoc network using wireless links or cables to communicate with each other and with data processing centres. Given that sensing devices can be static or mobile, and that sensors may fail or be damaged, it is clear that the network configuration must be highly dynamic. An already deployed sensor network is usually required to support multiple sensing tasks of different types to be accomplished simultaneously. Sensing tasks might share the usage of a sensing resource, but more often they compete to exclusively control it. Consider for example the search-and-rescue scenario of Figure 1, where the sensor network has to support an identification task (of people in need of rescue), and at the same time a wide area surveillance task (to detect possible threats to the life of the injured people). If only one UAV is available to be allocated to a task, the question to answer is: “Where is it better to send that particular UAV?”.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129138219","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}
引用次数: 9
Experimental Analysis of Flow Optimization and Data Compression for TCP Enhancement TCP增强的流量优化和数据压缩实验分析
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072141
N. Rao, S. Poole, W. Wing, S. Carter
{"title":"Experimental Analysis of Flow Optimization and Data Compression for TCP Enhancement","authors":"N. Rao, S. Poole, W. Wing, S. Carter","doi":"10.1109/INFCOMW.2009.5072141","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072141","url":null,"abstract":"Flow optimization and data compression methods promise to improve TCP performance, and edge devices that implement them to transparently improve wide-area network performance are currently being developed. We present an experimental study of TCP throughput performance of such Cisco devices using 1Gbps connections of thousands of miles over UltraScience Net. Based on iperf measurements, we have the following observations: (i) multi-fold throughput improvements are achieved over the buffer-tuned TCP both for single and most multiple streams; and (ii) high throughputs are maintained over connection lengths of thousands of miles. For file transfers using iperf, our experiments included files with repeated bytes and uniformly randomly generated bytes, and supernova simulation data in hdf format: (i) highest and lowest throughputs are achieved for hdf and random data files, respectively; (ii) most throughputs were maximized by 5-10 parallel TCP streams; and (iii) pre-compression of files using gzip did not have a significant effect on transport performance.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114556600","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
Graph-Based P2P Traffic Classification at the Internet Backbone 基于图的互联网骨干网P2P流量分类
IEEE INFOCOM Workshops 2009 Pub Date : 2009-04-19 DOI: 10.1109/INFCOMW.2009.5072151
Marios Iliofotou, Hyun-chul Kim, M. Faloutsos, M. Mitzenmacher, Prashanth Pappu, G. Varghese
{"title":"Graph-Based P2P Traffic Classification at the Internet Backbone","authors":"Marios Iliofotou, Hyun-chul Kim, M. Faloutsos, M. Mitzenmacher, Prashanth Pappu, G. Varghese","doi":"10.1109/INFCOMW.2009.5072151","DOIUrl":"https://doi.org/10.1109/INFCOMW.2009.5072151","url":null,"abstract":"Monitoring network traffic and classifying applications are essential functions for network administrators. In this paper, we consider the use of Traffic Dispersion Graphs (TDGs) to classify network traffic. Given a set of flows, a TDG is a graph with an edge between any two IP addresses that communicate; thus TDGs capture network-wide interactions. Using TDGs, we develop an application classification framework dubbed Graption (Graph-based classification). Our framework provides a systematic way to harness the power of network-wide behavior, flow-level characteristics, and data mining techniques. As a proof of concept, we instantiate our framework to detect P2P applications, and show that it can identify P2P traffic with recall and precision greater than 90% in backbone traces, which are particularly challenging for other methods.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159357","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}
引用次数: 67
首页 上一页 下一页 尾页
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学术官方微信