Tuesday, May 12, 2009
Thursday, November 6, 2008
summary: The paper describes the Internet indirection infrastructure(i3) which offers a rendezvous-based communication abstraction. Basically, i3 decouples the act of sending from the act of receiving through using other identifier mechanism. Some communication primitives to support mobility, multicast and anycast are provided by i3. To demonstrate the feasibility of i3, the authors built an overlay network based on the Chord lookup system.
Summary:The middleboxes like NAT, firewalls and transparent caches are considered to violate the two tenets of the Internet architecture's original principles. To solve the problem, the authors present the delegation-oriented architecture(DOA). DOA uses the globally unambiguous identifier to specify every host in the Internet in which a DHT infrastructure is needed.
Thursday, October 30, 2008
Summary: This paper presents "Chord" using consistent hashing which is designed to let nodes enter and leave the network with minimal disruption. The chord protocol is described clearly in the paper in which some important features like simplicity, provable correctness and provable performance are also discussed. The authors believe that Chord will become a valuable component for peer-to-peer systems.
Background: consistent hashing
1, i feel a little bit lost about Chord's Scalable Key Location. How Chord makes it?
2, in another paper the authors talked about DHT, but in Chord it doesn't talk anything about DHT. Cause i am not familiar with DHT, my question is: Can we say DHT is a consistent hashing technique?
3, is Chord deployed somewhere in current peer-to-peer systems? Based on this paper, Chord should attract lots of attention from the peer-to-peer systems' designers.
Monday, October 27, 2008
Summary: This paper presents RON- resilient overlay network which tights the applications and routing to let end-to-end communications be unaffected in face of path outlets. RON is a novel way to deal with the underlying network protocol's problems, especially BGP's long convergence time caused by link failures.
This is a very good paper which has been cited by 1185 times. I think the following reasons which let this paper be so popular:
1, No matter RON is practical or not, the idea in it is quite new that tries to solve underlying network problems in the end user perspective. (a new story of End to End argument?)
2, Real data from real world. The author deployed 16 RON nodes in the Internet and got convincing results to show the RON's effectiveness.
3, Authors themselves has realized the RON's problems and explained them clearly in paper.
Thursday, October 9, 2008
Summary: this paper presents ExOR which basically lets one node to send packets to several nodes and then chooses one of these nodes continues to send to several nodes till the packets reach the destination. There are several challenges in ExOR. Authors built a packet format to solve these challenges. Through experiments on Roofnet, ExOR makes a big improvement on throughput than traditional routing scheme.
this is a good paper and really smart idea.
1, is ExOR really practical?
2, i do think there are too much stuff in the ExOR packet header. Is it a good solution to augment the packet header?
Tuesday, October 7, 2008
Summary: this paper presents a new path metric called Estimated Transmission Count(ETX) which can be used to find higher throughput paths than using minimum-hop-count. The author briefly described DSDV and DSR and made them be capable to incorporate ETX.
1, what is motivation for finding the higher throughput paths?