Routing & Network Knowledge
2011-05-20 20:19
99 查看
This is a technical notes as I read the paper Routing in Delay Tolerant Networks.I should have written these words long before. I hope it is not too late.
In that paper, K. Fall et al. create a set of abstract knowledge oracles, each able to answer questions we ask of them. These oracles are:
Contact Summary Oracle. This oracle can answer question about aggregate statistics of the contacts. In particular, the contacts summary oracle provides the average waiting time until the next contact for an edge. Thus, the contact summary oracle can only respond with time-invariant or summary characteristics about contacts.
Contact Oracle. This oracle can answer any question regarding contacts between two nodes at any point in time. This is equivalent to knowing the time-varying DTN multi-graph. The contacts summary oracle can be constructed using the contacts oracle, but not vice versa.
Queuing Oracle. This oracle gives information about instantaneous buffer occupancies(queuing) at any node at any time and can be used to route around congested nodes.(Most difficult oracle to realize in a distributed system)
Traffic Demand Oracle. This oracle can answer any question regarding the present or future traffic demand. It is able to provide the set of messages injected into the system at any time.
Routing algorithms fall into 3 classes:
Zero Knowledge.(First Contact)
Partial Knowledge.(no traffic demand oracle)
Complete Knowledge.
Computing Shortest(minimum cost) PathDelay Component:1,queuing delay;2,transmission delay;3,propagation delay.Given that edge capacities and propagation delays vary with time, we also expect route selection to vary with time. If edge cost is time-invariant, we can use Dijkstra's shortest path algorithm.
In that paper, K. Fall et al. create a set of abstract knowledge oracles, each able to answer questions we ask of them. These oracles are:
Contact Summary Oracle. This oracle can answer question about aggregate statistics of the contacts. In particular, the contacts summary oracle provides the average waiting time until the next contact for an edge. Thus, the contact summary oracle can only respond with time-invariant or summary characteristics about contacts.
Contact Oracle. This oracle can answer any question regarding contacts between two nodes at any point in time. This is equivalent to knowing the time-varying DTN multi-graph. The contacts summary oracle can be constructed using the contacts oracle, but not vice versa.
Queuing Oracle. This oracle gives information about instantaneous buffer occupancies(queuing) at any node at any time and can be used to route around congested nodes.(Most difficult oracle to realize in a distributed system)
Traffic Demand Oracle. This oracle can answer any question regarding the present or future traffic demand. It is able to provide the set of messages injected into the system at any time.
Routing algorithms fall into 3 classes:
Zero Knowledge.(First Contact)
Partial Knowledge.(no traffic demand oracle)
Complete Knowledge.
Computing Shortest(minimum cost) PathDelay Component:1,queuing delay;2,transmission delay;3,propagation delay.Given that edge capacities and propagation delays vary with time, we also expect route selection to vary with time. If edge cost is time-invariant, we can use Dijkstra's shortest path algorithm.
相关文章推荐
- Hack Like a Pro: Using Nexpose to Scan for Network & System Vulnerabilities
- Putty出现"Network error:Software caused connection abort"
- POJ 2349&&ZOJ 1914 Arctic Network(kuangbin带你飞 专题六:最小生成树)
- C++ Knowledge series STL & Const
- BAPI_NETWORK_COMP_REMOVE 物料组…
- 【边双连通分量 && LCA】POJ - 3694 Network
- Windows Azure Virtual Network Connect & Traffic Manager Note
- 用户 'NT AUTHORITY/NETWORK SERVICE' 登录失败
- 用户 'NT AUTHORITY/NETWORK SERVICE' 登录失败。
- rimble GeoExplorer® GeoXR™ Network Rover
- Power Network(网络流最大流 & dinic算法 + 优化)
- OTU_Network&calc_otu
- AT&T Global Network Client
- 【POJ 3694】 Network(割边<桥>+LCA)
- 解决ASP.NET错误:用户 'NT AUTHORITY/NETWORK SERVICE' 登录失败
- [Network]Android N 新wifi connect&auto connect流程分析
- 【POJ 3694】 Network(割边<桥>+LCA)
- ASP.NET&nbsp;MVC&nbsp;入门&nbsp;3、Routing
- 前端面试题目future network