Abstract: Semiconductor diode lasers are tiny sources of light powered by electricity. These are used extensively in medical and aesthetic applications. This patent application covers the concept of replaceable laser diodes for a wide range of applications. Historically, the high power laser sources have been prohibitively expensive to contemplate such an idea. However, as technology advances the price per Watt continues to fall dramatically. Somewhat analogous to the Gillette safety razor concept, this patent application describes how diodes can be replaced in a manner akin to the ordinary razor blade. Simply put, this invention describes replaceable laser light sources for aesthetic and medical applications.

Abstract: The present invention demonstrates how network-coding can be applied to a deterministic broadcast approach, resulting in significant reductions in the number of transmissions in the network. We propose two algorithms, that rely only on local two-hop topology information and make extensive use of opportunistic listening to reduce the number of transmissions: 1) a simple XOR-based coding algorithm and 2) a Reed-Solomon based coding algorithm that determines the optimal coding gain achievable for a coding algorithm that relies only on local information.

Abstract: An advance over the prior art is achieved through an efficient method to retransmit erroneous frames by identifying the users who are most likely to experience a frame error and requests retransmissions from them. Since the recovery is done by starting with the most likely, second most likely etc., the invention results in faster recovery of data. Moreover, the invention reduces the battery consumption of subsequent mobile nodes by suppressing the retransmission requests that were already made by nodes preceding it. A key element of the invention is to rank the set of receiver nodes in the order of decreasingly worse channel conditions, i.e., from worst to best. Hence, with K receiver nodes, a transmit node assigns rank 1 to a receiver node to which it has the poorest radio channel condition. Similarly, it assigns rank K to the receiver node to which it has the best radio channel condition.

Abstract: The present invention is a methodology to prioritize packets based on the conditional probability that given the values of attributes carried by packet, the packet is a legitimate one. We will call this the conditional legitimate probability of a packet from here onward. The conditional probability of each packet is evaluated based on Bayesian estimation technique. This is accomplished by comparing the attributes carried by an incoming packet against the “nominal” distribution of attributes of legitimate packet stream. Since an exact prioritization of packets based on their conditional legitimate probability would require offline, multiple-pass operations, e.g. sorting, we take the following alternative approach to realize an online, one-pass selectively dropping scheme.

Abstract: The present invention is a method and apparatus to aggregate or bundle packets to optimize the resource utilization and improve the transport efficiency of packets which are transferred between various protocol layers in a communications network. One embodiment of the invention sets forth a method of aggregating packets of a first size to packets of a second size for transmission in a wireless communications network between, for example, a base station controller and base transmitting station. The method includes the steps of calculating a maximum bundling factor represented by (an IP packet MTU size at a first location minus protocol overhead) divided by an application layer packet size and determining a most efficient bundling factor in terms of packet fragments, where the most efficient bundling factor is determined by a largest packet per fragment ratio.

Abstract: This invention introduces an intelligent buffering sharing scheme that supports multiple service classes and multiple drop priorities per class. The available buffers are shared between different queues but at the same time every queue will be guaranteed a certain minimum buffer allocation. Other schemes presented in the literature to not address this minimum buffer guarantee in the presence of multiple service classes and drop priorities. In addition, the scheme presented in this innovation is based on a static threshold approach that has certain implementation cost tradeoff with another dynamic threshold approach presented in the literature that deals with buffer management in the presence of multiple service classes and drop priorities per class.

Abstract: In a UMTS network, each packet data service user requires a dedicated channel (DCH) to transmit at high data rates. However, the number of DCHs available is small due to code and power limitations. Thus many users will have to be allocated the same DCH on a time sharing basis. Such sharing will not impact the quality of service for users whose applications are not delay sensitive and whose traffic generation pattern toggles between transmit and idle states. Such applications include web browsing, FTP sessions and E-mail. The present invention discloses four algorithms that can be used to dynamically allocate DCH channels to a contending user based on the user's need according to its traffic generation.

