ºÝºÝߣshows by User: ZhenyunZhuang / http://www.slideshare.net/images/logo.gif ºÝºÝߣshows by User: ZhenyunZhuang / Sat, 07 May 2016 18:28:22 GMT ºÝºÝߣShare feed for ºÝºÝߣshows by User: ZhenyunZhuang Designing SSD-friendly Applications for Better Application Performance and Higher IO Efficiency /slideshow/designing-ssdfriendly-applications-for-better-application-performance-and-higher-io-efficiency/61777082 2016-160507182823
COMPSAC 2016]]>
COMPSAC 2016]]> Sat, 07 May 2016 18:28:22 GMT /slideshow/designing-ssdfriendly-applications-for-better-application-performance-and-higher-io-efficiency/61777082 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Designing SSD-friendly Applications for Better Application Performance and Higher IO Efficiency ZhenyunZhuang COMPSAC 2016 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2016-160507182823-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> COMPSAC 2016
Designing SSD-friendly Applications for Better Application Performance and Higher IO Efficiency from Zhenyun Zhuang
]]> 557 7 https://cdn.slidesharecdn.com/ss_thumbnails/2016-160507182823-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Optimized Selection of Streaming Servers with GeoDNS for CDN Delivered Live Streaming /slideshow/optimized-selection-of-streaming-servers-with-geodns-for-cdn-delivered-live-streaming/61776976 2014-160507182059
Journal of Internet Technology 2014]]>
Journal of Internet Technology 2014]]> Sat, 07 May 2016 18:20:59 GMT /slideshow/optimized-selection-of-streaming-servers-with-geodns-for-cdn-delivered-live-streaming/61776976 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Optimized Selection of Streaming Servers with GeoDNS for CDN Delivered Live Streaming ZhenyunZhuang Journal of Internet Technology 2014 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2014-160507182059-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Journal of Internet Technology 2014
Optimized Selection of Streaming Servers with GeoDNS for CDN Delivered Live Streaming from Zhenyun Zhuang
]]> 412 4 https://cdn.slidesharecdn.com/ss_thumbnails/2014-160507182059-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 OCPA: An Algorithm for Fast and Effective Virtual Machine Placement and Assignment in Large Scale Cloud Environments /slideshow/ocpa-an-algorithm-for-fast-and-effective-virtual-machine-placement-and-assignment-in-large-scale-cloud-environments/61776952 2011-160507181917
CloudCom-Asia 2013]]>
CloudCom-Asia 2013]]> Sat, 07 May 2016 18:19:17 GMT /slideshow/ocpa-an-algorithm-for-fast-and-effective-virtual-machine-placement-and-assignment-in-large-scale-cloud-environments/61776952 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) OCPA: An Algorithm for Fast and Effective Virtual Machine Placement and Assignment in Large Scale Cloud Environments ZhenyunZhuang CloudCom-Asia 2013 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2011-160507181917-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> CloudCom-Asia 2013
OCPA: An Algorithm for Fast and Effective Virtual Machine Placement and Assignment in Large Scale Cloud Environments from Zhenyun Zhuang
]]> 141 7 https://cdn.slidesharecdn.com/ss_thumbnails/2011-160507181917-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Optimizing CDN Infrastructure for Live Streaming with Constrained Server Chaining /slideshow/optimizing-cdn-infrastructure-for-live-streaming-with-constrained-server-chaining/61776942 2011-160507181836
ISPA 2011]]>
ISPA 2011]]> Sat, 07 May 2016 18:18:36 GMT /slideshow/optimizing-cdn-infrastructure-for-live-streaming-with-constrained-server-chaining/61776942 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Optimizing CDN Infrastructure for Live Streaming with Constrained Server Chaining ZhenyunZhuang ISPA 2011 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2011-160507181836-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> ISPA 2011
Optimizing CDN Infrastructure for Live Streaming with Constrained Server Chaining from Zhenyun Zhuang
]]> 303 5 https://cdn.slidesharecdn.com/ss_thumbnails/2011-160507181836-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Application-Aware Acceleration for Wireless Data Networks: Design Elements and Prototype Implementation /slideshow/applicationaware-acceleration-for-wireless-data-networks-design-elements-and-prototype-implementation/61776821 2009-160507180933
IEEE Transactions on Mobile Computing (ToMC 2009) http://dl.acm.org/citation.cfm?id=1592332]]>
IEEE Transactions on Mobile Computing (ToMC 2009) http://dl.acm.org/citation.cfm?id=1592332]]> Sat, 07 May 2016 18:09:33 GMT /slideshow/applicationaware-acceleration-for-wireless-data-networks-design-elements-and-prototype-implementation/61776821 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Application-Aware Acceleration for Wireless Data Networks: Design Elements and Prototype Implementation ZhenyunZhuang IEEE Transactions on Mobile Computing (ToMC 2009) http://dl.acm.org/citation.cfm?id=1592332 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2009-160507180933-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> IEEE Transactions on Mobile Computing (ToMC 2009) http://dl.acm.org/citation.cfm?id=1592332
Application-Aware Acceleration for Wireless Data Networks: Design Elements and Prototype Implementation from Zhenyun Zhuang
]]> 244 6 https://cdn.slidesharecdn.com/ss_thumbnails/2009-160507180933-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 PAIDS: A Proximity-Assisted Intrusion Detection System for Unidentified Worms /slideshow/paids-a-proximityassisted-intrusion-detection-system-for-unidentified-worms/61776800 2009-160507180752
COMPSAC 2009 http://dl.acm.org/citation.cfm?id=1633030]]>
COMPSAC 2009 http://dl.acm.org/citation.cfm?id=1633030]]> Sat, 07 May 2016 18:07:52 GMT /slideshow/paids-a-proximityassisted-intrusion-detection-system-for-unidentified-worms/61776800 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) PAIDS: A Proximity-Assisted Intrusion Detection System for Unidentified Worms ZhenyunZhuang COMPSAC 2009 http://dl.acm.org/citation.cfm?id=1633030 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2009-160507180752-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> COMPSAC 2009 http://dl.acm.org/citation.cfm?id=1633030
PAIDS: A Proximity-Assisted Intrusion Detection System for Unidentified Worms from Zhenyun Zhuang
]]> 157 4 https://cdn.slidesharecdn.com/ss_thumbnails/2009-160507180752-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 On the Impact of Mobile Hosts in Peer-to-Peer Data Networks /slideshow/on-the-impact-of-mobile-hosts-in-peertopeer-data-networks/61776783 2008-160507180647
ICDCS 2008]]>
ICDCS 2008]]> Sat, 07 May 2016 18:06:47 GMT /slideshow/on-the-impact-of-mobile-hosts-in-peertopeer-data-networks/61776783 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) On the Impact of Mobile Hosts in Peer-to-Peer Data Networks ZhenyunZhuang ICDCS 2008 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2008-160507180647-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> ICDCS 2008
On the Impact of Mobile Hosts in Peer-to-Peer Data Networks from Zhenyun Zhuang
]]> 249 5 https://cdn.slidesharecdn.com/ss_thumbnails/2008-160507180647-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 WebAccel: Accelerating Web access for low-bandwidth hosts /slideshow/webaccel-accelerating-web-access-for-lowbandwidth-hosts/61776766 2008-160507180543
Computer Networks 2008 http://dl.acm.org/citation.cfm?id=1384027]]>
Computer Networks 2008 http://dl.acm.org/citation.cfm?id=1384027]]> Sat, 07 May 2016 18:05:43 GMT /slideshow/webaccel-accelerating-web-access-for-lowbandwidth-hosts/61776766 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) WebAccel: Accelerating Web access for low-bandwidth hosts ZhenyunZhuang Computer Networks 2008 http://dl.acm.org/citation.cfm?id=1384027 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2008-160507180543-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Computer Networks 2008 http://dl.acm.org/citation.cfm?id=1384027
WebAccel: Accelerating Web access for low-bandwidth hosts from Zhenyun Zhuang
]]> 329 8 https://cdn.slidesharecdn.com/ss_thumbnails/2008-160507180543-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Client-side web acceleration for low-bandwidth hosts /slideshow/clientside-web-acceleration-for-lowbandwidth-hosts/61776745 2007-160507180414
2007 BROADNETS]]>
2007 BROADNETS]]> Sat, 07 May 2016 18:04:14 GMT /slideshow/clientside-web-acceleration-for-lowbandwidth-hosts/61776745 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Client-side web acceleration for low-bandwidth hosts ZhenyunZhuang 2007 BROADNETS <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2007-160507180414-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> 2007 BROADNETS
Client-side web acceleration for low-bandwidth hosts from Zhenyun Zhuang
]]> 303 6 https://cdn.slidesharecdn.com/ss_thumbnails/2007-160507180414-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 A3: application-aware acceleration for wireless data networks /slideshow/a3-applicationaware-acceleration-for-wireless-data-networks/61776720 2006-160507180253
ACM MOBICOM 2006]]>
ACM MOBICOM 2006]]> Sat, 07 May 2016 18:02:52 GMT /slideshow/a3-applicationaware-acceleration-for-wireless-data-networks/61776720 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) A3: application-aware acceleration for wireless data networks ZhenyunZhuang ACM MOBICOM 2006 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2006-160507180253-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> ACM MOBICOM 2006
A3: application-aware acceleration for wireless data networks from Zhenyun Zhuang
]]> 294 5 https://cdn.slidesharecdn.com/ss_thumbnails/2006-160507180253-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Mutual Exclusion in Wireless Sensor and Actor Networks /slideshow/mutual-exclusion-in-wireless-sensor-and-actor-networks/61776707 2006-160507180146
SECON 2006]]>
SECON 2006]]> Sat, 07 May 2016 18:01:45 GMT /slideshow/mutual-exclusion-in-wireless-sensor-and-actor-networks/61776707 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Mutual Exclusion in Wireless Sensor and Actor Networks ZhenyunZhuang SECON 2006 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2006-160507180146-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> SECON 2006
Mutual Exclusion in Wireless Sensor and Actor Networks from Zhenyun Zhuang
]]> 300 5 https://cdn.slidesharecdn.com/ss_thumbnails/2006-160507180146-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Hazard avoidance in wireless sensor and actor networks /slideshow/hazard-avoidance-in-wireless-sensor-and-actor-networks/61776635 broadnets-160507175600
Computer Communications http://dl.acm.org/citation.cfm?id=1646735 ]]>
Computer Communications http://dl.acm.org/citation.cfm?id=1646735 ]]> Sat, 07 May 2016 17:56:00 GMT /slideshow/hazard-avoidance-in-wireless-sensor-and-actor-networks/61776635 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Hazard avoidance in wireless sensor and actor networks ZhenyunZhuang Computer Communications http://dl.acm.org/citation.cfm?id=1646735 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/broadnets-160507175600-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Computer Communications http://dl.acm.org/citation.cfm?id=1646735
Hazard avoidance in wireless sensor and actor networks from Zhenyun Zhuang
]]> 192 5 https://cdn.slidesharecdn.com/ss_thumbnails/broadnets-160507175600-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Dynamic Layer Management in Super-Peer Architectures /slideshow/dynamic-layer-management-in-superpeer-architectures/61776611 icpp-04-zhuang-160507175440
IEEE Transactions on Parallel and Distributed Systems (TPDS 2005)) http://dl.acm.org/citation.cfm?id=1092784]]>
IEEE Transactions on Parallel and Distributed Systems (TPDS 2005)) http://dl.acm.org/citation.cfm?id=1092784]]> Sat, 07 May 2016 17:54:40 GMT /slideshow/dynamic-layer-management-in-superpeer-architectures/61776611 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Dynamic Layer Management in Super-Peer Architectures ZhenyunZhuang IEEE Transactions on Parallel and Distributed Systems (TPDS 2005)) http://dl.acm.org/citation.cfm?id=1092784 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/icpp-04-zhuang-160507175440-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> IEEE Transactions on Parallel and Distributed Systems (TPDS 2005)) http://dl.acm.org/citation.cfm?id=1092784
Dynamic Layer Management in Super-Peer Architectures from Zhenyun Zhuang
]]> 352 4 https://cdn.slidesharecdn.com/ss_thumbnails/icpp-04-zhuang-160507175440-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 A Distributed Approach to Solving Overlay Mismatching Problem /slideshow/a-distributed-approach-to-solving-overlay-mismatching-problem/61776594 ace-yunhao-160507175326
ICDCS 2004 http://dl.acm.org/citation.cfm?id=977974 ]]>
ICDCS 2004 http://dl.acm.org/citation.cfm?id=977974 ]]> Sat, 07 May 2016 17:53:25 GMT /slideshow/a-distributed-approach-to-solving-overlay-mismatching-problem/61776594 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) A Distributed Approach to Solving Overlay Mismatching Problem ZhenyunZhuang ICDCS 2004 http://dl.acm.org/citation.cfm?id=977974 <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/ace-yunhao-160507175326-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> ICDCS 2004 http://dl.acm.org/citation.cfm?id=977974
A Distributed Approach to Solving Overlay Mismatching Problem from Zhenyun Zhuang
]]> 328 4 https://cdn.slidesharecdn.com/ss_thumbnails/ace-yunhao-160507175326-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks /slideshow/hybrid-periodical-flooding-in-unstructured-peertopeer-networks/61776562 icpp-2003-160507175032
ICPP 2003 Blind flooding is a popular search mechanism used current commercial P2P systems because of its simplicity. However, blind flooding among peers or super-peers causes large volume of unnecessary traffic although the response time is short. Some improved statistics-based search mechanisms can reduce the traffic volume but also significantly shrink the query coverage range. In some search mechanisms, not all peers may be reachable creating the so-called partial coverage problem. Aiming at alleviating the partial coverage problem and reducing the unnecessary traffic, we propose an efficient and adaptive search mechanism, Hybrid Periodical Flooding (HPF). HPF retains the advantages of statistics-based search mechanisms, alleviates the partial coverage problem, and provides the flexibility to adaptively adjust different parameters to meet different performance requirements. The effectiveness of HPF is demonstrated through simulation studies.]]>
ICPP 2003 Blind flooding is a popular search mechanism used current commercial P2P systems because of its simplicity. However, blind flooding among peers or super-peers causes large volume of unnecessary traffic although the response time is short. Some improved statistics-based search mechanisms can reduce the traffic volume but also significantly shrink the query coverage range. In some search mechanisms, not all peers may be reachable creating the so-called partial coverage problem. Aiming at alleviating the partial coverage problem and reducing the unnecessary traffic, we propose an efficient and adaptive search mechanism, Hybrid Periodical Flooding (HPF). HPF retains the advantages of statistics-based search mechanisms, alleviates the partial coverage problem, and provides the flexibility to adaptively adjust different parameters to meet different performance requirements. The effectiveness of HPF is demonstrated through simulation studies.]]> Sat, 07 May 2016 17:50:31 GMT /slideshow/hybrid-periodical-flooding-in-unstructured-peertopeer-networks/61776562 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks ZhenyunZhuang ICPP 2003 Blind flooding is a popular search mechanism used current commercial P2P systems because of its simplicity. However, blind flooding among peers or super-peers causes large volume of unnecessary traffic although the response time is short. Some improved statistics-based search mechanisms can reduce the traffic volume but also significantly shrink the query coverage range. In some search mechanisms, not all peers may be reachable creating the so-called partial coverage problem. Aiming at alleviating the partial coverage problem and reducing the unnecessary traffic, we propose an efficient and adaptive search mechanism, Hybrid Periodical Flooding (HPF). HPF retains the advantages of statistics-based search mechanisms, alleviates the partial coverage problem, and provides the flexibility to adaptively adjust different parameters to meet different performance requirements. The effectiveness of HPF is demonstrated through simulation studies. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/icpp-2003-160507175032-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> ICPP 2003 Blind flooding is a popular search mechanism used current commercial P2P systems because of its simplicity. However, blind flooding among peers or super-peers causes large volume of unnecessary traffic although the response time is short. Some improved statistics-based search mechanisms can reduce the traffic volume but also significantly shrink the query coverage range. In some search mechanisms, not all peers may be reachable creating the so-called partial coverage problem. Aiming at alleviating the partial coverage problem and reducing the unnecessary traffic, we propose an efficient and adaptive search mechanism, Hybrid Periodical Flooding (HPF). HPF retains the advantages of statistics-based search mechanisms, alleviates the partial coverage problem, and provides the flexibility to adaptively adjust different parameters to meet different performance requirements. The effectiveness of HPF is demonstrated through simulation studies.
Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks from Zhenyun Zhuang
]]> 280 5 https://cdn.slidesharecdn.com/ss_thumbnails/icpp-2003-160507175032-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 AOTO: Adaptive overlay topology optimization in unstructured P2P systems /slideshow/aoto-adaptive-overlay-topology-optimization-in-unstructured-p2p-systems/61776538 globecom-03-160507174840
IEEE GLOBECOM 2003 Peer-to-Peer (P2P) systems are self-organized and decentralized. However, the mechanism of a peer randomly joining and leaving a P2P network causes topology mismatch- ing between the P2P logical overlay network and the physical underlying network. The topology mismatching problem brings great stress on the Internet infrastructure and seriously limits the performance gain from various search or routing tech- niques. We propose the Adaptive Overlay Topology Optimiza- tion (AOTO) technique, an algorithm of building an overlay multicast tree among each source node and its direct logical neighbors so as to alleviate the mismatching problem by choos- ing closer nodes as logical neighbors, while providing a larger query coverage range. AOTO is scalable and completely dis- tributed in the sense that it does not require global knowledge of the whole overlay network when each node is optimizing the organization of its logical neighbors. The simulation shows that AOTO can effectively solve the mismatching problem and re- duce more than 55% of the traffic generated by the P2P system itself. ]]>
IEEE GLOBECOM 2003 Peer-to-Peer (P2P) systems are self-organized and decentralized. However, the mechanism of a peer randomly joining and leaving a P2P network causes topology mismatch- ing between the P2P logical overlay network and the physical underlying network. The topology mismatching problem brings great stress on the Internet infrastructure and seriously limits the performance gain from various search or routing tech- niques. We propose the Adaptive Overlay Topology Optimiza- tion (AOTO) technique, an algorithm of building an overlay multicast tree among each source node and its direct logical neighbors so as to alleviate the mismatching problem by choos- ing closer nodes as logical neighbors, while providing a larger query coverage range. AOTO is scalable and completely dis- tributed in the sense that it does not require global knowledge of the whole overlay network when each node is optimizing the organization of its logical neighbors. The simulation shows that AOTO can effectively solve the mismatching problem and re- duce more than 55% of the traffic generated by the P2P system itself. ]]> Sat, 07 May 2016 17:48:40 GMT /slideshow/aoto-adaptive-overlay-topology-optimization-in-unstructured-p2p-systems/61776538 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) AOTO: Adaptive overlay topology optimization in unstructured P2P systems ZhenyunZhuang IEEE GLOBECOM 2003 Peer-to-Peer (P2P) systems are self-organized and decentralized. However, the mechanism of a peer randomly joining and leaving a P2P network causes topology mismatch- ing between the P2P logical overlay network and the physical underlying network. The topology mismatching problem brings great stress on the Internet infrastructure and seriously limits the performance gain from various search or routing tech- niques. We propose the Adaptive Overlay Topology Optimiza- tion (AOTO) technique, an algorithm of building an overlay multicast tree among each source node and its direct logical neighbors so as to alleviate the mismatching problem by choos- ing closer nodes as logical neighbors, while providing a larger query coverage range. AOTO is scalable and completely dis- tributed in the sense that it does not require global knowledge of the whole overlay network when each node is optimizing the organization of its logical neighbors. The simulation shows that AOTO can effectively solve the mismatching problem and re- duce more than 55% of the traffic generated by the P2P system itself. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/globecom-03-160507174840-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> IEEE GLOBECOM 2003 Peer-to-Peer (P2P) systems are self-organized and decentralized. However, the mechanism of a peer randomly joining and leaving a P2P network causes topology mismatch- ing between the P2P logical overlay network and the physical underlying network. The topology mismatching problem brings great stress on the Internet infrastructure and seriously limits the performance gain from various search or routing tech- niques. We propose the Adaptive Overlay Topology Optimiza- tion (AOTO) technique, an algorithm of building an overlay multicast tree among each source node and its direct logical neighbors so as to alleviate the mismatching problem by choos- ing closer nodes as logical neighbors, while providing a larger query coverage range. AOTO is scalable and completely dis- tributed in the sense that it does not require global knowledge of the whole overlay network when each node is optimizing the organization of its logical neighbors. The simulation shows that AOTO can effectively solve the mismatching problem and re- duce more than 55% of the traffic generated by the P2P system itself.
AOTO: Adaptive overlay topology optimization in unstructured P2P systems from Zhenyun Zhuang
]]> 180 4 https://cdn.slidesharecdn.com/ss_thumbnails/globecom-03-160507174840-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Eliminating OS-caused Large JVM Pauses for Latency-sensitive Java-based Cloud Platforms /slideshow/eliminating-oscaused-large-jvm-pauses-for-latencysensitive-javabased-cloud-platforms/61631377 2016-160503160420
For PaaS-deployed (Platform as a Service) customer-facing applications (e.g., online gaming and online chatting), ensuring low latencies is not just a preferred feature, but a must-have feature. Given the popularity and powerful- ness of Java platforms, a significant portion of today’s PaaS platforms run Java. JVM (Java Virtual Machine) manages a heap space to hold application objects. The heap space can be frequently GC-ed (Garbage Collected), and applications can be occasionally stopped for long time during some GC and JVM activities. In this work, we investigated the JVM pause problem. We found out that there are some (and large) JVM STW pauses cannot be explained by application-level activities and JVM activities during GC; instead, they are caused by OS mechanisms. We successfully reproduced such problems and root-cause-ed the reasons. The findings can be used to enhance JVM implementation. We also proposed a set of solutions to mitigate and eliminate these large STW pauses. We share the knowledge and experiences in this writing. ]]>
For PaaS-deployed (Platform as a Service) customer-facing applications (e.g., online gaming and online chatting), ensuring low latencies is not just a preferred feature, but a must-have feature. Given the popularity and powerful- ness of Java platforms, a significant portion of today’s PaaS platforms run Java. JVM (Java Virtual Machine) manages a heap space to hold application objects. The heap space can be frequently GC-ed (Garbage Collected), and applications can be occasionally stopped for long time during some GC and JVM activities. In this work, we investigated the JVM pause problem. We found out that there are some (and large) JVM STW pauses cannot be explained by application-level activities and JVM activities during GC; instead, they are caused by OS mechanisms. We successfully reproduced such problems and root-cause-ed the reasons. The findings can be used to enhance JVM implementation. We also proposed a set of solutions to mitigate and eliminate these large STW pauses. We share the knowledge and experiences in this writing. ]]> Tue, 03 May 2016 16:04:20 GMT /slideshow/eliminating-oscaused-large-jvm-pauses-for-latencysensitive-javabased-cloud-platforms/61631377 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Eliminating OS-caused Large JVM Pauses for Latency-sensitive Java-based Cloud Platforms ZhenyunZhuang For PaaS-deployed (Platform as a Service) customer-facing applications (e.g., online gaming and online chatting), ensuring low latencies is not just a preferred feature, but a must-have feature. Given the popularity and powerful- ness of Java platforms, a significant portion of today’s PaaS platforms run Java. JVM (Java Virtual Machine) manages a heap space to hold application objects. The heap space can be frequently GC-ed (Garbage Collected), and applications can be occasionally stopped for long time during some GC and JVM activities. In this work, we investigated the JVM pause problem. We found out that there are some (and large) JVM STW pauses cannot be explained by application-level activities and JVM activities during GC; instead, they are caused by OS mechanisms. We successfully reproduced such problems and root-cause-ed the reasons. The findings can be used to enhance JVM implementation. We also proposed a set of solutions to mitigate and eliminate these large STW pauses. We share the knowledge and experiences in this writing. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2016-160503160420-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> For PaaS-deployed (Platform as a Service) customer-facing applications (e.g., online gaming and online chatting), ensuring low latencies is not just a preferred feature, but a must-have feature. Given the popularity and powerful- ness of Java platforms, a significant portion of today’s PaaS platforms run Java. JVM (Java Virtual Machine) manages a heap space to hold application objects. The heap space can be frequently GC-ed (Garbage Collected), and applications can be occasionally stopped for long time during some GC and JVM activities. In this work, we investigated the JVM pause problem. We found out that there are some (and large) JVM STW pauses cannot be explained by application-level activities and JVM activities during GC; instead, they are caused by OS mechanisms. We successfully reproduced such problems and root-cause-ed the reasons. The findings can be used to enhance JVM implementation. We also proposed a set of solutions to mitigate and eliminate these large STW pauses. We share the knowledge and experiences in this writing.
Eliminating OS-caused Large JVM Pauses for Latency-sensitive Java-based Cloud Platforms from Zhenyun Zhuang
]]> 584 4 https://cdn.slidesharecdn.com/ss_thumbnails/2016-160503160420-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Mobile Hosts Participating in Peer-to-Peer Data Networks: Challenges and Solutions /slideshow/mobile-hosts-participating-in-peertopeer-data-networks-challenges-and-solutions/61192483 2010-160421131940
Wireless Networks (2010) http://dl.acm.org/citation.cfm?id=1873504 Peer-to-peer (P2P) data networks dominate Internet traffic, accounting for over 60% of the overall traffic in a recent study. In this work, we study the problems that arise when mobile hosts participate in P2P networks. We primarily focus on the performance issues as experienced by the mobile host, but also study the impact on other fixed peers. Using BitTorrent as a key example, we identify several unique problems that arise due to the design aspects of P2P networks being incompatible with typical characteristics of wireless and mobile environments. Using the insights gained through our study, we present a wireless P2P (wP2P) client application that is backward compatible with existing fixed-peer client applications, but when used on mobile hosts can provide significant performance improvements.]]>
Wireless Networks (2010) http://dl.acm.org/citation.cfm?id=1873504 Peer-to-peer (P2P) data networks dominate Internet traffic, accounting for over 60% of the overall traffic in a recent study. In this work, we study the problems that arise when mobile hosts participate in P2P networks. We primarily focus on the performance issues as experienced by the mobile host, but also study the impact on other fixed peers. Using BitTorrent as a key example, we identify several unique problems that arise due to the design aspects of P2P networks being incompatible with typical characteristics of wireless and mobile environments. Using the insights gained through our study, we present a wireless P2P (wP2P) client application that is backward compatible with existing fixed-peer client applications, but when used on mobile hosts can provide significant performance improvements.]]> Thu, 21 Apr 2016 13:19:40 GMT /slideshow/mobile-hosts-participating-in-peertopeer-data-networks-challenges-and-solutions/61192483 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Mobile Hosts Participating in Peer-to-Peer Data Networks: Challenges and Solutions ZhenyunZhuang Wireless Networks (2010) http://dl.acm.org/citation.cfm?id=1873504 Peer-to-peer (P2P) data networks dominate Internet traffic, accounting for over 60% of the overall traffic in a recent study. In this work, we study the problems that arise when mobile hosts participate in P2P networks. We primarily focus on the performance issues as experienced by the mobile host, but also study the impact on other fixed peers. Using BitTorrent as a key example, we identify several unique problems that arise due to the design aspects of P2P networks being incompatible with typical characteristics of wireless and mobile environments. Using the insights gained through our study, we present a wireless P2P (wP2P) client application that is backward compatible with existing fixed-peer client applications, but when used on mobile hosts can provide significant performance improvements. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2010-160421131940-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Wireless Networks (2010) http://dl.acm.org/citation.cfm?id=1873504 Peer-to-peer (P2P) data networks dominate Internet traffic, accounting for over 60% of the overall traffic in a recent study. In this work, we study the problems that arise when mobile hosts participate in P2P networks. We primarily focus on the performance issues as experienced by the mobile host, but also study the impact on other fixed peers. Using BitTorrent as a key example, we identify several unique problems that arise due to the design aspects of P2P networks being incompatible with typical characteristics of wireless and mobile environments. Using the insights gained through our study, we present a wireless P2P (wP2P) client application that is backward compatible with existing fixed-peer client applications, but when used on mobile hosts can provide significant performance improvements.
Mobile Hosts Participating in Peer-to-Peer Data Networks: Challenges and Solutions from Zhenyun Zhuang
]]> 284 9 https://cdn.slidesharecdn.com/ss_thumbnails/2010-160421131940-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Enhancing Intrusion Detection System with Proximity Information /slideshow/enhancing-intrusion-detection-system-with-proximity-information/61192391 2010-160421131713
Journal International Journal of Security and Networks (2010) http://dl.acm.org/citation.cfm?id=1923774 The wide spread of worms poses serious challenges to today’s Internet. Various IDSes (Intrusion Detection Systems) have been proposed to identify or prevent such spread. These IDSes can be largely classified as signature-based or anomaly-based ones depending on what type of knowledge the system knows. Signature-based IDSes are unable to detect the outbreak of new and unidentified worms when the worms’ characteristic patterns are unknown. In addition, new worms are often sufficiently intelligent to hide their activities and evade anomaly detection. Moreover, modern worms tend to spread more quickly, and the outbreak period lasts in the order of hours or even minutes. Such characteristics render existing detection mechanisms less effective. In this work, we consider the drawbacks of current detection approaches and propose PAIDS, a proximity-assisted IDS approach for identifying the outbreak of unknown worms. PAIDS does not rely on signatures. Instead, it takes advantage of the proximity information of compromised hosts. PAIDS operates on an orthogonal dimension with existing IDS approaches and can thus work collaboratively with existing IDSes to achieve better performance. We test the effectiveness of PAIDS with trace-driven simulations and observe that PAIDS has a high detection rate and a low false positive rate. We]]>
Journal International Journal of Security and Networks (2010) http://dl.acm.org/citation.cfm?id=1923774 The wide spread of worms poses serious challenges to today’s Internet. Various IDSes (Intrusion Detection Systems) have been proposed to identify or prevent such spread. These IDSes can be largely classified as signature-based or anomaly-based ones depending on what type of knowledge the system knows. Signature-based IDSes are unable to detect the outbreak of new and unidentified worms when the worms’ characteristic patterns are unknown. In addition, new worms are often sufficiently intelligent to hide their activities and evade anomaly detection. Moreover, modern worms tend to spread more quickly, and the outbreak period lasts in the order of hours or even minutes. Such characteristics render existing detection mechanisms less effective. In this work, we consider the drawbacks of current detection approaches and propose PAIDS, a proximity-assisted IDS approach for identifying the outbreak of unknown worms. PAIDS does not rely on signatures. Instead, it takes advantage of the proximity information of compromised hosts. PAIDS operates on an orthogonal dimension with existing IDS approaches and can thus work collaboratively with existing IDSes to achieve better performance. We test the effectiveness of PAIDS with trace-driven simulations and observe that PAIDS has a high detection rate and a low false positive rate. We]]> Thu, 21 Apr 2016 13:17:13 GMT /slideshow/enhancing-intrusion-detection-system-with-proximity-information/61192391 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Enhancing Intrusion Detection System with Proximity Information ZhenyunZhuang Journal International Journal of Security and Networks (2010) http://dl.acm.org/citation.cfm?id=1923774 The wide spread of worms poses serious challenges to today’s Internet. Various IDSes (Intrusion Detection Systems) have been proposed to identify or prevent such spread. These IDSes can be largely classified as signature-based or anomaly-based ones depending on what type of knowledge the system knows. Signature-based IDSes are unable to detect the outbreak of new and unidentified worms when the worms’ characteristic patterns are unknown. In addition, new worms are often sufficiently intelligent to hide their activities and evade anomaly detection. Moreover, modern worms tend to spread more quickly, and the outbreak period lasts in the order of hours or even minutes. Such characteristics render existing detection mechanisms less effective. In this work, we consider the drawbacks of current detection approaches and propose PAIDS, a proximity-assisted IDS approach for identifying the outbreak of unknown worms. PAIDS does not rely on signatures. Instead, it takes advantage of the proximity information of compromised hosts. PAIDS operates on an orthogonal dimension with existing IDS approaches and can thus work collaboratively with existing IDSes to achieve better performance. We test the effectiveness of PAIDS with trace-driven simulations and observe that PAIDS has a high detection rate and a low false positive rate. We <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2010-160421131713-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Journal International Journal of Security and Networks (2010) http://dl.acm.org/citation.cfm?id=1923774 The wide spread of worms poses serious challenges to today’s Internet. Various IDSes (Intrusion Detection Systems) have been proposed to identify or prevent such spread. These IDSes can be largely classified as signature-based or anomaly-based ones depending on what type of knowledge the system knows. Signature-based IDSes are unable to detect the outbreak of new and unidentified worms when the worms’ characteristic patterns are unknown. In addition, new worms are often sufficiently intelligent to hide their activities and evade anomaly detection. Moreover, modern worms tend to spread more quickly, and the outbreak period lasts in the order of hours or even minutes. Such characteristics render existing detection mechanisms less effective. In this work, we consider the drawbacks of current detection approaches and propose PAIDS, a proximity-assisted IDS approach for identifying the outbreak of unknown worms. PAIDS does not rely on signatures. Instead, it takes advantage of the proximity information of compromised hosts. PAIDS operates on an orthogonal dimension with existing IDS approaches and can thus work collaboratively with existing IDSes to achieve better performance. We test the effectiveness of PAIDS with trace-driven simulations and observe that PAIDS has a high detection rate and a low false positive rate. We
Enhancing Intrusion Detection System with Proximity Information from Zhenyun Zhuang
]]> 404 6 https://cdn.slidesharecdn.com/ss_thumbnails/2010-160421131713-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Guarding Fast Data Delivery in Cloud: an Effective Approach to Isolating Performance Bottleneck During Slow Data Delivery /slideshow/guarding-fast-data-delivery-in-cloud-an-effective-approach-to-isolating-performance-bottleneck-during-slow-data-delivery/61192227 2015-160421131328
LNCS 2015 Cloud-based products heavily rely on the fast data delivery between data centers and remote users - when data delivery is slow, the products’ performance is crippled. When slow data delivery occurs, engineers need to investigate the issue and find the root cause. The investigation requires experience and time, as data delivery involves multiple playing parts including sender/receiver/network. To facilitate the investigations, we propose an algorithm to automatically identify the performance bottleneck. The algorithm aggregates information from multiple layers of data sender and receiver. It helps to automatically isolate the problem type by identifying which component of sender/receiver/network is the bottleneck. After isolation, successive efforts can be taken to root cause the exact problem. We also build a prototype to demonstrate the effectiveness of the algorithm.]]>
LNCS 2015 Cloud-based products heavily rely on the fast data delivery between data centers and remote users - when data delivery is slow, the products’ performance is crippled. When slow data delivery occurs, engineers need to investigate the issue and find the root cause. The investigation requires experience and time, as data delivery involves multiple playing parts including sender/receiver/network. To facilitate the investigations, we propose an algorithm to automatically identify the performance bottleneck. The algorithm aggregates information from multiple layers of data sender and receiver. It helps to automatically isolate the problem type by identifying which component of sender/receiver/network is the bottleneck. After isolation, successive efforts can be taken to root cause the exact problem. We also build a prototype to demonstrate the effectiveness of the algorithm.]]> Thu, 21 Apr 2016 13:13:28 GMT /slideshow/guarding-fast-data-delivery-in-cloud-an-effective-approach-to-isolating-performance-bottleneck-during-slow-data-delivery/61192227 ZhenyunZhuang@slideshare.net(ZhenyunZhuang) Guarding Fast Data Delivery in Cloud: an Effective Approach to Isolating Performance Bottleneck During Slow Data Delivery ZhenyunZhuang LNCS 2015 Cloud-based products heavily rely on the fast data delivery between data centers and remote users - when data delivery is slow, the products’ performance is crippled. When slow data delivery occurs, engineers need to investigate the issue and find the root cause. The investigation requires experience and time, as data delivery involves multiple playing parts including sender/receiver/network. To facilitate the investigations, we propose an algorithm to automatically identify the performance bottleneck. The algorithm aggregates information from multiple layers of data sender and receiver. It helps to automatically isolate the problem type by identifying which component of sender/receiver/network is the bottleneck. After isolation, successive efforts can be taken to root cause the exact problem. We also build a prototype to demonstrate the effectiveness of the algorithm. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/2015-160421131328-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> LNCS 2015 Cloud-based products heavily rely on the fast data delivery between data centers and remote users - when data delivery is slow, the products’ performance is crippled. When slow data delivery occurs, engineers need to investigate the issue and find the root cause. The investigation requires experience and time, as data delivery involves multiple playing parts including sender/receiver/network. To facilitate the investigations, we propose an algorithm to automatically identify the performance bottleneck. The algorithm aggregates information from multiple layers of data sender and receiver. It helps to automatically isolate the problem type by identifying which component of sender/receiver/network is the bottleneck. After isolation, successive efforts can be taken to root cause the exact problem. We also build a prototype to demonstrate the effectiveness of the algorithm.
Guarding Fast Data Delivery in Cloud: an Effective Approach to Isolating Performance Bottleneck During Slow Data Delivery from Zhenyun Zhuang
]]> 180 4 https://cdn.slidesharecdn.com/ss_thumbnails/2015-160421131328-thumbnail.jpg?width=120&height=120&fit=bounds document Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 https://cdn.slidesharecdn.com/profile-photo-ZhenyunZhuang-48x48.jpg?cb=1535559373 - Full stack performance engineering - Software development in Python and Java - Publications: https://sites.google.com/site/zhenyun/papers https://sites.google.com/site/zhenyun/papers https://cdn.slidesharecdn.com/ss_thumbnails/2016-160507182823-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/designing-ssdfriendly-applications-for-better-application-performance-and-higher-io-efficiency/61777082 Designing SSD-friendly... https://cdn.slidesharecdn.com/ss_thumbnails/2014-160507182059-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/optimized-selection-of-streaming-servers-with-geodns-for-cdn-delivered-live-streaming/61776976 Optimized Selection of... https://cdn.slidesharecdn.com/ss_thumbnails/2011-160507181917-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/ocpa-an-algorithm-for-fast-and-effective-virtual-machine-placement-and-assignment-in-large-scale-cloud-environments/61776952 OCPA: An Algorithm for...