Symposium on Architectures for Networking and Communications Systems最新文献_第6页

Input-queued switches with logarithmic delay: necessary conditions and a reconfigurable scheduling algorithm 具有对数延迟的输入队列交换机:必要条件和可重构调度算法

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477961

Krishnendu Roy, R. Vaidyanathan, J. Trahan

{"title":"Input-queued switches with logarithmic delay: necessary conditions and a reconfigurable scheduling algorithm","authors":"Krishnendu Roy, R. Vaidyanathan, J. Trahan","doi":"10.1145/1477942.1477961","DOIUrl":"https://doi.org/10.1145/1477942.1477961","url":null,"abstract":"Typically, a scheduling algorithm for an n x n packet switch with a crossbar as the data fabric divides time into slots, each of duration tp sufficient to transmit a packet. If a scheduling round requires tr > tp time, then the switch can transmit multiple packets, up to s = ⌊tr/tp⌋, between each mapped input-output pair under the current mapping. If s = 1, there exists a frame-based scheduling algorithm with Θ(log n) delay. For uniform random traffic, we establish that the delay is Ω(n) for any s > 1, hence, s = 1 is the only case where a Θ(log n) delay is achievable.\u0000 Given the importance of achieving a low s, it is imperative to develop extremely fast scheduling algorithms (that reduce tr) on a mesh-based structure (corresponding to the crossbar topology of the switch). We present results for a fast scheduling algorithm that runs on a mesh-of-trees topology that can be overlaid on the crossbar switching fabric.","PeriodicalId":329300,"journal":{"name":"Symposium on Architectures for Networking and Communications Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129844509","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

On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks 专用网络中多数据传输的带宽调度算法设计

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477970

Yunyue Lin, C. Wu

{"title":"On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks","authors":"Yunyue Lin, C. Wu","doi":"10.1145/1477942.1477970","DOIUrl":"https://doi.org/10.1145/1477942.1477970","url":null,"abstract":"The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data transfer. Efficient algorithms are needed for path computation and bandwidth scheduling in dedicated networks to improve the utilization of network resources and meet diverse user requests. We consider two periodic bandwidth scheduling problems: multiple data transfer allocation (MDTA) and multiple fixed-slot bandwidth reservation (MFBR), both of which schedule a number of user requests accumulated in a certain period. MDTA is to assign multiple data transfer requests on several pre-specified network paths to minimize the total data transfer end time, while MFBR is to satisfy multiple bandwidth reservation requests, each of which specifies a bandwidth and a time slot. For MDTA, we design an optimal algorithm and provide its correctness proof; for MFBR, we prove it to be NP-complete and propose a heuristic algorithm, Minimal Bandwidth and Distance Product Algorithm (MBDPA). Extensive simulation results illustrate the performance superiority of the proposed MBDPA over a greedy heuristic approach and provide valuable insight into the advantage of periodic bandwidth scheduling over instant bandwidth scheduling.","PeriodicalId":329300,"journal":{"name":"Symposium on Architectures for Networking and Communications Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132770529","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}

引用次数: 26

A scalable multithreaded L7-filter design for multi-core servers 用于多核服务器的可扩展多线程l7过滤器设计

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477952

Danhua Guo, Guangdeng Liao, L. Bhuyan, B. Liu, J. Ding

{"title":"A scalable multithreaded L7-filter design for multi-core servers","authors":"Danhua Guo, Guangdeng Liao, L. Bhuyan, B. Liu, J. Ding","doi":"10.1145/1477942.1477952","DOIUrl":"https://doi.org/10.1145/1477942.1477952","url":null,"abstract":"L7-filter is a significant component in Linux's QoS framework that classifies network traffic based on application layer data. It enables subsequent distribution of network resources in respect to the priority of applications. Considerable research has been reported to deploy multi-core architectures for computationally intensive applications. Unfortunately, the proliferation of multi-core architectures has not helped fast packet processing due to: 1) the lack of efficient parallelism in legacy network programs, and 2) the non-trivial configuration for scalable utilization on multi-core servers.\u0000 In this paper, we propose a highly scalable parallelized L7-filter system architecture with affinity-based scheduling on a multi-core server. We start with an analytical study of the system architecture based on an offline design. Similar to Receive Side Scaling (RSS) in the NIC, we develop a model to explore the connection level parallelism in L7-filter and propose an affinity-based scheduler to optimize system scalability. Performance results show that our optimized L7-filter has superior scalability over the naive multithreaded version. It improves system performance by about 50% when all the cores are deployed.","PeriodicalId":329300,"journal":{"name":"Symposium on Architectures for Networking and Communications Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116970545","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}

引用次数: 54

On runtime management in multi-core packet processing systems 多核包处理系统的运行时管理

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477953

Qiang Wu, T. Wolf

引用次数: 33

Stateful hardware decompression in networking environment 网络环境下有状态硬件解压缩

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477968

Hao Yu, H. Franke, G. Biran, Amit Golander, T. Nelms, B. Bass

{"title":"Stateful hardware decompression in networking environment","authors":"Hao Yu, H. Franke, G. Biran, Amit Golander, T. Nelms, B. Bass","doi":"10.1145/1477942.1477968","DOIUrl":"https://doi.org/10.1145/1477942.1477968","url":null,"abstract":"Compression and Decompression can significantly lower the network bandwidth requirements for common internet traffic. Driven by the demands of an enterprise network intrusion system, this paper defines and examines the requirements of popular dictionary-based decompression in the real-time network processing scenario. In particular, a \"stateful\" decompression is required that arises out of the packet oriented nature of current networks, where the decompression of the data of a packet depends on the decompressed contents of its preceeding packets composing the same data stream. We propose an effective hardware decompression acceleration engine, which fetches the history data into the accelerator's fast memory on-demand and hides the associated latency by exploring the parallelism of the dictionary-based decompression process. We specify and evaluate various design and implementation options of the fetch-on-demand mechanism, i.e. prefetch most frequently used history, on-accelerator history buffer management, and reuse of fetched history data. Through simulation-based performance study, we show the effectiveness of the proposed mechanism on hiding the overhead of stateful decompression. We further show the effects of the design options and the impact on the overall performance of the network service stack of an intrusion prevension system.","PeriodicalId":329300,"journal":{"name":"Symposium on Architectures for Networking and Communications Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125082699","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

Towards effective network algorithms on multi-core network processors 多核网络处理器上有效的网络算法研究

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477963

Yaxuan Qi, Zongwei Zhou, Baohua Yang, Fei He, Y. Xue, Jun Li

引用次数: 3

Data path credentials for high-performance capabilities-based networks 基于高性能功能的网络的数据路径凭据

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477965

T. Wolf

引用次数: 32

Acceleration of decision tree searching for IP traffic classification 为 IP 流量分类加速决策树搜索

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477949

Yan Luo, Ke Xiang, Sanping Li

引用次数: 38

SimNP: a flexible platform for the simulation of a network processing system SimNP:一个灵活的模拟网络处理系统的平台

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477962

D. Bermingham, Liu Zhen, Xiaojun Wang

引用次数: 2

Implementing an OpenFlow switch on the NetFPGA platform 在NetFPGA平台上实现OpenFlow交换机

Symposium on Architectures for Networking and Communications Systems Pub Date : 2008-11-06 DOI: 10.1145/1477942.1477944

Jad Naous, David Erickson, Adam Covington, G. Appenzeller, N. McKeown

引用次数: 275