Abstract: The present invention enhances reliable flooding of link state advertisements (LSAs) using retransmission. In accordance with the present invention, a technique is disclosed to make a retransmission timer more responsive to dynamic network conditions. This technique varies the retransmission timer value as network conditions change providing the capability to alleviate the culmination of CPU utilization and memory resource exhaustion that may arise from fast retransmission while still achieving the object of fast flooding whenever possible. The retransmission timers provided by the present invention are assigned on a “per neighbor” basis.

Abstract: A methodology is provided for fault detection and service restoration in a multiservice switch on a per flow basis. An ingress source transmits the same data over each of two redundant cores. An egress receiver selects on a per flow bass which core to utilize. Bi-directional flows are not necessarily grouped together. The basic approach to fault detection is to assume that the two cores are not in lock step, but that the shelves are continually monitoring link flows for control path data as well as user data. The path monitoring is accomplished using a combination of arbiter and aggregator functions found in the service shelves and core interface cards, respectively. The arbiter transmits link test cells to both cores on a per flow basis, wherein the link test cells traverse and are monitored by respective aggregators to and from each core. When an egress arbiter determines that a flow is bad, it initiates a switch to the alternative source core, from which the flow would continue.

Abstract: An advance over the prior art is achieved through an efficient method for the dynamic selection of frequencies with low occupancy in a manner that results in minimizing the search for such frequencies and the risk of a large of number of nodes choosing the same frequency. A method for dynamically selecting the frequencies according to the invention includes the following parts. A channel loading indicator that determines if the mobile node needs to look for a new channel. A channel search algorithm that quickly determines the new channel to be used. A tracking algorithm that remembers the channels that were most recently determined to be loaded and hence should be avoided in the near future. In one embodiment of the invention a method of selecting frequencies for use by a device in a wireless communications network is presented.

Abstract: The present invention is a methodology for predicting when current sets of encryption keys used in a high speed data network are about to expire. The invention allows network elements of a communication system to re-negotiate new sets of keys well in advance so as to prevent interruptions in communications traffic flow. In accordance with one exemplary embodiment of the invention, a weighted traffic flow per usage for a given network element is calculated on a periodic basis. The value of the weighted traffic flow per usage is compared with a remainder value of a specific quantity of communications traffic yet to be processed by the network element. If the remainder value is less than the weighted traffic flow value, an indication is given to the appropriate network element to renegotiate a new set of keys.

Abstract: The present invention provides a network support mechanism, called Sync-VPN, that is transparent to real-time, multi-user distributed applications, such as online multi-player games in which the order of player actions is critical to the outcome. The invention uses a client/server application model, where a server coordinates state updates based on action messages sent by clients. The invention builds on bandwidth-quaranteed VPN service to ensure predictable packet delay and loss characteristics, thereby providing predictable packet service, state update fairness, and player action fairness. A Sync-out mechanism synchronizes delivery of state updates to all players enabling them to react to the same update fairly. A Sync-in mechanism processes action messages from all players in a fair order based on real-time occurrence. Sync-VPN employs a round-trip time estimation algorithm essential to message latency estimation in the Sync-out and Sync-in mechanisms.

Abstract: The Core Network Management Object Model of the present invention generically models the physical and logical objects in a configuration management system. The present invention also models the generic action objects required to manipulate the network objects. Unique object level information is isolated at the leaf level of the object model and is not proliferated to other generic parts of the model. The action objects all model different actions that need to be performed in a configuration application architecture and insulates the network objects from having any knowledge of session and event information. Leaf objects and actions are specialized to perform any configuration related actions. In the Core Network Management Object Model an Object Factory creates the unique object and an Action Factory creates the unique action. The action shall then be performed on the unique object to get, set and modify device information through SNMP and also to store the information in the database.

