Routing and flow control in high-speed wide-area networks

Article Abstract:

Routing and flow control mechanisms used in local area networks (LANs) and metropolitan area networks (MANs) are not appropriate for wide area networks (WANs). The categories of routing and flow control mechanisms include centralized or distributed control; decisions made at the network's edge or at intermediate nodes; deterministic or stochastic decisions; ability of decision making process to adapt; local or global information; information age; and topological dependence. Combinations of these categories can be used to describe routing and flow control schemes. Routing mechanisms that show enough promise to warrant further study include virtual circuit routing; datagram routing; and fixed routing. The most promising flow control mechanism operates with end-to-end windows, discarding packets in congested parts of the network, and selectively transmitting lost packets.

Wide area networks, Flow Rate, WAN

---

Distributed routing for load balancing

Article Abstract:

One problem in the control of discrete-event systems is how to design routing units for a queueing network made up of several service stations, each of which has its own waiting room, and several arrival streams of tasks, each of which has its own routing unit. Considered here are the amount of information each routing unit should have available at the time of decision so as to perform well. Routing units are assumed to make a decision on where to send an arriving task at the time of the arrival. Open-loop, or feedforward, polices are compared with simple closed-loop, or feedback, policies in which the routing unit at the time of an arrival can look at only one queue length. The lack of online coordination means it is unlikely that an 'optimal policy' will be found, but reasonable performance robustness in terms of service rate changes is provided.

Systems analysis, Control systems, System Design, Discrete Simulation, Scientific Research, Closed-Loop Systems, Queuing Networks, Models of Computation, Event-Driven Systems, Load Balancing, Load balancing (Computers)

---

A Hierarchical Scheme for Multiobjective Adaptive Routing in Large Communication Networks

Article Abstract:

A hierarchical strategy for control of large-scale communications networks attempts to use the tradeoff between routing efficiency and information requirements. The scheme can be adapted to load and topology changes and permits an optimization of network performance in multiple objective functions. Flow control and routing concepts are integrated to control congestion.

Networks, Communications Management, Hierarchical Organization

Similar abstracts:

• Abstracts: Routing and congestion control in common channel Signaling System No. 7. An overview of Signaling System No. 7
• Abstracts: Array pattern control and synthesis. Automatic placement and routing techniques for gate array and standard cell designs
• Abstracts: Neural network models of sensory integration for improved vowel recognition. An Improved Conference Circuit

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.