2008 Proceedings of 17th International Conference on Computer Communications and Networks最新文献_第9页

A New Collision Resolution Mechanism for IEEE 802.11 WLAN 一种新的IEEE 802.11 WLAN冲突解决机制

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.117

Qifei Zhang, Baolin Sun, Chao Gui, Changjun Zeng

引用次数: 2

An Efficient and Scalable Pattern Matching Scheme for Network Security Applications 一种用于网络安全应用的高效可扩展模式匹配方案

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.176

Tsern-Huei Lee, Nai-Lun Huang

{"title":"An Efficient and Scalable Pattern Matching Scheme for Network Security Applications","authors":"Tsern-Huei Lee, Nai-Lun Huang","doi":"10.1109/ICCCN.2008.ECP.176","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.176","url":null,"abstract":"Because of its accuracy, pattern matching technique has recently been applied to Internet security applications such as intrusion detection/prevention, anti-virus, and anti-malware. Among various famous pattern matching algorithms, the Aho-Corasick (AC) can match multiple pattern strings simultaneously with worst-case performance guarantee and is adopted in both Clam antivirus (ClamAV) and Snort intrusion detection open sources. The AC algorithm is based on finite automaton which can be implemented straightforwardly with a two-dimensional state transition table. However, the memory requirement prohibits such an implementation when the total length of the pattern strings is large. The ClamAV implementation limits the depth of the finite automaton and combines with linked lists to reduce memory requirement. The banded-row format is adopted to compress the state transition table and used as an alternative pattern matching machine in Snort. In this paper we present a novel implementation which requires small memory space and achieves high throughput performance. Compared with the banded-row format, our proposed scheme achieves 39.7% reduction in memory requirement for 5,000 patterns randomly selected from ClamAV signatures. Besides, the processing time of our proposed scheme is, on the average, 83.9% of that of the banded-row format for scanning various types of files. Compared with the ClamAV implementation with the same 5,000 patterns and files, our proposed scheme requires slightly more memory space but achieves 80.6% reduction in processing time on the average.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123642937","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

Flexible Classification on Heterogenous Multicore Appliance Platforms 异构多核设备平台上的灵活分类

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.27

Priyanka Tembey, Anish Bhatt, Subramanya R. Dulloor, Ada Gavrilovska, K. Schwan

引用次数: 0

An Empirical Energy Model for Supercapacitor Powered Wireless Sensor Nodes 超级电容供电无线传感器节点的经验能量模型

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.34

G. Merrett, A. Weddell, A. Lewis, N. Harris, B. Al-Hashimi, N. White

引用次数: 49

A Light Weight Method for Maintaining Clock Synchronization for Networked Systems 一种维护网络系统时钟同步的轻量级方法

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.105

D. Salyers, A. Striegel, C. Poellabauer

{"title":"A Light Weight Method for Maintaining Clock Synchronization for Networked Systems","authors":"D. Salyers, A. Striegel, C. Poellabauer","doi":"10.1109/ICCCN.2008.ECP.105","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.105","url":null,"abstract":"Maintaining synchronization of clocks between wireless systems is a well known problem of which significant research has been performed. This has lead to a variety of methods introduced to maintain clock synchronization. Typically, works are heavy weight in that they require constant communication between systems in order to maintain clock synchronization on the order of microseconds. Unfortunately, for many applications the cost of constant communication to ensure clock synchronization is neither desirable nor acceptable. Additionally, for applications such as link state routing, delay measurements and quality of service measurements, clock synchronization on the order of microseconds is not necessary, and synchronization on the order of milliseconds is sufficient. Thus, in this work we present a light weight technique for correcting for clock drift between systems that will allow for millisecond accuracy during long periods of time while requiring no special hardware nor constant communication between systems. Experimental studies of the measured delay between two systems are performed, showing that with a training period, clocks can remained synchronized within a few milliseconds over long periods of time.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122051416","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

A Comparative Study of Path Level Traffic Grooming Strategies for WDM Optical Networks with Dynamic Traffic - Invited Paper WDM光网络路径级业务量疏导策略与动态业务量的比较研究[j]

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.64

Srivatsan Balasubramanian, Arun Kumar Somani

引用次数: 5

Managing Traffic Growth in Telecom Mesh Networks (Invited Paper) 管理电信网状网络的流量增长(特邀论文)

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.77

R. Roy, B. Mukherjee

引用次数: 6

LocSens - An Indoor Location Tracking System using Wireless Sensors LocSens -使用无线传感器的室内位置跟踪系统

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.165

F. Bagci, Florian Kluge, N. Bagherzadeh, T. Ungerer

引用次数: 7

Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity IP-over-WDM网络的逻辑拓扑设计:最小保护容量的混合方法

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.78

Muhammad S. Javed, K. Thulasiraman, G. Xue

{"title":"Logical Topology Design for IP-over-WDM Networks: A Hybrid Approach for Minimum Protection Capacity","authors":"Muhammad S. Javed, K. Thulasiraman, G. Xue","doi":"10.1109/ICCCN.2008.ECP.78","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.78","url":null,"abstract":"The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues to attract significant interest from the research community. An IP-over-WDM network implements Internet Protocol (IP) directly over physical WDM network by establishing lightpaths using IP routers, optical crossconnects (OXC) and optical fibers. Generally an optical fiber carries several lightpaths and all of them get disconnected, if the fiber carrying them fails. Such failures can quickly impact the performance of the entire network. If IP routers can find paths to all the nodes in the network, then the network can continue to provide service without significant performance degradation. This can be achieved by reserving network resources (protection) or provisioning the network with some additional capacity (restoration). Such networks are usually called survivable networks. In this paper, we propose four algorithms based on SMART framework proposed by Kurant and Thiran, and a hybrid approach by Shenai and Sivalingam. The algorithms use a combination of protection and restoration mechanisms to make IP-over-WDM networks survivable such that the protection capacity required is not significant.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"219 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129840932","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

Resource Management Schemes for Multiple Traffic in Integrated Heterogeneous Wireless and Mobile Networks 异构无线和移动综合网络中多种流量的资源管理方案

2008 Proceedings of 17th International Conference on Computer Communications and Networks Pub Date : 2008-11-17 DOI: 10.1109/ICCCN.2008.ECP.38

Wei Shen, Qing-An Zeng

引用次数: 20