Abstract: Methods and apparatus to select composite link cost-out thresholds are disclosed. A disclosed example method comprises collecting traffic statistics for a communication network, computing, based on the collected traffic statistics, a plurality of flow rates for a composite link of the communication network for respective ones of a plurality of potential fault conditions for the composite link, computing a plurality of remaining capacities of the composite link for respective ones of the plurality of fault conditions, computing a plurality of differences between respective ones of the plurality of flow rates and the plurality of remaining capacities, and selecting a cost-out threshold for the composite link based on the plurality of computed differences.

Abstract: The present invention is a delay based model and in fact uses queuing delay as a congestion measure, providing advantages over prior art loss based systems. One advantage is that queuing delay can be more accurately estimated than loss probability. This is because packet losses in networks with large bandwidth-delay product are rare events under TCP Reno and its variants (probability on the order 10?7 or smaller), and because loss samples provide coarser information than queuing delay samples. Indeed, measurements of delay are noisy, just as those of loss probability. Thus, another advantage of the present invention is that each measurement of queuing delay provides multi-bit information while each measurement of packet loss (whether a packet is lost) provides only one bit of information for the filtering of noise. This makes it easier for an equation-based implementation to stabilize a network into a steady state with a target fairness and high utilization.

Abstract: Some embodiments of the present invention relate to an apparatus for managing communications within a distributed network. According to some embodiments of the invention, the apparatus may include a communication management module and a synchronization module. The communication management module may be operatively coupled to a communication module belonging to the distributed network. The communication management module may be adapted to allocate for each communication within the network a communication frame comprised of a predetermined number of timeslots. The communication management module may configure the communication module coupled thereto to repeat a communication at one or more of the timeslots of the frame allocated for the communication. The timeslots may, for example, be equal in length and may each correspond to a predetermined fraction of the length of a communication frame.

Abstract: A method and apparatus for providing a method to enable subscribers of broadband access services, such as Digital Subscriber Loop based or Cable based broadband access services, to dynamically reconfigure their access arrangements as a function of the application they invoke are disclosed. Subscribers that subscribe to a basic amount of bandwidth can dynamically increase their bandwidth allocation when they invoke a voice or video application by simply requesting the application. The present invention provides a method for broadband service providers to dynamically adjust access bandwidth allocation for subscribers by detecting signaling messages, such as application request setup messages and disconnect messages.

Abstract: In a buffer (10) to compensate for runtime fluctuations of data packets (1) transmitted over a transmission line (40), in order to be able to set optimally an additional retransmission delay by the buffer (10) it is proposed to calculate the probable hold time of a data packet (1) immediately after arrival of a data packet (1) in the buffer (10). The additional retransmission delay by the buffer (10) is set based on the probable hold time of the data packets (1) in the buffer (10). To guarantee optimum setting of the retransmission delay, both the maximum detected probable hold time and the minimum detected probable hold time of the data packets (1) are used. This is achieved preferably by means of a minimum value detector and a maximum value detector which detect extreme values of the probable hold time occurring at specific time intervals.

Abstract: Methods and systems for providing a network and routing protocol for utility services are disclosed. A method includes discovering a utility network. Neighboring nodes are discovered and the node listens for advertised routes for networks from the neighbors. The node is then registered with one or more utility networks, receiving a unique address for each network registration. Each upstream node can independently make forwarding decisions on both upstream and downstream packets, i.e., choose the next hop according to the best information available to it. The node can sense transient link problems, outage problems and traffic characteristics. Information is used to find the best route out of and within each network. Each network node maintains multi-egress, multi-ingress network routing options both for itself and the node(s) associated with it. The node is capable of several route maintenance functions utilizing the basic routing protocol and algorithms.

Abstract: The present disclosure provides an access node for transferring and/or assigning network passwords. The access node includes a first interface for sending and receiving communication of a first type to and from a first node operating in a wireless local area network (WLAN). The access node also includes a second interface for sending and receiving communication of a second type to and from a second node in a mobile network, such as a GSM/GPRS network. The access node further includes a short messaging service (SMS) module for sending and receiving SMS messages to the second node carrying an OTP allocated. The access node also includes a mechanism to verify a precondition before the OTP is sent to the second node.

Abstract: More efficient utilization of available bandwidth is implemented in an OFDM wireless communication system. The partitions of bandwidth may be of different sizes and may be different from the original system design parameters. Basic system structure such as the number of tones used and the number of OFDM symbol times in a slot is maintained throughout the system. Bandwidth is varied by adjusting the inter-tone spacing or bandwidth associated with a single tone. As the inter-tone spacing is increased, the OFDM symbol transmission time is decreased following an inverse proportional relationship.

Abstract: Methods and systems to perform collision detection (CD) in a communication network are disclosed. Methods and systems over multipacket reception (MPR)-capable physical layers are also disclosed. In one embodiment, the method for transmitting information in a network includes the steps of initiating transmission over a communication channel, monitoring a feedback channel, modifying transmission parameters for the transmission over the communication channel (where modifying includes stopping transmission and adjusting transmission parameters), if a feedback transmission is detected while monitoring the feedback channel, a duration of the feedback transmission being smaller than duration of the transmission over the communication channel, and determining whether transmission was successful, if transmission continues after modifying transmission parameters. Other embodiments of methods for transmitting and receiving information, as well as systems that implement the methods, are also disclosed.

Abstract: A communication system comprises a control station and a child station. The child station decides a communication period between the child station and the control station in order to maintain a connection state in a power save mode. The decision of the communication period is performed in accordance with a predetermined wake-up period, a time-out value that maintains the connection state even when no communication is taking place, and a frame length that is a unit of the communication. The child station decides on the time-out value to be the communication period when the wake-up period is greater than the time-out period, and decides on the wake-up period to be the communication period when the wake-up period is less than or equal to the time-out period. The child station then transmits the decided communication period to the control station.

