Collaborative Research: Emerging Directions in Network Design and Optimization
协作研究:网络设计和优化的新兴方向
基本信息
- 批准号:0729022
- 负责人:
- 金额:$ 25.1万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2007
- 资助国家:美国
- 起止时间:2007-09-01 至 2011-08-31
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
The main focus of the research is to develop good algorithms for designing networks. With the popularity and ubiquity of the Internet, it has become important to develop simple and scalable algorithms to design good networks which offer the most flexibility and functionality. Thenetwork designer has to build networks given only partial information and loose estimates of the traffic that will eventually be carried, to build networks knowing that faults will almost surely occur and to provision for handling these faults gracefully, and to do this in the most economic and efficient fashion. Along with this, the network designer today must take into account the heterogeneity of networks (which will include wireless and optical parts), and the fact that eachnetwork has to interact with potentially many other networks. In addition, these interacting networks may be controlled by different entities having different pricing schemes and different incentive structures.The investigators from Carnegie Mellon University and Bell Laboratories draw on their mix of backgrounds to mathematically model the problems faced in network design contexts, and to develop algorithmic tools and good algorithms with provable guarantees for these problems. To achieve these goals, the research adapts and augments a rich set of algorithmic techniques from linear and convex programming, stochastic optimization, metric embeddings, and randomization, as well as complexity-theoretic techniques that have developed in theoretical computer science over the past few years. The research reflects a collaboration between academia and research laboratories to transfer ideas, problems and algorithms between theory and practice: in particular, the research encourages students to learn problem modeling and solving, and to move between thetwo environments gaining a balanced view of issues in network design. Research progress is propagated into the curriculum via specialized courses presenting the theoretical advances in the context of their applications, as well as basic courses teaching the fundamental ideas and techniques behind these research advances.
研究的主要焦点是开发良好的网络设计算法。随着Internet的普及和无处不在,开发简单且可扩展的算法来设计提供最大灵活性和功能的良好网络变得越来越重要。网络设计人员必须在仅提供部分信息和对最终将承载的流量进行粗略估计的情况下构建网络,在知道故障几乎肯定会发生的情况下构建网络,并为优雅地处理这些故障做好准备,并以最经济高效的方式做到这一点。除此之外,当今的网络设计师还必须考虑到网络的异构性(包括无线和光纤部分),以及每个网络都必须与潜在的许多其他网络交互的事实。此外,这些相互作用的网络可能由具有不同定价方案和不同激励结构的不同实体控制。来自卡内基梅隆大学和贝尔实验室的研究人员利用他们的混合背景对网络设计环境中面临的问题进行数学建模,并为这些问题开发算法工具和良好的算法。为了实现这些目标,该研究采用并增强了来自线性和凸规划、随机优化、度量嵌入和随机化的丰富的算法技术,以及过去几年在理论计算机科学中发展起来的复杂性理论技术。这项研究反映了学术界和研究实验室之间的合作,以在理论和实践之间传递想法、问题和算法:尤其是,该研究鼓励学生学习问题建模和解决,并在两个环境之间移动,以平衡网络设计中的问题。研究进展通过介绍其应用背景下的理论进展的专门课程以及讲授这些研究进展背后的基本思想和技术的基础课程被传播到课程中。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Anupam Gupta其他文献
Probing hard color-singlet exchange in pp̄ collisions at √s = 630 GeV and 1800 GeV
探测 √s = 630 GeV 和 1800 GeV pp̄ 碰撞中的硬颜色-单线态交换
- DOI:
- 发表时间:
1998 - 期刊:
- 影响因子:0
- 作者:
B. Abbott;M. Abolins;V. Abramov;B. Acharya;I. Adam;D. Adams;M. Adams;S. Ahn;H. Aihara;G. Alves;N. Amos;E. Anderson;R. Astur;M. Baarmand;V. Babintsev;L. Babukhadia;A. Baden;B. Baldin;S. Banerjee;J. Bantly;E. Barberis;P. Baringer;J. Bartlett;A. Belyaev;S. Beri;I. Bertram;V. Bezzubov;P. Bhat;V. Bhatnagar;M. Bhattacharjee;N. Biswas;G. Blazey;S. Blessing;P. Bloom;A. Boehnlein;N. Bojko;F. Borcherding;C. Boswell;A. Brandt;R. Breedon;R. Brock;A. Bross;D. Buchholz;V. S. Burtovoǐ;J. Butler;W. Carvalho;D. Casey;Z. Casilum;H. Castilla;D. Chakraborty;S. Chang;S. Chekulaev;Wei Chen;Suyong Choi;S. Chopra;B. Choudhary;J. Christenson;M. Chung;D. Claes;A. Clark;W. G. Cobau;J. Cochran;L. Coney;W. Cooper;C. Cretsinger;D. Cullen;M. Cummings;D. Cutts;O. Dahl;K. Davis;K. De;K. D. Signore;M. Demarteau;D. Denisov;S. Denisov;H. Diehl;M. Diesburg;G. D. Loreto;P. Draper;Y. Ducros;L. Dudko;S. Dugad;A. Dyshkant;D. Edmunds;J. Ellison;V. Elvira;R. Engelmann;S. Eno;G. Eppley;P. Ermolov;O. Eroshin;V. Evdokimov;T. Fahland;M. Fatyga;S. Feher;D. Fein;T. Ferbel;G. Finocchiaro;H. Fisk;Y. Fisyak;E. Flattum;G. Forden;M. Fortner;K. Frame;S. Fuess;E. Gallas;A. Galyaev;P. Gartung;V. Gavrilov;T. Geld;R. Genik;K. Genser;C. Gerber;Y. Gershtein;B. Gibbard;B. Gobbi;B. Gomez;G. Gomez;P. Goncharov;J. Solı́s;H. Gordon;L. Goss;K. Gounder;A. Goussiou;N. Graf;P. Grannis;D. Green;H. Greenlee;S. Grinstein;P. Grudberg;S. Grünendahl;G. Guglielmo;J. Guida;J. Guida;Anupam Gupta;S. N. Gurzhiev;G. Gutiérrez;P. Gutierrez;N. Hadley;H. Haggerty;S. Hagopian;V. Hagopian;K. Hahn;R. E. Hall;P. Hanlet;S. Hansen;J. Hauptman;D. Hedin;A. Heinson;U. Heintz;R. Hernández;T. Heuring;R. Hirosky;J. Hobbs;B. Hoeneisen;J. S. Hoftun;F. Hsieh;H. Ting;H. Tong;A. Ito;E. James;J. Jaques;S. Jerger;R. Jesik;T. Joffe;K. Johns;M. Johnson;A. Jonckheere;M. Jones;H. Jöstlein;S. Jun;C. Jung;S. Kahn;G. Kalbfleisch;D. Karmanov;D. Karmgard;R. Kehoe;M. Kelly;S. Kim;B. Klima;C. Klopfenstein;W. Ko;J. Kohli;D. Koltick;A. V. Kostritskiy;J. Kotcher;A. Kotwal;A. Kozelov;E. Kozlovsky;J. Krane;M. Krishnaswamy;S. Krzywdzinski;S. Kuleshov;Y. Kulik;S. Kunori;F. Landry;G. Landsberg;B. Lauer;A. Leflat;Jiang Li;Q. Li;J. Lima;D. Lincoln;S. Linn;J. Linnemann;R. Lipton;F. Lobkowicz;S. Loken;A. Lucotte;L. Lueking;A. Lyon;A. Maciel;R. Madaras;R. Madden;L. Magaña;V. Manankov;S. Mani;H. Mao;R. Markeloff;T. Marshall;M. Martin;K. Mauritz;B. May;A. Mayorov;R. Mccarthy;J. Mcdonald;T. Mckibben;J. McKinley;T. Mcmahon;H. Melanson;M. Merkin;K. Merritt;C. Miao;H. Miettinen;A. Mincer;C. Mishra;N. Mokhov;N. Mondal;H. Montgomery;P. Mooney;M. Mostafá;H. Motta;C. Murphy;F. Nang;M. Narain;V. S. Narasimham;A. Narayanan;H. Neal;J. Negret;P. Némethy;D. Norman;L. Oesch;V. Oguri;E. Oliveira;E. Oltman;N. Oshima;D. Owen;P. Padley;A. Para;Y. M. Park;R. Partridge;N. Parua;M. Paterno;B. Pawlik;J. Perkins;Marco Peters;R. Piegaia;H. Piekarz;Y. Pischalnikov;B. Pope;H. Prosper;S. Protopopescu;J. Qian;P. Z. Quintas;R. Raja;S. Rajagopalan;O. Ramirez;S. Reucroft;M. Rijssenbeek;T. Rockwell;M. Roco;P. Rubinov;R. Ruchti;J. Rutherfoord;A. Sanchez;A. Santoro;L. Sawyer;R. Schamberger;H. Schellman;J. Sculli;E. Shabalina;C. Shaffer;H. Shankar;R. K. Shivpuri;D. Shpakov;M. Shupe;H. Singh;J. Singh;V. Sirotenko;E. Smith;R. Smith;R. Snihur;G. Snow;J. Snow;S. Snyder;J. Solomon;M. Sosebee;N. Sotnikova;M. Souza;G. Steinbrück;R. Stephens;M. L. Stevenson;D. Stewart;F. Stichelbaut;D. Stoker;V. Stolin;D. Stoyanova;M. Strauss;K. Streets;M. Strovink;A. Sznajder;P. Tamburello;J. Tarazi;M. Tartaglia;T. Thomas;J. Thompson;T. Trippe;P. Tuts;V. Vaniev;N. Varelas;E. Varnes;D. Vititoe;A. Volkov;A. Vorobiev;H. Wahl;G. Wang;J. Warchoł;G. Watts;M. Wayne;H. Weerts;A. White;J. White;J. Wightman;S. Willis;S. Wimpenny;J. Wirjawan;J. Womersley;E. Won;D. Wood;Z. Wu;R. Yamada;P. Yamin;T. Yasuda;P. Yepes;K. Yip;C. Yoshikawa;S. Youssef;J. Yu;Y. Yu;B. Zhang;Y. Zhou;Z. Zhou;Z. H. Zhu;M. Zielinski;D. Zieminska;A. Zieminski;E. Zverev;A. Zylberstejn - 通讯作者:
A. Zylberstejn
The Connectivity Threshold for Dense Graphs
密集图的连接阈值
- DOI:
- 发表时间:
2021 - 期刊:
- 影响因子:0
- 作者:
Anupam Gupta;Euiwoong Lee;Jason Li - 通讯作者:
Jason Li
Efficient cost-sharing mechanisms for prize-collecting problems
针对奖品收集问题的有效成本分摊机制
- DOI:
10.1007/s10107-014-0781-1 - 发表时间:
2015 - 期刊:
- 影响因子:2.7
- 作者:
Anupam Gupta;J. Könemann;S. Leonardi;R. Ravi;G. Schäfer - 通讯作者:
G. Schäfer
Chasing convex bodies with linear competitive ratio (invited paper)
线性竞争比追逐凸体(特邀论文)
- DOI:
10.1145/3406325.3465354 - 发表时间:
2021 - 期刊:
- 影响因子:0
- 作者:
C. Argue;Anupam Gupta;Guru Guruganesh;Ziye Tang - 通讯作者:
Ziye Tang
Anupam Gupta的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Anupam Gupta', 18)}}的其他基金
Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization
协作研究:AF:媒介:算法遇见机器学习:减轻优化中的不确定性
- 批准号:
2422926 - 财政年份:2024
- 资助金额:
$ 25.1万 - 项目类别:
Continuing Grant
NSF: STOC 2024 Conference Student Travel Support
NSF:STOC 2024 会议学生旅行支持
- 批准号:
2421504 - 财政年份:2024
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
AF: Small: Towards New Relaxations for Online Algorithms
AF:小:在线算法的新放松
- 批准号:
2224718 - 财政年份:2022
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization
协作研究:AF:媒介:算法遇见机器学习:减轻优化中的不确定性
- 批准号:
1955785 - 财政年份:2020
- 资助金额:
$ 25.1万 - 项目类别:
Continuing Grant
Collaborative Research: AF: Small: Combinatorial Optimization for Stochastic Inputs
合作研究:AF:小:随机输入的组合优化
- 批准号:
2006953 - 财政年份:2020
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
AF: Small: New Approaches for Approximation and Online Algorithms
AF:小:近似和在线算法的新方法
- 批准号:
1907820 - 财政年份:2019
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
CCF-BSF: AF: Small: Metric Embeddings and Partitioning for Minor-Closed Graph Families
CCF-BSF:AF:小:次封闭图族的度量嵌入和分区
- 批准号:
1617790 - 财政年份:2016
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
BSF: 2014414: New Challenges and Perspectives in Online Algorithms
BSF:2014414:在线算法的新挑战和前景
- 批准号:
1540541 - 财政年份:2015
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
AF: Small: Approximation Algorithms for Uncertain Environments and Graph Partitioning
AF:小:不确定环境和图分区的近似算法
- 批准号:
1319811 - 财政年份:2013
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
AF: Small: Future Directions in Approximation Algorithms Research
AF:小:近似算法研究的未来方向
- 批准号:
1016799 - 财政年份:2010
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
相似国自然基金
Research on Quantum Field Theory without a Lagrangian Description
- 批准号:24ZR1403900
- 批准年份:2024
- 资助金额:0.0 万元
- 项目类别:省市级项目
Cell Research
- 批准号:31224802
- 批准年份:2012
- 资助金额:24.0 万元
- 项目类别:专项基金项目
Cell Research
- 批准号:31024804
- 批准年份:2010
- 资助金额:24.0 万元
- 项目类别:专项基金项目
Cell Research (细胞研究)
- 批准号:30824808
- 批准年份:2008
- 资助金额:24.0 万元
- 项目类别:专项基金项目
Research on the Rapid Growth Mechanism of KDP Crystal
- 批准号:10774081
- 批准年份:2007
- 资助金额:45.0 万元
- 项目类别:面上项目
相似海外基金
Collaborative Research: CPS: Medium: An Online Learning Framework for Socially Emerging Mixed Mobility
协作研究:CPS:媒介:社会新兴混合出行的在线学习框架
- 批准号:
2401007 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: CMOS+X: A Device-to-Architecture Co-development and Demonstration of Large-scale Integration of FeFET on CMOS for Emerging Computing Applications
合作研究:CMOS X:用于新兴计算应用的 CMOS 上大规模集成 FeFET 的设备到架构联合开发和演示
- 批准号:
2404874 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: EAGER: Towards Safeguarding the Emerging Miniapp Paradigm in Mobile Super Apps
合作研究:EAGER:捍卫移动超级应用中新兴的小应用范式
- 批准号:
2330265 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
D-ISN/Collaborative Research: Early Warning Systems for Emerging Epidemics of Illicit Substances
D-ISN/合作研究:非法物质新出现流行病的早期预警系统
- 批准号:
2240409 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: Characterizing the emerging field of departmental change and empowering an inclusive network of practitioners
协作研究:描述部门变革的新兴领域并增强包容性从业者网络
- 批准号:
2315407 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: Characterizing the emerging field of departmental change and empowering an inclusive network of practitioners
协作研究:描述部门变革的新兴领域并增强包容性从业者网络
- 批准号:
2315405 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: ELET2: Engaged Learning Environment for Emerging Transportation Technologies
合作研究:ELET2:新兴交通技术的参与式学习环境
- 批准号:
2315451 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: Transformation, interaction and toxicity of emerging 2D nanomaterials free-standing and embedded onto nanocomposite membranes for PFAS degradation
合作研究:新兴二维纳米材料独立式和嵌入纳米复合膜上用于 PFAS 降解的转化、相互作用和毒性
- 批准号:
2228033 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
SPX: Collaborative Research: Scalable Neural Network Paradigms to Address Variability in Emerging Device based Platforms for Large Scale Neuromorphic Computing
SPX:协作研究:可扩展神经网络范式,以解决基于新兴设备的大规模神经形态计算平台的可变性
- 批准号:
2401544 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant
Collaborative Research: Transformation, interaction and toxicity of emerging 2D nanomaterials free-standing and embedded onto nanocomposite membranes for PFAS degradation
合作研究:新兴二维纳米材料独立式和嵌入纳米复合膜上用于 PFAS 降解的转化、相互作用和毒性
- 批准号:
2227942 - 财政年份:2023
- 资助金额:
$ 25.1万 - 项目类别:
Standard Grant