Abstract: A method to increase capacity in a transmission system using parallel waveforms comprises several transmitters and at least one receiver. To determine the signal received at the receivers, the method takes account of all the parameters observed on all the sub-carriers of the majority of the receivers or their totality.

Abstract: A data processing apparatus maps input symbols to be communicated onto a predetermined number of carrier signals of an Orthogonal Frequency Division Multiplexed (OFDM) symbol. The data processor includes an interleaver memory which reads-in the predetermined number of data symbols for mapping onto the OFDM carrier signals. The interleaver memory reads-out the data symbols on to the OFDM carriers to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are interleaved on to the carrier signals. The set of addresses are generated from an address generator which comprises a linear feedback shift register and a permutation circuit.

Abstract: A correlator detects arriving timings of a desired wave and an interfering wave from a signal transmitted by the OFDM scheme. A reception response vector estimator estimates a first response vector for a signal arriving within a guard interval section from the head arriving wave and a second response vector for a signal arriving after the guard interval section from the head arriving wave out of the desired wave, and also a third response vector for a signal arriving within the guard interval section from the head arriving wave and a fourth response vector for a signal arriving after the guard interval section from the head arriving wave out of the interfering wave. An adaptive array block provides a weight vector based on a result of Fourier transform on the first to fourth response vectors.

Abstract: A method of managing a signal over a symbol period includes supplying samples of the signal at beginning and end portions of the symbol period. The method further includes suppressing the supply of samples of the signal at a middle portion of the symbol period.

Abstract: A multi-modulation mode air interface frame format, and related methods for carrying traffic on the multi-modulation mode air frame format, including an overhead portion including a first plurality of time slots and a plurality of overhead bursts located within respective ones of the first plurality of time slots. The frame format also includes a traffic portion including a second plurality of time slots following the first plurality of time slots and a plurality of traffic bursts, wherein respective ones of the plurality of traffic bursts are located within one or more of the second plurality of time slots. And each of the plurality of traffic bursts are modulated using a respective one of a plurality of modulation modes.

Abstract: Protection paths are dynamically allocated in a wavelength-division multiplexed network including a plurality of nodes (12) coupled by communication links (14). A database (26) stores information regarding the status of the network including information associating channels in each link of the node to one or more protection paths and information associating channels in each link to respective working paths. Upon receiving a request for a new protection path to protect a defined working path, links are identified that have at least one shareable channel which may be shared between the new protection path and one or more existing protection paths, as are links that do not have a shareable channel but do have an unused channel that may be used for the new protection path. Costs are assigned to identified links where links that have at least one shareable channel are weighted differently that links that do not have a shareable channel. A protection path is determined using the found links based on the costs.

Abstract: A method in a data processing system for monitoring for errors on a network. Responsive to detecting a change in a state of the network, determine whether the change in state is a loss of a communications link to a remote data processing system. If the change in state is a loss of the communications link, determine whether the communications link was established for at least a first period of time to be considered an acceptable connection to the remote data processing system; and create a new serviceable event, if a second period of time passes without reestablishing the communications link to the selected data processing system. Repeat occurrences of identical outages are tracked and multiple detected instances of an outage for different partitions are counted as a single failure in the examples.

Abstract: A computing node that functions as a member within a computing system group, such as a cluster, that has a status allowing receipt of group messages even though the node is not an active member of the cluster. The node is able to function as a primary member or as a backup member that controls redundant resources to be utilized in case of a failure. The computing node is able to have one of two status values, an “Active” status and an “Ineligible” status. Members that are able to function as a primary member have an “Active” status assigned, and a member that is not configured or otherwise eligible to perform as a primary member is assigned an “Ineligible” status. Members with an Ineligible status receive all group messages and therefore are able to become configured and eligible to become a primary member.

