Abstract: Systems and methods are provided for ranking electronic information based on determined similarities. In one aspect a set of unique features are determined from a collection of electronic objects. A graph is constructed in which electronic object are represented as object nodes and determined features are represented as feature nodes. The object nodes are interconnected by a weighted edge to at least one feature node. Scores for the object nodes and the feature nodes are computed using a determined set of anchor nodes and a determined weighted adjacency matrix. The object nodes and the feature nodes of the graph are ranked and displayed based on the computed scores. In one aspect, the scores and the ranks for the object nodes and the feature nodes are dynamically updated and displayed based on user preferences.

Abstract: Systems and methods are provided for organizing and processing information in a graph having a number of nodes interconnected by a number of edges. An array E lists neighboring nodes for nodes of the graph that have at least one neighboring node in a determined order of the nodes. Positions in array E of a last neighboring node listed in array E for respective nodes are listed as corresponding entries in an array V based on the determined order of the nodes. In various aspects, array E and array V are used to determine information for the graph, including degrees or neighboring nodes of one or more given nodes of the graph. The system and methods disclosed herein are applicable for determining relative ranks for the nodes of the graph.

Abstract: Real-time broadcast and multicast based packet transmissions/services over a wireless, local area networks (WLAN) may be improved by reducing the interference across neighboring access points (APs) while minimally impacting the performance of unicast transmissions/services. Minimal impact is assured by scheduling the transmission of multicast packet flows such that the duration of the time period required to transmit such flows is also minimized. One type of method provides a constant approximation of an optimal time period/schedule while another provides a logarithmic approximation of an optimal time period/schedule.

Abstract: Real-time broadcast and multicast based packet transmissions/services over a wireless, local area networks (WLAN) may be improved by reducing the interference across neighboring access points (APs) while minimally impacting the performance of unicast transmissions/services. Minimal impact is assured by scheduling the transmission of multicast packet flows such that the duration of the time period required to transmit such flows is also minimized. One type of method provides a constant approximation of an optimal time period/schedule while another provides a logarithmic approximation of an optimal time period/schedule.

Abstract: Disclosed is a method and apparatus for scheduling multiple carriers to service multiple users in a multi-carrier wireless data network. A data transmission in a multi-carrier wireless data system can be scheduled in frames comprising one or more time slots. For each frame, each of multiple carriers in each time slot of the frame are assigned to one of multiple users. Various objective functions can be used to assign the carriers to the users based on a weight for each user and a channel rate of each carrier for each user while preventing excessive carriers from being assigned to a user.

Abstract: A method and apparatus for scheduling the transmission of data packets over a multihop wireless backhaul network in which delay guarantees through the network may be advantageously ensured. Illustratively, a novel packet scheduling scheme is provided which is advantageously based on an existing scheduling policy for wireline networks and for which a delay guarantee (based on the delay characteristics of the existing scheduling policy) can be advantageously ensured. In one embodiment, an even-odd link activation framework is defined for a given multihop wireless backhaul network, and an associated scheduling policy based on an arbitrary existing scheduling policy for wireline networks is derived and adopted. In such a case, the derived scheduling policy, when applied to the given multihop wireless backhaul network, advantageously ensures a worst-case delay guarantee of approximately twice that of the existing scheduling policy for wireline networks.

Abstract: A method for determining a master ring for an optical communications network having nodes arranged in a plurality of interconnected ring structures. (A master ring is a ring structure which contains every node in the network exactly once, and which also respects the node ordering of every individual ring.) An efficient solution to the master ring problem is provided by advantageously limiting the enumeration process based on the consistency of the enumeration of individual rings with each other. Illustratively, an intersection graph of the network is generated; one or more of the rings is chosen and possible openings of each of these rings are enumerated; and a limited number of possible openings of one or more other (i.e., non-chosen) rings are enumerated such that the enumeration of the possible openings of the other (i.e., non-chosen) rings are consistent therewith.

Abstract: Techniques for use in designing, adjusting or operating a wireless network so as to provide a desired level of performance for the network. An optimization process is applied to a set of information characterizing the network. The optimization process includes at least a pre-frequency-assignment optimization stage, which is applied prior to assignment of frequencies to one or more communication channels of the wireless network. An output of the optimization process is utilized to determine one or more operating parameters of the wireless network, such as a base station transmit power or antenna orientation.

Abstract: Techniques for use in designing, adjusting or operating a wireless network so as to provide a desired level of performance for the network. An optimization process is applied to a set of information characterizing the network. The optimization process is implemented as a multi-stage process which includes at least a frequency assignment stage and a post-frequency-assignment optimization stage, wherein the frequency assignment stage and the post-frequency-assignment stage are subject to iteration. For example, after an initial assignment of the frequencies in the frequency assignment stage, the post-frequency-assignment optimization stage may be performed, and based on the result of the optimization, at least one of the frequency assignment stage and the post-frequency-assignment optimization stage may be repeated. An output of the optimization process is utilized to determine one or more operating parameters of the wireless network, such as a base station transmit power or antenna orientation.

Abstract: A method of determining an optimal path from a source node to a destination node over a number of links in an information network having n nodes. Each link has an associated cost-delay function, the optimal path is constrained to an overall delay of D, and a total cost of all links along the path is to be minimized at a value OPT. The method includes maintaining a range [L, U] for OPT, wherein L is a lower bound and U is an upper bound, and setting initial values for L and U. A cost value V is set corresponding to {square root over (U·L)}, and a scaled cost c′ is derived for each link wherein c′ corresponds to cn/V&egr;, c is an actual cost for each link, and &egr;>0. If a feasible path having a delay of at most D and a total cost of at most V is found not to exist, then the value of L is increased to V, a new cost value V is set and the link costs c′ are further scaled. The values of L and U are reset until U/L<2 and a feasible path continues to exist.

Abstract: A method is disclosed, for designing an access network that is to carry communication traffic between end nodes and a core network. Information is provided that describes end node locations, the level of demand associated with each end node, available trunk types and their related capacities, and a cost structure. The cost structure includes a fixed overhead cost for each trunk type, and a service charge per unit distance for each trunk type. The provided information is incorporated in a linear program to find an optimal-cost access network. The linear program is solved to obtain a provisional solution that defines the composition and usage of each link of the optimal-cost access network. For each such link, the composition is defined by a fractional level of investment (incurring a like fraction of the corresponding overhead charge) in each pertinent trunk type.