217results about How to "Efficient networking" patented technology

Apparatus and methods implement aggregation frames and allocation frames. The aggregation frames include a plurality of MSDUs or fragments thereof aggregated or otherwise combined together. An aggregation frame makes more efficient use of the wireless communication resources. The allocation frame defines a plurality of time intervals. The allocation frame specifies a pair of stations that are permitted to communicate with each other during each time interval as well as the antenna configuration to be used for the communication. This permits stations to know ahead of time when they are to communicate, with which other stations and the antenna configuration that should be used. A buffered traffic field can also be added to the frames to specify how much data remains to be transmitted following the current frame. This enables network traffic to be scheduled more effectively.

Systems and methods are provided to implement a dynamic and efficient cascading policy management framework architecture for both wired and wireless networks. A plurality of Policy Functions (PFs) are assigned to a plurality of Policy Enforcement Points (PEP). The PFs make decisions regarding local policy control at the specific PEP. The PFs then delegate the policy requests or IP flows to a separate PEP that is more conducive to enforcing that policy request. Thus, policy decisions are made at the point where the most information is available, leading to fewer policy requests traversing back and forth across a network. Additionally, this cascading Policy Management Framework Architecture allows for unified policy management across multiple types of networks, including wired (Internet) and wireless (UMTS).

A wireless network troubleshooting tool for monitoring an IEEE 802.11 wireless LAN is connected via an access point to the latter, and programmed for capturing a plurality of frames data packets traveling to and from the LAN, for performing a detailed protocol analysis on the contents of the headers associated with the captured frames, to detect and diagnose failures or defects in the monitored wireless networks, to permit repair.

A topology discovery process is used to discover all of the links in an ad hoc network and thereby ascertain the topology of the entire network. One of the nodes of the network, referred to as the coordinator, receives the topology information which can then be used to, for example, distribute a routing table to each other node of the network. The process has a Diffusion phase in which a k-resilient mesh, k>1, is created by propagating a topology request message through the network. Through this process, the nodes obtain information from which they are able to discern their local neighbor information. In a subsequent, Gathering phase, the local neighbor information is reported upstream from a node to its parents in the mesh and thence to the parents' parents and so forth back to the coordinator. The robustness of the Diffusion phase is enhanced by allowing a node to have more than one parent as well as by a number of techniques, including use of a so-called diffusion acknowledgement message. The robustness of the Gathering phase is enhanced by a number of techniques including the use of timeouts that ensure that a node will report its neighbor information upstream even if it never receives neighbor information from one or more downstream neighbors and the use of a panic mode that enhances the probability that a node will get its neighbor information, and its descendents' neighbor information, reported upstream even if that node has lost connectivity with all of its parents.

A method of distributed control of a wireless mesh network without knowledge of global topology. The method includes: a station joining the network with any current member by propagating the join-request, or two meshes merging using the steps of: one mesh joining the other as a whole and then re-synchronizing its timing. The method further includes: first, each station periodically transmits a beacon; second, in response to a beacon being no longer detected, a station transmitting a bitmap of stations that it can still receive; third, each station responds by adding stations that it can receive with all of the bitmaps received from other members, and retransmitting the updated bitmap; fourth, after time for all stations to respond, all stations base current membership on the bitmap. The method further includes: determining sharable time slots that will not interfere with neighbors or other slot sharers, using and then releasing those slots.

The present invention includes novel techniques, apparatus, and systems for optical WDM communications. Various wavelocker apparatus and methods are disclosed that measure the frequency offsets between signal lasers and reference lasers. The measured offsets are used to adjust the signal laser frequencies to meet their target frequencies. The absolute accuracy of the reference laser frequency is improved by measuring the absorption of the reference laser by a gas cell with known fixed absorption lines versus the reference laser frequency. Apparatus and methods are disclosed to cover scenarios in which the reference laser polarization is aligned with the signal lasers, as well as those in which the reference laser polarization is not aligned with the signal lasers. The wavelocker apparatus may or may not be located at the same network site as the signal lasers.

