New Jersey Institute of Technology

Polytechnic University

Other

Empire Technology Development LLC

Crrc Zhuzhou Electric Locomotive Research Institute Co., Ltd.

Njit

Roberto Rojas-Cessa

Eiji Oki

Hung-Hsiang Jonathan Chao

Ziqian Dong

Chuan-bi Lin

Khondaker M Salehin

Nirwan Ansari

Haim Grebel

Mengchu Zhou

Jianghua Feng

Gaohua Chen

Jun Tang

Tairan Zhang

Zigian Dong

Qiang Fan

Zhen Qin

Jonathan Chao Hung-Hsiang

Zhengqi Jiang

Mina Taheri

Dajun Wang

A method and a system for rail transit communication. The method includes: selecting a second target FSO transceiver from the FSO transceivers that are currently located within a signal coverage of a target FSO base station, in response to detecting that a first target free-space-optics (FSO) transceiver moves out of the signal coverage of the target FSO base station when data communication between the target FSO base station and the target user terminal is performed via the first target FSO transceiver, where the target FSO base station is one of the FSO base stations located on the rail; and maintaining the data communication between the target FSO base station and the target user terminal, by using the second target FSO transceiver. Handover among the base stations is reduced for user equipment, data communication rate is increased, and communication experience of passengers can be improved.

Rail transit communication method and system

Energy packet switches (EPS) employing supercapacitors as storage provide aggregation and delivery of energy to users based on shared-capacitance in a digital power grid. The EPS aggregates energy from one or multiple energy sources, stores and dispatches the energy in discrete amounts as energy packets to one or multiple users. The payload of the energy packet is adjusted by the voltages of the supercapacitors which are used as energy containers for both the EPS and the users. The EPS has a control plane where data transmitted is used to control the operation of the EPS, and a power plane to receive and transmit energy between ports. The power and data planes work in parallel and with a parallel data network. Control and management of the EPS are based on a request-grant transport protocol. The data network is used to receive energy requests and grants, and a granting scheme is used to select which loads are granted energy. By sending addresses of granted loads on the data network and energy on the energy grid, energy is delivered to addressed destinations.

Energy packet switches

Methods and apparatus for packetized energy distribution are provided. A data and power delivery network, called a digital grid, is provided to facilitate delivery of power upon request. Energy bits (quanta) serve as a means to deliver energy as well as coding. Voltage pulses of varying time scales are used for coding and current levels help to accurately meet customer's demand. Energy is sent as packets (a combination of energy bits), and specific energy packets are addressed to specific customers permitting accurate monitoring and distribution of electrical energy.

Packeted energy delivery system and methods

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.

Measurement of clock skew between two remote hosts connected through computer networks

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.

Determination of download throughput of wireless connection with compound probes

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.

Measurement of packet processing time of end hosts through estimation of end link capacity

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.

Forwarding cells of partitioned data through a three-stage Clos-network packet switch with memory at each stage

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.

Space-space-memory (SSM) Clos-network packet switch

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 Ncrosspoint buffers. An output-based shared-memory crosspoint-buffered (O-SMCB) packet switch is used where the crosspoint buffers are shared by two outputs and use no speedup. An embodiment of the proposed switch provides high performance under admissible uniform and non-uniform multicast traffic models while using 50% of the memory used in CICB switches that has dedicated buffers. Furthermore, the O-SMCB switch provides higher throughput than an existing SMCB switch where the buffers are shared by inputs.

Replicating and switching multicast internet packets in routers using crosspoint memory shared by output ports

Techniques are generally disclosed for disseminating link state information to one or more nodes of a network of nodes, the network of nodes interconnected via a plurality of communication channels.

Disseminating link state information to nodes of a network

Examples of are disclosed for configuring one or more routes through a three-stage Clos-network packet switch.

Configuring a three-stage Clos-network packet switch

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.

Forwarding data through a three-stage Clos-network packet switch with memory at each stage

A pipeline-based matching scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with matching schemes, such as CRRD and CMSD. In the new approach, arbitration may operate in a pipelined manner. Each sub-scheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides a matching result(s). The sub-scheduler can use a matching scheme such as CRRD and CMSD.

Scheduling the dispatch of cells in non-empty virtual output queues of multistage switches using a pipelined hierarchical arbitration scheme

A Pipelined-based Maximal-sized Matching (PMM) scheduling approach for input-buffered switches relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration may operate in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient maximal matching algorithm such as iSLIP and DRRM. PMM maximizes the efficiency of the adopted arbitration scheme by allowing sufficient time for a number of iterations. PMM preserves 100% throughput under uniform traffic and fairness for best-effort traffic.

Growing community of inventors

Brooklyn, NY, United States of America

Roberto Rojas-Cessa