INFOCOM 2011 - PDF Preprint Papers

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

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed INFOCOM-2011 Paper

click to vote

INFOCOM
2011
IEEE

783views Communications» more INFOCOM 2011»

Secure and practical outsourcing of linear programming in cloud computing

13 years 4 months ago

Download www.sundaychennai.com

—Cloud Computing has great potential of providing robust computational power to the society at reduced cost. It enables customers with limited computational resources to outsourc...

Cong Wang, Kui Ren, Jia Wang

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	783	Secure and practical outsourcing of linear programming in cloud computing	claim
2	414	Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection	claim
3	323	A high-throughput routing metric for reliable multicast in multi-rate wireless mesh networks	claim
4	310	A distributed triangulation algorithm for wireless sensor networks on 2D and 3D surface	claim
5	301	Scheduling in mapreduce-like systems for fast completion time	claim
6	299	A first look at inter-data center traffic characteristics via Yahoo! datasets	claim
7	279	Opportunistic spectrum access for mobile cognitive radios	claim
8	272	Consolidating virtual machines with dynamic bandwidth demand in data centers	claim
9	271	Estimating the performance of hypothetical cloud service deployments: A measurement-based approach	claim
10	270	iLight: Indoor device-free passive tracking using wireless sensor networks	claim
11	270	An analytical approach to real-time misbehavior detection in IEEE 802.11 based wireless networks	claim
12	270	Pricing-based spectrum access control in cognitive radio networks with random access	claim
13	266	Throughput and delay analysis of hybrid wireless networks with multi-hop uplinks	claim
14	264	Secure friend discovery in mobile social networks	claim
15	264	Adaptive algorithms for detecting community structure in dynamic social networks	claim
16	261	Aggregation capacity of wireless sensor networks: Extended network case	claim
17	261	Bayesian-inference based recommendation in online social networks	claim
18	260	Understanding robustness of mobile networks through temporal network measures	claim
19	257	Converge-cast with MIMO	claim
20	248	Adaptive wireless channel probing for shared key generation	claim
21	246	Consort: Node-Constrained Opportunistic Routing in wireless mesh networks	claim
22	245	Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs	claim
23	244	Scalable and fully distributed localization with mere connectivity	claim
24	244	On adaptive-width channel allocation in non-cooperative, multi-radio wireless networks	claim
25	243	Optimizing network-coded cooperative communications via joint session grouping and relay node selection	claim
26	242	Space-time tradeoff in regular expression matching with semi-deterministic finite automata	claim
27	242	SelectCast: Scalable data aggregation scheme in wireless sensor networks	claim
28	242	Novasky: Cinematic-quality VoD in a P2P storage cloud	claim
29	241	QoF: Towards comprehensive path quality measurement in wireless sensor networks	claim
30	239	STAP: A social-tier-assisted packet forwarding protocol for achieving receiver-location privacy preservation in VANETs	claim
31	239	Optimal channel assignment and power allocation for dual-hop multi-channel multi-user relaying	claim
32	239	Does wireless sensor network scale? A measurement study on GreenOrbs	claim
33	234	Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd	claim
34	233	Dynamic right-sizing for power-proportional data centers	claim
35	231	Spherical representation and polyhedron routing for load balancing in wireless sensor networks	claim
36	229	A distributed and privacy preserving algorithm for identifying information hubs in social networks	claim
37	228	WiZi-Cloud: Application-transparent dual ZigBee-WiFi radios for low power internet access	claim
38	227	Forwarding anomalies in Bloom filter-based multicast	claim
39	225	A robust optimization approach to backup network design with random failures	claim
40	224	Networking low-power energy harvesting devices: Measurements and algorithms	claim
41	224	SigSag: Iterative detection through soft message-passing	claim
42	224	Reconciling privacy preservation and intrusion detection in sensory data aggregation	claim
43	224	Ubiquitous data collection for mobile users in wireless sensor networks	claim
44	223	Content management in a mobile ad hoc network: Beyond opportunistic strategy	claim
45	222	A dynamic relay selection scheme for mobile users in wireless relay networks	claim
46	220	Contrabass: Concurrent transmissions without coordination for ad hoc networks	claim
47	220	Optimal Sybil-resilient node admission control	claim
48	220	Channel allocation in wireless data center networks	claim
49	220	Prevalence and mitigation of forum spamming	claim
50	219	Smart sleep: Sleep more to reduce delay in duty-cycled wireless sensor networks	claim
51	219	Timely data delivery in a realistic bus network	claim
52	218	BodyT2: Throughput and time delay performance assurance for heterogeneous BSNs	claim
53	218	Clustering in cooperative networks	claim
54	215	Fine-grained location-free planarization in wireless sensor networks	claim
55	215	Capacity of byzantine agreement with finite link capacity	claim
56	213	Risk sensitive optimal control framework applied to delay tolerant networks	claim
57	211	Feasibility and optimization of delay guarantees for non-homogeneous flows in IEEE 802.11 WLANs	claim
58	210	Sensor localization with deterministic accuracy guarantee	claim
59	209	Delay constrained minimum energy broadcast in cooperative wireless networks	claim
60	209	Modeling residual-geometric flow sampling	claim
61	208	Identifying mobiles hiding behind wireless routers	claim
62	208	Finite-horizon energy allocation and routing scheme in rechargeable sensor networks	claim
63	207	On the achievable throughput of CSMA under imperfect carrier sensing	claim
64	207	Content downloading in vehicular networks: What really matters	claim
65	206	Sharing multiple messages over mobile networks	claim
66	206	The resilience of WDM networks to probabilistic geographical failures	claim
67	206	Strategyproof auctions for balancing social welfare and fairness in secondary spectrum markets	claim
68	205	Approximate distance queries and compact routing in sparse graphs	claim
69	205	A cross-domain privacy-preserving protocol for cooperative firewall optimization	claim
70	204	On power and throughput tradeoffs of WiFi and Bluetooth in smartphones	claim
71	204	General capacity scaling of wireless networks	claim
72	201	Delay-bounded MAC with minimal idle listening for sensor networks	claim
73	201	Physical layer wireless security made fast and channel independent	claim
74	200	Continuous multi-dimensional top-k query processing in sensor networks	claim
75	200	SocialFilter: Introducing social trust to collaborative spam mitigation	claim
76	199	Connected coverage in wireless networks with directional antennas	claim
77	197	Throughput and delay scaling of general cognitive networks	claim
78	196	Fast and scalable secret key generation exploiting channel phase randomness in wireless networks	claim
79	196	A prior-free revenue maximizing auction for secondary spectrum access	claim
80	195	Taming user-generated content in mobile networks via Drop Zones	claim
81	194	Approximation algorithms for throughput maximization in wireless networks with delay constraints	claim
82	192	Construction of directional virtual backbones with minimum routing cost in wireless networks	claim
83	192	The digital rights management game in peer-to-peer streaming systems	claim
84	191	Experimental evaluation of optimal CSMA	claim
85	190	Optimal multiple-coverage of sensor networks	claim
86	190	Connectivity maintenance in mobile wireless networks via constrained mobility	claim
87	190	Optimal power control in Rayleigh-fading heterogeneous networks	claim
88	189	A dynamic game solution to malware attack	claim
89	189	Making sense of customer tickets in cellular networks	claim
90	188	Optimal control of epidemic evolution	claim
91	188	User-centric data dissemination in disruption tolerant networks	claim
92	188	Optimal multicast capacity and delay tradeoffs in MANETs: A global perspective	claim
93	187	Multiple task scheduling for low-duty-cycled wireless sensor networks	claim
94	186	Privacy analysis of user association logs in a large-scale wireless LAN	claim
95	186	Implications of device diversity for organic localization	claim
96	186	Identity-based attack detection in mobile wireless networks	claim
97	186	Information propagation speed in bidirectional vehicular delay tolerant networks	claim
98	185	Transport throughput of secondary networks in spectrum sharing systems	claim
99	185	Maintaining source privacy under eavesdropping and node compromise attacks	claim
100	184	Network-aware behavior clustering of Internet end hosts	claim
101	183	VIRO: A scalable, robust and namespace independent virtual Id routing for future networks	claim
102	183	Optimized asynchronous multi-channel neighbor discovery	claim
103	182	Optimal sampling algorithms for frequency estimation in distributed data	claim
104	182	Multi-path routing and rate allocation for multi-source video on-demand streaming in wireless mesh networks	claim
105	181	On the throughput scaling of Cognitive Radio ad hoc networks	claim
106	180	PVA in VANETs: Stopped cars are not silent	claim
107	180	A highly scalable bandwidth estimation of commercial hotspot access points	claim
108	176	To preempt or not: Tackling bid and time-based cheating in online spectrum auctions	claim
109	176	RelSamp: Preserving application structure in sampled flow measurements	claim
110	175	A nearly-optimal index rule for scheduling of users with abandonment	claim
111	173	Resource management for fading wireless channels with energy harvesting nodes	claim
112	173	Describing and forecasting video access patterns	claim
113	169	There's something about MRAI: Timing diversity can exponentially worsen BGP convergence	claim
114	167	Analysis and algorithms for partial protection in mesh networks	claim
115	167	SMALL: A Strategy-proof Mechanism for radio spectrum allocation	claim
116	166	A real-time multicast routing scheme for multi-hop switched fieldbuses	claim
117	165	Distinguishing locations across perimeters using wireless link measurements	claim
118	165	A comparative study of two network-based anomaly detection methods	claim
119	164	Scheduling for small delay in multi-rate multi-channel wireless networks	claim
120	163	Incentive provision using intervention	claim
121	159	Hidden communication in P2P networks Steganographic handshake and broadcast	claim
122	158	Heterogeneity increases multicast capacity in clustered network	claim
123	153	Scheduling design and analysis for end-to-end heterogeneous flows in an avionics network	claim
124	152	Sampling vs sketching: An information theoretic comparison	claim
125	150	Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints	claim
126	150	Delay-bounded adaptive UFH-based anti-jamming wireless communication	claim
127	146	Utilizing shared vehicle trajectories for data forwarding in vehicular networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers