2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)最新文献

筛选
英文 中文
A traffic-aware top-N firewall ruleset approximation algorithm 流量感知的top-N防火墙规则集近似算法
Ho-Yu Lam, Donghan Wang, H. J. Chao
{"title":"A traffic-aware top-N firewall ruleset approximation algorithm","authors":"Ho-Yu Lam, Donghan Wang, H. J. Chao","doi":"10.1145/1872007.1872019","DOIUrl":"https://doi.org/10.1145/1872007.1872019","url":null,"abstract":"Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount of traffic and network line speed. In this poster, we investigate an approximation algorithm for selecting the top-N most frequently matched subset of rules from the original ruleset. Through simulations, we show that our approaches the optimal while runs in seconds, allowing online adaptation to changing traffic patterns.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131250641","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
An experimental evaluation of Distributed Rate Limiting for cloud computing applications 云计算应用中分布式速率限制的实验评估
Joseph Doyle, R. Shorten, D. O'Mahony
{"title":"An experimental evaluation of Distributed Rate Limiting for cloud computing applications","authors":"Joseph Doyle, R. Shorten, D. O'Mahony","doi":"10.1145/1872007.1872042","DOIUrl":"https://doi.org/10.1145/1872007.1872042","url":null,"abstract":"Pricing and load distribution in a cloud are difficult problems. In order to recover the construction costs of the data center, the owner must endeavour to have high utilization while maintaining performance levels for the users. Distributed Rate Limiting (DRL) is a mechanism that can be used to attack this problem. A mathematical framework and the convergence and stability properties of two DRL algorithms were examined in previous work. In this paper we build upon that work by evaluating the performance of these algorithms on a testbed against the results of a simulation carried out in previous work. We also evaluate the algorithms resilience to failure and propose the good-neighbours enhancement to improve its performance.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134634828","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
End-to-end congestion management for non-blocking multi-stage switching fabrics 面向非阻塞多级交换结构的端到端拥塞管理
Nikolaos Chrysos, L. Chen, C. Minkenberg, C. Kachris, M. Katevenis
{"title":"End-to-end congestion management for non-blocking multi-stage switching fabrics","authors":"Nikolaos Chrysos, L. Chen, C. Minkenberg, C. Kachris, M. Katevenis","doi":"10.1145/1872007.1872016","DOIUrl":"https://doi.org/10.1145/1872007.1872016","url":null,"abstract":"In Fig. 3, we depict the average delay of packets targeting non-hotspots, for various numbers of hotspots, each over-loaded by 2.5×, under bursty arrivals, with average burst size of 36. Each request or grant may refer to up to 128 segments in a virtual-output-queue (VOQ), thus reducing control overhead. The switching fabric assumed here is a 64×64, three-stage Clos, made of CIOQ switching chips.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"15 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133268623","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
An architecture for Software Defined Cognitive Radio 软件定义认知无线电的体系结构
A. Dutta, D. Saha, D. Grunwald, D. Sicker
{"title":"An architecture for Software Defined Cognitive Radio","authors":"A. Dutta, D. Saha, D. Grunwald, D. Sicker","doi":"10.1145/1872007.1872014","DOIUrl":"https://doi.org/10.1145/1872007.1872014","url":null,"abstract":"As we move forward towards the next generation of wireless protocols, the push for a better radio physical layer is ever increasing. Conventional radio architectures are limited to narrow operating regions and fails to adapt with changing technology. This is further strengthened with the advent of cognitive radio, which needs a more versatile and flexible framework that is programmable within the timing constraints of a protocol. In this paper we present an architecture for Software Defined Cognitive Radio that caters to the specific baseband processing requirements in a changing environment. We aim to provide more flexibility by de-constructing the radio pipeline into a framework of user controlled kernels that can be reconfigured at run-time. This architecture provides the barebones of a OFDM based radio physical layer that can adapt to perform a varied number of tasks in different radio networks. We also present a novel message based real-time reconfiguration method to transmit and receive a wide range of waveforms used in concurrent wireless protocols.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114758730","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}
引用次数: 27
Destination-based adaptive routing on 2D mesh networks 二维网格网络中基于目的地的自适应路由
R. Ramanujam, Bill Lin
{"title":"Destination-based adaptive routing on 2D mesh networks","authors":"R. Ramanujam, Bill Lin","doi":"10.1145/1872007.1872030","DOIUrl":"https://doi.org/10.1145/1872007.1872030","url":null,"abstract":"The choice of routing algorithm plays a vital role in the performance of on-chip interconnection networks. Adaptive routing is appealing because it offers better latency and throughput than oblivious routing, especially under non-uniform and bursty traffic. The performance of an adaptive routing algorithm is determined by its ability to accurately estimate congestion in the network. In this regard, maintaining global congestion information using a separate monitoring network offers better congestion visibility into distant parts of the network than solutions relying only on local congestion state. However, the main challenge in designing such routing schemes is to keep the logic and bandwidth overhead as low as possible to fit into the tight power, area and delay budgets of onchip routers. In this paper, we propose a minimal destination-based adaptive routing strategy (DAR) where every node estimates the delay to every other node in the network, and routing decisions are based on these per-destination delay estimates. DAR outperforms Regional Congestion Awareness (RCA), the best previously known adaptive routing algorithm that uses non-local congestion knowledge. This is because the per-destination delay estimates in DAR are more accurate and not corrupted by congestion on links outside the admissible routing paths to the destination. We show that DAR outperforms minimal adaptive routing by up to 65% and RCA by up to 41% in terms of latency on SPLASH-2 benchmarks. It also outperforms these algorithms in latency and throughput under synthetic traffic patterns on both 8×8 and 16×16 mesh topologies.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115690237","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}
引用次数: 79
HELIOS: A High Energy-efficiency Locally-scheduled Input-queued Optical Switch HELIOS:一种高能效的本地调度输入队列光交换机
Shunyuan Ye, Yanming Shen, S. Panwar
{"title":"HELIOS: A High Energy-efficiency Locally-scheduled Input-queued Optical Switch","authors":"Shunyuan Ye, Yanming Shen, S. Panwar","doi":"10.1145/1872007.1872018","DOIUrl":"https://doi.org/10.1145/1872007.1872018","url":null,"abstract":"Fast growing traffic for both the Internet and within data centers has lead to an increasing demand for high-speed switching systems. In this paper, we propose a fully distributed scheduling algorithm with an O(1) complexity, for a switch with an optical switching fabric. The inputs only use local queue information to make their scheduling decisions, and the switch consumes much less power than an electronic switch. Therefore, we call the switch HELIOS: High Energy-efficiency Locally-scheduled Input-queued Optical Switch. HELIOS can achieve 100% throughput for any admissible Bernoulli i.i.d traffic. To our knowledge, this is the first distributed scheduling algorithm to guarantee 100% throughput for an input-queued optical switch.","PeriodicalId":262685,"journal":{"name":"2010 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125052149","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
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学术官方微信