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

2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems最新文献

筛选
英文 中文
Anatomy of Public Internet eXchange Points Ecosystem in Brazil 巴西公共互联网交换点生态系统剖析
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.23
Samuel Henrique Bucke Brito, Mateus A. S. Santos, R. Fontes, D. A. L. Perez, Christian Esteve Rothenberg
{"title":"Anatomy of Public Internet eXchange Points Ecosystem in Brazil","authors":"Samuel Henrique Bucke Brito, Mateus A. S. Santos, R. Fontes, D. A. L. Perez, Christian Esteve Rothenberg","doi":"10.1109/SBRC.2015.23","DOIUrl":"https://doi.org/10.1109/SBRC.2015.23","url":null,"abstract":"For a long time many efforts were carried to increase the understanding of the complex Internet ecosystem. Internet eXchange Points have been targets since they represent a microcosm of Internet diversity. The contribution of this paper is the first empirical analysis of the IXP ecosystem in Brazil, compiling information that comprehend the characterization of members participating of these environments, including the build of AS-level connectivity graphs. By analysing the topologies we found the average adjacency of IXP's members (vertices degree), the isolated and accumulated depth of paths in advertised routes (AS-PATH), the density of peers to highlight the peering potential within IXPs, the accounting of traffic engineering policies related to AS-Prepend and k-clique communities. Another contribution is that our dataset with more than 2.5 GB is shared with the academic community.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127308601","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
CRAL: A Centrality-Based and Energy Efficient Collection Protocol for Low Power and Lossy Networks CRAL:一种基于中心性和节能的低功耗和有损网络收集协议
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.28
B. P. Santos, L. Vieira, M. Vieira
{"title":"CRAL: A Centrality-Based and Energy Efficient Collection Protocol for Low Power and Lossy Networks","authors":"B. P. Santos, L. Vieira, M. Vieira","doi":"10.1109/SBRC.2015.28","DOIUrl":"https://doi.org/10.1109/SBRC.2015.28","url":null,"abstract":"High throughput and energy are two important constraints of the Wireless Sensor Networks (WSNs). In this paper, we present the Centrality-based Routing Aware for L2Ns (CRAL)1-Low Drop and Fast Delivery to mitigate these problems. The routing protocols are centrality-based and employ link quality estimators Expected Transmission Count (ETX) and Expected Transmission Time (ETT) to find best paths in wireless links. The suitable combinations of these techniques lead the algorithms to improve the literature results in delivery rate, energy consumption, and time to delivery data packets. CRAL does this by building routing trees with high throughput and maintains low energy consumption. The simulation results show that CRAL is more reliable, efficient in energy consumption, robust, and favoring data fusion than Centrality Tree (CT) and Shortest Paths Tree (SPT).","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129491282","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
Consolidation of VMs to Improve Energy Efficiency in Cloud Computing Environments 整合虚拟机，提高云计算环境下的能源效率
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.27
Thiago Kenji Okada, Albert P. M. De La Fuente Vigliotti, D. Batista, A. Goldman
{"title":"Consolidation of VMs to Improve Energy Efficiency in Cloud Computing Environments","authors":"Thiago Kenji Okada, Albert P. M. De La Fuente Vigliotti, D. Batista, A. Goldman","doi":"10.1109/SBRC.2015.27","DOIUrl":"https://doi.org/10.1109/SBRC.2015.27","url":null,"abstract":"Improvement of energy efficiency in IT is an important research topic nowadays. The reduction of operational costs, generated heat and environment impact are some of the reasons for this. Thanks to the advent of cloud computing, it is possible to improve energy efficiency in data centers by running various virtual machines in a single physical machine. However, the cloud providers generally invest in performance, not energy efficiency. This paper focuses on the problem of an energy efficient initial VM placement, and describes three new algorithms for this problem, one based on the First Fit Decreasing algorithm, and the other two based on the Best Fit Decreasing algorithm. They are compared with other algorithms in the literature, and a reduction of power consumption up to 3.24% was observed, as well a reduction of execution time in several orders of magnitude. Scripts used to analyze traces publicly provided by Google are another contribution of the paper, since they are useful for those working in mechanisms for cloud computing.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116029472","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}
引用次数: 25
S-Trace: Building Causal Paths on Software Defined Networks S-Trace:在软件定义网络上构建因果路径
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.38
Fabrício B. Carvalho, R. Ferreira
{"title":"S-Trace: Building Causal Paths on Software Defined Networks","authors":"Fabrício B. Carvalho, R. Ferreira","doi":"10.1109/SBRC.2015.38","DOIUrl":"https://doi.org/10.1109/SBRC.2015.38","url":null,"abstract":"Determining hardware and software elements used to process an application request and group them in a set, called causal path, that exposes relevant parameters, such as processing time and delays, and that may explain the behavior of the application is a challenging task. Several tools for building causal paths have been proposed for the current Internet architecture, but none so far explores features offered by Software Defined Network (SDN). This paper proposes S-Trace, a tool for building causal paths that does not modify applications and that uses specific features of SDN to build precise causal paths. To build a causal path, S-Trace intercepts library function calls to correlate communication events between processes and uses record and replay techniques in SDN to correlate network events. S-Trace was evaluated using a benchmark (TPC-W) and an application that emulates the behavior of multi-tier applications that was instrumented to validate the causal paths constructed by S-Trace. The experimental results show that S-Trace builds correct causal paths at the cost of a small overhead associated with some library function calls.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125515679","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
MobDatU: A New Model for Human Mobility Prediction Based on Heterogeneous Data MobDatU:基于异构数据的人类流动性预测新模型
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.34
L. M. Silveira, J. Almeida, H. T. Marques-Neto, A. Ziviani
{"title":"MobDatU: A New Model for Human Mobility Prediction Based on Heterogeneous Data","authors":"L. M. Silveira, J. Almeida, H. T. Marques-Neto, A. Ziviani","doi":"10.1109/SBRC.2015.34","DOIUrl":"https://doi.org/10.1109/SBRC.2015.34","url":null,"abstract":"Several previous mobility models aim at describing or predicting human behavior in a particular region during a certain period of time. Nevertheless, most of those models have been evaluated using data from a single source, such as data from mobile calls or GPS data obtained from Web applications. Thus, the effectiveness of such models when using different types of data remains unknown. This paper proposes a new model to predict human mobility, called MobDatU, which was designed to use data from mobile calls and data from georeferenced applications (in an isolated or combined way). MobDatU as well as two state-of-the-art models, namely SMOOTH and Leap Graph, are evaluated considering various scenarios with single data source and multiple data sources. The experiments indicate that MobDatU always produces results that are better than or at least comparable to the best baseline in all scenarios, unlike the previous models whose performance is very dependent on the particular type of data used.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"50 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120901840","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
Analyzing the Impact of Dropbox Content Sharing on an Academic Network 分析Dropbox内容共享对学术网络的影响
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.22
G. Gonçalves, I. Drago, Ana Paula Couto da Silva, A. Vieira, J. Almeida
{"title":"Analyzing the Impact of Dropbox Content Sharing on an Academic Network","authors":"G. Gonçalves, I. Drago, Ana Paula Couto da Silva, A. Vieira, J. Almeida","doi":"10.1109/SBRC.2015.22","DOIUrl":"https://doi.org/10.1109/SBRC.2015.22","url":null,"abstract":"Cloud storage services (e.g., Dropbox) are a popular means for sharing content and performing collaborative work. Yet, content sharing via cloud might result in bandwidth wastage when repetitive data is downloaded by different users in the same network domain. This paper first characterizes sharing patterns in Dropbox by analyzing data collected from a campus network for 4 months. We identify that the volume of data sharing in such homogeneous environment is reasonably high. Next, we use the characterization results to implement a synthetic workload generator that allows us to test alternatives for the Dropbox synchronization protocol. We then propose a synchronization architecture that includes network caches to temporarily hold user updates. Our evaluation of the proposed solution indicates that, even with a small cache, it is possible to achieve almost the maximum possible reduction of downloads from remote servers, thus benefiting storage providers, end users and the Internet.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132978513","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
Estimating Betweenness Centrality on Optical Telecommunications Networks 光通信网络间性中心性的估计
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.30
S. Trindade, P. A. P. Borges, C. Pavan
{"title":"Estimating Betweenness Centrality on Optical Telecommunications Networks","authors":"S. Trindade, P. A. P. Borges, C. Pavan","doi":"10.1109/SBRC.2015.30","DOIUrl":"https://doi.org/10.1109/SBRC.2015.30","url":null,"abstract":"From a set of real optical telecommunication network topologies, an expression is proposed to estimate the betweenness centrality of a network without prior knowledge of its topological structure, having only the number of nodes and links as requirement. Betweenness centrality shows the number of times each node is present in the shortest paths between other nodes. This information is relevant when planning networks, as the topology can have a significant impact on its costs. In this context, the analytical models can be used in evaluation tools as elimination criterion and to forecast costs, accelerating decision making. Experimental results reveal that the proposed expression obtain the value of the betweenness centrality with an average error less than 3%.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122312104","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
An Autonomic Spatial Query Processing Model for Urban Sensor Networks 城市传感器网络的自主空间查询处理模型
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.20
Marcos Aurélio Carrero, Rone Ilídio da Silva, A. Santos, Carmem S. Hara
{"title":"An Autonomic Spatial Query Processing Model for Urban Sensor Networks","authors":"Marcos Aurélio Carrero, Rone Ilídio da Silva, A. Santos, Carmem S. Hara","doi":"10.1109/SBRC.2015.20","DOIUrl":"https://doi.org/10.1109/SBRC.2015.20","url":null,"abstract":"Wireless Sensor Networks (WSN) in urban environments manage a large amount of sensoring data. The deployment of spatial query processing in a decentralized and autonomous large-scale WSN is a major challenge due to the network resources constraints. This paper proposes ASQPM, a scalable and autonomous model for data storage and spatial query processing. Scalability is provided by grouping sensors into clusters based on the spatial similarity of their readings. The query processing efficiency relies on the concept of repositories, which are regions in the monitored area that concentrate information, storing the readings of a set of clusters. The experimental results show that it is more effective for query processing than classical approaches.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126730833","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
ResiDI: An Intelligent Decision Platform for Residential Infrastructure Using Wireless Sensors and Actuators 基于无线传感器和执行器的住宅基础设施智能决策平台
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.36
G. P. R. Filho, J. Ueyama, Bruno S. Faiçal, D. Guidoni, L. Villas
{"title":"ResiDI: An Intelligent Decision Platform for Residential Infrastructure Using Wireless Sensors and Actuators","authors":"G. P. R. Filho, J. Ueyama, Bruno S. Faiçal, D. Guidoni, L. Villas","doi":"10.1109/SBRC.2015.36","DOIUrl":"https://doi.org/10.1109/SBRC.2015.36","url":null,"abstract":"This work proposes an intelligent decision system for a residential infrastructure based on wireless sensors and actuator networks, called ResiDI. In order to achieve this, the proposal is based on the development of a neural network that aims to increase the accuracy in the decision-making, and a temporal correlation mechanism that aims to reduce the energy consumption of the network. When compared with an approach adopted in the literature, both simulated and real results show that ResiDI reduces the energy consumption of its network, while maintaining a degree of accuracy in the decision-making.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126609296","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
IPv6 Multihop Host Configuration for Low-Power Wireless Networks 低功耗无线网络的IPv6多跳主机配置
2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems Pub Date : 2015-05-18 DOI: 10.1109/SBRC.2015.31
B. Peres, Olga Goussevskaia
{"title":"IPv6 Multihop Host Configuration for Low-Power Wireless Networks","authors":"B. Peres, Olga Goussevskaia","doi":"10.1109/SBRC.2015.31","DOIUrl":"https://doi.org/10.1109/SBRC.2015.31","url":null,"abstract":"Many low-power wireless networks are based on mechanisms that maintain cycle-free topologies to support data-collection applications. The network is typically optimized for bottom-up data traffic, and eventual packets that need to be sent in a different direction must follow longer paths and are frequently dropped due to lack of memory for the necessary routing tables, which can require O(n) memory space, where n is the size of the subtree rooted at each routing node. In this work we propose a Multihop Host Configuration strategy that explores cycle-free network structures in low-power wireless networks to generate and assign IPv6 addresses to nodes. The objective is to enable efficient and robust top-down routing with low memory footprint. MHCL generates and assigns IPv6 addresses which reflect the topology of the underlying wireless network. As a result, routing tables for top-down data traffic are of size O(k), where k is the number of children of each routing node. We implemented our strategy as a subroutine of RPL protocol in Contiki OS. We performed experiments to show that our strategy is efficient in time and number of messages, and is robust to network dynamics, caused by changes in preferred parents and failures in network links and nodes.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115317633","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信