We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
A considerable amount of effort in the DIS community has been devoted to developing efficient, scaleable, mechanisms for distributing state updates and interaction information in ...
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
Abstract— Opportunistic Networks (ONs) are a newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unplanned contacts among nodes to share in...
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...