Experimental & Theoretical Study of Congestion Control Protocols

实验性的

• 批准号: 9116177
• 负责人: Amarnath Mukherjee
• 金额: $ 8万
• 依托单位: University of Pennsylvania
• 依托单位国家: 美国
• 项目类别: Continuing grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-09-01 至 1994-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9116177&HistoricalAwards=false
• 关键词: Experimental; & Theoretical; Study; Congestion

The research will develop performance analysis tools and methodologies for congestion control protocols in computer networks. The work includes a detailed study of a Fokker-Planck system, developed by the principal investigator in previous work, using finite difference schemes to solve the Fokker-Planck equations more efficiently and accurately. The study will include delayed feedback in the system, a detailed study of time series models of the Internet round trip delays. It will also include an investigation of statistical models correlating round trip delays with network congestion, a mapping of the real world network parameters, and a comparison of alterative flow control protocols, including both rate based window based algorithms. The rate based algorithms planned for this study are the Dynamic Time Window Protocol, dynamic version of the Leaky Bucket Protocol and the Packet Pair Protocol. The switch schedules will be varied across Fair Queueing, Virtual Clock, Generalized Virtual Clock. Non-work- conserving versions of Generalized Virtual Clock, FCFS Drop Tail and FCFS Random Drop.

该研究将为计算机网络中的拥塞控制协议开发性能分析工具和方法。 这项工作包括对由主要研究者在之前的工作中开发的福克-普朗克系统的详细研究，使用有限差分格式更有效、更准确地求解福克-普朗克方程。 该研究将包括系统中的延迟反馈，详细研究互联网往返延迟的时间序列模型。 它还将包括对往返延迟与网络拥塞相关的统计模型的研究、现实世界网络参数的映射以及替代流量控制协议的比较，包括基于速率的基于窗口的算法。 本研究计划的基于速率的算法是动态时间窗口协议、漏桶协议和数据包对协议的动态版本。 公平队列、虚拟时钟、通用虚拟时钟的切换时间表将有所不同。 通用虚拟时钟、FCFS Drop Tail 和 FCFS Random Drop 的非工作保存版本。