Abstract: An optical channel data unit (ODU) switch includes a set of two or more client cards, a set of two or more line cards, and a set of two or more switch cards. Each switch card is connected to all client cards, all line cards, and all other switch cards, and each client card, line card and switch card includes control logic for managing an operation of the ODU switch in a distributed manner.

Abstract: An optical channel data unit (ODU) switch includes a set of two or more client cards, a set of two or more line cards, and a set of two or more switch cards. Each switch card is connected to all client cards, all line cards, and all other switch cards, and each client card, line card and switch card includes control logic for managing an operation of the ODU switch in a distributed manner.

Abstract: A network includes a master and a set of slaves that communicate orthogonal frequency-division multiplexing (OFDM) and time division multiple access (TDMA) symbols on sub-carriers. A master broadcasts to the set of slaves using downlinks and all of the sub-carriers, a broadcast polling packet including data packets for each slave and sub-carrier assignments for the slaves. Each slave, in response to receiving the downlink polling packet, transmits simultaneously a response packet to the master using uplinks and the assigned sub-carriers. The master then transmits to the set of slave using the downlinks and all of the sub-carriers, a group acknowledgement packet, wherein the broadcast polling packet, the response packet, and the group acknowledgement packet comprise one superframe in one communication cycle, and wherein the broadcasting on the downlinks and the transmitting on the uplinks are disjoint in time.

Abstract: A method and system provide multiple-access control and frequency band allocation, and transmission time sharing among multiple users in orthogonal frequency-division multiple-access (OFDMA) and time-division multiple-access (TDMA) networks. The method can be applied to uplinks and downlinks of multi-user, multi-carrier communication networks. Under a total transmission-power minimization constraint, the method can allocate carriers and transmission time to users optimally, and at the same time, can guarantee a data rate or equivalently a latency requirement of each user.

Abstract: In a wireless network that includes multiple nodes, each periodic announcement cycle of a communication schedule is partitioned into a set of time slots, including a set of management time slots, a set of beacon time slots, and a set of superframe time slots. Management frames are broadcast during the management slot to specify beacons. Beacons are transmitted during the beacon slots to specify when to transmit the superframes during the superframe time slots.

Abstract: In a wireless network that includes multiple nodes, each periodic announcement cycle of a communication schedule is partitioned into a set of time slots, including a set of management time slots, a set of beacon time slots, and a set of superframe time slots. Management frames are broadcast during the management slot to specify beacons. Beacons are transmitted during the beacon slots to specify when to transmit the superframes during the superframe time slots.

Abstract: A method for communicating in a network including a coordinator node and a set of leaf nodes transmits periodically, from the coordinator node to the set of leaf nodes, a beacon defining a superframe, wherein the supper frame includes an active period and an inactive period, and wherein the active period includes a first contention access period (CAP-1), a first contention free period (CFP-1), a first group acknowledgement (GACK-1), a second CFP-2, a second GACK-2, and a second CAP-2, and wherein each CFP includes a guaranteed time slot (GTS) assigned to each leaf node. Then, each leaf node transmits to the coordinator node only during the GTS assigned to the leaf node during each CFP.

Abstract: A method and system provide multiple-access control and frequency band allocation, and transmission time sharing among multiple users in orthogonal frequency-division multiple-access (OFDMA) and time-division multiple-access (TDMA) networks. The method can be applied to uplinks and downlinks of multi-user, multi-carrier communication networks. Under a total transmission-power minimization constraint, the method can allocate carriers and transmission time to users optimally, and at the same time, can guarantee a data rate or equivalently a latency requirement of each user.

Abstract: A method allocates and assigns addresses to nodes in an ad hoc wireless network. A set of potential addresses of nodes in an ad hoc wireless network are defined as having N fields, in which the number of bits in each field is one or more bits. A subset of the set addresses is allocated initially as addresses to be assigned to nodes joining the network, in which each address has N-K fields, where 0<K<N. The size of the subset of addresses is increased adaptively by increasing the number of fields in each address in the subset.

Abstract: A network includes a master and a set of slaves that communicate orthogonal frequency-division multiplexing (OFDM) and time division multiple access (TDMA) symbols on sub-carriers. A master broadcasts to the set of slaves using downlinks and all of the sub-carriers, a broadcast polling packet including data packets for each slave and sub-carrier assignments for the slaves. Each slave, in response to receiving the downlink polling packet, transmits simultaneously a response packet to the master using uplinks and the assigned sub-carriers. The master then transmits to the set of slave using the downlinks and all of the sub-carriers, a group acknowledgement packet, wherein the broadcast polling packet, the response packet, and the group acknowledgement packet comprise one superframe in one communication cycle, and wherein the broadcasting on the downlinks and the transmitting on the uplinks are disjoint in time.

