The authors consider a communication network shared by several selfish users. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a noncooperative game. They investigate the Nash equilibrium of such systems. For a two-node multiple links system, uniqueness of the Nash equilibrium is proven under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, these convexity conditions are not sufficient for guaranteeing uniqueness, and a counterexample is presented. Nonetheless, uniqueness of the Nash equilibrium for general topologies is established under various assumptions. >

Competitive routing in multiuser communication networks

The present invention concerns a new category of integrated circuitry and a new methodology for adaptive or reconfigurable computing. The preferred IC embodiment includes a plurality of heterogeneous computational elements coupled to an interconnection network. The plurality of heterogeneous computational elements include corresponding computational elements having fixed and differing architectures, such as fixed architectures for different functions such as memory, addition, multiplication, complex multiplication, subtraction, configuration, reconfiguration, control, input, output, and field programmability. In response to configuration information, the interconnection network is operative in real-time to configure and reconfigure the plurality of heterogeneous computational elements for a plurality of different functional modes, including linear algorithmic operations, non-linear algorithmic operations, finite state machine operations, memory operations, and bit-level manipulations. The various fixed architectures are selected to comparatively minimize power consumption and increase performance of the adaptive computing integrated circuit, particularly suitable for mobile, hand-held or other battery-powered computing applications.

Adaptive integrated circuitry with heterogeneous and reconfigurable matrices of diverse and adaptive computational units having fixed, application specific computational elements

In early November 1988 the Internet, a collection of networks consisting of 60,000 host computers implementing the TCP/IP protocol suite, was attacked by a virus, a program which broke into computers on the network and which spread from one machine to another. The authors present a detailed analysis of the virus program. The describe the lessons that this incident has taught the Internet community and topics for future consideration and resolution. A detailed routine-by-routine description of the virus program, including the contents of its built-in dictionary is provided. >

/pdf/with-microscope-and-tweezers-an-analysis-of-the-internet-4dn0kwqoj3.pdf

With microscope and tweezers: an analysis of the Internet virus of November 1988

The present invention concerns configuration of a new category of integrated circuitry for adaptive computing. The various embodiments provide an executable information module for an adaptive computing engine (ACE) integrated circuit and may include configuration information, operand data, and may also include routing and power control information. The ACE IC comprises a plurality of heterogeneous computational elements coupled to an interconnection network. The plurality of heterogeneous computational elements include corresponding computational elements having fixed and differing architectures, such as fixed architectures for different functions such as memory, addition, multiplication, complex multiplication, subtraction, configuration, reconfiguration, control, input, output, and field programmability. In response to configuration information, the interconnection network is operative to configure the plurality of heterogeneous computational elements for a plurality of different functional modes.

Apparatus, method, system and executable module for configuration and operation of adaptive integrated circuitry having fixed, application specific computational elements

A communication network shared by several selfish users is considered. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a noncooperative game. The Nash equilibrium of such systems is investigated. For a two-node multiple-link system, the uniqueness of the Nash equilibrium is proved under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, the uniqueness of the Nash equilibrium is established under various assumptions. >

Competitive routing in multi-user communication networks

Armies of spiders could not weave a wider web networks are everywhere. Networks span continents and oceans; tie office buildings in iiles of wire, fiber, and other nerse media; reach into land, air, and space vehicles; and confront microcomputers as well as large maint'rame computers. Someii networks are incredibly fast and others are pragmatically slow; some work better than others, and some do not work well at all. However, despite the present abundance, new networks are still being developed coinstantly to challeinge the competitioni. If' we had a way to initerconnect various networks, many problems could be solved. For example, a user may want to comiimuilicate with a site that is not on the same public network as the host computer. Perhaps there are sev eral hosts but no single network to which they will all coinnect. In some cases, the cost of coninection will be a factor; coninecting 100 hosts on a coaxial local net is more cost-effective than putting them all on a public net, but running 1000 miles of coaxial cable to the 101st host is ab.surd. In other cases, pragmatics or the basic laws of nature apply; for example, radio-based networks are about the only choice if mobility is needed. A network technology that supports a maximum of 256 hosts becomies a problenm when you acquire the 257th. G,iven that all hosts caninot be put on a single network, the next best option is to interconniect networks.

Sheltzer

Papers

The DARPA Internet: Interconnecting Heterogeneous Computer Networks with Gateways