Methods and apparatus for automatically creating a circuit path that includes specified elements are disclosed. According to one aspect of the present embodiment, a method for computing a circuit path between a source node and a destination node of a network includes identifying at least a first element that is to be traversed by the circuit path such that the path passes from the source node, traverses the first element, then passes to the destination node. The method also includes routing a first segment of the circuit path automatically such that the source node and the first element are components of the first segment. In one embodiment, routing the first segment automatically includes routing the first segment automatically using a shortest path first algorithm.

Described herein are methods and systems for preparing to efficiently distribute data to be extracted from a data store to clients and for distributing such prepared data to the clients. The methods and system have particular utility in the context of a network monitoring system which captures and stores network event data and makes the event data available to clients according to any desired view or summary. One method for preparing the data involves storing as primary requests one or more client requests for data to be extracted from the event database. Additional client requests for event are each compared to the stored primary requests to determine whether each additional request matches a stored primary request in accordance with a given criterion, such as a filter or summary formula. If the additional request matches a stored primary request, the additional client request is associated with the matching primary request. If the additional request does not match a stored primary request, the additional request is stored as a new primary request. As a result of this method, client requests which match one another can be processed at once and distributed to all clients registering the request.

A game device is provided with a processor and an air interface apparatus. In a wireless communication environment such as that of IEEE802.11, a CPU of the air interface apparatus selects, in a search process, an SSID that includes at least in a portion thereof a predetermined pattern. Network information including the selected SSID is retained in a memory unit as a BSS list registering wireless networks that are targets, for connection. The processor refers to the BSS list and determines a wireless network to participate in.

The invention relates to an RFID based intelligent logistics managing system, which belongs to the field of logistics management, and used for managing logistics information of cargoes with RFID tags. The logistics managing system comprises a logistics control system, a storage system arranged in a warehouse and a vehicle-mounted mobile module, wherein the logistics control system is connected with the storage system and the vehicle-mounted mobile module via a communication network to realize commutation between the logistics control system and the storage system or the vehicle-mounted mobile module, each of the storage system and the vehicle-mounted storage system is equipped with an RFID reader, the RFID readers read information of the RFID tags, and the RFID information is transmitted to the logistics control system. According to the RFID based intelligent logistics managing system, logistics information can be managed in a highly-efficient, automatic, informationized, networked, intelligent and flexible manner.

A system for scanning computer files for unwanted properties, such as containing computer viruses or being spam e-mail, allocates a priority to pending scan requests based upon the identity of a computer user associated with the scan request. In the case of a normal file access request, the computer user associated with the scan request may be the file access request or in the case of an on-demand scan, then the computer user associated with a particular scan request for a computer file may be the owner or creator of that computer file. In the case of scan requests associated with e-mails, the sender or recipient computer user may be used in the allocation of a priority level for the scan request.

In a communication network, the network management system NMS keeps one or more element management system EMS in synchronization of network topology changes using requests that are automatically generated or manually requested and then sent from the NMS to the affected EMS(s) whenever a node topology change is made at the NMS. Examples of changes are node creation, node move, node group move, node group renaming, etc. As the changes are completed in the EMS topology database, the EMS sends acknowledgments of the request to the NMS. This functionality requires verification of the validity of the request for that specific EMS, before the change is implemented at the NMS.

The present invention includes novel techniques, apparatus, and systems for optical WDM communications. Tunable lasers are employed to generate subcarrier frequencies representing subchannels of an ITU channel to which client signals can be mapped. Client circuits can be divided and combined before being mapped, independent of one another, to individual subchannels within and across ITU channels. Subchannels may be independently routed to a single subchannel receiver filter, such that each subchannel detected at the receiver may come from a different source location. Network architectures and subchannel transponders, muxponders and crossponders are disclosed, and techniques are employed (at the subchannel level/layer), to facilitate the desired optical routing, switching, concatenation and protection of client circuits mapped to these subchannels across the nodes of a WDM network. Subchannel hopping may also be used to increase the optical network security.