Abstract: A method for communicating in a network including a coordinator node and a set of leaf nodes transmits periodically, from the coordinator node to the set of leaf nodes, a beacon defining a superframe, wherein the supper frame includes an active period and an inactive period, and wherein the active period includes a first contention access period (CAP-1), a first contention free period (CFP-1), a first group acknowledgement (GACK-1), a second CFP-2, a second GACK-2, and a second CAP-2, and wherein each CFP includes a guaranteed time slot (GTS) assigned to each leaf node. Then, each leaf node transmits to the coordinator node only during the GTS assigned to the leaf node during each CFP.

Abstract: A method assigns addresses to nodes in a wireless network. An address space is defined as an n-dimensional grid. Each grid intersection has coordinates of a corresponding possible node of a wireless network. A number of components of each coordinate is equal to a dimensionality of the grid, and the coordinates form a logical address of the corresponding node. A parent node assigns an unallocated logical address as a child node address to a child node joining the wireless network such that one component of the child node address is one larger than a corresponding component of the parent node.

Abstract: Logical addresses are assigned to nodes in a wireless network from an address space defined as an n-dimensional grid, where intersections have coordinates of the nodes. A component of the coordinates is selected to be associated with a predetermined value. A parent node assigns an unallocated logical address to a child node joining the network such that any component of the child node address is modified, by one, from a corresponding component of the parent node if the selected component of the parent node has the predetermined value. Otherwise, the unallocated logical address is assigned such that the selected component of the child node address is modified by one from the selected component of the parent node.

Abstract: A method binds devices connected by a wireless network by setting a first timeout in a master device. A key exchange is performed between the master and a slave device. The key exchange is terminated if the first timeout expires and the key exchange is incomplete. Then, a second timeout is set in the master device and a third timeout is set in the slave device if the key exchange is complete. A binding to the slave device is established in the master device if the master device receives a response from the slave device after the second time expires. Otherwise the slave device is disabled. A binding to the master device is established in the slave device if the third timeout expires and there is only one key exchange detected by the slave device.

Abstract: A method assigns addresses to nodes in a wireless network. An address space is defined as an n-dimensional grid. Each grid intersection has coordinates of a corresponding possible node of a wireless network. A number of components of each coordinate is equal to a dimensionality of the grid, and the coordinates form a logical address of the corresponding node. A parent node assigns an unallocated logical address as a child node address to a child node joining the wireless network such that one component of the child node address is one larger than a corresponding component of the parent node.

Abstract: A method allocates and assigns addresses to nodes in an ad hoc wireless network. A set of potential addresses of nodes in an ad hoc wireless network are defined as having N fields, in which the number of bits in each field is one or more bits. A subset of the set addresses is allocated initially as addresses to be assigned to nodes joining the network, in which each address has N-K fields, where 0<K<N. The size of the subset of addresses is increased adaptively by increasing the number of fields in each address in the subset.

Abstract: A method assigns addresses to nodes in a wireless network. An address space is defined as an n-dimensional grid, each grid intersection having coordinates of a corresponding possible node of a wireless network, a number of components of each coordinate being equal to a dimensionality of the grid, and the coordinates forming a logical address of the corresponding possible node. A component of the coordinates is selected to be associated with a predetermined value. A parent node assigns to a child node joining the wireless network an unallocated logical address as a child node address such that any component of the child node address is modified, by one, from a corresponding component of the parent node if the selected component of the parent node has the predetermined value.

Abstract: A system delivers multimedia services to mobile devices via a network by first registering a mobile device with a service manager connected to the mobile device via the network. Application service providers are connected to the service manager via the network. Each application service provider is associated with particular multimedia services. An environment description to be associated with the mobile device is acquired, and a particular application service provider is identified according to the environment description, and then selected services provided by the particular application service provider are delivered to the mobile device according to the environment description via the network.

Abstract: A method binds devices connected by a wireless network. A first timeout is set in a master device, and a key exchange is performed between the master device and a slave device. The key exchange is terminated if the first timeout expires and the key exchange is incomplete. Then, a second timeout is set in the master device and a third timeout is set in the slave device if the key exchange is complete. A binding to the slave device is established in the master device if the master device receives a response from the slave device after the second time expires, and otherwise the slave device is disabled. A binding to the master device is established in the slave device if the third timeout expires and there is only one key exchange detected by the slave device, and otherwise further operation of the slave device are blocked by the slave device if there more than one key exchanges are detected by the slave device.

Abstract: A system delivers multimedia services to mobile devices via a network by first registering a mobile device with a service manager connected to the mobile device via the network. Application service providers are connected to the service manager via the network. Each application service provider is associated with particular multimedia services. An environment description to be associated with the mobile device is acquired, and a particular application service provider is identified according to the environment description, and then selected services provided by the particular application service provider are delivered to the mobile device according to the environment description via the network.