Gain graphs are graphs in which each edge has a gain (a label from a group, say ?, so that reversing the direction, inverses the gain). In this paper we take a generalized view of gain graphs in which the label of an edge is related to the label of the reverse edge by an involution. Applying selectors to gain graphs is a generalization of vertex-switching (or Seidel switching) of an undirected ...

We present an almost all-optical node architecture suitable for on-the-fly packet and burst switching without losses. The operation of the node is based on wavelength converters for mapping the incoming to the outgoing links, and for intra-node contention resolution. The node can be built out of commercially available equipment, and is easily scalable, with respect to the number of its incoming...

This paper addresses the issues of stability and L2-gain analysis for switched systems via multiple Lyapunov function methods. The proposed necessary and sufficient conditions enable derivation of improved stability tests, an L2gain characterization and a design method for state-dependent stabilizing switching laws.

We survey recent work on competition in markets in which consumers have costs of switching between competing firms' products. In a market with switching costs (or "brand loyalty"), a firm's current market share is an important determinant of its future profitability. We examine how the firm's choice between setting a low price to capture market share, and setting a high price to harvest profits...

In the spirit of the light switching game of Gale and Berlekamp, we define a light switching game based on permutations. We consider the game over the integers modulo k, that is, with light bulbs in an n × n formation, having k different intensities cyclically switching from 0 (off) to (k − 1) (highest intensity) and then back to 0 (off). Under permutation switching, that is, adding a permutati...

Due to limited available photonic devices, optical networks in the near future will likely employ routing schemes that do not require sophisticated processing of optical packets. In this paper, we propose a novel self-routing scheme for all-optical packet networks that can be applied to networks with arbitrary topology. The proposed routing scheme requires only single bit processing and can be ...

Considerations on the use of a Service Identifier in Packet Headers Status of this Memo This memo provides information for the Internet community. It does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This memo describes some considerations relating to the use of IP protocol number fields and payload protocol (e.g., TCP) port fields to identify p...

Task switching and short-term retention: The role of memory load in task switching performance