Chuang Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chuang Lin has a total of 88 co-authors. Here are the top co-authors by number of shared publications:
Fengyuan Ren
8 shared publications- Fengyuan Ren
Department of Computer Science and Technology, Tsinghua University, Beijing, China
6 shared publications - Yixin Jiang
EPRI, China Southern Power Grid Co. Ltd., Guangzhou, China
5 shared publications - Minghui Shi
Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
4 shared publications - Xuemin Shen
University of Waterloo
4 shared publications - Hao Yin
Tsinghua University
3 shared publications
Latest Publications
- 1 July 2017
- Published by Elsevier in Computer Networks
- Vol. 122, 217-230
Modeling and understanding burst transmission for energy efficient ethernet
- 1 July 2017
- Published by Elsevier in Computer Networks
- Vol. 122, 217-230
Modeling and understanding burst transmission for energy efficient ethernet
- 1 January 2015
- Published by Springer Nature
- p. 99-101
Conclusions and Outlook
- 3 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 28 (5) , 74-80
Toward a practical reconfigurable router: a software component development approach
Modern routers are no longer simple packet routing equipment. They are extremely complex systems that incorporate various network management functionalities. Due to system complexity, most commercial routers are developed by a few equipment vendors in a closed development pattern, which not only hinders the broad participation of most routing function research and development (R&D) teams, but also deter the wide deployment of novel network architectures such as Software Defined Networks (SDNs). In this article a practical approach is introduced to build an open, flexible, and modularized reconfigurable router. A reconfigurable routing software platform supporting functional modules is dynamically assembled, replaced, and updated in the form of components. So far the platform has been adopted by vendors such as Ruijie Networks in their commercial routers, and it is running well all the time. Moreover, a component development environment is provided, which consists of a code editor, a multi-platform compiler, and an automatic testing tool. A component sharing website has also been built to encourage the participation of various R&D teams and promote the spread of our open reconfigurable development pattern.
- 3 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Network
- Vol. 28 (5) , 74-80
Toward a practical reconfigurable router: a software component development approach
Modern routers are no longer simple packet routing equipment. They are extremely complex systems that incorporate various network management functionalities. Due to system complexity, most commercial routers are developed by a few equipment vendors in a closed development pattern, which not only hinders the broad participation of most routing function research and development (R&D) teams, but also deter the wide deployment of novel network architectures such as Software Defined Networks (SDNs). In this article a practical approach is introduced to build an open, flexible, and modularized reconfigurable router. A reconfigurable routing software platform supporting functional modules is dynamically assembled, replaced, and updated in the form of components. So far the platform has been adopted by vendors such as Ruijie Networks in their commercial routers, and it is running well all the time. Moreover, a component development environment is provided, which consists of a code editor, a multi-platform compiler, and an automatic testing tool. A component sharing website has also been built to encourage the participation of various R&D teams and promote the spread of our open reconfigurable development pattern.
- 26 March 2014
- Published by Springer Nature in Cluster Computing
- Vol. 17 (3) , 943-955
Managing performance and power consumption tradeoff for multiple heterogeneous servers in cloud computing
- 26 March 2014
- Published by Springer Nature in Cluster Computing
- Vol. 17 (3) , 943-955
Managing performance and power consumption tradeoff for multiple heterogeneous servers in cloud computing
- 1 January 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 23 (1) , 6-12
Stochastic Workflow Nets Based Workflow Pattern Modeling
Petri nets are widely used in describing workflow models of management systems, and also functioning in process management and resource organizing. The number of workflow patterns are increasing along with the demands of business process modeling. The Petri net and its extensions can no longer meet the requirement of model description, due to the limitation of their semantics. The models of some patterns are very sophisticated and even grow exponentially in complexity. Also the performance of these new patterns are not well studied. This paper extends Petri nets to Stochastic workflow nets (SWNs) and introduces stochastic or state related variables into arc weights, transition enabling guard and execution time. With the new features, SWNs can describe models more accurately and flexibly. And performance of common patterns is calculated under the assumption of exponentially distributed time. The paper also illustrates how to simplify the model with equivalent patterns.
- 1 January 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 23 (1) , 6-12
Stochastic Workflow Nets Based Workflow Pattern Modeling
Petri nets are widely used in describing workflow models of management systems, and also functioning in process management and resource organizing. The number of workflow patterns are increasing along with the demands of business process modeling. The Petri net and its extensions can no longer meet the requirement of model description, due to the limitation of their semantics. The models of some patterns are very sophisticated and even grow exponentially in complexity. Also the performance of these new patterns are not well studied. This paper extends Petri nets to Stochastic workflow nets (SWNs) and introduces stochastic or state related variables into arc weights, transition enabling guard and execution time. With the new features, SWNs can describe models more accurately and flexibly. And performance of common patterns is calculated under the assumption of exponentially distributed time. The paper also illustrates how to simplify the model with equivalent patterns.
- 11 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 23 (1) , 1-14
Phase Plane Analysis of Quantized Congestion Notification for Data Center Ethernet
Currently, Ethernet is being enhanced to become the unified switch fabric in data centers. With the unified switch fabric, the cost on redundant devices is reduced, while the design and management of data center networks are simplified. Congestion management is one of the indispensable enhancements on Ethernet, and Quantized Congestion Notification (QCN) has just been ratified as the formal standard. Though QCN has been investigated for several years, there exist few in-depth theoretical analyses on QCN. The most possible reason is that QCN is heuristically designed and involves the property of variable structure. The classic linear analysis method is incapable of handling the segmented nonlinearity of the variable structure system. In this paper, we use the phase plane method, which is suitable for systems of segmented nonlinearity, to analyze the QCN system. The overall dynamic behaviors of the QCN system are presented, and the sufficient conditions for the stable QCN system are deduced. These sufficient conditions serve as guidelines toward proper parameters setting. Moreover, we find that the stability of QCN is mainly promised by the sliding mode motion, which is the underlying reason for QCN's stable queue shown in numerous simulations and experiments. Experiments on the NetFPGA platform verify that the analytical results can explain the complex behaviors of QCN.
- 11 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 23 (1) , 1-14
Phase Plane Analysis of Quantized Congestion Notification for Data Center Ethernet
Currently, Ethernet is being enhanced to become the unified switch fabric in data centers. With the unified switch fabric, the cost on redundant devices is reduced, while the design and management of data center networks are simplified. Congestion management is one of the indispensable enhancements on Ethernet, and Quantized Congestion Notification (QCN) has just been ratified as the formal standard. Though QCN has been investigated for several years, there exist few in-depth theoretical analyses on QCN. The most possible reason is that QCN is heuristically designed and involves the property of variable structure. The classic linear analysis method is incapable of handling the segmented nonlinearity of the variable structure system. In this paper, we use the phase plane method, which is suitable for systems of segmented nonlinearity, to analyze the QCN system. The overall dynamic behaviors of the QCN system are presented, and the sufficient conditions for the stable QCN system are deduced. These sufficient conditions serve as guidelines toward proper parameters setting. Moreover, we find that the stability of QCN is mainly promised by the sliding mode motion, which is the underlying reason for QCN's stable queue shown in numerous simulations and experiments. Experiments on the NetFPGA platform verify that the analytical results can explain the complex behaviors of QCN.
- 16 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 31 (9) , 66-74
Accelerating Peer-to-Peer File Sharing with Social Relations
Peer-to-peer file sharing systems, most notably BitTorrent (BT), have achieved tremendous success among Internet users. Recent studies suggest that long-term relationships among BT peers could be explored for peer cooperation, so as to achieve better sharing efficiency. However, whether such long-term relationships exist remain unknown. From an 80-day trace of 100,000 real world swarms, we find that less than 5% peers can meet each other again throughout the whole period, which largely invalidates the fundamental assumption of these peer cooperation protocols. Yet the recent emergence of online social network applications sheds new light on this problem. In particular, a number of BT swarms are now triggered by Twitter, reflecting a new trend for initializing sharing among communities. In this paper, we for the first time examine the challenges and potentials of accelerating peer-to-peer file sharing with Twitter social networks. We show that the peers in such swarms have stronger temporal locality, thus offering great opportunity for improving their degree of sharing. Based on the Hadamard Transform of peers' online behaviors, we develop a social index to quickly locate peers of common patterns. We further demonstrate a practical cooperation protocol that identifies and utilizes the social relations with the index. Our PlanetLab experiments indicate that the incorporation of social relations remarkably accelerates the downloading time. The improvement remains noticeable even in a hybrid system with a small set of socially active peers only.
- 16 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 31 (9) , 66-74
Accelerating Peer-to-Peer File Sharing with Social Relations
Peer-to-peer file sharing systems, most notably BitTorrent (BT), have achieved tremendous success among Internet users. Recent studies suggest that long-term relationships among BT peers could be explored for peer cooperation, so as to achieve better sharing efficiency. However, whether such long-term relationships exist remain unknown. From an 80-day trace of 100,000 real world swarms, we find that less than 5% peers can meet each other again throughout the whole period, which largely invalidates the fundamental assumption of these peer cooperation protocols. Yet the recent emergence of online social network applications sheds new light on this problem. In particular, a number of BT swarms are now triggered by Twitter, reflecting a new trend for initializing sharing among communities. In this paper, we for the first time examine the challenges and potentials of accelerating peer-to-peer file sharing with Twitter social networks. We show that the peers in such swarms have stronger temporal locality, thus offering great opportunity for improving their degree of sharing. Based on the Hadamard Transform of peers' online behaviors, we develop a social index to quickly locate peers of common patterns. We further demonstrate a practical cooperation protocol that identifies and utilizes the social relations with the index. Our PlanetLab experiments indicate that the incorporation of social relations remarkably accelerates the downloading time. The improvement remains noticeable even in a hybrid system with a small set of socially active peers only.
- 8 March 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 12 (4) , 1752-1761
Frequency Domain Packet Scheduling with MIMO for 3GPP LTE Downlink
In this paper, we formalize a general Frequency Domain Packet Scheduling (FDPS) problem for 3GPP LTE Downlink (DL). The DL FDPS problem incorporates the SingleUser Multiple Input Multiple Output (SU-MIMO) technique, and can express various scheduling policies, including the Proportional-Fair metric, the MaxWeight scheduling, etc. For LTE DL SU-MIMO, the constraint of selecting only one MIMO mode (transmit diversity or spatial multiplexing) per user in each transmission time interval (TTI) increases the hardness of the FDPS problem. We prove the problem is MAX SNP-hard, which implies approximation algorithms with constant approximation ratios are the best we can expect. Subsequently, we propose an approximation algorithm of polynomial runtime. The solution is based on a greedy method for maximizing a non-decreasing submodular function over a matroid. The algorithm can solve the general DL FDPS problem with an approximation ratio of 4. We implement the proposed algorithm and compare its performance with other well-known schedulers.
- 8 March 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 12 (4) , 1752-1761
Frequency Domain Packet Scheduling with MIMO for 3GPP LTE Downlink
In this paper, we formalize a general Frequency Domain Packet Scheduling (FDPS) problem for 3GPP LTE Downlink (DL). The DL FDPS problem incorporates the SingleUser Multiple Input Multiple Output (SU-MIMO) technique, and can express various scheduling policies, including the Proportional-Fair metric, the MaxWeight scheduling, etc. For LTE DL SU-MIMO, the constraint of selecting only one MIMO mode (transmit diversity or spatial multiplexing) per user in each transmission time interval (TTI) increases the hardness of the FDPS problem. We prove the problem is MAX SNP-hard, which implies approximation algorithms with constant approximation ratios are the best we can expect. Subsequently, we propose an approximation algorithm of polynomial runtime. The solution is based on a greedy method for maximizing a non-decreasing submodular function over a matroid. The algorithm can solve the general DL FDPS problem with an approximation ratio of 4. We implement the proposed algorithm and compare its performance with other well-known schedulers.
- 24 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 30 (9) , 1738-1745
ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation
Practical wireless network coding (e.g., COPE) is a promising technique that can enhance the throughput of wireless networks. However, such a technique also bears a serious security drawback: it breaks the current privacy-preserving protocols (e.g., Onion Routing), since their operations conflict each other. As user privacy in wireless networks is highly valued nowadays, a new privacy-preserving scheme that can function with wireless network coding becomes indispensable. To address such a challenge, we apply the idea of cooperative networking and design a novel anonymity scheme named ANOC, which can function in network-coding-based wireless mesh networks. ANOC is built upon the classic Onion Routing protocol, and resolves its conflict with network coding by introducing efficient cooperation among relay nodes. Using ANOC, we can perform network coding to achieve a higher throughput, while still preserving user privacy in wireless mesh networks. We formally show how ANOC achieves the property of relationship anonymity, and conduct extensive experiments via nsclick to demonstrates its feasibility and efficiency when integrated with network coding.
- 24 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 30 (9) , 1738-1745
ANOC: Anonymous Network-Coding-Based Communication with Efficient Cooperation
Practical wireless network coding (e.g., COPE) is a promising technique that can enhance the throughput of wireless networks. However, such a technique also bears a serious security drawback: it breaks the current privacy-preserving protocols (e.g., Onion Routing), since their operations conflict each other. As user privacy in wireless networks is highly valued nowadays, a new privacy-preserving scheme that can function with wireless network coding becomes indispensable. To address such a challenge, we apply the idea of cooperative networking and design a novel anonymity scheme named ANOC, which can function in network-coding-based wireless mesh networks. ANOC is built upon the classic Onion Routing protocol, and resolves its conflict with network coding by introducing efficient cooperation among relay nodes. Using ANOC, we can perform network coding to achieve a higher throughput, while still preserving user privacy in wireless mesh networks. We formally show how ANOC achieves the property of relationship anonymity, and conduct extensive experiments via nsclick to demonstrates its feasibility and efficiency when integrated with network coding.
- 1 January 2012
- Published by Springer Nature
- p. 301-307
An Channel-Awared Transmission Protocol in Wireless Sensor Networks
- 1 January 2012
- Published by Springer Nature
- p. 301-307
An Channel-Awared Transmission Protocol in Wireless Sensor Networks