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

In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extreme, you will learn where they tend to fail to contribute to the twin goals of network efficiency and cost-savings. Most of all, you will learn precisely how to tailor theoretical models to make them as useful as possible in practice. Throughout, the authors focus on the traffic demands encountered in the real world of network design. Their generic approach, however, allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network. For beginners, this book is an excellent introduction. For seasoned professionals, it provides immediate solutions and a strong foundation for further advances in the use of mathematical modeling for network design. (Less)

Routing, Flow, And Capacity Design In Communication And Computer Networks

A system of techniques is presented for optimizing open shortest path first (OSPF) or intermediate system-intermediate system (IS-IS) weights for intradomain routing in a changing world, the goal being to avoid overloaded links. We address predicted periodic changes in traffic as well as problems arising from link failures and emerging hot spots.

/pdf/optimizing-ospf-is-is-weights-in-a-changing-world-5nzxnxua3u.pdf

Optimizing OSPF/IS-IS weights in a changing world

Traffic engineering involves adapting the routing of traffic to network conditions, with the joint goals of good user performance and efficient use of network resources. We describe an approach to intradomain traffic engineering that works within the existing deployed base of interior gateway protocols, such as Open Shortest Path First and Intermediate System-Intermediate System. We explain how to adapt the configuration of link weights, based on a networkwide view of the traffic and topology within a domain. In addition, we summarize the results of several studies of techniques for optimizing OSPF/IS-IS weights to the prevailing traffic. The article argues that traditional shortest path routing protocols are surprisingly effective for engineering the flow of traffic in large IP networks.

/pdf/traffic-engineering-with-traditional-ip-routing-protocols-3kvfodzn0z.pdf

Traffic engineering with traditional IP routing protocols

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

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

In this paper we address the problem of optimal routing in shortest-path data networks — such as Internet protocol (IP) networks — using open shortest path first (OSPF), routing information protocol (RIP), and other interior gateway protocols (IGPs). We propose a combinatorial algorithm for solving the optimal shortest-path routing problem, which consists of finding the link-distance metric assignment to all links in a network that results in optimal shortest-path routing and minimizes the average delay of packets in the network. Minimizing the delay of packets is critical, especially in the emerging voice over IP (VoIP) networks, quality of service (QoS)-centric virtual private networks (VPNs), and networks carrying other delay-sensitive traffic flows. Finding optimal link metrics that result in shortest-path routing is a special case of a classical inverse shortest-path problem. We propose a combinatorial approximation algorithm and illustrate the effectiveness of the proposed algorithm by comparing the results with bounds for several data network instances. We investigate not only the sensitivity of the solution with respect to the starting point, but also the sensitivity of the algorithm's performance with respect to uncertainty in traffic. We show that one preferred starting point consistently converges to near-optimal solutions. In addition, we extract two other distance metrics from the solution to the optimal general routing problem and show that these are preferred starting points for small or sparsely connected networks.

Manoel Alberto Rodrigues

Papers

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

Optimal routing in shortest-path data networks

Method for shortest path routing