Publications
Disclaimer :
These papers are made available as a means to ensure timely dissemination of scholarly and technical work
on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders,
notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not
be reposted without the explicit permission of the copyright holder.
2013
Cloud-based Computation Offloading for Mobile Devices: State of the Art, Challenges and Opportunities ,
Lei Jiao , Xiaoming Fu , Roy Friedman, Stefano Secci, Zbigniew Smoreda and Hannes Tschofenig , Future Network & Mobile Summit 2013, Lisbon, Portugal,
July 2013.
Optimizing Data Center Traffic of Online Social Networks ,
Lei Jiao , Jun Li , Xiaoming Fu , The 19th IEEE International Workshop on Local and Metropolitan Area Networks (LANMAN 2013), Brussels, Belgium,
Best Paper Award, April 2013.
Read abstract
With a huge number of users and a very large scale of data, an Online Social Network (OSN) service has to partition its data among multiple servers inside a data center. As data are often partitioned randomly, the response time in accessing the data is however unpredictable. Researchers have proposed social locality to address this concern: if a server hosts the master replica of a user's data, it must also host a replica (either master or slave) of every friend of this user, thus enabling convenient access of all of them on the same server. However, doing so comes with two overheads: the replication storage and the traffic of maintaining replica consistency. Existing work focuses on the former, but overlooks the latter that can consume considerable network resources. In this paper, we study social-locality-aware partitioning of the OSN data while meeting diverse performance goals of data center networks. We formulate the traffic optimization problem and propose a new traffic-aware data partitioning algorithm. Through the evaluations with a large-scale, real-world Twitter trace, we further show that, compared with state-of-the-art algorithms, our algorithm significantly reduces traffic without deteriorating the load balance among servers and causing extra replication storage.
jiao_lanman13.pdf [237.2 kB]
2012
Cost Optimization for Online Social Networks on Geo-Distributed Clouds ,
Lei Jiao , Jun Li , Tianyin Xu and Xiaoming Fu , the 20th IEEE International Conference on Network Protocols (ICNP 2012), Austin, Texas, USA,
November 2012.
Read abstract
Geo-distributed IaaS (Infrastructure-as-a-Service) clouds provide an intriguing platform to deploy Online Social Network (OSN) services. To leverage the potential of clouds, a major task of OSN providers is optimizing the monetary cost spent on cloud resource utilization while providing satisfactory Quality of Service (QoS) to OSN users. We thus study the problem of cost optimization for the dynamic OSN on multiple geo-distributed clouds over consecutive time periods, with its QoS meeting the pre-defined requirement. We model the QoS as well as the cost of an OSN, formulate the problem, and design a solution named cosplay. Our experiments with a large-scale Twitter trace show that, while always ensuring the QoS as required, cosplay can achieve superior one-time cost reduction compared with the state of the art, and can also reduce the accumulative cost significantly when continuously evaluated over 48 months with dynamics comparable to real-world OSNs.
jiao_icnp12.pdf [465.1 kB]
To Offload or Not to Offload: An Efficient Code Partition Algorithm for Mobile Cloud Computing ,
Yuan Zhang , Hao Liu, Lei Jiao , Xiaoming Fu , 1st IEEE International Conference on Cloud Networking (CloudNet 2012), Paris, France,
November 2012.
2011
Scaling Microblogging Services with Divergent Traffic Demands ,
Tianyin Xu , Yang Chen , Lei Jiao , Ben Y. Zhao, Pan Hui, Xiaoming Fu , ACM/IFIP/USENIX 12th International Middleware Conference (Middleware 2011), Lisboa, Portugal, Lecture Notes in Computer Science 7049, pages 20-40,
Springer Verlag, December 2011.
Read abstract
Today’s microblogging services such as Twitter have long outgrown their initial designs as SMS-based social networks. Instead, a massive and steadily-growing user population of more than 100 million is using Twitter for everything from capturing the mood of the country to detecting earthquakes and Internet service failures. It is unsurprising that the traditional centralized client-server architecture has not scaled with user demand, leading to server overload and significant loss of availability.
In this paper, we argue that the divergence in usage models of microblogging services can best be addressed using complementary mechanisms, one that provides reliable messages between friends, and another that delivers events from popular celebrities and media outlets to their millions of followers. We present Cuckoo, a new microblogging system that offloads processing and bandwidth costs away from a small centralized server base while ensuring reliable message delivery. We use a 20-day Twitter availability measurement to guide our design, and trace-driven emulation of 30,000 Twitter users to evaluate our Cuckoo prototype. Compared to a centralized approach, Cuckoo achieves 30-50% server bandwidth savings and 50-60% CPU load reduction, all while guaranteeing reliable message delivery.
cuckoo.pdf [2593.3 kB]
Latency-Aware Data Partitioning for Geo-Replicated Online Social Networks ,
Lei Jiao , Tianyin Xu , Jun Li , Xiaoming Fu , ACM/IFIP/USENIX 12th International Middleware Conference (Middleware 2011), Poster session, Lisboa, Portugal,
December 2011.
Read abstract
No abstract is associated with this entry. Please download the two-page poster directly. Thanks.
TAMER.pdf [156.4 kB]
COPSS: An Efficient Content Oriented Publish/Subscribe System ,
Jiachen Chen , Mayutan Arumaithurai , Lei Jiao , Xiaoming Fu , K. K. Ramakrishnan, ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS 2011), Brooklyn, NY, USA,
October 2011.
Read abstract
Content-Centric Networks (CCN) provide substantial
flexibility for users to obtain information without regard to the source of the information or its current location. Publish/subscribe (pub/sub) systems have gained popularity in society to provide the convenience of removing the temporal dependency of the user having to indicate an interest each time he or she wants to receive a particular piece of related information. Currently, on the Internet, such pub/sub systems have been built on top of an IP-based network with the additional responsibility placed on the end-systems and servers to do the work of getting a piece of information to interested recipients. We propose Content-Oriented Pub/Sub System (COPSS) to achieve an efficient pub/sub capability for CCN. COPSS enhances the heretofore inherently pull-based CCN architectures proposed by integrating a push based multicast capability at the content-centric layer.
We emulate an application that is particularly emblematic
of a pub/sub environment - Twitter - but one where subscribers are interested in content (e.g., identi fied by keywords), rather than tweets from a particular individual. Using trace-driven simulation, we demonstrate that our architecture can achieve a scalable and efficient content centric pub/sub network. The simulator is parameterized using the results of careful microbenchmarking of the open source CCN implementation and of standard IP based forwarding. Our evaluations show that COPSS provides considerable performance improvements in terms of aggregate network load, publisher load and subscriber experience compared to that of a traditional IP infrastructure.
PDF [1102.1 kB]
COPS: An Efficient Content Oriented Publish/Subscribe System ,
Jiachen Chen , Mayutan Arumaithurai , Lei Jiao , Xiaoming Fu , K. K. Ramakrishnan, Technical Report No. IFI-TB-2011-06, Institute of Computer Science, University of Goettingen, Goettingen, Germany,
ISSN 1611-1044, June 2011.
Read abstract
Content-Centric Networks (CCN) provide substantial flexibility for users to obtain information without regard to the source of the information or its current location.
Publish/subscribe (pub/sub) systems have gained popularity in society to provide the convenience of removing the temporal dependency of the user having to indicate an interest each time he or she wants to receive a particular piece of related information. Currently, on the Internet, such pub/sub systems have been built on top of an IP-based
network with the additional responsibility placed on the end-systems and servers to do the work of getting a piece of information to interested recipients. We propose Content-Oriented Pub/Sub system (COPS) to achieve an efficient pub/sub capability for CCN. COPS enhances the heretofore inherently pull-based CCN architectures proposed by integrating push based multicast at the content-centric layer.
We emulate an application that is particularly emblematic of a pub/sub environment---Twitter---but one where subscribers are interested in content (e.g., identified by keywords), rather than tweets from a particular individual. Using trace-driven simulation, we demonstrate that our architecture can achieve a scalable and efficient pub/sub content centric network. The simulator is parameterized using the results of careful microbenchmarking of the open source CCN implementation and of standard IP based forwarding. Our evaluations show that COPS provides considerable performance improvements in terms of aggregate network load, publisher load and subscriber experience compared to that of a traditional IP infrastructure.
main.pdf [1488.3 kB]
PS-CCN: Achieving an Efficient Publish/Subscribe Capability for Content-Centric Networks ,
Jiachen Chen , Lei Jiao , Mayutan Arumaithurai , Xiaoming Fu , K. K. Ramakrishnan, Technical Report No. IFI-TB-2011-04, Institute of Computer Science, University of Goettingen, Goettingen, Germany,
ISSN 1611-1044, May 2011.
Read abstract
Content-Centric Networks (CCN) provide a substantial degree of flexibility for users and end-systems to obtain information without regard to their location or source. Publish/subscribe (pub/sub) systems have gained popularity in society to provide the same convenience for users. Currently, on the Internet, such pub/sub systems have been built on top of an IP-based network with additional responsibility placed in the end-systems and servers to do the work of dissemination. We propose PS-CCN to achieve an efficient pub/sub capability for CCN. PS-CCN enhances the inherently pull-based CCN by introducing the capability of multicast. We use trace-driven simulations to emulate an application that is particularly emblematic of a pub/sub environment—Twitter—but one where subscribers are interested in content (e.g.,
identified by keywords), rather than tweets from a particular individual. The simulator is tuned using the result of a careful microbenchmarking of the open source CCN implementation and standard IP based forwarding. Our evaluations show that PS-CCN provides considerable performance improvements in terms of aggregate network load, publisher load and subscriber experience compared to that of the traditional IP infrastructure.
ccnTechreportMay.pdf [1562.5 kB]
Cuckoo: Scaling Microblogging Services with Divergent Traffic Demands ,
Tianyin Xu , Yang Chen , Lei Jiao , Ben Y. Zhao, Pan Hui, Xiaoming Fu , Technical Report No. IFI-TB-2011-01, Institute of Computer Science, University of Goettingen, Goettingen, Germany, ISSN 1611-1044,
January 2011.
Read abstract
Today's microblogging services such as Twitter have long outgrown their initial designs as SMS-based social networks. Instead, a massive and steadily-growing user population of more than 100 million is using Twitter for everything from capturing the mood of the country to detecting earthquakes and Internet service failures. It is unsurprising then, that the traditional centralized client-server architecture has not scaled with user demand, leading to server overload and significant loss of availability.
In this paper, we argue that the divergence in usage models of microblogging services can best be addressed using complementary mechanisms, one that provides reliable messages between friends, and another that delivers events from popular celebrities and media outlets to their millions of followers. We present Cuckoo, a new microblogging system that offloads processing and bandwidth costs away from a small centralized server base while ensuring reliable message delivery. We use a 20-day Twitter availability measurement to guide our design, and trace-driven emulation of 30,000 Twitter users to evaluate our Cuckoo prototype. Compared to a centralized approach, Cuckoo achieves 30-50% server bandwidth savings and 50-60% CPU load reduction, all while guaranteeing reliable message delivery.
Technical Report.pdf [4259.3 kB]