Abstract: Methods and apparatus for limiting congestion in a packet-based network, particularly for controlling the transmission of voice traffic. A node in the network, such as a router, transmits at least one data stream comprising a plurality of data packets to a second node; the data streams can correspond to existing voice calls being transmitted through the network. The bandwidth utilization between the first node and second node is determined, and supervision packets are forwarded from the first node to the second node at a rate that is a function of the bandwidth utilization, the rate being inversely-proportional to the bandwidth utilization. At the second node, the congestion of the network can be determined based on the rate at which the supervision packets are received and, if the congestion exceeds a predefined threshold, the establishment of new voice calls through the second node and into the network can be limited.

Abstract: A set of one or more connectivity constraints imposed on the building/maintaining of network topology databases.

Abstract: A startup management system and method, particularly adapted for use in computer and other communication networks, is presented. Rate-based flow and congestion control mechanisms have been considered desirable, including to deal with the needs of emerging multimedia applications. Explicit rate control mechanisms achieve low loss because of a smooth flow of data from sources, while adjusting source rates through feedback. However, large feedback delays, presence of higher priority traffic and varying network conditions make it difficult to ensure feasibility (i.e., the aggregate arrival rate is below the bottleneck resource's capacity) while also maintaining very high resource utilization. The invention applies entry and early warning techniques which increase the initial connect rate of newly connecting sources.

Abstract: The present invention provides flow control for route switching in a communications system using retransmissions. It is well suited for a cellular mobile radio communications system, particularly a Universal Mobile Telecommunications System, UMTS.

Abstract: In a network packet router having one or more ingress and egress ports, a method is implemented at an ingress port for egress pass/drop determination for packets, comprising the steps of (a) noting header combinations and values, and egress port destination for incoming packets; (b) comparing the header combinations and values with rule sets associated with the header combinations and values including egress port identities, and (c) returning a determination of pass or drop for the packet.

Abstract: A method is presented for a learning-based strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type. Cost estimation is utilized to converge on an optimal message path.

Abstract: A method is presented for a time-aware strategy utilized within message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes. The method includes determining local attributes for each of the nodes and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.

Abstract: A system uses database digests to synchronize routing data in a network (100). The system includes a first node (110-1) and a second node (110-2). The first node (110-1) stores first routing data and the second node (110-2) stores second routing data. The second node (110-2) further performs a function on a portion of the second routing data, where the function produces a database digest that has substantially less data than the portion of the second routing data. The second node (110-2) also sends the database digest to the first node (110-1) to synchronize the second routing data with the first routing data.

Abstract: A method for reducing communications in a peer-to-peer wireless network having nodes includes sending an RTS-TOA ranging communication from a first node (N0) in a node group to another node (Nr, I) in the group, receiving the RTS-TOA communication with the second node (Nr, I) and sending a multi-cast CTS-TOA/RTS-TOA ranging communication from the second node (Nr, I) as a reply to the received RTS-TOA communication, and successively and sequentially repeating the multi-cast sending step for each of the nodes. A CTS-TOA message is a reply to the received RTS-TOA message and, simultaneously, is an RTS-TOA ranging communication to a new destination node (J). The method applies for a randomized communications approach when node identifications are not sequenced and to a sequential approach where nodes are sequenced, and also applies to completely connected and multi-hop networks. Also provided is a node for carrying out the method of the present invention.

Abstract: A method is presented for message-initiated constraint-based routing for digital message communication among nodes in an ad-hoc network, in which each node includes attributes having attribute values. The method includes determining local attributes for each of the nodes in the ad-hoc network and defining constraints on the attributes. Each node is provided access to the attributes of each neighboring node, with a neighboring node being a node that is one hop away. Each message transmitted over the ad-hoc network has a message type, which includes a destination specification, route specification, and objective specification. Constraint checking and cost estimation checking are performed for each message type.

Abstract: Disclosed is a routing and bandwidth allocation system that maximizes network throughput while maintaining global fairness in the sharing of network resources. From gathered global network information (such as inter-node communications patterns and network topology), routing tables and bandwidth allocation policies are computed for routers. In some embodiments, the computations involve applying multi-commodity flow methods to provide a “max-fair” allocation of network resources. While in some embodiments each router collects global network information and then locally produces its own routing and bandwidth allocation tables, it can be simpler and cheaper in terms of both computation and security for a centralized, trusted control unit to perform the calculations and then to distribute the results to the routers. The computed bandwidth policies can leave some bandwidth unallocated to handle unexpected surges in demand.

Abstract: A computer-implemented method determines relationships between facts. A driver matrix is created from a set of facts and a set of rules applying to the facts. Each entry in the driver matrix indicates whether one of the facts implies another one of the facts. Each of the facts comprises a observable fact relating to a physical object or activity. The driver matrix is multiplied by itself to derive a consequent matrix. The driver matrix is then compared to the consequent matrix to determine relationships between facts in the set of facts.

Abstract: The invention relates to a method for determining the propagation delay in a packet-based network for a packet-based network section of a connection between terminals, at least sections of the connection being routed via the packet-based network. According to the inventive method, the broadcast relay in the packet-based network is determined for the packet-based network section of the connection and substantially half of the time period that has been determined for the broadcast relay is taken as a value for the propagation delay of the packet-based network section. The method permits the determination of the propagation delay in the packet-based network. This parameter can help, for example, to determine whether an echo compensation is required during a voice connection.

Abstract: This invention proposes a method to obtain the cost of transmitting a set of data from a transmitting means (3, 16) to a receiving means (2) via a network (4), wherein the receiving means (2) determines the volume of said set of data received and communicates it to a billing unit (18) so that the latter can evaluate the cost of said transmission using this information and possibly other information in its possession. This invention also concerns the systems used to implement said method especially in cellular packet radio-communication networks.

Abstract: Disclosed herewith is an apparatus and method for transferring a Universal Serial Bus (USB) over a wireless Personal Area Network (PAN). The apparatus includes a USB device discovery module, a USB device list storage module, and an endpoint bandwidth allocation module. The USB device discovery module discovers a USB device from devices on the wireless PAN. The USB device list storage module stores information of the discovered device. The endpoint bandwidth allocation module is allocated an appropriate channel time according to a type of a transaction that can be found from the information of the discovered device.

Abstract: A computing system group processing architecture that facilitates asymmetric processing at different computing nodes within a group or cluster of nodes. Nodes within a group are assigned to subgroups. Each node in a subgroup performs similar processing, but nodes in different subgroups are able to perform different processing for the same group level protocol. All nodes monitor processing completion votes that are cast by all nodes, and node in subgroups that finish processing before other subgroups synchronize to the processing of those other subgroups by casting dummy votes during vote rounds of other subgroups that are still processing their subgroup protocol.

Abstract: In a communications network environment, nodes, such as personal computers, are assigned co-ordinates in a co-ordinate space (200) which is independent of network address and physical location. Each node (100) maintains links to a limited set of other nodes by storing the network addresses for those selected nodes. Each stored network address represents a link (205) in co-ordinate space (200). It becomes possible for any node to obtain the network address for a target node by initiating a query message to a node it has the network address for, which query message is propagated through the network between nodes which have the network address for a next node across co-ordinate space. When a receiving node finds it is the target node, or is as close in co-ordinate space as it is possible to forward the query message, it returns its own network address to the initiating node. Embodiments of the invention can also be used to retrieve information other than network addresses—such as objects.

Abstract: A source based scheme to establish communication paths in an optical network. According to one embodiment of the invention, a number of wavelength division multiplexing access nodes of an optical network employ a source based scheme to establish communication paths. Each of these access nodes stores a set of one or more network topology databases based on a set of one or more connectivity constraints.

Abstract: An object of the present invention is to provide a wireless communication print server 25 that makes a printer 20 connected the wireless communication print server 25 unavailable if a parameter 50 is in the initial state. When the wireless communication print server 25 receives a print request, determines whether or not the parameter 50 is in the initial state, and then rejects the print request if the parameter 50 is in the initial state. If the parameter 50 that has been changed by a change unit 60 is not in the initial state, the wireless communication print server makes the printer 20 connected with the wireless communication print server 25 available.

Abstract: A selective distribution messaging scheme for an optical network. According to one embodiment of the invention, a wavelength division multiplexing optical network includes a number of nodes each having an optical cross connect and each having stored therein a database representing conversion free connectivity from that node to others of the nodes. In addition, each of the nodes employs a messaging scheme to propagate notification of changes in the optical network to others of the nodes to maintain their databases. The messaging scheme in each of the nodes transmits messages to only selected ones of the other nodes based at least in part on the conversion free connectivity to minimize the number of communications between nodes.

Abstract: In an information processing device having a communication function of performing a network connection via a wireless relay apparatus, the information processing device comprises a first unit which finds the wireless relay apparatus, and a second unit which displays information, which is characterized according to identification information of the wireless relay apparatus when the first unit finds the wireless relay apparatus.

Abstract: A radio communication system according to the present invention comprises a transmitter having a plurality of transmission antennas, and a receiver having a mechanism to perform a diversity reception. A plurality of multi-modulators of the transmitter allocates the same transmission data to a plurality of subcarriers, combines all transmission signals obtained by weighting each of the subcarriers, and outputs combined transmission signals. At least one of weight values for the same data is different between the multi-modulators in the weighting processing for each of the carriers.

Abstract: The invention is a system and a method in a system including a mobile station (MS), a group of active cells including a first serving cell (cell a) and a second target cell (cell b) and a controller of the active cells which switches forward link transmissions of data packets from the controller (BSC) through the first serving cell to the mobile station to forward link transmission of data packets from the controller through a second cell to the mobile station.

Abstract: The present invention is related to LoCation Services (LCS) in General Packet Radio Service (GPRS). Because the specification of LCS was missing in the first versions of the technical specifications of GPRS, but already introduced in the GSM specifications, there will be a number of MSs having LCS capabilities when attached to circuit switched serving nodes (MSCs) but not when attached to packet switched serving nodes (SGSNs). When a location request for one such MS attached to both an MSC and an SGSN is directed to the SGSN first, an error may occur. The present invention discloses a method solving this problem by informing the associated HLR if the MS supports location service in packet switched mode or not at the time the MS attaches the network. The information is stored in the HLR, and when the location service node in the network receives a location request for that MS, the location node invokes the HLR for the information.

Abstract: A method for transferring information over a between a first node and a second node includes the steps of transmitting a frame from the first node to the second node. The frame contains link data enabling a determination of a link mode. Upon receipt of the frame at second node, a determination is made of a link mode using the link data contained in the frame, and data is transmitted from the second node to the first node using the determined link node.

Abstract: An arrangement for providing a terminal with information on the price of using a wireless telecommunication network, comprising at least one wireless telecommunication network, a terminal, which is within the coverage area of said at least one telecommunication network. The telecommunication network comprises means for forming pricing information on using the telecommunication network for data transmission, the terminal is configured to receive from said at least one telecommunication network the pricing information on using the telecommunication network for data transmission, and the terminal comprises a control unit controlling different parts of the terminal, the control unit being configured to form control information for selecting a telecommunication network to be used for data transmission on the basis of the pricing information received from said at least one telecommunication network.

Abstract: Methods are provided to ensure that content defining a sub-grid of a decentralized network continues to be provided to the sub-grid upon departure of a node from the sub-grid that has been responsible for providing the content. A node intent on exiting a sub-grid ensures that content for which it has service responsibility is appropriately transferred to another node prior to exiting the sub-grid, wherein the other node is capable of serving the transferred content to the sub-grid.

Abstract: The principles of the present invention provides for making roaming decisions based on association qualities between a wireless device and one or more wireless access points. From time to time, the wireless device updates a current association quality for a current wireless access point, for example, based on relative signal strength, observed error rates, and current wireless access point workload. Similarly, the wireless device updates association qualities for any other wireless access points the wireless device can communicate with. If the current association quality falls below a quality threshold, the wireless device roams to attempt to associate with another wireless access point. The wireless device ranks compatibly configured wireless access points based at least in part on corresponding association qualities. The wireless device can attempt to associate with higher ranked wireless access points before lower ranked wireless access points.

Abstract: A cell changing method for a packet-mode cellular mobile radio system, in which method information relating to resources allocated to a mobile station in a new cell is signaled by the network to said mobile station when said mobile station is still in the old cell and information intended to enable the mobile station to determine a timing advance to be applied by said mobile station in the new cell is also signaled by the network to said mobile station when said mobile station is still in the old cell.

Abstract: A method and apparatus provides for efficient data rate control and power control processes by transmitting a primary and a secondary pilot channel associated with a data channel. The primary and secondary pilot channels are used for decoding the data. A ratio of power levels of the primary and secondary pilot channels is based on at least one of the data rate and payload size of the data channel. The power level of the primary pilot channel is maintained independent of at least one of data rate and payload size of the data channel. The power level of the secondary pilot channel may be adjusted based on at least one of data rate and payload size of the data channel.

Abstract: In order to reduce delay and increase throughput of conventional hybrid type II automatic repeat request (ARQ) the present invention shows a method for estimating the signal to interference ratio SIR of a transmission time division duplex (TDD) channel slot to apply adapted code rates for the encoding of information units transmitted through this slot. The adapted code rates are achieved by defining a set of distinct transmission and retransmission thresholds which allow to refer to a particular code rate by taking a signal to interference ratio SIR of a timeshifted different TDD channel slot into consideration, assuming that the correlation of the conditions of the TDD channel is high enough.

Abstract: A system and method for deploying a network of wireless devices, including mobile terminals, wireless routers and a least one control console, within a three dimensional deployment area such as a building, so that communication, identification and position calculations of personnel, such as firefighters, using the mobile terminals can be achieved regardless of building structure. The wireless routers are deployed in a substantial vertical manner in staircases and elevator shafts of a building of interest, either in advance as part of a safety program or immediately upon arrival of firefighters or other team at the building during an emergency. The system and method according to the embodiment of the present invention described herein uses both TOF and RSSI between the mobile terminals and wireless routers to identify the floor numbers where firefighters are located and to track firefighter movements.

Abstract: A method for double weighting parallel interference cancellation in CDMA mobile communication system, integrates ideas of both partial weighting method and weighting method based on Bayes rule. When making a decision on each symbol of the user, calculating reliability coefficient of a decision result on the symbol of the user according to the weighting algorithm based on Bayes rule; weighting regenerated signal of the symbol of the user with the reliability coefficient. During process of MAI estimating and removing, obtaining the MAI on the expected user from weighted regenerated signal of other users in chip level; and then setting a weight value, weighting the MAI with the weight value. Finally, removing weighted MAI from received signal, which means partially removing MAI produced by other users on the expected user.

Abstract: Apparatus and method for closed-loop power control in mobile satellite communication system, which can compensate round trip delay. The apparatus for closed-loop power control includes the means of; a) converting power control order from base earth station into power control step; b) measuring channel change rate from power of pilot channel; c) making tab coefficient using said channel change rate; d) compensating channel change due to loop delay using power control step; and e) renovating received signal power using said power control step.

