Patent application number | Description | Published |
20080303628 | SCALABLE TWO-STAGE CLOS-NETWORKING SWITCH AND MODULE-FIRST MATCHING - A configuration scheme for IQC switches that hierarchizes the matching process reduces configuration complexity by performing routing first and port matching afterwards in a three-stage Clos-network switch. This scheme applies the reduction concept of Clos networks to the matching process. This, in turn, results in a feasible size of schedulers for up to Exabit-capacity switches, an independent configuration of the middle stage modules from port matches, a reduction of the matching communication overhead between different stages, and a release of the switching function to the last-stage modules in a three-stage switch. The switching performance of the proposed approach using weight-based and weightless selection schemes is high under uniform and non-uniform traffic. The number of stages of a Clos-network switch can be reduced to two. | 12-11-2008 |
20090059921 | REPLICATING AND SWITCHING MULTICAST INTERNET PACKETS IN ROUTERS USING CROSSPOINT MEMORY SHARED BY OUTPUT PORTS - Multicast traffic is expected to increase in packet networks, and therefore in switches and routers, by including broadcast and multimedia-on-demand services. Combined input-crosspoint buffered (CICB) switches can provide high performance under uniform multicast traffic. However this is often at the expense of N | 03-05-2009 |
20090089139 | SCHEDULING PROCESSING TASKS USED IN ACTIVE NETWORK MEASUREMENT - A method of scheduling tasks for active network measurement includes identifying a first measurement task for measuring a first network parameter and a second measurement task for measuring a second network parameter. It is determined whether there is a conflict between the first measurement task and the second measurement task. A first execution time of the first measurement task and a second execution time of the second measurement task are also determined. A task schedule is generated based at least in part on the first execution time, the second execution time, and whether there is the conflict between the first measurement task and the second measurement task. The task schedule is further generated based at least in part on a color graph. | 04-02-2009 |
20100260198 | Space-Space-Memory (SSM) Clos-Network Packet Switch - A Clos-network packet switching system may include input modules coupled to a virtual output queue, central modules coupled to the input modules, and output modules coupled to the central modules, each output module having a plurality of cross-point buffers for storing a packet and one or more output ports for outputting the packet. | 10-14-2010 |
20100316061 | Configuring a Three-Stage Clos-Network Packet Switch - Examples of are disclosed for configuring one or more routes through a three-stage Clos-network packet switch. | 12-16-2010 |
20110026532 | Forwarding Data Through a Three-Stage Clos-Network Packet Switch with Memory at each Stage - Examples are disclosed for forwarding data partitioned into one or more cells through at least a portion of a three-stage memory-memory-memory (MMM) input-queued Clos-network (IQC) packet switch. In some examples, each module of the three-stage MMM IQC packet switch includes a virtual queue and a manager that are configured in cooperation with one another to forward cells through at least a portion of the switch. The cells may have been partitioned and stored at an input port for the switch and destined for an output port for the switch. | 02-03-2011 |
20110026539 | Forwarding Cells of Partitioned Data Through a Three-Stage Clos-Network Packet Switch with Memory at Each Stage - Examples are disclosed for forwarding cells of partitioned data through a three-stage memory-memory-memory (MMM) input-queued Clos-network (IQC) packet switch. In some examples, each module of the three-stage MMM IQC packet switch includes a virtual queue and a manager that are configured in cooperation with one another to forward a cell from among cells of partitioned data through at least a portion of the switch. The cells of partitioned data may have been partitioned and stored at an input port for the switch and have a destination of an output port for the switch. | 02-03-2011 |
20140119215 | MEASUREMENT OF PACKET PROCESSING TIME OF END HOSTS THROUGH ESTIMATION OF END LINK CAPACITY - Technologies are generally described for measuring packet processing time of a remotely connected host device. According to some examples, link capacity may be measured to estimate the packet processing time (PPT). The capacity of the link connected to a host may be measured through active probing with the hosts time-stamping each probing packet after receiving it. Thus, PPT information may be included in the packet receiving process and the processes that the packet undergoes defined by the nature of different computing applications, time-stamping a packet is an example of a process that involves processing time. | 05-01-2014 |
20140122742 | MEASUREMENT OF CLOCK SKEW BETWEEN TWO REMOTE HOSTS CONNECTED THROUGH COMPUTER NETWORKS - Technologies are generally described for measuring clock skew between two remote hosts connected through a computer network. According to some examples, pairs of probe packets, also referred to as a compound probe, may be transmitted over an end-to-end path in both directions (forward and reverse paths) to measure a gap value at the end nodes for clock skew estimation. Compound probes may arrive at the end nodes with a zero dispersion gap (no separation) and the gap values along the forward and reverse paths may be determined by a capacity of the links connected to the end nodes added to the clock speeds of the measuring nodes upon arriving at the end nodes. The link capacity is a constant network parameter. Thus, the ratio of the measured gap values may provide an estimate of clock speed discrepancy between the end nodes. | 05-01-2014 |
20140146829 | FORWARDING CELLS OF PARTITIONED DATA THROUGH A THREE-STAGE CLOS-NETWORK PACKET SWITCH WITH MEMORY AT EACH STAGE - Examples are disclosed for forwarding cells of partitioned data through a three-stage memory-memory-memory (MMM) input-queued Clos-network (IQC) packet switch. In some examples, each module of the three-stage MMM IQC packet switch includes a virtual queue and a manager that are configured in cooperation with one another to forward a cell from among cells of partitioned data through at least a portion of the switch. The cells of partitioned data may have been partitioned and stored at an input port for the switch and have a destination of an output port for the switch. | 05-29-2014 |
20140293819 | DETERMINATION OF DOWNLOAD THROUGHPUT OF WIRELESS CONNECTION WITH COMPOUND PROBES - Technologies are generally described to determine a download throughput of a wireless connection in an environment hosting multiple wired and wireless connections. According to some examples, a compound probe may be transmitted from a source to a wireless destination. Another compound probe may also be transmitted from the source to the wireless destination. The compound probes may include multiple packets without any dispersion gap. Next, an average intra-packet gap (AIPG) and a minimum intra-packet gap (MIPG) may be determined from the first compound probe. Furthermore, another MIPG may be determined from the later compound probe. The download throughput from the source to the wireless destination may be computed from the AIPG and the MIPGs. | 10-02-2014 |