1The classic Dynamic Source Routing (DSR) protocol opts for the route requiring the lowest number of hops for transmitting data from the source to the destination. However, owing t...
Delay-tolerant network architectures exploit mobile devices carried by users to enable new networked applications. Efficiently routing information through these DTNs faces new cha...
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the...
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
Abstract—This paper examines the network interdomain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points. Internet ...
In optical transport networks algorithms dealing with the lightpath selection process select routes and assign wavelengths based on the routing information obtained from the networ...
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
The Internet consists of many self-administered and inter-connected AutonomousSystems(ASms). ASms exchangeinter-AS routing information with each other via the Border Gateway Protoc...
— Structured peer-to-peer systems have emerged as infrastructures for resource sharing in large-scale, distributed, and dynamic environments. One challenge in these systems is to...
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...