Routing is fundamental to the workings of the internet, yet the basic routing protocol, Border Gateway Protocol (BGP), is known to be insecure. This paper uses institutional economics to examine internet routing registries, which are used by network operators to mitigate the security flaws in BGP. Secure routing of internet traffic is characterised as a problem in the distributed governance of ...

ETRI Journal, Volume 33, Number 5, October 2011 This paper proposes hybrid distributed stochastic addressing (HDSA), which combines the advantages of distributed addressing and stochastic addressing, to solve the problems encountered when constructing a network in a ZigBee-based wireless sensor network. HDSA can assign all the addresses for ZigBee beyond the limit of addresses assigned by the e...

Advances in low-power electronics design and wireless communication have enabled the development of low cost, low power micro-sensor nodes. These sensor nodes are capable of sensing, processing and forwarding which have many applications such as underwater networks. In underwater wireless sensor networks (UWSNs) applications, sensors which are placed in underwater environments and predicted ena...

Distributed interactive multimedia applications such as video conferencing and virtual collaboration applications typically involve frequent interactions among multiple distributed parties. These applications require an efficient networking support such as core-based routing with Quality of Service (QoS) support. Typical core-based routing selects one router as a core for a multicast group and ...

In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...

We describe a system that provides query based associative access to the contents of distributed information servers. In typical distributed information systems there are so many objects that underconstrained queries can produce large result sets and extraordinary processing costs. To deal with this scaling problem we use content labels to permit users to learn about available resources and to ...

The omnicast problem addresses the need of uniform information dispersal in a group of individual nodes (robots), that is, every robot needs to receive (and process) the observations processed by everybody else. The time (or the number of schedule slots) it takes to exchange all distributedly collected information between all nodes/robots is a critical limiting factor for almost all practical s...

We provide an overview of the evolution of routing from its origins, even before the ARPANET, to recent algorithms that provide some Quality of Service, focusing on unicast distributed routing algorithms. We start our scheme with shortest path routing and optimal routing and conclude it with constrained routing protocols as well as a quick review of Ad-Hoc Routing protocols. KeywordsBest-effort...

A mobile ad hoc Network (MANET) is a mobile mesh network in which mobile wireless nodes are both hosts and routers so they can communicate without base stations. Because of this cooperative routing capability, MANETs have envisioned for military and emergency communication, but become more vulnerable to routing attacks than wired networks. If a malicious node propagates forged routing informati...

Satellite networks have been widely investigated both in the business and academia for many years, with many important routing algorithms reported in the literatures. However, fewer existing routing algorithms focus on the trade-off between the routing survivability and the routing computation and storage overheads. Due to topological dynamics, it is difficult to effectively apply the conventio...