2002 — 2005 |
Feigenbaum, Joan [⬀] Shenker, Scott (co-PI) [⬀] Krishnamurthy, Arvind (co-PI) [⬀] Yang, Yang (co-PI) [⬀] Yang, Yang (co-PI) [⬀] |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Incentive-Compatible Designs For Distributed Systems
This project includes the research activities to obtain theoretical and practical results on mechanisms that are incentive-compatible, scalable and distributed. Specifically, distributed algorithmic mechanism design with insights from game theory is proposed for three related problems in networking: interdomain routing, web caching and peer-to-peer file sharing. The research program on interdomain routing will develop a fundamentally new approach in which many of the routing-related incentive issues are handled by incentive-compatible protocols rather than bilateral contracts; such protocols can more effectively address the system-wide issues of efficient routing and conflicting policy requirements. Within this project also the recently developed techniques for digital-goods auctions will be applied to the peer-to-peer file sharing problem and to the design of incentive-compatible caching mechanisms. This project will help to understand better the behaviors of large-scale, distributed information systems formed by autonomous components such as Internet, and develop incentive-compatible algorithms for these systems accordingly.
|
1 |
2003 — 2009 |
Yang, Yang [⬀] Yang, Yang [⬀] |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Career: Networks With Multiple Transport Mechanisms
This project will perform a systematic analysis and design of a network with heterogeneous transport mechanisms. Specifically, the proposer perform the following tasks. First, by mapping all transport mechanisms into the same function space, the proposer will compare the bandwidth received by different transport mechanisms, under different router mechanisms. The following research tasks will be carried out: 1. Will propose and investigate the effectiveness of router mechanisms to control the difference of the bandwidth received by two transport mechanisms. Instead of designing router mechanisms with indirect objectives, will use optimal control to design them. 2. Second, by using stochastic differential equations to model aggregated flow dynamics, will analyze the stability and performance of such heterogeneous networks. Will analyze the effects of the mixture of flows on network stability and performance. Will investigate the effectiveness of using adaptive control to control a network with unknown or changing flow dynamics. 3. Third, will design an end-to-end priority scheme using different transport. This scheme is flexible and deployable because it does not involve modifications to the routers. We will implement applications to demonstrate the usage. 4. Fourth, will investigate the transport issues in mobile ad-hoc networks, where the limiting resources will be not only bandwidth as in wired network but also energy. Furthermore, such resources will be managed by mobile nodes that will be selfish. Applying an integrated optimization and game-theoretic approach, will investigate heterogeneous transport systems for mobile ad-hoc networks. 5. Fifth, will also evaluate the effects of application requirements and application adaptation.
The proposed research will be integrated in an educational plan which seeks to involve graduate and undergraduate students in the research effort. The PI will also a new class on system modeling and analysis, and add new instructional materials to two courses on computer networks.
|
1 |
2004 — 2008 |
Aspnes, James (co-PI) [⬀] Yang, Yang [⬀] Yang, Yang [⬀] Silberschatz, Abraham (co-PI) [⬀] |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Nets - Nr: Design and Evaluation of Multihomed Networks
Multi-homed networks are typically consisting of a number of access links be-longing to several distinct service providers. Many networks in the Internet are becoming multi-homed because multi-homing has the potential to improve availability and robustness, improve end-to-end application performance, re-duce operational cost of a user's network, and improve competitiveness of ser-vice providers. In this research project, the researchers will design architecture, algorithms, and protocols for multi-homing to contribute to the efficient opera-tion of multi-homed networks, which are becoming a critical component of the national information infrastructure. This research also aims to develop and dis-tribute a software tool to evaluate key perspectives of global, heterogeneous networks consisting of adaptive single-homed networks, multi-homed networks, and overlay networks.
|
1 |
2006 — 2010 |
Yang, Yang [⬀] Yang, Yang [⬀] |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Collaborative Research: Nets-Nbd: Traffic Engineering in An Uncertain World
The Internet has become a critical infrastructure of the modern society, carrying the traffic of many mission-critical applications. As a result, the efficiency and reliability of the backbone networks of the Internet have major societal impacts. Uncertainties, which arise due to unpredictable network events and traffic variations, and the competitive, decentralized nature of the Internet, are major challenges to improve the efficiency, reliability, and availability of the Internet.
This project develops effective and novel techniques to enable efficient and reliable traffic engineering in the presence of uncertainties. Its research consists of three major technical components: 1) COPE: Common-case Optimization with Penalty Envelope; 2) SITE: Symbiotic Inter-domain Traffic Engineering; and 3) Integration of COPE and SITE. Together, they provide a complete traffic engineering solution.
Broader Impacts: The research significantly advances the state of the art in traffic engineering. The techniques and toolkit resulted from the research deepens the understanding of traffic engineering and provides significant practical values in improving real IP network operations. In addition, the general principles behind the technical designs for addressing uncertainties have applications beyond traffic engineering.
|
1 |
2008 — 2012 |
Yang, Yang [⬀] Yang, Yang [⬀] Silberschatz, Abraham (co-PI) [⬀] |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Neco: P4p: Provider Portal For (P2p) Network Applications
The increasing integration of novel network applications, in particular, peer-to-peer (P2P) applications, into the Internet content distribution infrastructure is posing significant new challenges to achieving efficient and fair utilization of Internet network resources. In particular, by largely network oblivious, these network applications can cause substantial problems on network efficiency, Internet economics, and application performance.
The objective of this project is to develop a novel, light-weight framework called P4P that provides standard, modular interfaces to allow Internet network providers and network applications to jointly optimize their respective performance.
The P4P interfaces are designed through rigorous mathematical derivations to achieve extensibility, scalability and efficiency in large-scale, heterogeneous networks. The interfaces consider not only network provider privacy but also end-user privacy. The interfaces take into consideration not only traditional performance metrics but also increasingly important economic and business policies.
This project advances the state of the art in facilitating the interactions across different Internet network layers and entities, and presents a transformative research that enables others to effectively integrate network applications into network management.
The interfaces designed in the project will be specified in an open, standard language. The reference implementations will be made available broadly to facilitate integration into the Internet infrastructure. A P4P research group will be formed to maximize open research and disseminate results widely among network operators and application developers.
|
1 |
2010 — 2014 |
Yang, Yang [⬀] Yang, Yang [⬀] |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Nets: Small: Collaborative Research: Matrixnet: Concurrent Transmission and Reception in Wireless Networks
Title: NeTS:Small:Collaborative Research: MatrixNet: Concurrent Transmission and Reception in Wireless Networks
Abstract
As more people access the global Internet through wireless networks, the limited capacity of wireless networks is becoming a major challenge of our information-based society. Building around the point-to-point architecture, where the basic transmission unit is from a single transmitter to a single receiver, current wireless networks are shown to be severely limited in throughput and do not scale well as they become large and dense. Thus, it is time for a fundamental revisit and change to the wireless network system architecture, in order to explore distributed cooperation and one-to-many encoding/decoding in wireless networks.
The MatrixNet project uses a component-based framework to design implementable, distributed concurrency algorithms and protocols, spanning routing, media access control, and physical layers. It bridges and goes beyond theoretical asymptotic analysis in information theory in order to identify fundamental, algorithmic and system challenges facing the emerging, increasingly important field of system concurrent wireless networks. The project integrates multiple experimental platforms, including Sora, GNU radio, and networked MIMO, and conducts systematic, realistic evaluations. The project team consists of both academic and industrial researchers to facilitate potential technology transfer and cross-institution collaboration.
|
1 |
2012 — 2016 |
Yang, Yang [⬀] Yang, Yang [⬀] |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Nets: Small: Collaborative Research: Lawn: Scaling Up Cellular Data Networks Using a Large Number of Antennas
The exponential growth of mobile data is a major challenge to the operators of cellular networks. Looking beyond conventional capacity-improving approaches such as adding more cells and acquiring more spectrum, this project seeks to fundamentally improve the spectral efficiency of cellular data networks. The project investigates LAWN (Large number of Antenna based Wireless Networking), a radically new cellular network architecture, in which a large number of antennas simultaneously serve a relatively much smaller number of wireless terminals using multiuser beamforming. The project has two inter-related thrusts. The first investigates a novel LAWN base station design and prototype that can cost-effectively scale to hundreds of antennas and exploit physical-layer tradeoffs between computational complexity and network capacity. The second thrust studies the resulting new network architecture that efficiently schedules terminals, intelligently allocates transmission power, and coordinates pilot signal transmissions to mitigate inter-cell interference.
The project targets improving the spectral and power efficiency of cellular networks by many fold, leading to not only fast wireless data networks but also longer battery lifetime of mobile terminals. Results from the project are likely to provide fresh insights for new theoretical development, bringing large-scale multi-user beamforming one significant leap closer to practical deployment in cellular data networks. In addition to academic publications, the project will produce an open platform, including hardware, software, and documentation available on-line, for teaching and researching base station design. It will actively involve undergraduate students as well as students from under-represented populations.
|
1 |
2014 — 2017 |
Starr, Robert Yang, Yang [⬀] Yang, Yang [⬀] Sherman, Andrew Bjornson, Robert Galassi, David |
N/AActivity Code Description: No activity code was retrieved: click on the grant title for more information |
Cc*Iie Integration: Dynamically Optimizing Research Data Workflow With a Software Defined Science Network
Intelligent management of campus research networks has become a major challenge for many institutions, as their networks grow rapidly in size and complexity in order to meet the demands of on-campus scientists who are conducting research, collaborating with peers, and fulfilling their mission of scientific education. Traditional, static network management approaches are no longer adequate, since they often result in low efficiency, poor usability, and unpredictable network application performance.
The goal of this project is to design and deploy a novel intelligent network cyberinfrastructure that greatly expands the ability of scientists to rapidly and efficiently move the large quantities of data required for computation- and data-intensive scientific workflows. To ensure a broad impact, the project includes specific focus on a range of science drivers in diverse fields such as astronomy, climatology, and genomics.
The project achieves its goal by leveraging and validating several prior networking research and development efforts. These include Maple, a novel Software Defined Networking (SDN) programming framework developed at Yale, and an Application Layer Traffic Optimization (ALTO) protocol and framework pioneered at Yale and now incorporated in a proposed standard for the Internet by the Internet Engineering Task Force. Maple simplifies network programming for end-to-end, complex, dynamically constructed network services, while ALTO enables network applications to adapt dynamically, according to network states, to deliver network efficiency and application quality of service. In addition, the project builds on prior Yale and NSF investments in high-speed physical network cyberinfrastructure, the widely-adopted InCommon authentication framework, and IPv6 technology.
|
1 |
2017 — 2018 |
Yang, Yang [⬀] Yang, Yang [⬀] |
R03Activity Code Description: To provide research support specifically limited in time and amount for studies in categorical program areas. Small grants provide flexibility for initiating studies which are generally for preliminary short-term projects and are non-renewable. |
A New Ovarian Cancer Mouse Model Based On Nanoparticle Gene Delivery
Animal models have tremendously advanced the research of human cancer. However, the technically challenging, time consuming, and expensive process to generate animal model of human cancer is still a bottleneck for cancer research and drug development. In the proposed project, we expand the application of the nanoparticle drug/gene delivery system to the development of mouse cancer model with the goal of overcoming the challenges of current genetically engineered mouse (GEM) models. We will optimize the nanoparticle system for delivering tumorigenic DNA (plasmid DNA containing oncogenes or CRISPR/Cas9 gene editing components) to the targeted mouse ovarian surface epithelial cells and fallopian tube epithelial cells. The efficacy of this method in inducing ovarian cancer in mice will be evaluated. The formed tumors will be characterized and compared to current GEM models. If the proposed study is successfully completed, the results will provide new tools for creating safe, effective, and economic in vivo cancer models. The success of this revolutionarily new method may greatly advance the mouse models of human diseases and open new horizons in both basic and applied cancer research.
|
1 |