
	Where results make sense

Topic: Adaptive Routing

Related Topics

Routing

Number theory

Jammu and Kashmir

In the News (Fri 5 Sep 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	Routing - Wikipedia, the free encyclopedia
		Routing directs forwarding, the passing of logically addressed packets from their source toward their ultimate destination through intermediary nodes, called routers.
		Routing differs from bridging in its assumption that addresses are structured so that similar addresses are close together in the network, allowing the route to a group of addresses to be represented with a single routing table entry.
		Routed protocol: Any network protocol that provides enough information in its network layer address to allow a packet to be forwarded from one host to another host based on the addressing scheme.
	en.wikipedia.org /wiki/Routing (1259 words)

	Adaptive routing - Wikipedia, the free encyclopedia
		Adaptive routing describes the capability of a system, through which routes are characterised by their destination, to alter the path that the route takes through the system in response to a change in conditions.
		The term is commonly used in data networking to describe the capability of a network to 'route around' damage, such as loss of a node or a connection between nodes, so long as other path choices are available.
		Systems that do not implement adaptive routing are described as using static routing, where routes through a network are described by fixed paths (statically).
	en.wikipedia.org /wiki/Adaptive_Routing (256 words)

	Schemes for Adaptive QoS Routing
		Route selection: We used static routing, whereby paths are determined once at the beginning of the run and the cost of a path is the number of hops.
		The threshold for the decomposition algorithm was 4 for the case of static routing and 8 for the case of dynamic routing.
		Note that the routing table sizes presented in Table 1 are the sum of all the routing table entries over all the nodes, which has to be compared with the roughly 28,000 of the original system to account for the 280 edges/links used in the topological examples replicated on all 100 nodes.
	www.isoc.org /inet99/proceedings/4j/4j_1.htm (2797 words)

	archives: Utility-Theoretic Heuristics for Intelligent Adaptive Routing in Large Communcation Networks
		A routing algorithm has to, among other things, select at each node, for each message received by, or originating at that node, a neighboring node to which the message is to be sent (unless the receiving node happens to be the destination).
		Thus, the routing decisions, in practice, have to be based on knowledge of network state over a local neighborhood supplemented perhaps by a summary of the network state as viewed from a given node.
		If routing decisions are based on the preference ordering induced by in an otherwise uniform cost network with a single hotspot, every message originating in a source and a destination that correspond to a source-hotspot destination placement described in Case 3 is guaranteed to be propagated along an optimal path between to.
	archives.cs.iastate.edu /documents/disk0/00/00/01/06/index.html (7047 words)

	WatchGuard LiveSecurity
		Dynamic routing is distinguished from static routing, where hosts and gateways use pre-configured tables that describe the interfaces and gateways across which packets are forwarded towards their destinations.
		Adaptive routing means that systems participating in routing adjust for situations where connectivity between networks is interrupted, either from the loss of a router or the loss of a communications link.
		Document what routing protocol you are using, what type of measurement you use to identify the cost of transiting a link (e.g., delay, hop), subnet addressing and masks of each network, IP addresses assigned to each router interface, and all IGP-specific routing parameters (these probably depend on your router vendor).
	www.corecom.com /external/livesecurity/routing2.htm (1603 words)

	ROUTING-IN-OPTICAL-NETWORKS
		The central responsibility of the WDM routing protocol is to ensure that the information required for route assignment and wavelength assignment is maintained by the network in a scalable manner.
		In contrast, fixed alternate routing attempts to address the shortcomings of fixed routing by augmenting each entry in the routing table to be a prioritized set of paths from source to destination, rather than just a single one.
		To summarize, the responsibility of an optical routing protocol is to facilitate lightpath establishment between OXC switches, i.e.
	www.cmf.nrl.navy.mil /ccs/project/public/DC/web/projects/tron/pdcs2000/html/paper1.html (3435 words)

	Adaptive routing method for a dynamic network - US Patent 6667957 (Site not responding. Last check: 2007-10-31)
		Shortest path routing techniques seek to route traffic over the "least cost" path to the destination (often times the shortest path measured in hop count), an approach that optimal routing theory indicates is favorable during periods of light traffic.
		Route erasure is initiated when a node perceives that it has detected a network partition.
		While the key concept of TORA is the maintaining routes function, a function which is simply a new algorithm in the same general class of known algorithms (and thus inherits the properties of that class), the entire protocol includes other mechanisms which place it outside this class of algorithms.
	www.patentstorm.us /patents/6667957.html (8754 words)

	[No title]
		To implement this routing by fields, a further analogy is then drawn between the behavior of fields and that of analog circuitry.
		The Brownian motion of Field Routing starts with a message at a ``cool'' temperature and only ``heats'' it up when it has gotten stuck in a local minimum which is known not to be the intended destination of the message.
		Routing such as that utilized by the MIT J-Machine [DS87] requires little silicon to implement and is very fast.
	www.cs.caltech.edu /research/ic/transit/tn14/tn14.html (7049 words)

	Adaptive Routing in Mesh-Connected Networks - Glass, Ni (ResearchIndex) (Site not responding. Last check: 2007-10-31)
		Abstract: Wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topologies.
		Previous routing algorithms for meshes have been either deadlock free and nonadaptive or deadlock free and adaptive at the expense of adding physical or virtual channels.
		Our model for designing adaptive, deadlock-free routing algorithms is based on analyzing the directions in which packets can turn in a mesh.
	citeseer.ist.psu.edu /glass92adaptive.html (570 words)

	LSU EE 4720 Lecture Notes
		Adaptive Routing Path chosen based on network conditions (and source and desto too, of course).
		Unrestricted (a.k.a., Fully Adaptive) Routing Adaptive routing in which any neighboring node can be used in path.
		For oblivious routing, jR(q; d)j = 1, where q 2 Q is a link buffer and d 2 hN i is a destination.
	www.ece.lsu.edu /ee7725/1997/lsli03_5.html (1784 words)

	Adaptive routing in a parallel computing system - Patent 5181017
		A multi-dimensional, multi-nodal routing mechanism is described for relaying information from node to node using a header consisting of route descriptor bits.
		The routing is architected to dynamically adapt to changing network conditions including congestion and inoperative links using an alternative route when required and no buffering of messages is employed.
		The routing mechanism, processor and memory can be selected from any of a variety of commonly used processors and memory, such as the 80386 processor and compatible memory.
	www.freepatentsonline.com /5181017.html (6108 words)

	Adaptive Routing in Wireless Communication Networks using Swarm Intelligence - Arabshahi, Gray, Kassabalidis, ... (Site not responding. Last check: 2007-10-31)
		Abstract: this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.
		The aim of intelligent network routing is to detect dynamic traffic and topology events, thus identifying network bottlenecks, addressing them in an adaptive, intelligent manner, and therefore maintaining a desired Quality of Service (Update)
		Adaptive Routing in Wireless Communication Networks using Swarm Intelligence.
	citeseer.ist.psu.edu /arabshahi01adaptive.html (754 words)

	Adaptive Routing in Wireless Communication Networks using Swarm Intelligence - Arabshahi, Gray, Kassabalidis, ... (Site not responding. Last check: 2007-10-31)
		13 Mobile agents for adaptive routing - Di Caro, Dorigo - 1998 ACM
		9 Ant colonies for adaptive routing in packet-switched communi..
		1 Distributed reinforcement agents for adaptive routing in com..
	citeseer.ist.psu.edu /520326.html (754 words)

	Effect of grouped adaptive routing (Site not responding. Last check: 2007-10-31)
		With deterministic routing, routing channels are evenly spread across the centre stage links.
		Using grouped adaptive routing results in a nearly 20% higher saturation network throughput as well as lower average latencies.
		This is because the adaptive routing technique minimises the effects of load imbalance, thereby allowing a better utilisation of the links to the centre stage of the Clos network.
	hsi.web.cern.ch /HSI/dshs/publications/rt97/html/node9.html (160 words)

	[No title] (Site not responding. Last check: 2007-10-31)
		Although there are previous methods for computing the traffic equilibria of self adaptive routing (e.g., selfish routing), these methods use computationally demanding algorithms and require that a precise analytical model of the network be given.
		Also, it remains an open question how to design an adaptive routing scheme which ensures convergence to traffic equilibria in practice.
		In this paper we propose a simple, efficient, distributed probabilistic routing scheme for self adaptive routing in dynamic, realistic environments.
	www.cs.yale.edu /homes/yry/research/TechReports/XQYZ04.bib.txt (173 words)

	Journal of the ACM Bibliography (Site not responding. Last check: 2007-10-31)
		Adaptive routing allows more freedom in the paths taken by messages, spreading load over physical channels more evenly.
		We describe a family of deadlock-free routing algorithms called planar-adaptive routing algorithms, that require only a constant number of virtual channels independent of networks size and dimension.
		Planar-adaptive routing algorithms reduce the complexity of deadlock prevention by reducing the number of choices at each routing step.
	theory.lcs.mit.edu /~jacm/References/chienk1995:91.html (391 words)

	A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks - Park, Corson (ResearchIndex) (Site not responding. Last check: 2007-10-31)
		The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed l i nk reversals.
		The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks.
		Park and M. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in IEEE Infocom, 1997.
	citeseer.ist.psu.edu /park97highly.html (523 words)

	Caltech Computer Science Technical Reports - A Critique of Adaptive Routing
		Pertel, Michael J. A Critique of Adaptive Routing.
		Simulation results are presented that show dimension-order routing achieves both higher throughput and lower latency than adaptive routing.
		Specious claims for the advantages of adaptive routing are critiqued.
	caltechcstr.library.caltech.edu /102 (88 words)

	Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks - Dolev, Kranakis, Krizanc, Peleg (ResearchIndex) (Site not responding. Last check: 2007-10-31)
		We rank dynamic routing schemes by their adaptability, i.e., the maximum number of sites to be updated upon a topology change.
		We consider the case in which each node in the network may be directly connected with at most ffi neighboring nodes.
		17 Upper and lower bounds for routing schemes in dynamic networ..
	citeseer.ist.psu.edu /30583.html (523 words)

	KALMAN FILTERS (Site not responding. Last check: 2007-10-31)
		A one-step ahead estimation and prediction of the mean arrival process and buffer occupancy is carried using Kalman filters.
		It is shown using a three-node network example that model based estimates of the mean arrival process and the buffer occupancy could be used for making decisions on routing traffic on an alternate link to minimize the queuing delays experienced.
		The Kalman filter was implemented to effectively estimate and predict the state vectors comprising the mean arrival process and buffer occupancy.
	morse.uml.edu /research.d/traffic/kalman.htm (80 words)

	Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
		In particular, for the case of a bounded degree network it is proved that our scheme is optimal in its adaptability by presenting a matching tight lower bound.
		Our bubble routing scheme is a combination of a distributed routing database, a routing strategy, and a routing database update.
		It is shown how to perform the routing database update on a dynamic network in a distributed manner.
	epubs.siam.org /sam-bin/dbq/article/31661 (201 words)

	SHARP Hybrid Ad Hoc Routing Protocol (Site not responding. Last check: 2007-10-31)
		A static network where routes to all nodes are equally in demand all the time calls for a proactive protocol; a dynamic network where a few mobile nodes are the target of most route queries may benefit from a reactive protocol.
		SHARP is a hybrid routing protocol that finds the optimal mix of proactive route dissemination and reactive route discovery.
		Each SHARP node can direct the routing layer to optimize for a different metric, such as overhead, latency or jitter, for routes targeting that node.
	www.cs.cornell.edu /People/egs/sharp (247 words)

	Deadlock Resolution in Networks Employing Connection-Based Adaptive Routing - Turner, Tamir (ResearchIndex) (Site not responding. Last check: 2007-10-31)
		Abstract: Adaptive routing is used in networks in order to achieve fault tolerance and optimize performance for all traffic patterns.
		Most adaptive routing schemes route each packet independently, requiring addressing and sequencing information to be transmitted and processed for each packet.
		Connection-based message transport, such as virtual circuits, reduces the overhead for routing packets through the network and maintain FIFO packets delivery.
	citeseer.lcs.mit.edu /turner96deadlock.html (401 words)

	Tech Report BibTex Entry (Site not responding. Last check: 2007-10-31)
		Three adaptive multicast wormhole routing strategies are proposed and evaluated.
		The methods include minimal partially-adaptive, minimal fully-adaptive, free adaptive multicast wormhole routing algorithms ever proposed, are shown to be deadlock-free.l A study has been conducted that compares the performance of these multicast algorithms.
		The results show that the minumal fully-adaptive routing method creates teh least traffic, however, double vertical channels are required in order to avoid deadlock.
	www.cse.msu.edu /cgi-user/web/tech/document?ID=98&BibTex=Y (165 words)

	CS 105 -- Adaptive Routing (Site not responding. Last check: 2007-10-31)
		THE BEST ROUTES FROM MACHINE TO MACHINE MAY VARY WITH TIME.
		THE "BEST" ROUTE FROM A TO F WOULD NORMALLY BE THROUGH B AND D. The Web:
		This page is part of a section of lecture slides related to " Network Routing " within the topic "The Internet Protocol Suite".
	www.cs.williams.edu /~cs105/f02/outlines/CS105_274.html (74 words)

	[No title] (Site not responding. Last check: 2007-10-31)
		Throughput and delay are defined as: Throughput = EMBED Equation.3 Delay = Sum of (number of clock-ticks taken to complete journey — length for shortest path) for all packets completing their journey Both throughput and delay are calculated in the time interval (tj, tj+10].
		Goal Our goal is to find a routing algorithm which avoids bottlenecks and dropped packets, but still tries to take the shortest path (thus maximizing throughput and minimizng delay).
		Adaptive Routing This algorithm was adapted from the papers “AntNet: A Mobile Agents Approach to Adaptive Routing” and “Routing in telecommunications networks with “smart” ant-like agents”.
	www.contrib.andrew.cmu.edu /~col/pr/papers/Networks.doc (2199 words)

	Adaptive Routing and Wavelength Assignment Using Ant-Based Algorithm (Site not responding. Last check: 2007-10-31)
		Abstract: We propose a new ant-based algorithm for solving the dynamic routing and wavelength assignment (RWA) problem in WDM optical networks under the wavelength continuity constraint.
		To facilitate the ants' foraging task, we adopt in our algorithm a routing table with the probability for route selection.
		Simulation results on ns-2 simulator indicate that the proposed algorithm can adapt well to the traffic variations and it is much better than the fixed routing algorithm and also outperforms the fixed-alternate routing algorithm in terms of blocking probability.
	www.hori.ecei.tohoku.ac.jp /paper/abst04/ngo2.html (132 words)

	IngentaConnect Adaptive Packet Routing for Bursty Adversarial Traffic (Site not responding. Last check: 2007-10-31)
		One of the central tasks of networking is packet routing when edge bandwidth is limited.
		More precisely, we consider an adversary who injects packets, with only their destinations specified, into network nodes in a continuous manner subject to certain limitations on the injection rate.
		The question whether it is possible to deal with such an adversary and to design protocols that would discover routes which avoid traffic jams so that nodes only store a bounded number of packets was left as an open problem by Andrews et al.
	www.ingentaconnect.com /content/ap/ss/2000/00000060/00000003/art01681 (359 words)

Try your search on: Qwika (all wikis)