Abstract: A system and method for arbitrating among frequency-hopping spread spectrum communication systems are provided herein. An arbitrator calculates and compares hop frequencies for the communication systems of an area or network using frequency generation parameters received from the communication systems. The comparison identifies impending transmission collisions and collision frequencies for transmission time slots. The arbitrator then selects one of the radios associated with an impending collision to transmit, and suppresses or disables transmissions by non-selected radios during the same transmission time period for that frequency. Thus, the arbitrator minimizes bandwidth lost to co-channel and adjacent channel collisions by reducing or eliminating this mutual interference among the communication systems.

Abstract: A wireless communications network includes a base station to communicate with plural mobile stations over a wireless link. A broadcast message is sent to the plural mobile stations, with the broadcast message containing an indication for indicating to the plural mobile stations that the mobile stations are to change data rates for transmissions over a reverse wireless link.

Abstract: A mobile router is configured for generating a local router prefix (i.e., a null or invalid address prefix that is not reachable via a wide area network) for use by mobile nodes that attempt to attach to the mobile router. The mobile router attaches to an attachment router using a care-of address with an attachment router address prefix, and outputs a router advertisement message that specifies the null address prefix. Upon receiving a message from a mobile host that includes a source address field specifying a mobile host care-of address that includes the null address prefix, the mobile router adds the mobile host care-of address to a reverse routing header and inserts its own care-of address into the source address field. The message is output to its destination with the reverse routing header, ensuring the IPv6 address of the mobile router remains anonymous in the wide area network.

