Merger Notes Revised

Efficiently route or request data among entites.
Topology of network is dynamic due to intermittent connections.
There always requires an flooding sort of algos for going to p2p side, but raises the scalability problems. Need to take things from application layer to network layer as the P2P and MANET ranges the same. Good sign is CORBA framework proposed in my previous paper also ranges the same hence all issues can be taken into consideration and solutions can be mergerd with the disconnection, swizzling, mobility (I and II) layers. Mobility layer is going to work extensively in the revised version.

Peers should communicate to each other periodically.
These protocols should be triggered more frequently for MANET.
I can convert MHR into a neighbour tablefor nearest keys for DHT, that would imporve robustness and they need to be updates periodically.

Discovery mechanism

Rship Approach: Forward discovery queries using similarity, history and random Rships.
Updating Rships can be the activity performed while migration of servants.
Acquiring Rships can be performed as conduction process.
Discovery result backtracking would make system to learn much quicker.
Tradeoffs are overheads in all above operations.

Does above works better than Distributed Hash Table? Consider two cases for comparision: a) when the queries are similar and b) when queries are random.

Flooding: Obviously, it is going to take too much bandwidth, so it arises scalability issues.

Distributed Hash Table Algorithms: In this systems, every entity(file) and peer are assigned a unique key by a hash function. The keys along with the network addresses of peer storing the files are evenly distributed among all participating peers. Each peer maintains a routing table and queries are forwarded to only those peers which are listed in the routing table.

Need to exploit synergy

Need for a decentralized and self organized discovery algorithm that can leverge with the servants and device migration.
A tranformation algorithm which would make Nomadic to MANET, an algorithm that should exploit a synergy between P2P overlay networks and Mobile Ad-hoc Networks using an approach of Distributed Hash Table.

Migration from Nomadic to MANET

Does IOR distribution mechanism relates to p-p discovery algos, Flooding ,CAN, CHORD or Pastry? Nope, cuz as they are content algos, thats why they can work with Pure P-P and P-P with discovery.

Entities MG, MH, and FC are workable in P-P environment? To start with, MH and FC are obviously different entities. But yeah, MHs and FCs can be combined to work in P-P envirnment.

Do I require Discovery algorithms? Yes.

Which discovery algorithm suits the framework well ?

What after discovery? As they discover, then framework can go for Content based algorithms (in case services are different), and then go for IOR distribution. In case if services are same then framework can directly distribute the IOR.

In process of servant migration, as the client IOR gets dirty, then in case of P-P or MANET how framework would manage the old IOR context?

There requires a need for Async communication or real time message propagation

P2P algorithms

Ubicomputing Killer Apps

Traffic Management Domain:

• An accident warning service provided by a crashed car to approaching vehicles.
• A warning service provided by an ambulance rushing to an accident side to inform nearby vehicles to yield the right of way.

Business Domain:

• A service provided by the lead of meeting to get poll information from attendes, registering the persons attending the meeting.

Service Domain:

• Personal information service hosted on PDAs.