Hao Yin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hao Yin has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Geyong Min
University of Exeter
4 shared publications - Chuang Lin
Tsinghua University
2 shared publications - Chuang Lin
Department of Computer Science, Tsinghua University, Beijing, China
2 shared publications - Berton Sebastien
Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
1 shared publication - Bo Li
The Hong Kong University of Science and Technology
1 shared publication Changlai Du
1 shared publication
Latest Publications
- 24 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 55 (6) , 218-224
Data-Driven Information Plane in Software-Defined Networking
The contemporary Internet has evolved from an academic infrastructure to a tremendous commercial network, serving as an indispensable information platform for human communications, but with inherent limitations such as complicated management and manual configuration. To overcome these limitations, the basic Internet architecture has unleashed an unprecedented wave of innovation over the past decade, and introduced a promising networking paradigm, software-defined networking (SDN), often referred to as a "radical new idea in networking." SDN offers numerous potential benefits such as enhanced configuration, improved performance, and encouraged innovation in network architectures and operations, while undergoing unprecedented challenges due to the lack of global network-wide information. Nowadays, the emerging data-driven thought opens the era of the fourth paradigm for science research and transfers the design philosophy of future networks, based on the large-scale data rather than the small-scale data. We argue that the existence of a data-driven information plane in SDN can address these challenges. In this article, we explicitly propose a data-driven information plane and extend the SDN architecture specifically. We first overview the evolution of SDN, and then illustrate a novel SDN paradigm by introducing a data-driven information plane into the commonly accepted SDN reference architecture. Finally, we outline emerging challenges and discuss future directions for further research triggered by a data-driven information plane.
- 24 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Magazine
- Vol. 55 (6) , 218-224
Data-Driven Information Plane in Software-Defined Networking
The contemporary Internet has evolved from an academic infrastructure to a tremendous commercial network, serving as an indispensable information platform for human communications, but with inherent limitations such as complicated management and manual configuration. To overcome these limitations, the basic Internet architecture has unleashed an unprecedented wave of innovation over the past decade, and introduced a promising networking paradigm, software-defined networking (SDN), often referred to as a "radical new idea in networking." SDN offers numerous potential benefits such as enhanced configuration, improved performance, and encouraged innovation in network architectures and operations, while undergoing unprecedented challenges due to the lack of global network-wide information. Nowadays, the emerging data-driven thought opens the era of the fourth paradigm for science research and transfers the design philosophy of future networks, based on the large-scale data rather than the small-scale data. We argue that the existence of a data-driven information plane in SDN can address these challenges. In this article, we explicitly propose a data-driven information plane and extend the SDN architecture specifically. We first overview the evolution of SDN, and then illustrate a novel SDN paradigm by introducing a data-driven information plane into the commonly accepted SDN reference architecture. Finally, we outline emerging challenges and discuss future directions for further research triggered by a data-driven information plane.
- 5 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 15 (8) , 2114-2124
NetClust: A Framework for Scalable and Pareto-Optimal Media Server Placement
Effective media server placement strategies are critical for the quality and cost of multimedia services. Existing studies have primarily focused on optimization-based algorithms to select server locations from a small pool of candidates based on the entire topological information and thus these algorithms are not scalable due to unavailability of the small pool of candidates and low-efficiency of gathering the topological information in large-scale networks. To overcome this limitation, a novel scalable framework called NetClust is proposed in this paper. NetClust takes advantage of the latest network coordinate technique to reduce the workloads when obtaining the global network information for server placement, adopts a new K-means-clustering-based algorithm to select server locations and identify the optimal matching between clients and servers. The key contribution of this paper is that the proposed framework optimizes the trade-off between the service delay performance and the deployment cost under the constraints of client location distribution and the computing/storage/bandwidth capacity of each server simultaneously. To evaluate the performance of the proposed framework, a prototype system is developed and deployed in a real-world large-scale Internet. Experimental results demonstrate that 1) NetClust achieves the lower deployment cost and lower delay compared to the traditional server selection method; and 2) NetClust offers a practical and feasible solution for multimedia service providers.
- 5 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 15 (8) , 2114-2124
NetClust: A Framework for Scalable and Pareto-Optimal Media Server Placement
Effective media server placement strategies are critical for the quality and cost of multimedia services. Existing studies have primarily focused on optimization-based algorithms to select server locations from a small pool of candidates based on the entire topological information and thus these algorithms are not scalable due to unavailability of the small pool of candidates and low-efficiency of gathering the topological information in large-scale networks. To overcome this limitation, a novel scalable framework called NetClust is proposed in this paper. NetClust takes advantage of the latest network coordinate technique to reduce the workloads when obtaining the global network information for server placement, adopts a new K-means-clustering-based algorithm to select server locations and identify the optimal matching between clients and servers. The key contribution of this paper is that the proposed framework optimizes the trade-off between the service delay performance and the deployment cost under the constraints of client location distribution and the computing/storage/bandwidth capacity of each server simultaneously. To evaluate the performance of the proposed framework, a prototype system is developed and deployed in a real-world large-scale Internet. Experimental results demonstrate that 1) NetClust achieves the lower deployment cost and lower delay compared to the traditional server selection method; and 2) NetClust offers a practical and feasible solution for multimedia service providers.
- 1 April 2009
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 14 (2) , 234-241
Efficient user authentication and key management for peer-to-peer live streaming systems
- 1 April 2009
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 14 (2) , 234-241
Efficient user authentication and key management for peer-to-peer live streaming systems
- 1 April 2006
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 14 (3) , 263-278
A context-based simulation tool for design and evaluation of network processors
- 1 April 2006
- Published by Elsevier in Simulation Modelling Practice and Theory
- Vol. 14 (3) , 263-278
A context-based simulation tool for design and evaluation of network processors
- 17 February 2006
- Published by Elsevier in Journal of Systems Architecture
- Vol. 52 (7) , 423-431
An analytical model for hypercubes in the presence of multiple time-scale bursty traffic
- 17 February 2006
- Published by Elsevier in Journal of Systems Architecture
- Vol. 52 (7) , 423-431
An analytical model for hypercubes in the presence of multiple time-scale bursty traffic
- Open Access
- 1 February 2006
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 11 (1) , 1-7
Mobile police information system based on Web Services
The demand for communications anywhere, anytime, and on any device without recording the date is growing with the development of modern information technologies. Current wireless communications enable people to freely exchange information, while web services provide loosely-coupled, language-neutral, and platform-independent ways of linking applications within organizations, across enterprises, and across the Internet. This paper describes a mobile information system for police service, which integrates wireless communication technologies and web service technologies. The system satisfies the special demands of police information systems, such as security and interoperability. Policemen in the system can use various kinds of mobile terminals, such as mobile phones, tablet PCs, personal digital assistants, and laptops equipped with wireless LAN or GPRS to access data in the central database. The system is based on web services with a secure web service architecture and simple object access protocol message passing.
- 1 February 2006
- Published by Tsinghua University Press in Tsinghua Science and Technology
- Vol. 11 (1) , 1-7
Open AccessMobile police information system based on Web Services
The demand for communications anywhere, anytime, and on any device without recording the date is growing with the development of modern information technologies. Current wireless communications enable people to freely exchange information, while web services provide loosely-coupled, language-neutral, and platform-independent ways of linking applications within organizations, across enterprises, and across the Internet. This paper describes a mobile information system for police service, which integrates wireless communication technologies and web service technologies. The system satisfies the special demands of police information systems, such as security and interoperability. Policemen in the system can use various kinds of mobile terminals, such as mobile phones, tablet PCs, personal digital assistants, and laptops equipped with wireless LAN or GPRS to access data in the central database. The system is based on web services with a secure web service architecture and simple object access protocol message passing.
- 25 February 2005
- Published by Wiley in International Journal of Communication Systems
- Vol. 18 (8) , 711-729
Network traffic prediction based on a new time series model
Fast and accurate methods for predicting traffic properties and trend are essential for dynamic network resource management and congestion control. With the aim of performing online and feasible prediction of network traffic, this paper proposes a novel time series model, named adaptive autoregressive (AAR). This model is built upon an adaptive memory‐shortening technique and an adaptive‐order selection method originally developed by this study. Compared to the conventional one‐step ahead prediction using traditional Box–Jenkins time series models (e.g. AR, MA, ARMA, ARIMA and ARFIMA), performance results obtained from actual Internet traffic traces have demonstrated that the proposed AAR model is able to support online prediction of dynamic network traffic with reasonable accuracy and relatively low computation complexity. Copyright © 2005 John Wiley & Sons, Ltd.
- 25 February 2005
- Published by Wiley in International Journal of Communication Systems
- Vol. 18 (8) , 711-729
Network traffic prediction based on a new time series model
Fast and accurate methods for predicting traffic properties and trend are essential for dynamic network resource management and congestion control. With the aim of performing online and feasible prediction of network traffic, this paper proposes a novel time series model, named adaptive autoregressive (AAR). This model is built upon an adaptive memory‐shortening technique and an adaptive‐order selection method originally developed by this study. Compared to the conventional one‐step ahead prediction using traditional Box–Jenkins time series models (e.g. AR, MA, ARMA, ARIMA and ARFIMA), performance results obtained from actual Internet traffic traces have demonstrated that the proposed AAR model is able to support online prediction of dynamic network traffic with reasonable accuracy and relatively low computation complexity. Copyright © 2005 John Wiley & Sons, Ltd.