A network design method proceeds by generating cycles, evaluating the economics of building rings on those cycle, and building any economic rings. Generating a cycle involves picking two endpoints between which two disjoint link and node paths are desired-the two nodes selected are thus nodes on the candidate rings. Once a cycle is generated, various combinations of OADM/ADM nodes on the cycle are tried, from rings using three nodes to rings using all of the nodes on the cycle. The network design method considers a sequence of SONET/SDH and DWDM rings on each cycle generated, and compares the cost of carrying demand by SONET/SDH rings, DWDM rings, and an alternative dual-hub benchmark architecture. The ring constraints such as maximum circumference are applied before ring costs are calculated, and rings violating those constraints are eliminated from consideration. The demand carried by the most economic ring is removed from the input list of demands, and the entire process is repeated until no demand remains or it is not economical to carry the remaining demands by using rings. After all economic rings are considered, any remaining demands are carried on point-to-point systems.

According to certain embodiments of the invention, there is provided an arrangement for cooling a series of closely spaced upright computer components mounted to a support, the arrangement including a tray having a plurality of air moving devices such as fans. Members are used for helping mount removably the tray to the support in a generally horizontal disposition, and the air moving devices move air in a generally upright path of travel to help cool the upright computer components. The tray also has a series of connector ports for connecting electrically to outputs from individual ones of the computer components.

A method, computer program product and controller for controlling communication services for a plurality of applications on a physical network having a plurality M of network nodes providing certain network resources, wherein each of the applications is described by a set of requirements and is configured to run on at least two of the network nodes. The controller includes a generator and a calculator. The generator generates a network model of the physical network including a topology of the physical network and a node model for each of the network nodes, where the node model describes node capabilities and node resources of the network node. The calculator calculates virtual networks for the applications by mapping each respective set of requirements of the applications to the generated network model, where each of the calculated virtual networks includes at least two network nodes and a slice of the certain network resources.

The present invention relates to an imaging data server. The imaging data server acquires a plurality of types of imaging data pertaining to a plurality of objects of surveillance and transmits the acquired imaging data to a monitoring station over a network. The imaging data server comprises determination section for determining whether or not a change has arisen in the status of each of the objects of surveillance pertaining to a plurality of types of the imaging data; and a priority transmission section for transmitting, to the monitoring station, imaging data pertaining to an object of surveillance in which the status change is determined to have arisen by the determination section, with a higher priority than that utilized in the case of imaging data pertaining to an object of surveillance in which no status change is determined to have arisen.

Method and system for arranging and processing packetized network information are provided herein. A single receive buffer may be allocated in a host memory for storing packet data and control data associated with a packet and a single DMA operation may be generated for transferring the packet data and the control data into the single allocated receive buffer. A plurality of the single receive buffers may be arranged so that they are located contiguously in the host memory. The packet data and the control data for the packet may be written in the single receive buffer via the single DMA operation. At least one pad byte may be inserted in the single receive buffer for byte alignment. The pad may separate the control data from the packet data in the single receive buffer. The control data may comprise packet length data, status data, and/or checksum data.

Disclosed herein are systems and networks comprising a network operations server application for improving a packet-switched communications network, the application configured to: receive data from data source nodes; provide a management console allowing a user to configure a network multi-access protocol for: i) a node, ii) a type of node, iii) a group of nodes, iv) a type of data packet from a node, v) a type of data packet from a type of node, vi) a type of data packet from a group of nodes, or vii) a specific instance of a data packet from a node, the network multi-access protocol a scheduled or random access protocol; and dynamically create channel assignments to allocate bandwidth of the network among channels based on the configured network multi-access protocols to prevent network saturation and minimize data collisions in the packet-switched network.

An algorithm on a computer readable medium for efficiently creating a message efficient virtual backbone in a wireless ad hoc network utilizes three phases to establish an efficient network among the independent transceivers of a wireless ad hoc network. Independent transceivers within the transmission range of each other are neighbors. A leader election and tree construction phase constructs a tree of neighboring transceivers with one transceiver being designated the root and with each transceiver establishing and recording its location in the tree structure and the identifiers of its neighbors; and reporting when the tree is established. A level calculation phase determines the level of each transceiver away from the root transceiver, with each transceiver recording the level of its neighbors. Precedence for each transceiver is established with consideration of each transceiver's tree level and identifier, with tree level being paramount in deciding precedence; and reporting when the levels of the tree are established. A backbone construction phase establishes all transceivers as a dominator or a dominatee, with the dominators forming the network backbone and the dominatees all being neighbors to a dominator. Within the network each transceiver only needs to know the information of its neighboring transceivers.