2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第4页

Adaptive Bloom filters for multicast addressing 自适应布隆过滤器的多播寻址

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928802

Zalán Heszberger, János Tapolcai, A. Gulyás, J. Bíró, A. Zahemszky, P. Ho

引用次数: 7

L-WMxD: Lexical based Webmail XSS Discoverer L-WMxD:基于词法的Webmail XSS发现者

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928954

Zhushou Tang, Haojin Zhu, Z. Cao, Shuai Zhao

{"title":"L-WMxD: Lexical based Webmail XSS Discoverer","authors":"Zhushou Tang, Haojin Zhu, Z. Cao, Shuai Zhao","doi":"10.1109/INFCOMW.2011.5928954","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928954","url":null,"abstract":"XSS (Cross-Site Scripting) is a major security threat for web applications. Due to lack of source code of web application, fuzz technique has become a popular approach to discover XSS in web application except Webmail. This paper proposes a Webmail XSS fuzzer called L-WMxD (Lexical based Webmail XSS Discoverer). L-WMxD , which works on a lexical based mutation engine, is an active defense system to discover XSS before the Webmail application is online for service. The engine is initialized by normal JavaScript code called seed. Then, rules are applied to the sensitive strings in the seed which are picked out through a lexical parser. After that, the mutation engine issues multiple test cases. Newly-generated test cases are used for XSS test. Two prototype tools are realized by us to send the newly-generated test cases to various Webmail servers to discover XSS vulnerability. Experimental results of L-WMxD are quite encouraging. We have run L-WMxD over 26 real-world Webmail applications and found vulnerabilities in 21 Webmail services, including some of the most widely used Yahoo!Mail, Mirapoint Webmail and ORACLE' Collaboration Suite Mail.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122990011","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}

引用次数: 15

Micropatterning of different kinds of biomaterials as a platform of a molecular communication system 不同种类生物材料的微图案化作为分子通讯系统的平台

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928860

S. Hiyama, Y. Moritani, K. Kuribayashi-Shigetomi, H. Onoe, S. Takeuchi

引用次数: 1

Profiling per-packet and per-byte energy consumption in the NetFPGA Gigabit router 分析NetFPGA千兆路由器中每数据包和每字节的能耗

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928833

V. Sivaraman, A. Vishwanath, Zhi Zhao, Craig Russell

{"title":"Profiling per-packet and per-byte energy consumption in the NetFPGA Gigabit router","authors":"V. Sivaraman, A. Vishwanath, Zhi Zhao, Craig Russell","doi":"10.1109/INFCOMW.2011.5928833","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928833","url":null,"abstract":"Improving energy efficiency of Internet equipment is becoming an increasingly important research topic, motivated by the need to reduce energy costs (and Carbon footprint) for Internet Service Providers, as well as increase power density to achieve more switching capacity per-rack. While recent research has profiled the power consumption of commercial routing equipment, these profiles are coarse-grained (i.e., at the granularity of per line-card or per port), and moreover such platforms are inflexible for experimentation with new energy-saving mechanisms. In this paper we therefore consider the NetFPGA platform, which is becoming an increasingly popular routing platform for networking research due to its versatility and low-cost. Using a precise hardware-based traffic generator and high-fidelity energy probe, we conduct several experiments that allow us to decompose the energy consumption of the NetFPGA routing card into fine-grained per-packet and per-byte components with reasonable accuracy. Our quantification of energy consumption on this platform opens the doors for estimating network-wide energy footprints at the granularity of traffic sessions and applications (e.g., due to TCP file transfers), and provides a benchmark against which energy improvements arising from new architectures and protocols can be evaluated.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128052070","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}

引用次数: 90

An OSPF enhancement for energy saving in IP networks 针对IP网络节能的OSPF增强

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928832

A. Cianfrani, V. Eramo, M. Listanti, Marco Polverini

引用次数: 89

Improving the performance of intrusion detection using Dialog-based Payload Aggregation 利用基于对话框的负载聚合改进入侵检测的性能

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928926

Tobias Limmer, F. Dressler

{"title":"Improving the performance of intrusion detection using Dialog-based Payload Aggregation","authors":"Tobias Limmer, F. Dressler","doi":"10.1109/INFCOMW.2011.5928926","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928926","url":null,"abstract":"We propose Dialog-based Payload Aggregation (DPA) that extracts relevant payload data from TCP/IP packet streams based on sequence numbers in the TCP header for improved intrusion detection performance. Typical network-based Intrusion Detection Systems (IDSs) like Snort, which use rules for matching payload data, show severe performance problems in high-speed networks. Our detailed analysis based on live network traffic reveals that most of the signature matches either occur at the beginning of TCP connections or directly after direction changes in the data streams. Our DPA approach exploits protocol semantics intrinsic to bidirectional communication, i.e., most application layer protocols rely on requests and associated responses with a direction change in the data stream in between. DPA forwards the next N bytes of payload whenever a connection starts, or when the direction of the data transmission changes. All data transferred after this window is discarded. According to experimental results, our method reduces the amount of data to be analyzed at the IDS to around 3:7% for typical network traffic. At the same time, more than 89% of all potential events can be detected. Assuming a linear relationship between data rate and processing time of an IDS, this results in a speedup of more than one order of magnitude in the best case. Our performance analysis that combines DPA with Snort shows a 400% increase in packet processing throughput on commodity hardware.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133532046","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}

引用次数: 19

Identifying bad measurements in compressive sensing 识别压缩感知中的不良测量

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928783

H. Kung, Tsung-Han Lin, D. Vlah

引用次数: 12

Simulation-based evaluation of the diffusion-based physical channel in molecular nanonetworks 分子纳米网络中基于扩散的物理通道的模拟评价

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928854

N. Garralda, I. Llatser, A. Cabellos-Aparicio, M. Pierobon

{"title":"Simulation-based evaluation of the diffusion-based physical channel in molecular nanonetworks","authors":"N. Garralda, I. Llatser, A. Cabellos-Aparicio, M. Pierobon","doi":"10.1109/INFCOMW.2011.5928854","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928854","url":null,"abstract":"Nanonetworking is an emerging field of research, where nanotechnology and communication engineering are applied on a common ground. Molecular Communication (MC) is a bio-inspired paradigm, where Nanonetworks, i.e., the interconnection of devices at the nanoscale, are based on the exchange of molecules. Amongst others, diffusion-based MC is expected to be suitable for covering short distances (nm-µm). In this work, we explore the main characteristics of diffusion-based MC through the use of N3Sim, a physical simulation framework for MC. N3Sim allows for the simulation of the physics underlying the diffusion of molecules for different scenarios. Through the N3Sim results, the Linear Time Invariant (LTI) property is proven to be a valid assumption for the free diffusion-based MC scenario. Moreover, diffusion-based noise is observed and evaluated with reference to already proposed stochastic models. The optimal pulse shape for diffusion-based MC is provided as a result of simulations. Two different pulse-based coding techniques are also compared through N3Sim in terms of available bandwidth and energy consumption for communication.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115636608","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}

引用次数: 61

ISCoDe: A framework for interest similarity-based community detection in social networks ISCoDe:一个基于兴趣相似度的社交网络社区检测框架

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928942

E. Jaho, M. Karaliopoulos, I. Stavrakakis

{"title":"ISCoDe: A framework for interest similarity-based community detection in social networks","authors":"E. Jaho, M. Karaliopoulos, I. Stavrakakis","doi":"10.1109/INFCOMW.2011.5928942","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928942","url":null,"abstract":"This paper proposes a framework for node clustering in computerized social networks according to common interests. Communities in such networks are mainly formed by user selection, which may be based on various factors such as acquaintance, social status, educational background. However, such selection may result in groups that have a low degree of similarity. The proposed framework could improve the effectiveness of these social networks by constructing clusters of nodes with higher interest similarity, and thus maximize the benefit that users extract from their participation. The framework is based on methods for detecting communities over weighted graphs, where graph edge weights are defined based on measures of similarity between nodes' interests in certain thematic areas. The capacity of these measures to enhance the sensitivity and resolution of community detection is evaluated with concrete benchmark scenarios over synthetic networks. We also use the framework to assess the level of common interests among sample users of a popular online social application. Our results confirm that clusters formed by user selection have low degrees of similarity; our framework could, hence, be valuable in forming communities with higher coherence of interests.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123397027","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

Hard-deadline-based frame filtering mechanism supporting the delivery of real-time video streams 基于硬期限的帧过滤机制，支持实时视频流的传输

2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2011-04-10 DOI: 10.1109/INFCOMW.2011.5928933

J. Liu

{"title":"Hard-deadline-based frame filtering mechanism supporting the delivery of real-time video streams","authors":"J. Liu","doi":"10.1109/INFCOMW.2011.5928933","DOIUrl":"https://doi.org/10.1109/INFCOMW.2011.5928933","url":null,"abstract":"This paper describes a cross-layer filtering mechanism which facilitates real-time video frames to meet their stringent decoding deadlines in the existence of network congestion. The basic idea is to remove the dysfunctional video frames, which have missed their decoding deadlines, from transmission as early as possible, since they no longer serve for the functioning of a real-time media streaming application. The filtering mechanism consists of a pair of components which operate at the encoder and the decoder, respectively. The decoder-side component identifies the dysfunctional frames and sends the notifications to the encoder. The encoder-side component removes the identified dysfunctional frames from transmission. By removing dysfunctional frames from transmission, the video frames that are behind the dysfunctional frames are eligible for transmission at an earlier time and are made likely to meet their decoding deadlines. Meanwhile, removing dysfunctional frames from transmission also serves to maintain a stable and low queueing delay. The filtering mechanism relies on a user-space transport stack which enables the application-controlled transmission of data segments. The effectiveness of the filtering mechanism has been demonstrated through experiments in emulated networks.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124906857","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