The present invention is generally directed to a system for monitoring a variety of environmental and/or other conditions within a defined remotely located region. In one aspect, a system is configured to monitor utility meters (613) in a defined area. The system is implemented by using a plurality of wireless transmitters (614), each integrated into a sensor (612) adapted to monitor a particular data input. The system also includes a plurality of transceivers (221) that are dispersed throughout the region at defined locations. The system uses a local gateway (210) to translate and transfer information from the transmitters to a dedicated computer (260) on a network (230). The dedicated computer collects, compiles and stores the data for retrieval upon client demand across the network. The computer further includes means for evaluating the received information and identifying an appropriate control signal to be applied at a designated actuator.

System and method for monitoring and controlling remote devices

A wireless network, which includes a wireless router client operable to broadcast data packets to at least one wireless server and one additional wireless client. Each client and server includes programs for determining optimum routes between them. The client also includes a program for determining if a received data packet is not addressed to it and if the packet has been sent via a new optimal route unknown to the client, and for notifying the respective server of such a new optimal route.

Wireless network system and method for providing same

Data sets with multiple, heterogeneous feature spaces occur frequently. We present an abstract framework for integrating multiple feature spaces in the k-means clustering algorithm. Our main ideas are (i) to represent each data object as a tuple of multiple feature vectors, (ii) to assign a suitable (and possibly different) distortion measure to each feature space, (iii) to combine distortions on different feature spaces, in a convex fashion, by assigning (possibly) different relative weights to each, (iv) for a fixed weighting, to cluster using the proposed convex k-means algorithm, and (v) to determine the optimal feature weighting to be the one that yields the clustering that simultaneously minimizes the average within-cluster dispersion and maximizes the average between-cluster dispersion along all the feature spaces. Using precision/recall evaluations and known ground truth classifications, we empirically demonstrate the effectiveness of feature weighting in clustering on several different application domains.

/pdf/feature-weighting-in-k-means-clustering-5ggf3vms0c.pdf

Feature Weighting in k -Means Clustering

A packet network employs routers that determine network routing based on quality of service (QoS) provisioning parameters and network topology information. QoS provisioning parameters are provided to each router from a network management database, and the network topology information is determined from a link state database of the router. The link state database may include network topology information collected by the router in accordance with the open shortest path protocol (OSPF). A network link, router, or other node failure initiates a new path-selection process. First, a temporary set of provisioning entries may be determined with a shortest path first (SPF) routing method. Then, the network packet flows may be classified into packet flows, real-time and non-real-time, and then as packet flows that require reserved bandwidth or that may be multiplexed. A multicommodity flow (MCF) routing method is then employed to determine an optimized set of candidate provisioning entries for the packet flows that may be multiplexed. The MCF routing method determines new routing for the packet flows based on QoS provisioning commitments as parameters. The MCF routing method determines the new routing based on an optimization criterion, such as maximized revenue. Once the new routing is determined, routing of network traffic is enabled by converting the provisioning entries into filter rules, which are then loaded into the packet classifier of the router.

Adaptive routing system and method for QOS packet networks

A system in which a single VLAN architecture spans multiple VLAN transport protocols and technologies, including a method and system in which multiple different VLANs may be combined in a single enterprise network. Each LAN-switch in the sytem identifies each frame with an identifier, and associates that identifier with particular VLAN identifiers for each type of VLAN technology. When a frame is bridged or routed from a first type of VLAN to a second type of VLAN, the first VLAN encapsulation is removed and the second VLAN encapsulation is added, with appropriate change in the VLAN identifier for the frame or packet. The identifier may also be implicit for the frame, such as when a particular set of sender's MAC addresses are identified with a particular VLAN. Individual VLANs, of whatever architecture, may be added, configured or reconfigured, modified, or deleted, using control tools associated with the multiple VLAN architecture system. Individual ports may be associated with particular VLANs, or may be designated "dynamic" so that frames or packets associated with those ports are associated with particular VLANs in response to source or destination addresses or other information.

Multiple VLAN architecture system

A method is described for network optimization based on a multirate, circuit-switched analysis. Network loss probabilities are determined as a solution of a set of fixed point equations and the sensitivity of network performance, as a function of offered load and loss probabilities, is determined as a solution to a set of linear equations. Because the numerical complexity of solving both the fixed point equations and the sensitivity equations is of an order which renders an exact solution computationally intractable, an asymptotic approximation is applied which yields a solution to the network loss probabilities and network sensitivities. A global optimization procedure is then applied using an iterative, steepest ascent optimization procedure to yield a set of virtual path routings and capacity allocations.

Optimization method for routing and logical network design in multi-service networks

The invention discloses a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given. The routing optimality is measured with respect to some objective function (e.g., average network delay).

Method and apparatus for routing and link metric assignment in shortest path networks

Disclosed are network management procedures that apply measurements of traffic load to achieve greater efficiency in the operation of the network. In a method for deciding whether to route an incoming call on a selected potential service route, the potential service route is treated preferentially if each of its links has available capacity that is more than sufficient by a specified margin. In a method for computing billing revenues, the non-compliance of the network service provider with contracted requirements for carried load causes a revenue penalty to be exacted for lost bandwidth.

Measurement-based management method for packet communication networks

A method is disclosed for determining the shortest paths between a source node and a destination node in a network wherein the paths satisfy imposed system constraints. In accordance with the method of the invention, candidate paths are evaluated by accumulating system parameter information from a source node and projecting the system parameter information ahead to the destination node. When the accumulated and projected system parameter information for the candidate path satisfies the imposed system constraints, the candidate path is saved for further evaluation. The candidate paths are sorted in the order such that those paths most-likely to have the shortest lengths and satisfy the imposed system constraint are evaluated first. In one embodiment of the invention, candidate paths that fail to satisfy the imposed system constraints are removed from further processing. Thus, only candidate paths that have at least one complete path that satisfies the imposed system constraints are evaluated further.

Kajamalai Gopalaswamy Ramakrishnan

Papers

Optimization method for routing and logical network design in multi-service networks

Method and apparatus for routing and link metric assignment in shortest path networks

Measurement-based management method for packet communication networks

Method for finding shortest network routing paths subject to system constraints

Method for logical network design in multi-service networks