Abstract: The present invention provides a novel method and system for effecting CDMA handoff transitions. In an embodiment, a converter is provided that converts a conventional CDMA trigger signal at a first frequency into the same handoff trigger signal but at second frequency. Where a subscriber station is operating in a coverage area at the second frequency, the received CDMA re-direction signal can be used to trigger the handoff of the subscriber station from the second frequency to the first frequency.

Abstract: An information transmission source forms a transmission packet at a predetermined time unit into which a preamble is inserted and transmits it. The information reception target returns an acknowledge (ACK) packet or a not acknowledge (NACK) packet into which a preamble is inserted. A hidden terminal recognizes that the transmission path is used for data retransmission from when the NACK is received to when the next ACK is received to avoid collisions. Further, when there is transmission data at the information transmission source specified by a beacon signal, it is recognized that the transmission path is used until the next ACK is received. For example, in an ultra wide band communication method, access control is executed while avoiding collisions of communications and a retransmission control is executed.

Abstract: Methods and apparatus related to broadcasting data and interference management in a peer to peer wireless communications network are described. Scheduling of traffic air link resources is performed on a slot by slot basis in a decentralized manner. Wireless devices intending to broadcast traffic signals transmit broadcast request signals, sometimes alternatively referred to as broadcast indicator signals. A priority level is associated with each of the broadcast request signals. A receiver device intending to receive broadcast signals detects the broadcast request signals and makes an interference determination as to whether the higher priority broadcast traffic signal can be successfully recovered in the presence of lower priority broadcast traffic signals.

Abstract: A packet-based multimedia service is provided to a terminal in a network. A packet signaling connection is established between the terminal and the network. Signaling information for the multimedia service is transferred via the packet signaling connection using Session Initiation Protocol (SIP) or a similar protocol. A circuit bearer connection is also established with the terminal. Data for the multimedia service is transferred via the circuit bearer connection. This allows the data to be carried across networks which do not support the required QoS functionality for the packet-based service, or which cannot efficiently carry packet-based data. The circuit bearer connection can be established by a network entity or by the terminal. The circuit bearer can be interworked to a packet-switched bearer at some point in the network, such as at a gateway, so as to provide a remote party with the appearance that a fully packet-switched connection is being used.

Abstract: Methods and node capable of establishing link-weights based on protection-factor linked to protection level of a plurality of links between a source node and a destination node and capable of establishing primary and, potentially, protection path proposals using the established link-weights. An available bandwidth value for the link is determined. If the available bandwidth value for the link is greater than the bandwidth requirement associated to the potential path, then the link-weight of the link is set by computing a protection-factor associated to the link with the available bandwidth value for the link. Otherwise, the link-weight of the link is established to a value that indicates that the link should not be part of the potential path. Shortest path algorithm using the established link-weights could be applied to obtain path proposals.

Abstract: An intermediate network node is configured to forward a plurality of packets concurrently, e.g., as a vector, rather than one packet at a time. As such, the node can load a single sequence of forwarding instructions that may be repeatedly executed for packets in the vector. In addition, the intermediate network node adaptively controls the rate at which it processes data packets through a directed forwarding graph. To that end, the intermediate node is configured to dynamically select the number of packets per vector, i.e., vector size, processed at each node of the forwarding graph. Further, the intermediate node also may be configured to dynamically select timing intervals for one or more “node timers” used to control the rate at which packets traverse through the graph. Illustratively, the vector size and node-timer intervals are selected so that the average latency through the forwarding graph is less than a predetermined target latency, e.g., 50 microseconds (?s).

Abstract: The invention relates to a rapid response method for the failure of a link between two routing domains in a packet-oriented network. Once the failure of a link has been identified, substitute routes are provided for the interrupted routes by the local selection of alternative routes and by the propagation of messages along the substitute routes. In contrast to conventional inter-domain protocols such as the BGP (Iborder gateway protocol) the transmission of messages and the associated modification to the routing only involves routing domains that lie along the replacement routes. In one embodiment, a network-wide propagation of messages takes place if the failure of the link represents a persistent breakdown. As a consequence, optimal routes are re-determined in the entire network. The invention provides breakdown compensation that is appropriate for temporary breakdowns and prevents instabilities that occur as a result of the use of conventional inter-domain protocols.

Abstract: An end device on a Zigbee network exits a power saving mode and transmits a wake notification message to the network. The network retrieves a cached status flag indicating whether the end device is defined on the Zigbee network and transmits the status flag to the end device. If the end device is undefined on the Zigbee network, the end device attempts to re-join the network. During the power saving mode, the network can cache messages intended for the end device and transmit the messages to the end device when the device exits the power saving mode.

Abstract: A method for performing radio bearer mapping in an user equipment of a wireless communications system includes setting a plurality of multiplexing options of a frequency division duplex radio bearer, called FDD RB hereinafter, when the user equipment operates in a Cell Dedicated Channel state, each of the plurality of multiplexing options corresponding to a multiplexing mode, determining whether an RB of the user equipment has one of the plurality of multiplexing options, and using a multiplexing mode corresponding to a multiplexing option of the plurality of multiplexing options for performing RB mapping when the RB has the multiplexing option.

Abstract: A method of load balancing data packets at an array is disclosed. The method includes receiving a data packet encoded in a first format at an input of the array. The received data packet is assigned to an assigned element of the array, and the data packet is routed to a device. A message encoded in a second format is received from the device at the array. Information is extracted from a payload portion of the message, and the message is assigned to the assigned element of the array based on the information extracted from the payload portion of the message.