Bloom Filters. References:
|
|
- Veronica Atkins
- 6 years ago
- Views:
Transcription
1 Bloom Filters References: Li Fan, Pei Cao, Jussara Almeida, Andrei Broder, Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol, IEEE/ACM Transactions on Networking, Vol. 8, No. 3, June B. Bloom, Space/time trade-offs in hash coding with allowable errors, CACM, Vol. 13, No. 7, July /21/05 (SSL) 1
2 The Problem Bloom filter represents a set A = {a 1, a 2,, a n } of n stored elements (also called keys) A sequence of keys is later tested one by one for membership in the set The great majority of keys to be tested do not belong to the set fast reject time desired and no false negative Tradeoff between storage space for Bloom filter and false positive rate 11/21/05 (SSL) 2
3 The idea allocate a vector v of m bits, initially all set to 0 choose k independent hash functions, {H 1, H 2,, H k }, each with range {1,, m} for each stored element, a, the bits at positions H 1 (a), H 2 (a),..., H k (a) in v are set to 1. A particular bit might be set to 1 multiple times. Bloom filter with 4 hash functions 11/21/05 (SSL) 3
4 Membership query To determine whether b is in the set, the bits at positions H 1 (b), H 2 (b),..., H k (b) are checked. If any of them is 0, then certainly b is not in the set A no false negative However a false positive is probable parameters k and m are chosen to trade memory space for a small false positive probability False positive probability decreases as k increases or m/n increases 11/21/05 (SSL) 4
5 The math After inserting n keys into a filter of size m (bits), the probability that a particular bit in the filter is still 0 is The probability of a false positive in this situation is 11/21/05 (SSL) 5
6 Optimal tradeoff The right hand size of previous equation is minimized for k = ln 2 (m/n), in which case it becomes False positive probability With optimum integral no. of hash functions k=4 m/n False positive probability decreases as m/n increases 11/21/05 (SSL) 6
7 Handling membership changes For each location h in the bit array, h=1,, m, maintain a count, c(h), initially zero, equal to the number of times the bit location has been set to 1 When a key a joins/leaves A, the counts c(h 1 (a)), c(h 2 (a)),..., c(h k (a)) are incremented/decremented by 1 A bit location is turned on when its count changes from 0 to 1 A bit location is turned off when its count changes from 1 to 0 11/21/05 (SSL) 7
8 How much memory for counts After inserting n keys with k hash functions into array of m bits, probability that any count is greater than or equal to i Assume number of hash functions to be less than ln 2 (m/n), which is the optimum 11/21/05 (SSL) 8
9 How much memory for counts (cont.) For i = 16, we have Allowing 4 bits per count, for a practical m value, the probability of overflow is negligible. If the count ever exceeds 15 and it stays at 15 when the count should be incremented the consequence is that many deletions later, the Bloom filter may allow a false negative 11/21/05 (SSL) 9
10 Application Summary Cache Cooperating proxies behind an Internet bottleneck proxies serve each other s cache misses ICP protocol a cache miss causes queries sent to all other proxies (not scalable) Summary Cache each proxy computes a summary (Bloom filter) of URLs of its cached documents, together with counts for bit locations sends bit array to every other proxy sends update summary when % new documents reaches a threshold 11/21/05 (SSL) 10
11 More on Summary Cache A local cache miss results in queries sent only to proxies whose summaries have the requested document large reduction in msg traffic Summaries do not have to be up-to-date or accurate False misses total hit rate reduced, due to delayed updates False hits some bandwidth wasted Remote stale hits some bandwidth wasted Memory required increases with # of proxies 11/21/05 (SSL) 11
12 Other applications Sarang Dharmapurikar, et al., Longest Prefix Matching using Bloom Filters, Proceedings ACM SIGCOMM 2003, August 2003 Bloom filter i for the set of IP address prefixes of length i, i = 1,, 32 (some filters may be empty) To find next hop for a particular IP address, the address is used to probe all Bloom filters in parallel to get matching prefix lengths Then probe hash table associated with longest matching prefix length (first) 11/21/05 (SSL) 12
13 Other applications Alex C. Snoeren, et al., Hash-Based IP Traceback, Proceedings ACM SIGCOMM 2001, August 2001 Routers compute 32-bit digest over the invariant portion of IP header and first 8 bytes of payload of every packet forwarded Store digests in Bloom filters to save memory (down to 0.5% of link bandwidth per unit time) Use stored digests in routers to trace the source of attack packets 11/21/05 (SSL) 13
14 Other applications Intrusion detection, content based routing A. Broder and M. Mitzenmacher, Network applications of Bloom filters: A Survey, Proceedings 40 th Annual Allerton Conference, October /21/05 (SSL) 14
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Li Fan, Pei Cao and Jussara Almeida University of Wisconsin-Madison Andrei Broder Compaq/DEC System Research Center Why Web Caching One of
More informationSummary Cache based Co-operative Proxies
Summary Cache based Co-operative Proxies Project No: 1 Group No: 21 Vijay Gabale (07305004) Sagar Bijwe (07305023) 12 th November, 2007 1 Abstract Summary Cache based proxies cooperate behind a bottleneck
More informationCompact data structures: Bloom filters
Compact data structures: Luca Becchetti Sapienza Università di Roma Rome, Italy April 7, 2010 1 2 3 Dictionaries A dynamic set S of objects from a discrete universe U, on which (at least) the following
More informationAn Enhanced Bloom Filter for Longest Prefix Matching
An Enhanced Bloom Filter for Longest Prefix Matching Gahyun Park SUNY-Geneseo Email: park@geneseo.edu Minseok Kwon Rochester Institute of Technology Email: jmk@cs.rit.edu Abstract A Bloom filter is a succinct
More informationSummary Cache: A Scalable Wide-Area Web Cache Sharing Protocol
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 3, JUNE 2000 281 Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Li Fan, Member, IEEE, Pei Cao, Jussara Almeida, and Andrei Z. Broder Abstract
More informationOne Memory Access Bloom Filters and Their Generalization
This paper was presented as part of the main technical program at IEEE INFOCOM 211 One Memory Access Bloom Filters and Their Generalization Yan Qiao Tao Li Shigang Chen Department of Computer & Information
More informationBloom filters and their applications
Bloom filters and their applications Fedor Nikitin June 11, 2006 1 Introduction The bloom filters, as a new approach to hashing, were firstly presented by Burton Bloom [Blo70]. He considered the task of
More informationBackground on Bloom Filter
CSE 535 : Lecture 5 String Matching with Bloom Filters Washington University Fall 23 http://www.arl.wustl.edu/arl/projects/fpx/cse535/ Copyright 23, Sarang Dharmapurikar [Guest Lecture] CSE 535 : Fall
More informationWeb-based Energy-efficient Cache Invalidation in Wireless Mobile Environment
Web-based Energy-efficient Cache Invalidation in Wireless Mobile Environment Y.-K. Chang, M.-H. Hong, and Y.-W. Ting Dept. of Computer Science & Information Engineering, National Cheng Kung University
More informationID Bloom Filter: Achieving Faster Multi-Set Membership Query in Network Applications
ID Bloom Filter: Achieving Faster Multi-Set Membership Query in Network Applications Peng Liu 1, Hao Wang 1, Siang Gao 1, Tong Yang 1, Lei Zou 1, Lorna Uden 2, Xiaoming Li 1 Peking University, China 1
More informationarxiv: v1 [cs.ds] 11 Apr 2008
arxiv:0804.1845v1 [cs.ds] 11 Apr 2008 An Optimal Bloom Filter Replacement Based on Matrix Solving Ely Porat Bar-Ilan University Abstract We suggest a method for holding a dictionary data structure, which
More informationEfficient Resource Management for the P2P Web Caching
Efficient Resource Management for the P2P Web Caching Kyungbaek Kim and Daeyeon Park Department of Electrical Engineering & Computer Science, Division of Electrical Engineering, Korea Advanced Institute
More informationError Detection and Correction by using Bloom Filters R. Prem Kumar, Smt. V. Annapurna
Error Detection and Correction by using Bloom Filters R. Prem Kumar, Smt. V. Annapurna Abstract---Bloom filters (BFs) provide a fast and efficient way to check whether a given element belongs to a set.
More informationMulti-pattern Signature Matching for Hardware Network Intrusion Detection Systems
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE GLOBECOM 5 proceedings. Multi-pattern Signature Matching for Hardware
More informationA Credential-Based Data Path Architecture for Assurable Global Networking
A redential-based Data Path Architecture for Assurable Global Networking Tilman Wolf Department of Electrical and omputer Engineering University of Massachusetts, Amherst, MA, USA wolf@ecsumassedu Abstract
More informationBloom Filter for Network Security Alex X. Liu & Haipeng Dai
Bloom Filter for Network Security Alex X. Liu & Haipeng Dai haipengdai@nju.edu.cn 313 CS Building Department of Computer Science and Technology Nanjing University Bloom Filters Given a set S = {x 1,x 2,x
More informationA New Memory Efficient Technique for Fraud Detection in Web Advertising Networks
80 A New Memory Efficient Technique for Fraud Detection in Web Advertising Networks Howida A. shedeed dr_howida@cis.asu.edu.eg Faculty of Computer and Information Sciences Ain Shams University, Cairo,
More informationPartialSync: Efficient Synchronization of a Partial Namespace in NDN
NDN, Technical Report NDN-0039, 2016. http://named-data.net/techreports.html Revision 1: [6/9/16] PartialSync: Efficient Synchronization of a Partial Namespace in NDN Minsheng Zhang mzhang4@memphis.edu
More informationA Robust Bloom Filter
A Robust Bloom Filter Yoon-Hwa Choi Department of Computer Engineering, Hongik University, Seoul, Korea. Orcid: 0000-0003-4585-2875 Abstract A Bloom filter is a space-efficient randomized data structure
More informationFalse Rate Analysis of Bloom Filter Replicas in Distributed Systems
False Rate Analysis of Bloom Filter Replicas in Distributed Systems Yifeng Zhu Electrical and Computer Engineering University of Maine zhu@eece.maine.edu Hong Jiang Computer Science and Engineering University
More informationCLIP: A Compact, Load-balancing Index Placement Function
CLIP: A Compact, Load-balancing Index Placement Function Michael McThrow Storage Systems Research Center University of California, Santa Cruz Abstract Existing file searching tools do not have the performance
More informationProject Proposal. ECE 526 Spring Modified Data Structure of Aho-Corasick. Benfano Soewito, Ed Flanigan and John Pangrazio
Project Proposal ECE 526 Spring 2006 Modified Data Structure of Aho-Corasick Benfano Soewito, Ed Flanigan and John Pangrazio 1. Introduction The internet becomes the most important tool in this decade
More informationLength Indexed Bloom Filter Based Forwarding In Content Centeric Networking
Length Indexed Bloom Filter Based Forwarding In Content Centeric Networking Vishal Manghnani Rochester Institute of Technology vjm1952@rit.edu Abstract Named Data Network (NDN) is a modern networking architecture
More informationDoS Attacks. Network Traceback. The Ultimate Goal. The Ultimate Goal. Overview of Traceback Ideas. Easy to launch. Hard to trace.
DoS Attacks Network Traceback Eric Stone Easy to launch Hard to trace Zombie machines Fake header info The Ultimate Goal Stopping attacks at the source To stop an attack at its source, you need to know
More informationSingle Packet IP Traceback in AS-level Partial Deployment Scenario
Single Packet IP Traceback in AS-level Partial Deployment Scenario Chao Gong, Trinh Le, Turgay Korkmaz, Kamil Sarac Department of Computer Science, University of Texas at San Antonio 69 North Loop 64 West,
More informationSubway : Peer-To-Peer Clustering of Clients for Web Proxy
Subway : Peer-To-Peer Clustering of Clients for Web Proxy Kyungbaek Kim and Daeyeon Park Department of Electrical Engineering & Computer Science, Division of Electrical Engineering, Korea Advanced Institute
More informationrequest is not a cache hit when the summary indicates so (a false hit), the penalty is a wasted query message. If the request is a cache hit when the
Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Li Fan, Pei Cao, and Jussara Almeida Department of Computer Science University of Wisconsin-Madison flfan,cao,jussarag@cs.wisc.edu Andrei
More informationSeminar on. By Sai Rahul Reddy P. 2/2/2005 Web Caching 1
Seminar on By Sai Rahul Reddy P 2/2/2005 Web Caching 1 Topics covered 1. Why Caching 2. Advantages of Caching 3. Disadvantages of Caching 4. Cache-Control HTTP Headers 5. Proxy Caching 6. Caching architectures
More informationSKALA: Scalable Cooperative Caching Algorithm Based on Bloom Filters
SKALA: Scalable Cooperative Caching Algorithm Based on Bloom Filters Nodirjon Siddikov and Dr. Hans-Peter Bischof 2 Enterprise IT Operation and Planning Unit, FE Coscom LLC, Tashkent, Uzbekistan 2 Computer
More informationRouting Lookup Algorithm for IPv6 using Hash Tables
Routing Lookup Algorithm for IPv6 using Hash Tables Peter Korppoey, John Smith, Department of Electronics Engineering, New Mexico State University-Main Campus Abstract: After analyzing of existing routing
More informationReducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters
Appl. Math. Inf. Sci. 8, No. 4, 1865-1877 (2014) 1865 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/080445 Reducing False Positives of a Bloom Filter
More informationInternet Caching Architecture
GET http://server.edu/file.html HTTP/1.1 Caching Architecture Proxy proxy.net #/bin/csh #This script NCSA mosaic with a proxy setenv http_proxy http://proxy.net:8001 setenv ftp_proxy http://proxy.net:8001
More informationA Framework for Efficient Class-based Sampling
A Framework for Efficient Class-based Sampling Mohit Saxena and Ramana Rao Kompella Department of Computer Science Purdue University West Lafayette, IN, 47907 Email: {msaxena,kompella}@cs.purdue.edu Abstract
More informationLecture 10: Addressing
Lecture 10: Addressing CSE 123: Computer Networks Alex C. Snoeren HW 2 due WEDNESDAY Lecture 10 Overview ICMP The other network-layer protocol IP Addresses Class-based addressing Subnetting Classless addressing
More informationSecuring Networks with P4
University of Amsterdam System & Network Engineering Securing Networks with P4 Joseph Hill, Paola Grosso February 14, 2018 Contents 1 Introduction 2 1.1 NetFlow....................................... 2
More informationMembership test for Mapping Information optimization draft-flinck-lisp-membertest-00
Membership test for Mapping Information optimization draft-flinck-lisp-membertest-00 1 Nokia Siemens Networks HFl / 18.3.2010 The problem we are addressing If an Ingress Tunnel Router acting as a gateway
More informationEvaluation of Path Recording Techniques in Secure MANET
Evaluation of Path Recording Techniques in Secure MANET Danai Chasaki and Tilman Wolf Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA, USA Email: {dchasaki,wolf}@ecs.umass.edu
More informationMapping Internet Sensors with Probe Response Attacks
Mapping Internet Sensors with Probe Response Attacks John Bethencourt, Jason Franklin, and Mary Vernon {bethenco, jfrankli, vernon}@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison
More informationAn Efficient and Practical Defense Method Against DDoS Attack at the Source-End
An Efficient and Practical Defense Method Against DDoS Attack at the Source-End Yanxiang He Wei Chen Bin Xiao Wenling Peng Computer School, The State Key Lab of Software Engineering Wuhan University, Wuhan
More informationA Precise and Practical IP Traceback Technique Based on Packet Marking and Logging *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 28, 453-470 (2012) A Precise and Practical IP Traceback Technique Based on Packet Marking and Logging * State Key Laboratory of Networking and Switching Technology
More informationAn Enhanced Dynamic Packet Buffer Management
An Enhanced Dynamic Packet Buffer Management Vinod Rajan Cypress Southeast Design Center Cypress Semiconductor Cooperation vur@cypress.com Abstract A packet buffer for a protocol processor is a large shared
More informationHash-Based String Matching Algorithm For Network Intrusion Prevention systems (NIPS)
Hash-Based String Matching Algorithm For Network Intrusion Prevention systems (NIPS) VINOD. O & B. M. SAGAR ISE Department, R.V.College of Engineering, Bangalore-560059, INDIA Email Id :vinod.goutham@gmail.com,sagar.bm@gmail.com
More informationA Lightweight IP Traceback Mechanism on IPv6
A Lightweight IP Traceback Mechanism on IPv6 Syed Obaid Amin, Myung Soo Kang, and Choong Seon Hong School of Electronics and Information, Kyung Hee University, 1 Seocheon, Giheung, Yongin, Gyeonggi, 449-701
More informationSIGNET: NETWORK-ON-CHIP FILTERING FOR COARSE VECTOR DIRECTORIES. Natalie Enright Jerger University of Toronto
SIGNET: NETWORK-ON-CHIP FILTERING FOR COARSE VECTOR DIRECTORIES University of Toronto Interaction of Coherence and Network 2 Cache coherence protocol drives network-on-chip traffic Scalable coherence protocols
More informationCHAPTER 4 BLOOM FILTER
54 CHAPTER 4 BLOOM FILTER 4.1 INTRODUCTION Bloom filter was formulated by Bloom (1970) and is used widely today for different purposes including web caching, intrusion detection, content based routing,
More informationScalable Hash-based IP Traceback using Rate-limited Probabilistic Packet Marking
TECHNICAL REPORT, COLLEGE OF COMPUTING, GEORGIA INSTITUTE OF TECHNOLOGY Scalable Hash-based IP Traceback using Rate-limited Probabilistic Packet Marking Minho Sung, Jason Chiang, and Jun (Jim) Xu Abstract
More informationx 1 x 2... y 1 y 2...
Network Applications of Bloom Filters: A Survey Λ Andrei Broder y Michael Mitzenmacher z Abstract A Bloom filter is an ingenious randomized data-structure for concisely representing a set in order to support
More informationModelling and Analysis of Push Caching
Modelling and Analysis of Push Caching R. G. DE SILVA School of Information Systems, Technology & Management University of New South Wales Sydney 2052 AUSTRALIA Abstract: - In e-commerce applications,
More informationAn Efficient Provable Data Possession Scheme based on Counting Bloom Filter for Dynamic Data in the Cloud Storage
, pp. 9-16 http://dx.doi.org/10.14257/ijmue.2016.11.4.02 An Efficient Provable Data Possession Scheme based on Counting Bloom Filter for Dynamic Data in the Cloud Storage Eunmi Jung 1 and Junho Jeong 2
More informationProject Proposal. ECE 526 Spring Modified Data Structure of Aho-Corasick. Benfano Soewito, Ed Flanigan and John Pangrazio
Project Proposal ECE 526 Spring 2006 Modified Data Structure of Aho-Corasick Benfano Soewito, Ed Flanigan and John Pangrazio 1. Introduction The internet becomes the most important tool in this decade
More informationBloom Filters via d-left Hashing and Dynamic Bit Reassignment Extended Abstract
Bloom Filters via d-left Hashing and Dynamic Bit Reassignment Extended Abstract Flavio Bonomi 1 Michael Mitzenmacher 2 Rina Panigrahy 3 Sushil Singh 4 George Varghese 5 Abstract In recent work, the authors
More informationA New Logging-based IP Traceback Approach using Data Mining Techniques
using Data Mining Techniques Internet & Multimedia Engineering, Konkuk University, Seoul, Republic of Korea hsriverv@gmail.com, kimsr@konuk.ac.kr Abstract IP Traceback is a way to search for sources of
More informationNetwork Algorithmics, Introduction. George Varghese. April 2, 2007
Network Algorithmics, Introduction George Varghese April 2, 2007 Introduction What is Internet Algorithmics? Warm up Exercise Will assume some knowledge of basic network protocols but hope to teach you
More informationPayload Inspection Using Parallel Bloom Filter in Dual Core Processor
Payload Inspection Using Parallel Bloom Filter in Dual Core Processor Arulanand Natarajan (Corresponding author) Anna University Coimbatore, TN, India E-mail: arulnat@yahoo.com S. Subramanian Sri Krishna
More informationGood Memories: Enhancing Memory Performance for Precise Flow Tracking
Good Memories: Enhancing Memory Performance for Precise Flow Tracking Boris Grot, William Mangione-Smith University of California, Los Angeles Department of Electrical Engineering {bgrot, billms}@ucla.edu
More informationRelative Reduced Hops
GreedyDual-Size: A Cost-Aware WWW Proxy Caching Algorithm Pei Cao Sandy Irani y 1 Introduction As the World Wide Web has grown in popularity in recent years, the percentage of network trac due to HTTP
More informationInterdomain Routing Design for MobilityFirst
Interdomain Routing Design for MobilityFirst October 6, 2011 Z. Morley Mao, University of Michigan In collaboration with Mike Reiter s group 1 Interdomain routing design requirements Mobility support Network
More informationWeb File Transmission by Object Packaging Performance Comparison with HTTP 1.0 and HTTP 1.1 Persistent Connection
Web File Transmission by Performance Comparison with and Hiroshi Fujinoki, Murugesan Sanjay, and Chintan Shah Department of Computer Science Southern Illinois University at Edwardsville Edwardsville, Illinois
More informationProf. N. P. Karlekar Project Guide Dept. computer Sinhgad Institute of Technology
Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Advance Deterministic
More informationLow-Overhead Message Tracking for Distributed Messaging
Low-Overhead Message Tracking for Distributed Messaging Seung Jun 1 and Mark Astley 2 1 College of Computing, Georgia Institute of Technology, Atlanta, GA 30339, USA 2 IBM T.J. Watson Research Center,
More informationWeb File Transmission by Object Packaging Performance Comparison with HTTP 1.0 and HTTP 1.1 Persistent Connection
Web File Transmission by Performance Comparison with HTTP 1. and Hiroshi Fujinoki, Murugesan Sanjay, and Chintan Shah Department of Computer Science Southern Illinois University at Edwardsville Edwardsville,
More informationNetwork Control and Signalling
Network Control and Signalling 1. Introduction 2. Fundamentals and design principles 3. Network architecture and topology 4. Network control and signalling 5. Network components 5.1 links 5.2 switches
More informationCE Advanced Network Security Network Forensics
CE 817 - Advanced Network Security Network Forensics Lecture 22 Mehdi Kharrazi Department of Computer Engineering Sharif University of Technology Acknowledgments: Some of the slides are fully or partially
More informationLONGEST prefix matching (LPM) techniques have received
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 14, NO. 2, APRIL 2006 397 Longest Prefix Matching Using Bloom Filters Sarang Dharmapurikar, Praveen Krishnamurthy, and David E. Taylor, Member, IEEE Abstract We
More informationA NEW IP TRACEBACK SCHEME TO AVOID LAUNCH ATTACKS
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 3, March 2014,
More informationMapping Internet Sensors with Probe Response Attacks
Mapping Internet Sensors with Probe Response Attacks Computer Sciences Department University of Wisconsin, Madison Introduction Outline Background Example Attack Introduction to the Attack Basic Probe
More informationApproximate Packet Classification Caching
Approximate Packet Classification Caching Francis Chang, Kang i, Wu-chang Feng OGI School of Science and Engineering at OHSU {francis, kangli, wuchang}@cse.ogi.edu ABSTRACT Most network devices such as
More informationReducing Outgoing Traffic of Proxy Cache by Using Client-Cluster
Reducing Outgoing Traffic of Proxy Cache by Using Client-Cluster Kyungbaek Kim and Daeyeon Park Abstract: Many web cache systems and policies concerning them have been proposed. These studies, however,
More informationRobust TCP Stream Reassembly In the Presence of Adversaries
Robust TCP Stream Reassembly In the Presence of Adversaries Sarang Dharmapurikar and Vern Paxson Washington Univ. UC Berkeley Usenix Security 2005 Presented by N. Sertac Artan Motivation TCP Reassembly
More informationBroadcast Updates with Local Look-up Search (BULLS): A New Peer-to-Peer Protocol
Broadcast Updates with Local Look-up Search (BULLS): A New Peer-to-Peer Protocol G. Perera and K. Christensen Department of Computer Science and Engineering University of South Florida Tampa, FL 33620
More informationA Privacy Preserving Model for Ownership Indexing in Distributed Storage Systems
A Privacy Preserving Model for Ownership Indexing in Distributed Storage Systems Tiejian Luo tjluo@ucas.ac.cn Zhu Wang wangzhubj@gmail.com Xiang Wang wangxiang11@mails.ucas.ac.cn ABSTRACT The indexing
More informationEXAM TCP/IP NETWORKING Duration: 3 hours With Solutions
SCIPER: First name: Family name: EXAM TCP/IP NETWORKING Duration: 3 hours With Solutions Jean-Yves Le Boudec January 2013 INSTRUCTIONS 1. Write your solution into this document and return it to us (you
More informationScalable Enterprise Networks with Inexpensive Switches
Scalable Enterprise Networks with Inexpensive Switches Minlan Yu minlanyu@cs.princeton.edu Princeton University Joint work with Alex Fabrikant, Mike Freedman, Jennifer Rexford and Jia Wang 1 Enterprises
More information1-1. Switching Networks (Fall 2010) EE 586 Communication and. September Lecture 10
EE 586 Communication and Switching Networks (Fall 2010) Lecture 10 September 17 2010 1-1 Announcement Send me your group and get group ID HW3 (short) out on Monday Personal leave for next two weeks No
More informationExscind: A Faster Pattern Matching For Intrusion Detection Using Exclusion and Inclusion Filters
Exscind: A Faster Pattern Matching For Intrusion Detection Using Exclusion and Inclusion Filters 1 Monther Aldwairi and Duaa Alansari Seventh International Conference on Next Generation Web Services Practices
More informationTelecom Systems Chae Y. Lee. Contents. Overview. Issues. Addressing ARP. Adapting Datagram Size Notes
Internetworking Contents Overview Functions Issues Basic Delivery Unit Addressing Datagram Delivery ARP IPv4 Header Adapting Datagram Size Notes 2 Overview - Example 3 Direct Delivery 4 Indirect Delivery
More informationCompressed Bloom Filters
Compressed Bloom Filters Michael Mitzenmacher Harvard University 33 Oxford St. Cambridge, MA 02138 michaelm@eecs.harvard.edu ABSTRACT A Bloom filter is a simple space-efficient randomized data structure
More informationAdaptive Bloom Filters for Multicast Addressing
This paper was presented as part of the High-Speed Networks 2011 HSN 2011) Workshop at IEEE INFOCOM 2011 Adaptive Bloom Filters for Multicast Addressing Zalan Heszberger, János Tapolcai, András Gulyás,
More informationCAPTRA: Coordinated Packet Traceback
CAPTRA: Coordinated Packet Traceback Denh Sy and Lichun Bao Bren School of Information and Computer Sciences University of California, Irvine, CA 9697 {dsy,lbao}@icsuciedu ABSTRACT Network-based attacks
More informationProtecting Network Quality of Service Against Denial of Service Attacks
Protecting Network Quality of Service Against Denial of Service Attacks Douglas S. Reeves Peter Wurman NC State University S. Felix Wu U.C. Davis Dan Stevenson Xiaoyong Wu MCNC DARPA FTN PI Meeting January
More informationAn Integration Approach of Data Mining with Web Cache Pre-Fetching
An Integration Approach of Data Mining with Web Cache Pre-Fetching Yingjie Fu 1, Haohuan Fu 2, and Puion Au 2 1 Department of Computer Science City University of Hong Kong, Hong Kong SAR fuyingjie@tsinghua.org.cn
More informationCodes, Bloom Filters, and Overlay Networks. Michael Mitzenmacher
Codes, Bloom Filters, and Overlay Networks Michael Mitzenmacher 1 Today... Erasure codes Digital Fountain Bloom Filters Summary Cache, Compressed Bloom Filters Informed Content Delivery Combining the two
More informationFlexible Indexing Using Signatures
Flexible Indexing Using Signatures David Holmes 9517 Linden Avenue Bethesda, MD 20814 (240)426-1658 E-mail: holmesdo@aol.com Abstract This paper discusses an implementation of database signatures. Previous
More informationApproximate Caches for Packet Classification
Approximate Caches for Packet Classification Francis Chang, Wu-chang Feng Systems Software aboratory OGI School of Science and Engineering at OHSU Beaverton, Oregon, USA {francis, wuchang}@cse.ogi.edu
More informationImproving the Database Logging Performance of the Snort Network Intrusion Detection Sensor
-0- Improving the Database Logging Performance of the Snort Network Intrusion Detection Sensor Lambert Schaelicke, Matthew R. Geiger, Curt J. Freeland Department of Computer Science and Engineering University
More informationDesign and Implementation of A P2P Cooperative Proxy Cache System
Design and Implementation of A PP Cooperative Proxy Cache System James Z. Wang Vipul Bhulawala Department of Computer Science Clemson University, Box 40974 Clemson, SC 94-0974, USA +1-84--778 {jzwang,
More informationRED behavior with different packet sizes
RED behavior with different packet sizes Stefaan De Cnodder, Omar Elloumi *, Kenny Pauwels Traffic and Routing Technologies project Alcatel Corporate Research Center, Francis Wellesplein, 1-18 Antwerp,
More informationEvaluation Study of a Distributed Caching Based on Query Similarity in a P2P Network
Evaluation Study of a Distributed Caching Based on Query Similarity in a P2P Network Mouna Kacimi Max-Planck Institut fur Informatik 66123 Saarbrucken, Germany mkacimi@mpi-inf.mpg.de ABSTRACT Several caching
More informationNew Payload Attribution Methods for Network Forensic Investigations
New Payload Attribution Methods for Network Forensic Investigations MIROSLAV PONEC, PAUL GIURA, JOEL WEIN and HERVÉ BRÖNNIMANN Polytechnic Institute of NYU, Akamai Technologies Payload attribution can
More informationTOPO: A Topology-aware Single Packet Attack Traceback Scheme
TOPO: A Topology-aware Single Packet Attack Traceback Scheme Linfeng Zhang and Yong Guan Department of Electrical and Computer Engineering Iowa State University Ames, Iowa 5 {zhanglf, yguan}@iastate.edu
More informationOverview. Implementing Gigabit Routers with NetFPGA. Basic Architectural Components of an IP Router. Per-packet processing in an IP Router
Overview Implementing Gigabit Routers with NetFPGA Prof. Sasu Tarkoma The NetFPGA is a low-cost platform for teaching networking hardware and router design, and a tool for networking researchers. The NetFPGA
More informationAn Analysis of the Number of ICP Packets on the Distributed WWW Caching System
An Analysis of the Number of ICP Packets on the Distributed WWW Caching System Eiji Kawai, Ken-ichi Chinen, Suguru Yamaguchi and Hideki Sunahara Nara Institute of Science and Technology 8916-5 Takayama,
More informationInternet Protocol version 6
Internet Protocol version 6 Claudio Cicconetti International Master on Communication Networks Engineering 2006/2007 IP version 6 The Internet is growing extremely rapidly. The
More informationTHE CACHE REPLACEMENT POLICY AND ITS SIMULATION RESULTS
THE CACHE REPLACEMENT POLICY AND ITS SIMULATION RESULTS 1 ZHU QIANG, 2 SUN YUQIANG 1 Zhejiang University of Media and Communications, Hangzhou 310018, P.R. China 2 Changzhou University, Changzhou 213022,
More informationCS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007
CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 Question 344 Points 444 Points Score 1 10 10 2 10 10 3 20 20 4 20 10 5 20 20 6 20 10 7-20 Total: 100 100 Instructions: 1. Question
More informationContent-Oriented Routing and Its Integration
September 2011 Content-Oriented Routing and Its Integration with ih IP Infrastructure ETSI Future Network Technologies Workshop 26 September 2011 Sophia Antipolis, France Hang Liu Joint work with Xavier
More informationLockless Hash Tables with Low False Negatives
Lockless Hash Tables with Low False Negatives J. Ros-Giralt, A. Commike, R. Rotsted, P. Clancy, A. Johnson, R. Lethin Reservoir Labs New York, NY, US {giralt, commike, rotsted, clancy, johnson, lethin}@reservoir.com
More informationEstimating Persistent Spread in High-speed Networks Qingjun Xiao, Yan Qiao, Zhen Mo, Shigang Chen
Estimating Persistent Spread in High-speed Networks Qingjun Xiao, Yan Qiao, Zhen Mo, Shigang Chen Southeast University of China University of Florida Motivation for Persistent Stealthy Spreaders Imagine
More informationIPT Framework: A Technical & Administrative Approach for IP Packets Traceback and Identifying Cyber Criminals
IPT Framework: A Technical & Administrative Approach for IP Packets Traceback and Identifying Cyber Criminals Abolfazl Amirkhan MSc student, Information Technology Management Payame Noor University Tehran
More informationPERG-Rx: An FPGA-based Pattern-Matching Engine with Limited Regular Expression Support for Large Pattern Database. Johnny Ho
PERG-Rx: An FPGA-based Pattern-Matching Engine with Limited Regular Expression Support for Large Pattern Database Johnny Ho Supervisor: Guy Lemieux Date: September 11, 2009 University of British Columbia
More information