INFOCOM 2010 - PDF Preprint Papers

INFOCOM 2010 Annual Joint Conference of the IEEE Computer and Communications Societies

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2010 Paper

click to vote

INFOCOM
2010
IEEE

538views Communications» more INFOCOM 2010»

Fuzzy Keyword Search over Encrypted Data in Cloud Computing

13 years 11 months ago

Download www.ece.iit.edu

—As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have t...

Jin Li, Qian Wang, Cong Wang, Ning Cao, Kui Ren, W...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	538	Fuzzy Keyword Search over Encrypted Data in Cloud Computing	claim
2	438	The Impact of Virtualization on Network Performance of Amazon EC2 Data Center	claim
3	328	Multicast Scheduling with Cooperation and Network Coding in Cognitive Radio Networks	claim
4	320	PriSense: Privacy-Preserving Data Aggregation in People-Centric Urban Sensing Systems	claim
5	313	Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing	claim
6	307	P-Coding: Secure Network Coding against Eavesdropping Attacks	claim
7	294	Compressive Sensing Based Positioning Using RSS of WLAN Access Points	claim
8	284	CCACK: Efficient Network Coding Based Opportunistic Routing Through Cumulative Coded Acknowledgments	claim
9	279	Delay Performance of Scheduling with Data Aggregation in Wireless Sensor Networks	claim
10	275	MeasuRouting: A Framework for Routing Assisted Traffic Monitoring	claim
11	264	Malicious Hubs: Detecting Abnormally Malicious Autonomous Systems	claim
12	258	Resource Allocation in Multi-cell OFDMA-based Relay Networks	claim
13	258	A General Algorithm for Interference Alignment and Cancellation in Wireless Networks	claim
14	250	SafeQ: Secure and Efficient Query Processing in Sensor Networks	claim
15	249	Distributed Caching Algorithms for Content Distribution Networks	claim
16	242	VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones	claim
17	234	Adaptive Calibration for Fusion-based Wireless Sensor Networks	claim
18	230	Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization	claim
19	230	Effective Carrier Sensing in CSMA Networks under Cumulative Interference	claim
20	229	Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas	claim
21	222	Asymmetry-Aware Real-Time Distributed Joint Resource Allocation in IEEE 802.22 WRANs	claim
22	222	A Balanced Consistency Maintenance Protocol for Structured P2P Systems	claim
23	220	Cognitive Mobile Virtual Network Operator: Investment and Pricing with Supply Uncertainty	claim
24	220	Cooperative Bridges: Topology Control in Cooperative Wireless Ad Hoc Networks	claim
25	219	The Capacity of Heterogeneous Wireless Networks	claim
26	219	On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks	claim
27	218	Maximum Damage Malware Attack in Mobile Wireless Networks	claim
28	218	Understanding Sub-stream Scheduling in P2P Hybrid Live Streaming Systems	claim
29	216	SlideOR: Online Opportunistic Network Coding in Wireless Mesh Networks	claim
30	216	Delay Analysis for Cognitive Radio Networks with Random Access: A Fluid Queue View	claim
31	215	Analyzing Nonblocking Switching Networks using Linear Programming (Duality)	claim
32	214	Toward the Practical Use of Network Tomography for Internet Topology Discovery	claim
33	214	Malicious Shellcode Detection with Virtual Memory Snapshots	claim
34	214	Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks with Elastic and Inelastic Traffic	claim
35	213	Building Scalable Virtual Routers with Trie Braiding	claim
36	213	FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps	claim
37	211	Towards Reliable Scheduling Schemes for Long-lived Replaceable Sensor Networks	claim
38	211	Group Device Pairing based Secure Sensor Association and Key Management for Body Area Networks	claim
39	210	Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing	claim
40	207	Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints	claim
41	207	Opportunistic Spectrum Access with Multiple Users: Learning under Competition	claim
42	206	Near-Optimal Power Control in Wireless Networks: A Potential Game Approach	claim
43	205	Distributed Coordination with Deaf Neighbors: Efficient Medium Access for 60 GHz Mesh Networks	claim
44	204	Cooperative Boundary Detection for Spectrum Sensing Using Dedicated Wireless Sensor Networks	claim
45	204	Throughput, Delay, and Mobility in Wireless Ad Hoc Networks	claim
46	204	Randomized Differential DSSS: Jamming-Resistant Wireless Broadcast Communication	claim
47	204	Characterization of Non-Manipulable and Pareto Optimal Resource Allocation Strategies for Interference Coupled Wireless Systems	claim
48	203	Distributed Power Control for Cognitive User Access based on Primary Link Control Feedback	claim
49	202	An Optimal Key Distribution Scheme for Secure Multicast Group Communication	claim
50	201	Maximizing the Contact Opportunity for Vehicular Internet Access	claim
51	201	On Channel-Discontinuity-Constraint Routing in Wireless Networks	claim
52	201	An Axiomatic Theory of Fairness in Network Resource Allocation	claim
53	200	Exploiting Multiple-Antenna Diversity for Shared Secret Key Generation in Wireless Networks	claim
54	200	High Performance Dictionary-Based String Matching for Deep Packet Inspection	claim
55	200	Pricing under Constraints in Access Networks: Revenue Maximization and Congestion Management	claim
56	199	URCA: Pulling out Anomalies by their Root Causes	claim
57	198	CPMC: An Efficient Proximity Malware Coping Scheme in Smartphone-based Mobile Networks	claim
58	198	On the Aggregatability of Router Forwarding Tables	claim
59	197	Towards Mobile Phone Localization without War-Driving	claim
60	197	PeopleRank: Social Opportunistic Forwarding	claim
61	197	Efficient Continuous Scanning in RFID Systems	claim
62	195	Walking in Facebook: A Case Study of Unbiased Sampling of OSNs
63	195	Cooperative Resource Management in Cognitive WiMAX with Femto Cells	claim
64	195	On Computing Compression Trees for Data Collection in Wireless Sensor Networks	claim
65	195	On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks	claim
66	194	P2P Trading in Social Networks: The Value of Staying Connected	claim
67	194	Reliable Wireless Broadcasting with Near-Zero Feedback	claim
68	191	A Secondary Market for Spectrum	claim
69	191	Deploying Mesh Nodes under Non-Uniform Propagation	claim
70	191	On the Feasibility and Efficacy of Protection Routing in IP Networks	claim
71	190	Back-Pressure Routing for Intermittently Connected Networks	claim
72	190	Socially-Aware Network Design Games	claim
73	190	Wireless Network Virtualization as A Sequential Auction Game	claim
74	189	Delay-Based Network Utility Maximization	claim
75	189	Metrics for Evaluating Video Streaming Quality in Lossy IEEE 802.11 Wireless Networks	claim
76	189	CapAuth: A Capability-based Handover Scheme	claim
77	188	High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting	claim
78	187	MIMO-Aware Routing in Wireless Mesh Networks	claim
79	187	Buffer Management for Aggregated Streaming Data with Packet Dependencies	claim
80	186	Sybil Attacks Against Mobile Users: Friends and Foes to the Rescue	claim
81	186	Pressure Routing for Underwater Sensor Networks	claim
82	185	DAC: Distributed Asynchronous Cooperation for Wireless Relay Networks	claim
83	185	On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad-Hoc Networks	claim
84	185	Joint Random Access and Power Selection for Maximal Throughput in Wireless Networks	claim
85	185	Joint Power and Secret Key Queue Management for Delay Limited Secure Communication	claim
86	184	Castor: Scalable Secure Routing for Ad Hoc Networks	claim
87	184	Measurement and Diagnosis of Address Misconfigured P2P Traffic	claim
88	183	MobiCent: a Credit-Based Incentive System for Disruption Tolerant Network	claim
89	183	Chorus: Collision Resolution for Efficient Wireless Broadcast	claim
90	182	Refresh: Weak Privacy Model for RFID Systems	claim
91	182	A Signal Processing View on Packet Sampling and Anomaly Detection	claim
92	182	Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces	claim
93	181	Distributed Algorithms for Approximating Wireless Network Capacity	claim
94	181	From Time Domain to Space Domain: Detecting Replica Attacks in Mobile Ad Hoc Networks	claim
95	181	ACR: Active Collision Recovery in Dense Wireless Sensor Networks	claim
96	180	Collaborative Measurements of Upload Speeds in P2P Systems	claim
97	180	Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling	claim
98	179	Approximate Capacity Subregions of Uniform Multihop Wireless Networks	claim
99	178	Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory	claim
100	177	Bayesian Inference for Localization in Cellular Networks	claim
101	177	Distributed Resource Allocation for Synchronous Fork and Join Processing Networks	claim
102	177	DPLC: Dynamic Packet Length Control in Wireless Sensor Networks	claim
103	177	Estimating Link Reliability in Wireless Networks: An Empirical Study and Interference Modeling	claim
104	177	Efficient Resource Allocation with Flexible Channel Cooperation in OFDMA Cognitive Radio Networks	claim
105	177	Multi-Round Sensor Deployment for Guaranteed Barrier Coverage	claim
106	176	MSET: A Mobility Satellite Emulation Testbed	claim
107	176	Neighbor Discovery with Reception Status Feedback to Transmitters	claim
108	176	BGP Churn Evolution: a Perspective from the Core	claim
109	176	Information Quality Aware Routing in Event-Driven Sensor Networks	claim
110	176	Compressive Oversampling for Robust Data Transmission in Sensor Networks	claim
111	176	Throughput and Delay Analysis on Uncoded and Coded Wireless Broadcast with Hard Deadline Constraints	claim
112	175	Approximate Models for General Cache Networks	claim
113	175	Layered Internet Video Engineering (LIVE): Network-Assisted Bandwidth Sharing and Transient Loss Protection for Scalable Video Streaming	claim
114	175	ISP-Enabled Behavioral Ad Targeting without Deep Packet Inspection	claim
115	175	On the Impact of Mobility on Multicast Capacity of Wireless Networks	claim
116	174	Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks	claim
117	173	Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments	claim
118	173	Reliable GPS-Free Double-Ruling-Based Information Brokerage in Wireless Sensor Networks	claim
119	173	Chameleon: Adaptive Peer-to-Peer Streaming with Network Coding	claim
120	173	Distance Estimation by Constructing The Virtual Ruler in Anisotropic Sensor Networks	claim
121	173	Coupled 802.11 Flows in Urban Channels: Model and Experimental Evaluation	claim
122	173	Scheduling Heterogeneous Real-Time Traffic over Fading Wireless Channels	claim
123	172	A Collaboration-based Autonomous Reputation System for Email Services	claim
124	172	Optimal Probing for Unicast Network Delay Tomography	claim
125	172	Retiring Replicants: Congestion Control for Intermittently-Connected Networks	claim
126	172	A Frequency Domain Model to Predict the Estimation Accuracy of Packet Sampling	claim
127	171	Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow	claim
128	171	Multihop Transmission Opportunity in Wireless Multihop Networks	claim
129	171	Optimal Activation and Transmission Control in Delay Tolerant Networks	claim
130	170	Enabling a Bufferless Core Network Using Edge-to-Edge Packet-Level FEC	claim
131	170	Assessing the VANET's Local Information Storage Capability under Different Traffic Mobility	claim
132	170	Scalable Modulation for Scalable Wireless Videocast	claim
133	170	Joint Energy Management and Resource Allocation in Rechargeable Sensor Networks	claim
134	170	BitTorrent Darknets	claim
135	170	A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels	claim
136	170	Multipath Wireless Network Coding: A Population Game Perspective	claim
137	169	Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model	claim
138	169	Linear Programming Models For Multi-Channel P2P Streaming Systems	claim
139	169	CoTrack: A Framework for Tracking Dynamic Features with Static and Mobile Sensors	claim
140	169	Stimulating Cooperation in Multi-hop Wireless Networks Using Cheating Detection System	claim
141	169	Minimizing Electricity Cost: Optimization of Distributed Internet Data Centers in a Multi-Electricity-Market Environment	claim
142	169	Haste: Practical Online Network Coding in a Multicast Switch	claim
143	169	MIS: Malicious Nodes Identification Scheme in Network-Coding-Based Peer-to-Peer Streaming	claim
144	168	Improving QoS in BitTorrent-like VoD Systems	claim
145	168	SparseTrack: Enhancing Indoor Pedestrian Tracking with Sparse Infrastructure Support	claim
146	168	Routing for Energy Minimization in the Speed Scaling Model	claim
147	168	Distributed Dynamic Speed Scaling	claim
148	167	Asymptotic Analysis of Precoded Small Cell Networks	claim
149	167	DiffProbe: Detecting ISP Service Discrimination	claim
150	166	Throughput Analysis of Multiple Access Relay Channel under Collision Model	claim
151	166	Pattern Mutation in Wireless Sensor Deployment	claim
152	166	Elastic Rate Limiting for Spatially Biased Wireless Mesh Networks	claim
153	166	Flow Control for Cost-Efficient Peer-to-Peer Streaming	claim
154	165	How do Superpeer Networks Emerge?	claim
155	165	Network Coding for Multi-Resolution Multicast	claim
156	165	Incorporating Random Linear Network Coding for Peer-to-Peer Network Diagnosis	claim
157	165	Safeguarding Data Delivery by Decoupling Path Propagation and Adoption	claim
158	165	Price of Anarchy in Non-Cooperative Load Balancing	claim
159	165	A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping	claim
160	165	Counting RFID Tags Efficiently and Anonymously	claim
161	165	Network Reliability With Geographically Correlated Failures	claim
162	165	Robust and Fast Pattern Matching for Intrusion Detection	claim
163	164	Cross-layer Optimization for Wireless Networks with Deterministic Channel Models	claim
164	164	Distributed Monitoring and Aggregation in Wireless Sensor Networks	claim
165	164	Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System	claim
166	164	Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space	claim
167	164	Optimal Control of Constrained Cognitive Radio Networks with Dynamic Population Size	claim
168	163	Design and Analysis of a Robust Pipelined Memory System	claim
169	163	On the Age of Pseudonyms in Mobile Ad Hoc Networks	claim
170	163	Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks	claim
171	163	Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams	claim
172	163	Surfing the Blogosphere: Optimal Personalized Strategies for Searching the Web	claim
173	162	Frequency-Domain Packet Scheduling for 3GPP LTE Uplink	claim
174	162	Mobile Real-Time Group Communication Service	claim
175	162	Critical Sensor Density for Partial Connectivity in Large Area Wireless Sensor Networks	claim
176	162	Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks	claim
177	161	A Self-Organized Mechanism for Thwarting Malicious Access in Ad Hoc Networks	claim
178	161	Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks	claim
179	161	Extending Access Point Connectivity through Opportunistic Routing in Vehicular Networks	claim
180	161	Understanding Node Localizability of Wireless Ad-hoc Networks	claim
181	160	RIPPLE Authentication for Network Coding	claim
182	159	Deterministic Broadcast on Multiple Access Channels	claim
183	159	An Attack-Defense Game Theoretic Analysis of Multi-Band Wireless Covert Timing Networks	claim
184	159	Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks	claim
185	158	When Watchdog Meets Coding	claim
186	158	A Framework for Joint Network Coding and Transmission Rate Control in Wireless Networks	claim
187	158	Towards a Theory of Anonymous Networking	claim
188	158	Efficient Similarity Estimation for Systems Exploiting Data Redundancy	claim
189	157	Bargaining and Price-of-Anarchy in Repeated Inter-Session Network Coding Games	claim
190	157	Wormhole-Resilient Secure Neighbor Discovery in Underwater Acoustic Networks	claim
191	157	First-Fit Scheduling for Beaconing in Multihop Wireless Networks	claim
192	157	Reliable Adaptive Multipath Provisioning with Bandwidth and Differential Delay Constraints	claim
193	157	Handling Triple Hidden Terminal Problems for Multi-Channel MAC in Long-Delay Underwater Sensor Networks	claim
194	156	UUSee: Large-Scale Operational On-Demand Streaming with Random Network Coding	claim
195	156	Pricing and Incentives in Peer-to-Peer Networks	claim
196	156	INPAC: An Enforceable Incentive Scheme for Wireless Networks using Network Coding	claim
197	156	Predicting Prefix Availability in the Internet	claim
198	155	A Systematic Approach for Evolving VLAN Designs	claim
199	155	Resource Allocation over Network Dynamics without Timescale Separation	claim
200	155	Capacity Region of a Wireless Mesh Backhaul Network over the CSMA/CA MAC	claim
201	155	Demand-Oblivious Routing: Distributed vs. Centralized Approaches	claim
202	155	HaND: Fast Handoff with Null Dwell Time for IEEE 802.11 Networks	claim
203	155	Dynamic Control of Coding in Delay Tolerant Networks	claim
204	154	Non-Preemptive Buffer Management for Latency Sensitive Packets	claim
205	154	Network Coding Tomography for Network Failures	claim
206	154	Stable Maximum Throughput Broadcast in Wireless Fading Channels	claim
207	154	Designing a Practical Access Point Association Protocol	claim
208	153	Convergence Speed of Binary Interval Consensus	claim
209	153	Energy-Conserving Scheduling in Multi-hop Wireless Networks with Time-Varying Channels	claim
210	152	Channel-based Unidirectional Stream Protocol (CUSP)	claim
211	152	Optimal SINR-based Random Access	claim
212	152	Reliability in Layered Networks with Random Link Failures	claim
213	151	Reliable Broadcasting in Random Networks and the Effect of Density	claim
214	151	Enhancing Wireless TCP: A Serialized-Timer Approach	claim
215	151	On Constructing Efficient Shared Decision Trees for Multiple Packet Filters	claim
216	151	Recognizing Exponential Inter-Contact Time in VANETs	claim
217	150	Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks	claim
218	149	Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing	claim
219	149	Markov Approximation for Combinatorial Network Optimization	claim
220	149	Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements	claim
221	148	Network Positioning from the Edge - An Empirical Study of the Effectiveness of Network Positioning in P2P Systems	claim
222	148	Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case	claim
223	148	Verifiable Fine-Grained Top-k Queries in Tiered Sensor Networks	claim
224	148	Sample Path Bounds for Long Memory FBM Traffic	claim
225	147	Making the Case for Random Access Scheduling in Wireless Multi-hop Networks	claim
226	147	Value-aware Resource Allocation for Service Guarantees in Networks	claim
227	147	Evaluating Potential Routing Diversity for Internet Failure Recovery	claim
228	146	Optimal Control of Wireless Networks with Finite Buffers	claim
229	145	TopBT: A Topology-Aware and Infrastructure-Independent BitTorrent Client	claim
230	145	Utility Maximization for Delay Constrained QoS in Wireless	claim
231	145	Universal Rigidity: Towards Accurate and Efficient Localization of Wireless Networks	claim
232	144	Netscope: Practical Network Loss Tomography	claim
233	144	Survivable Distributed Storage with Progressive Decoding	claim
234	144	Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks	claim
235	143	EmNet: Satisfying The Individual User Through Empathic Home Networks	claim
236	143	File Fragmentation over an Unreliable Channel	claim
237	143	Energy Efficient Algorithms for the RFID Estimation Problem	claim
238	143	Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network	claim
239	142	On the Viability of Paris Metro Pricing for Communication and Service Networks	claim
240	142	Mobile Sensor Deployment in Unknown Fields	claim
241	141	Password Strength: An Empirical Analysis	claim
242	141	Tracking Quantiles of Network Data Streams with Dynamic Operations	claim
243	141	Limitations and Possibilities of Path Trading between Autonomous Systems	claim
244	141	Topological Properties Affect the Power of Network Coding in Decentralized Broadcast	claim
245	141	Rate Adaptation Games in Wireless LANs: Nash Equilibrium and Price of Anarchy	claim
246	140	CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model	claim
247	139	Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics	claim
248	139	A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs	claim
249	138	Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles	claim
250	138	Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model	claim
251	137	Queuing Analysis in Multichannel Cognitive Spectrum Access: A Large Deviation Approach	claim
252	137	Overcoming Failures: Fault-tolerance and Logical Centralization in Clean-Slate Network Management	claim
253	136	Spatio-Temporal Fusion for Small-scale Primary Detection in Cognitive Radio Networks	claim
254	136	Transition from Heavy to Light Tails in Retransmission Durations	claim
255	136	Worst-Case TCAM Rule Expansion	claim
256	136	Efficient Tag Identification in Mobile RFID Systems	claim
257	135	Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes	claim
258	135	On the Fundamental Limits of Broadcasting in Wireless Mobile Networks	claim
259	132	Scalable NIDS via Negative Pattern Matching and Exclusive Pattern Matching	claim
260	132	A Theoretical Framework for Hierarchical Routing Games	claim
261	132	Routing in Socially Selfish Delay Tolerant Networks	claim
262	130	Low-complexity Scheduling Algorithms for Multi-channel Downlink Wireless Networks	claim
263	129	On Scheduling for Minimizing End-to-End Buffer Usage over Multihop Wireless Networks	claim
264	129	Link Homophily in the Application Layer and its Usage in Traffic Classification	claim
265	129	On Global Modeling of Backbone Network Traffic	claim
266	128	Discrete Gene Regulatory Networks (dGRNs): A Novel Approach to Configuring Sensor Networks	claim
267	126	On Providing Non-uniform Scheduling Guarantees in a Wireless Network	claim
268	126	Measuring Availability in the Domain Name System	claim
269	123	Tracking Long Duration Flows in Network Traffic	claim
270	122	Optimal Channel Choice for Collaborative Ad-Hoc Dissemination	claim
271	122	Practical Scheduling Algorithms for Concurrent Transmissions in Rate-adaptive Wireless Networks	claim
272	120	Predictive Blacklisting as an Implicit Recommendation System	claim
273	115	PhishNet: Predictive Blacklisting to Detect Phishing Attacks	claim
274	115	Twister Networks and Their Applications to Load-Balanced Switches	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers