
	Where results make sense

Topic: Nonblocking minimal spanning switch

Related Topics

Bubble sort

List of algorithms

Shortest path problem

	Banyan switch - Wikipedia, the free encyclopedia
		Banyan Switches are complex crossover switches used in electrical or optical switches.
		Logical banyan switches are used in logic or signal pathways to crossover switching of signals onto new pathways.
		Their complexity depends on the topology of the individual switches in a switch matrix (how wide it is by how many 'plies' or layers of switches it takes), to implement your desired crossover logic.
	en.wikipedia.org /wiki/Banyan_switch (412 words)

	Cisco Systems Designing Switched LAN Internetworks
		A LAN switch is a device that typically consists of many ports that connect LAN segments (Ethernet and Token Ring) and a high-speed port (such as 100-Mbps Ethernet, Fiber Distributed Data Interface [FDDI], or 155-Mbps ATM).
		The fundamental difference between a LAN switch and a router is that the LAN switch operates at Layer 2 of the OSI model and the router operates at Layer 3.
		Switched LAN topologies are susceptible to loops, as shown in Figure 12-6.
	www.alliancedatacom.com /manufacturers/cisco-systems/framerelay_design/design_switchedlan.asp (9362 words)

	Directly programmable distribution element - US Patent 5634004 (Site not responding. Last check: 2007-10-13)
		The multiplex switching is the physical transfer of a cell from an input port to the output port.
		Label switching is translation of a connection identifier from one valid at the input port to one valid at the output port.
		A minimal signaling path is the one from the bottleneck back to the place where the last data frame which was pushed into the network by the source currently resides.
	www.patentstorm.us /patents/5634004.html (19467 words)

	Learn more about List of algorithms in the online encyclopedia. (Site not responding. Last check: 2007-10-13)
		Kruskal's algorithm: finds a minimum spanning tree for a graph
		Prim's algorithm: finds a minimum spanning tree for a graph
		Nonblocking Minimal Spanning Switch say, for a Telephone exchange
	www.onlineencyclopedia.org /l/li/list_of_algorithms.html (729 words)

	Integrated packetized voice and data switching system - Patent 4958341 (Site not responding. Last check: 2007-10-13)
		Advantageously, the data switching modules, whose inputs are connected to the concentrators, perform all checking and routing functions, while the 1024.times.1024 maximum size space division switch, whose outputs are connected to the concentrators, provides a large fan-out distribution network for reaching many concentrators from each data switching module.
		The data switching modules chain groups of incoming packets destined for a common outlet of the space division switch so that only one connection in that switch is required for transmitting each group of chained packets from a data switching module to a concentrator.
		In accordance with one embodiment of the invention, a packet switch is used for switching voice packet outputs of the data switching modules and a circuit switch, such as the space division switch, is used for switching data packet outputs.
	www.freepatentsonline.com:9003 /4958341.html (20093 words)

	Minimal XHTML 1.1 Document (Site not responding. Last check: 2007-10-13)
		Regeneration allows a firm to create LANs that span very long distances because the data link distance across multiple switches in an Ethernet LAN is almost unlimited because the signal sent from switch to switch is regenerated as a clean signal to the next switch.
		Switches in an Ethernet LAN are organized in a hierarchical topology.
		A nonblocking switch is a switch with aggregate throughput large enough to handle even their highest possible input load.
	home.socal.rr.com /trandall (3704 words)

	[No title]
		The optical nature of the switch provides enormous bandwidth with input/output port rates of the order of Gbits/sec., and the distributed approach is highly modular, creating an easily growable switch.
		In medium to large reconfigurable switches, clustering techniques are required for optimizing the connection diagram among modules and routing traffic through the switch.
		However, simulation results for a switch of size $81 \times 81$ seem to indicate that the traffic-handling capability scales well with the size of the switch when non-uniformity prevails in the offered traffic, a realistic assumption.
	www.cs.columbia.edu /~hgs/bib/net93.bib (5809 words)

	Fan Chung Graham
		Minimal decomposition of all graphs with equinumerous vertices and edges into mutually isomorphic subgraphs, Finite and infinite sets, Vol.
		Minimal decomposition of graphs into mutually isomorphic subgraphs, Combinatorica 1 (1981), 13-24 (with P. Erdös and R. Graham).
		The largest minimal rectilinear Steiner trees for a set of N points enclosed in a rectangle with given perimeter, Network 9 (1979), 19-36 (with F. Hwang).
	math.ucsd.edu /~fan/mypaps/fanpap/papers.htm (2592 words)

	[No title]
		The reason suggested is that otherwise bandwidth is wasted by transmitting fragments of partially dropped packets, which the receiving TCP cannot use.
		In fact ATM switches tend to drop cells from multiple packets when the window increases too much, causing TCP to pause for a long time rather than continuing with a reduced window.
		Each switch estimates the additional fraction of cells lost if a new call would be routed through the switch.
	www.cs.columbia.edu /~hgs/bib/net95.bib (4835 words)

	Wikipedia:Pages_needing_attention/Applied_Arts_and_Sciences (Site not responding. Last check: 2007-10-13)
		Nonblocking Minimal Spanning Switch - Needs work from someone knowledgeable about some of the theoretical underpinnings of telephone networks, things like Clos networks in their rearrangeably nonblocking form.
		There are other problems but I am not familiar enough with the topic (Flanders is both a region in Belgium and a region spanning three countries...).
		there is also a bit, noted on its discussion page, about someone exploring "fifty metres inland" seems to be a verrrry minimal exploration if that measurement is correct.
	www.buyitfast.org /q/Wikipedia:Pages_needing_attention/Applied_Arts_and_Sciences (6767 words)

	SuperStack II Switch Family 10/100/1000 Stackable Switches
		The Switch 9300 learns MAC addresses (up to 16,000) on all ports at a address learning rate of 400,000 addresses per second and by default floods frames with unknown destination addresses to all ports assigned to the source frame's VLAN.
		SuperStack II Switch 2700 is an Ethernet/ATM workgroup switch with 12 Ethernet ports and 1 ATM port for high-speed backbone connections.
		The switch is ideal for workgroups and small departmental LANs that need increased bandwidth across Ethernet ports, and also require a high-speed ATM downlink to an ATM campus backbone now or in the future.
	www.abcdata.com.pl /support/3com/100280c.html (4374 words)

	University of Florida
		As switched internetworking is taking over as the new wave in campus networks, Cisco Systems has gained a leadership position in implementing switched campus networks using leading-edge products and technology.
		The Catalyst 5000 family is flexible enough to function as a wiring closet switch and as a collapsed switch in the data center.
		Unlike other ATM switch architectures, however, the shared-memory fabric of the Catalyst 5500 switch allows all the advanced traffic management and other mechanisms of the switch to be implemented not on the interface modules, but on a field-replaceable feature card on the switch module.
	nersp.nerdc.ufl.edu /~poke/cisco (9119 words)

	[No title]
		This switch disables code in a number of places throughout ntop, code which analyzes specific protocols, but can place additional load on the host.
		This switch could be used to run ntop on low-end CPUs or where ntop is acting as a collector (netFlow or sFlow) and the GUI is not required.
		This switch disables code in a number of places throughout ntop, code which allows ntop to track "foreign" hosts (that is ones not local according to the IP address(es) of ntop's interfaces or set pseudo-local by -m
	www.math.temple.edu /doc/packages/ntop/FAQ (15139 words)

	Multiplexer (Site not responding. Last check: 2007-10-13)
		The DS0's are the basic granularity at which switching takes place in a telephone exchange.
		between each layer of the switch, or else the switch will not be able to complete a full set of connections.
		This is the method usually used in long distance switches, which have high utilization of their sw
	bonose.com /Multiplexer-36.html (560 words)

	[No title]
		Intended to provide NSA Type-1 encryption for permanent storage and network transport in PC and LAN environments, a crypto peripheral has been developed which can be used on servers, workstations and laptops.
		This ongoing project gives the community a new tool with which to insert cryptographic protection with minimal disruption to ongoing operations.
		These include integrating discipline-specific INFOSEC metrics, providing common language spanning organizational boundaries, closing the gap between risk management and security engineering, and producing scalable metrics that can be targeted to systems of varying complexity.
	www.ieee-security.org /Cipher/PastIssues/1996/issue9602/issue9602.txt (10795 words)

	Integration
		OKFDD minimization by genetic algorithms with application to circuit design
		Shaping a VLSI wire to minimize Elmore delay with consideration of coupling capacitance
		On the optimal four-way switch box routing structures of FPGA greedy routing architectures1
	wotan.liu.edu /docis/dbl/integr (1351 words)

	Networks
		The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
		Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
		Minimizing number of wavelengths in multicast routing trees in WDM networks
	wotan.liu.edu /docis/dbl/newoks (2042 words)

Try your search on: Qwika (all wikis)