37th Annual IEEE Conference on Local Computer Networks最新文献

筛选
英文 中文
Distributed client-server assignment 分布式客户机-服务器分配
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423633
Thuan Duong-Ba, Thinh P. Q. Nguyen
{"title":"Distributed client-server assignment","authors":"Thuan Duong-Ba, Thinh P. Q. Nguyen","doi":"10.1109/LCN.2012.6423633","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423633","url":null,"abstract":"For many Internet systems, clients (users) interact with each other indirectly via intermediate servers. In such systems, it is crucial to assign users to servers based on the interaction patterns among the users, in such a way to reduce communication costs and to balance loads among the servers. Finding the optimal client-server assignment has been previously shown to be NP-complete, and approximate centralized solutions have been proposed. In this paper, we present a distributed scheme for finding an approximately optimal client-server assignment in which the servers exchange and update information about their loads iteratively among themselves. Based on these, they make decisions to reassign their users to others iteratively so that final client-server assignment is approximately optimal. Theoretical results on the convergence rate and complexity of the proposed algorithm are presented. Simulations results show the effectiveness of the proposed algorithm for different patterns of user interactions.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122525469","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
Flow-Path: An AllPath flow-based protocol Flow-Path:基于AllPath流的协议
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423619
Elisa Rojas, G. Ibáñez, Diego Rivera, J. A. Carral
{"title":"Flow-Path: An AllPath flow-based protocol","authors":"Elisa Rojas, G. Ibáñez, Diego Rivera, J. A. Carral","doi":"10.1109/LCN.2012.6423619","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423619","url":null,"abstract":"This paper describes Flow-Path, an AllPath flow-based switching protocol that features improved load adaptive properties. Upon arrival of a new flow to the network, it explores every possible path reaching from source to destination host and selects the lowest latency path at the moment. It is based on the same basic principle than ARP-Path, that is, snooping the ARP protocol dialog (request and reply messages) to explore all available paths at the same time that address resolution takes place, but it is flow-based instead of source address-based. While preserving the main advantages of ARP-Path: shortest path bridging exploiting the full network topology, Flow-Path has the advantages of full independence of flows at the time of path creation and guarantees path symmetry (congruency) and increased path diversity. Flow-Path thus improves load distribution, at the expense of increased address table size in each bridge.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129563307","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
Network capabilities of cloud services for a real time scientific application 网络能力的云服务,用于实时科学应用
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423665
Dilip Kumar Krishnappa, Eric J. Lyons, David E. Irwin, M. Zink
{"title":"Network capabilities of cloud services for a real time scientific application","authors":"Dilip Kumar Krishnappa, Eric J. Lyons, David E. Irwin, M. Zink","doi":"10.1109/LCN.2012.6423665","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423665","url":null,"abstract":"Dedicating high-end servers for executing scientific applications that run intermittently, such as severe weather detection or generalized weather forecasting, wastes resources. While the Infrastructure-as-a-Service (IaaS) model used by today's cloud platforms is well-suited for the bursty computational demands of these applications, it is unclear if the network capabilities of today's cloud platforms are sufficient. In this paper, we analyze the networking capabilities of multiple commercial (Amazon's EC2 and Rackspace) and research (GENICloud and ExoGENI cloud) platforms in the context of a Nowcasting application, a forecasting algorithm for highly accurate, near-term, e.g., 5-20 minutes, weather predictions. The application has both computational and network requirements. While it executes rarely, whenever severe weather approaches, it benefits from an IaaS model; However, since its results are time-critical, enough bandwidth must be available to transmit radar data to cloud platforms before it becomes stale. We conduct network capacity measurements between radar sites and cloud platforms throughout the country. Our results indicate that ExoGENI cloud performs the best for both serial and parallel data transfer with an average throughput of 110.22 Mbps and 17.2 Mbps, respectively. We also found that the cloud services perform better in the distributed data transfer case, where a subset of nodes transmit data in parallel to a cloud instance. Ultimately, we conclude that commercial and research clouds are capable of providing sufficient bandwidth for our real-time Nowcasting application.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129953246","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
Cache isolation and thin provisioning of hypervisor caches 缓存隔离和精简配置管理程序缓存
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423618
V. Suryanarayana, K. Balasubramanya, R. Pendse
{"title":"Cache isolation and thin provisioning of hypervisor caches","authors":"V. Suryanarayana, K. Balasubramanya, R. Pendse","doi":"10.1109/LCN.2012.6423618","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423618","url":null,"abstract":"Server virtualization has enabled resource consolidation and has minimized the need for additional and expensive hardware. Server virtualization has been widely deployed in a lot of organizations, because of the attractive benefits it offers like minimal hardware, cost effective resource consolidation, easier management and maintenance of hardware resources and so on. Many cloud service providers have offloaded processing capabilities to virtual servers in their data centers instead of using multiple physical servers which are very expensive these days. When such a virtualized server setup is connected to disk arrays, latency of data access becomes prominent. In order to minimize the response time of application requests on the virtual servers and make efficient utilization of cache, a dynamic caching mechanism is proposed by the authors on the hypervisor. The caching mechanism proposed in the research is different, in the sense that, it is an isolated, unshared and dynamic cache, where caching is done on the hypervisor instead of the virtual machines. The dynamic cache allocation algorithm enables thin provisioning of the hypervisor cache and leads to efficient cache utilization. Experimental results obtained using the thin provisioning algorithm look promising in terms of reducing the response time and efficiently utilizing the available cache.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131173814","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}
引用次数: 4
A wireless mesh sensor network for hazard and safety monitoring at the Port of Brisbane 布里斯班港用于危险和安全监测的无线网状传感器网络
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423601
Amin Ahmadi, A. Bigdeli, Mahsa Baktash, B. Lovell
{"title":"A wireless mesh sensor network for hazard and safety monitoring at the Port of Brisbane","authors":"Amin Ahmadi, A. Bigdeli, Mahsa Baktash, B. Lovell","doi":"10.1109/LCN.2012.6423601","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423601","url":null,"abstract":"A wireless sensor network (WSN) was designed and implemented to provide reliable long-term hazard monitoring at the Port of Brisbane, Australia. The proposed system consists of four sensor nodes, a wireless gateway and a central monitoring computer. The sensor nodes are capable of measuring a range of hazardous events along with the time and location of events in maritime environment. Each sensor node is also equipped with a Global Positioning System (GPS) module and a ZigBee module. The monitoring server is a personal computer application server with Internet connectivity. Sensor nodes utilize smart algorithm to save energy and AES-128 encryption to encode data prior to sending the data packet through the wireless ZigBee protocol to gateway. The gateway collects and decrypts the data packets and forwards them to the monitoring computer through wireless connection. A database server running on the monitoring computer stores the captured data for visualization and further analysis. The monitoring server is interfaced to Google Maps to overlay real-time data from the sensor nodes onto map in the correct corresponding locations. The WSN system was successfully deployed and tested at the Port of Brisbane, Queensland, Australia.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132925555","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
Applicability of crypto-based security approaches in tactical wireless multi-hop networks 基于密码的安全方法在战术无线多跳网络中的适用性
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423584
N. Aschenbruck, E. Gerhards-Padilla, Martin Lambertz
{"title":"Applicability of crypto-based security approaches in tactical wireless multi-hop networks","authors":"N. Aschenbruck, E. Gerhards-Padilla, Martin Lambertz","doi":"10.1109/LCN.2012.6423584","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423584","url":null,"abstract":"Security is one of the core challenges especially for wireless multi-hop networks in public safety scenarios. Sensitive data is transmitted via insecure links. Furthermore, there may be competing interests. Thus, there is a high probability of disturbance or eavesdropping of communication. Confidentiality, integrity, and authenticity of transmitted packets can be provided by cryptographic means. However, as the devices used in multi-hop networks are usually resource constrained, the goal of this paper is to scrutinize the feasibility of securing such networks using strong but computationally expensive cryptography. In this paper, we show generic benchmarking results for tactical multi-hop network devices as well as a case study comparing two routing security approaches.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134592271","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
Time series matrix factorization prediction of internet traffic matrices 互联网流量矩阵的时间序列矩阵分解预测
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423629
Yunlong Song, Min Liu, Shaojie Tang, Xufei Mao
{"title":"Time series matrix factorization prediction of internet traffic matrices","authors":"Yunlong Song, Min Liu, Shaojie Tang, Xufei Mao","doi":"10.1109/LCN.2012.6423629","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423629","url":null,"abstract":"Traffic matrices (TMs) are very important for traffic engineering and if they can be predicted, the network operations can be made beforehand. However, existing prediction methods are neither accurate nor efficient in practice. In this paper, we utilize the spatio-temporal property and low rank nature to directly predict the total TMs. The problem is that conventional matrix interpolation only works well when elements are missing uniformly and randomly. But in the case of TMs prediction, an entire part of the matrix is unknown. To solve this problem, we utilize some essential properties of TMs and add the time series forecasting into the matrix interpolation. We analyze our algorithm and evaluate its performance. The experiment result shows that our method can predict TMs under an NMAE of 30% in most cases, even predicting all the elements of next 3 weeks.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130762745","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}
引用次数: 10
Characterizing cyberlocker traffic flows 表征网络密室的流量
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423655
Aniket Mahanti, Niklas Carlsson, M. Arlitt, C. Williamson
{"title":"Characterizing cyberlocker traffic flows","authors":"Aniket Mahanti, Niklas Carlsson, M. Arlitt, C. Williamson","doi":"10.1109/LCN.2012.6423655","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423655","url":null,"abstract":"Cyberlockers have recently become a very popular means of distributing content. Today, cyberlocker traffic accounts for a non-negligible fraction of the total Internet traffic volume, and is forecasted to grow significantly in the future. The underlying protocol used in cyberlockers is HTTP, and increased usage of these services could drastically alter the characteristics of Web traffic. In light of the evolving nature of Web traffic, updated traffic models are required to capture this change. Despite their popularity, there has been limited work on understanding the characteristics of traffic flows originating from cyberlockers. Using a year-long trace collected from a large campus network, we present a comprehensive characterization study of cyberlocker traffic at the transport layer. We use a combination of flow-level and host-level characteristics to provide insights into the behavior of cyberlockers and their impact on networks. We also develop statistical models that capture the salient features of cyberlocker traffic. Studying the transport-layer interaction is important for analyzing reliability, congestion, flow control, and impact on other layers as well as Internet hosts. Our results can be used in developing improved traffic simulation models that can aid in capacity planning and network traffic management.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134297568","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}
引用次数: 10
Active breadcrumbs: Aggressive distribution method of in-network guidance information for content-oriented networks 主动面包屑:面向内容网络的网络内引导信息的主动分发方法
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423602
Masayuki Kakida, Y. Tanigawa, H. Tode
{"title":"Active breadcrumbs: Aggressive distribution method of in-network guidance information for content-oriented networks","authors":"Masayuki Kakida, Y. Tanigawa, H. Tode","doi":"10.1109/LCN.2012.6423602","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423602","url":null,"abstract":"Lately, access loads on servers and network traffic are increasing due to larger content-size and higher request-frequency in content distribution networks. Breadcrumbs (an architecture with guidance information for locating a content cache) is designed to reduce server-loads and to form content oriented network autonomously in cooperation with cached contents. We also proposed Breadcrumbs+ which solves BC's problem that queries visit the same routers repeatedly with forming a loop of routing. However, Breadcrumbs itself still has a technical issue that some queries potentially traverse longer hops compared to conventional approach. In addition, Breadcrumbs takes only a passive approach; a query is routed by a trail of BCs only when the query happens to encounter a corresponding BC. This indicates that Breadcrumbs has a space to enhance its capability. We expect that active and adaptive control of BC improves user experience. In this paper, we propose Active Breadcrumbs which provides higher cache utilization through active spreading guidance information around cache-nodes. Finally, we show the effectiveness of Active Breadcrumbs in terms of traversing content/query hops and server utilization through the extensive computer simulation.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133555642","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
An optimised dynamic resource allocation algorithm for Cloud's backbone network 一种优化的云骨干网络动态资源分配算法
37th Annual IEEE Conference on Local Computer Networks Pub Date : 2012-10-22 DOI: 10.1109/LCN.2012.6423621
Ilhem Fajjari, N. Aitsaadi, G. Pujolle, H. Zimmermann
{"title":"An optimised dynamic resource allocation algorithm for Cloud's backbone network","authors":"Ilhem Fajjari, N. Aitsaadi, G. Pujolle, H. Zimmermann","doi":"10.1109/LCN.2012.6423621","DOIUrl":"https://doi.org/10.1109/LCN.2012.6423621","url":null,"abstract":"Sky computing is a promising concept enabling a flexible deployment of geographical distributed applications. Whereas, it is faced with a fundamental challenge which is: “efficient resource utilisation” within Cloud's infrastructure. Hence, a high flexible and intelligent resource allocation scheme is necessary to accommodate unpredictable and variable users demands. This paper tackles the fundamental challenge of efficient resource allocation within Cloud's backbone network. The ultimate goal is to satisfy the Cloud's user requirements while maximising Cloud provider's revenue. The problem consists in embedding virtual networks within substrate infrastructure. A new dynamic adaptive virtual network resource allocation strategy named Backtracking-VNE is investigated to deal with the complexity of resource provisioning within Cloud network. The proposal coordinates virtual nodes and virtual links mapping stages to optimise resources usage. Moreover, thanks to forecasting module, Backtracking-VNE guarantees an efficient resources share between embedded virtual links with respect to their occupancy. We demonstrate through extensive simulations that contrarily to static bandwidth allocation approaches, Backtracking-VNE enhances substrate bandwidth usage whilst minimising virtual links congestion. Acceptance rate of virtual networks and Cloud providers income are also improved compared with related strategies.","PeriodicalId":209071,"journal":{"name":"37th Annual IEEE Conference on Local Computer Networks","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132258475","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
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学术官方微信