Method for determining optimal route to deliver packet from source node via relay nodes to destination node

Matthew Brand,Petar Maymounkov,Andreas F Molisch, アンドレアス・エフ・モリッシュ, ペタール・マイモウンコフ, マッシュー・ブランド

user-5fe1a78c4c775e6ec07359f9(2009)

引用 12|浏览2
暂无评分
摘要
PROBLEM TO BE SOLVED: To provide a routing method for determining a route that has a guaranteed minimal amount of delay. SOLUTION: In a network, an optimal route to deliver a packet from a source node via relay nodes to a destination node is determined. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is compared with a deadline time, and the probabilities are scaled accordingly until the minimal delay route becomes an optimal route. COPYRIGHT: (C)2010,JPO&INPIT
更多
查看译文
关键词
Network packet,Relay,Computer network,Computer science,Arrival time,Graph,Optimal route
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要