Sciweavers

2076 search results - page 79 / 416
» Universal Routing in Distributed Networks
Sort
View
ICDCSW
2008
IEEE
14 years 4 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
TWC
2010
13 years 4 months ago
Clustering and cluster-based routing protocol for delay-tolerant mobile networks
This research investigates distributed clustering scheme and proposes a cluster-based routing protocol for DelayTolerant Mobile Networks (DTMNs). The basic idea is to distributivel...
Ha Dang, Hongyi Wu
ICNP
1997
IEEE
14 years 2 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
NETGAMES
2003
ACM
14 years 3 months ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
ICPPW
2005
IEEE
14 years 3 months ago
A New Multipath Routing Approach to Enhancing TCP Security in Ad Hoc Wireless Networks
— In a typical mobile ad hoc network, mobile computing devices wander autonomously and communicate via temporary links in a self-organized computing system without any central ad...
Zhi Li, Yu-Kwong Kwok