Packet Forwarding Algorithms in a Line Network.

Antonios Antoniadis,Neal Barcelo,Daniel Cole,Kyle Fox,Benjamin Moseley,Michael Nugent,Kirk Pruhs

Lecture Notes in Computer Science（2014）

引用 8|浏览43

暂无评分

摘要

We initiate a competitive analysis of packet forwarding policies for maximum and average flow in a line network. We show that the policies Earliest Arrival and Furthest-To-Go are scalable, but not constant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow.

查看译文

关键词

Optimal Schedule, Competitive Ratio, Online Algorithm, Competitive Algorithm, Internet Protocol Address

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要