Abstract: A Wireless Local Area Network (WLAN) supports multiple slot times. A Basic Service Set (BSS)/Independent Basic Service Set (IBSS) of the WLAN services a plurality of WLAN devices (STAs) and at least one STA of the plurality of STAs supports multiple slot times. Operation is initiated using a short slot time. Then, the a determination is made that operation of the BSS/IBSS requires use of a long slot time, wherein the long slot time is longer than the short slot time. Operation of at least one of the plurality of STAs is modified to be consistent with the long slot time. In altering the operation the STA sets a local Long Slot Termination Time (LSTT). When a Target Beacon Transition Time (TBTT) is before the local LSTT, a beacon is transmitted that indicates that the long slot time is to be used and that includes the local LSTT. When the TBTT is after the local LSTT, a beacon is transmitted that indicates that the short slot time is to be used.

Abstract: The present invention relates to a session control unit (16) for use in a communication network (11a) for providing wireless access to the Internet for mobile nodes (2). The communication network comprises one or several access routers (3) for wireless communication with mobile nodes and one or several anchor points (12a) for routing data packets to and/or from the mobile nodes via the access routers. The session control unit is arranged to allocate a session identifier to a mobile node (2) requesting access to the network, select an anchor point (12a) to route data packets to and/or from the mobile node, and communicate an IP-address associated with the selected anchor point to the access router communicating with the mobile node. The allocated session identifier is independent of the selected anchor point. The invention also relates to a method for providing session control to a communication network.

Abstract: Methods of establishing communications between a first station and a second station in a wireless local area network using a direct link protocol are disclosed in which a first distance between the first station and the second station and a second distance between the first station and an access point in the wireless local area network are determined. The first distance may then be compared to the second distance. Direct link protocol communications between the first station and the second station may be established if the first distance is less than the second distance.

Abstract: A system and method for characterizing the quality of a link, in particular, a bi-directional link, between nodes in a wireless communication network, such as a wireless ad-hoc peer-to-peer network, with minimum network overhead. The system and method determine the quality of link between two nodes by taking into consideration the view from both the nodes, and factors such as signal strength, signal-to-noise ratio or any statistic collected at the physical layer that is deemed representative of the quality of a link. The link quality can also be adjusted using a weighting factor.

Abstract: A network for wireless transmission of a media data in a building includes a plurality of access points. A first access point receives the media data from a source and transmits the media data downstream at a first data rate. A plurality of additional access points is distributed about the building, each of which includes an upstream transceiver to receive the media content on a first channel and a downstream transceiver to re-transmit the media content at substantially the first data rate on a second channel. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.