Abstract: The present invention sets forth a methodology for providing improved downlink backhaul services from a radio network controller (RNC) to a plurality of base stations via a backhaul network that provides Ethernet services. The Ethernet services are provided by a group of provider edge (PE) switches and regular label switch routers (referred to as P switches). Base stations within the network are assigned into clusters, each of the clusters having a cluster ID. The RNC transmits packets to a given switch or switches out on the network based on a cluster ID included within the transmitted packet. The communications traffic is then multicast from at least one last hop switch in the network to candidate base stations on the basis of the cluster ID and an active set within the cluster. Advantageously, the clusters act as subgroups for more easily directing the transmission of the backhaul multicast traffic.

Abstract: An optical fiber cable is tested to determine the zero dispersion frequencies of the sections of which it is made by directing light along it, the light comprising two optical frequency components having optical frequencies that differ by a predetermined amount ??. The frequencies of the components are swept across the operating frequency range of the cable, keeping ?? constant. At the other end of the cable, the spectrum of the light is analyzed to determine the relative powers of first order 4 WM components (satellite lines) and the frequencies at which they have principal maximum values.

Abstract: A multi-table-based grant generator in accordance with the present invention solves the issue of bandwidth granularity, while maintaining the simplicity of a table approach. The present invention grant generator provides grants of fine granularity for regulation of upstream transmission of cells in an ATM PON. Multiple grant tables having differing bandwidth granularities are linked together through a simple grant distribution mechanism. The grant tables and grant distribution mechanisms can be recursively linked to achieve a number of different granularities. The grant generator of the present invention is based on multiple grant tables with a combination of multiplexers, dividers, and address counters. The grant generator provides both larger and smaller bandwidths for data grants as well as PLOAM grants without large size grant tables. In one exemplary embodiment of the present invention, improved granularity is achieved, where a first grant table is used for one size of bandwidth grant, e.g.

Abstract: A bi-directional optical transmission system according to the present invention provides transport of x optical channels over n nodes. The system supports two-way transport of the x channels over a single fiber connecting each of the nodes in sequence. The system is advantageous in that only two optical transmission bands are utilized in order to achieve minimal loss in the separation of bands. The use of only two bands permits the utilization of low-loss wide band thin film optical filters to combine and separate the signals at each node. A reflection port of this filter is used to carry oppositely directed signals of the second band from the bi-directional fiber to an optical amplifier for the second band. An alternate arrangement of the optical filters in the two separate bands is chosen to maximize the optical performance of the overall system and significantly reduce insertion losses.

Abstract: The present invention is a core interface mechanism that permits 1:N type port protection on the core side of the switch such that core bandwidth is not wasted by the direct connection of service cards to the switching core. In an exemplary embodiment, a core interface module supports up to two active service cards and one dedicated protection service card. To provide increased efficiency and lower cost the redundant service card does not strand user bandwidth in the switch core. In an exemplary embodiment, the core interface includes a plurality of core side input and output ports for coupling to the switching core and a plurality of card side input and output ports for coupling to the service cards. A data flow switch function couples between the core side ports and the card side ports. The data flow switch function operates to complete data flow paths between the core side ports and the card side ports.

Abstract: The present invention is an I2C (inter-IC control) bridge device which implements a communication protocol layered on top of a standard I2C protocol. The layered protocol used by the bridge device is termed the “Layered I2C Protocol”—abbreviated “LIP”. Thus the bridge device is called a “LIP bridge device”. The LIP bridge device provides I2C address extension, data integrity checking, and fault detection and isolation when inserted between an I2C bus master and it's intended target I2C device. Each LIP bridge device has at least two attached I2C busses—a parent bus and a child bus. The LIP bridge operates as a slave on its parent bus, and a master of its child bus. The Layered I2C protocol is specified to operate on a bus between one or more bus masters and the parent bus of one or more LIP bridge devices. The child bus is used for attaching multiple I2C devices and/or one or more LIP bridge devices.

Abstract: In a code division multiple access (CDMA) wireless system, a wireless terminal transmits information packets to a communications systems controller. Each information packet comprises a piggy back field which indicates to the communication systems controller resources requested by the wireless terminal for transmission of subsequent information packets.