Sciweavers

154 search results - page 2 / 31
» Routing for Relief Efforts
Sort
View
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
13 years 5 months ago
An Agent-Based Best Effort Routing Technique for Load Balancing
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...
Sunilkumar S. Manvi, Pallapa Venkataram
INFOCOM
1997
IEEE
13 years 9 months ago
Re-Routing in Circuit Switched Networks
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
Eric W. M. Wong, Andy K. M. Chan, Tak-Shing Peter ...
ICC
2007
IEEE
134views Communications» more  ICC 2007»
13 years 12 months ago
Joint On-Demand Routing and Spectrum Assignment in Cognitive Radio Networks
— In Cognitive Radio Networks, nodes can work on different frequency bands. Existing routing proposals help nodes select frequency bands without considering the effect of band sw...
Geng Cheng, Wei Liu, Yunzhao Li, Wenqing Cheng
GLOBECOM
2007
IEEE
13 years 9 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
JOIN
2006
128views more  JOIN 2006»
13 years 5 months ago
Galo: a Deployable Framework for Providing Better than Best-Effort Quality of Service
In this paper we propose a deployable approach to improving QoS by using a generic, extendable, overlay architecture; the Generalized Application Layer Overlay (GALO). The goals of...
Raheem A. Beyah, Raghupathy Sivakumar, John A. Cop...