Yang Richard Yang

Yang Richard Yang

Auto-generated profile, based on publicly available information

Yang Richard Yang

Department of Computer Science, Yale University, New Haven, USA

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 August 2020 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
JZJingxuan Zhang
Jingxuan Zhang
KGKai Gao
Kai Gao
YYY. Richard Yang
Y. Richard Yang
JBJun Bi
Jun Bi
As modern network applications (e.g., large data analytics) become more distributed and can conduct application-layer traffic adaptation, they demand better network visibility to better orchestrate their data flows. As a result, the ability to predict the available bandwidth for a set of flows has become a fundamental requirement of today's networking systems. While there are previous studies addressing the case of non-reactive flows, the prediction for reactive flows, e.g., flows managed by TCP congestion control algorithms, still remains an open problem. In this paper, we take the first step to solving this problem in a data center network. To address both theoretical and practical challenges, we introduce a novel learning-based prediction system based on the NUM model, with two key techniques named fast factor learning (FFL) and efficient flow sampling. We adopt novel techniques to overcome practical concerns such as scalability, convergence and unknown system parameters. A system, Prophet, is proposed leveraging the emerging technologies of Software Defined Networking (SDN) to realize the model. Evaluations demonstrate that our solution achieves significant accuracy in a wide range of settings.


26 August 2013 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
YSYi Sun
Yi Sun
YYY. Richard Yang
Y. Richard Yang
XZXiaobing Zhang
Xiaobing Zhang
YGYang Guo
Yang Guo
JLJun Li
Jun Li
KSKave Salamatian
Kave Salamatian
P2P platforms have been criticized because of the heavy strain that they can inflict on costly inter-domain links of network operators. It is therefore mandatory to develop network optimization schemes for controlling the load generated by a P2P platform on an operator network. While many research efforts exist on centralized tracker-based systems, in recent years multiple DHT-based P2P platforms have been widely deployed and considered as commercial services due to their scalability and fault tolerance. Finding network optimization for DHT-based P2P applications has thereby potential large practical impacts. In this paper, we present THash, a simple scheme that implements a distributed and effective network optimization for DHT systems. THash uses standard DHT put/get semantics and utilizes a triple hash method to guide the DHT clients to choose their sharing peers in proper domains. We have implemented THash in a major commercial P2P system (PPLive), using the standard ALTO/P4P protocol as the network information source. We conducted experiments over this network in real operation and observed that compared with Native DHT, THash reduced respectively by 47.4% and 67.7% the inter-PID and inter-AS traffic, while reducing the average downloading time by 14.6% to 24.5%.

1 September 2009
Verified
Report
Open access
PDF file
CGC. Griffiths
C. Griffiths
JLJ. Livingood
J. Livingood
LPL. Popkin
L. Popkin
RWR. Woundy
R. Woundy
YYY. Yang
Y. Yang
This document describes the experiences of Comcast, a large cable broadband Internet Service Provider (ISP) in the U.S., in a Proactive Network Provider Participation for P2P (P4P) technical trial in July 2008. This trial used P4P iTracker technology, which is being considered by the IETF as part of the Application Layer Transport Optimization (ALTO) working group. Status of This Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited.

5 July 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
QXQiao Xiang
Qiao Xiang
JZJingxuan Jensen Zhang
Jingxuan Jensen Zhang
XWXin Tony Wang
Xin Tony Wang
YLYang Jace Liu
Yang Jace Liu
CGChin Guok
Chin Guok
YYY. Richard Yang
Y. Richard Yang
Multi-domain network resource reservation systems are being deployed, driven by the demand and substantial benefits of providing predictable network resources. However, a major lack of existing systems is their coarse granularity, due to the participating networks’ concern of revealing sensitive information, which can result in substantial inefficiencies. This paper presents Mercator, a novel multi-domain network resource discovery system to provide fine-grained, global network resource information, for collaborative sciences. The foundation of Mercator is a resource abstraction through algebraic-expression enumeration (i.e., linear inequalities/equations), as a compact representation of multiple properties of network resources (e.g., bandwidth, delay and loss rate) in multi-domain networks. In addition, we develop an obfuscating protocol, to address the privacy concerns by ensuring that no participant can associate the algebraic expressions with the corresponding member networks. We also introduce a super-set projection technique to increase Mercator’s scalability. We implement a prototype Mercator and deploy it in a small federation network. We also evaluate the performance of Mercator through extensive experiments using real topologies and traces. Results show that Mercator (1) efficiently discovers available networking resources in collaborative networks on average four orders of magnitude faster, and allows fairer allocations of network resources; (2) preserves the member networks’ privacy with little overhead; and (3) scales to a collaborative network of 200 member networks.

3 June 2020 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
KGKai Gao
Kai Gao
TNTaishi Nojima
Taishi Nojima
HYHaitao Yu
Haitao Yu
YYYang Richard Yang
Yang Richard Yang
Software-Defined Networking (SDN) enables more dynamic and fine-grained network control. In particular, network operators can route traffic not only based on packet header fields, but also higher-level parameters such as user settings, traffic characteristics, and application-layer information extracted by virtualized network functions such as DPI, firewall and authentication servers. Integrating these higher-level parameters into an SDN programming framework brings substantial benefits but is still missing in the SDN community. In this paper, we articulate the challenges and then propose Trident, a novel unified SDN programming framework. Trident extends algorithmic SDN programming with a new abstraction called stream attribute, which integrates meta parameters into the match-action programming paradigm. Further, Trident adopts the idea of reactive value from function reactive programming, eliminating the complexity of manually handling dynamicity. To effectively and efficiently realize these novel ideas, Trident introduces reactive table as the basic processing unit and develops a domain-specific distributed update protocol to maintain consistency during updates. Evaluations show that Trident puts very little overhead on integrating existing network management tools and network functions, and can handle up to O(10 5 ) routing requests per second with O(100) milliseconds latency.