Cabletron Systems, Inc.

Aprisma Management Technologies, Inc.

Other

Nimesa Corporation

Roger H Dev

Jason Jeffords

Eric S Rustici

Walter P Scott

Prasan Kaikini

Mark H Nelson

Oliver C Ibe

Wallace E Matthews

Eric W Gray

Dale H Emery

Dwayne S Wiggin

Howard M Brown

Lundy M Lewis

Kurt A Dobbins

Chris Oliver

Rajiv Malik

Steve Sycamore

Phil Andlauer

Suzanne Thebaut

Ajay Aggarwal

Dan Hullette

Todd Wohlers

Bruce Nutbrown

Andy Grimes

Tom Parker

Alex E Raj

Vick Vaishnavi

Todd A Crowley

Mark Samber

Martin S Quinn

A system and method of queuing orders locates data-entry modules relative to a pickup location such that a customer who places an order after a customer who placed an earlier order can be signaled to approach a pickup location before the first customer if the order of the second customer is ready before the order of the first customer. The system can signal a customer to wait in a predefined location until the order is ready, or the system can signal the customer to approach the pickup location.

System and method for improved queuing, service-time, and capacity in drive-through operations

According to an embodiment of the present invention, a method is provided for partitioning a network, comprising modeling the network as a graph comprising nodes which represent network devices, and edges which represent links between the devices, and automatically partitioning the graph into domains. One embodiment of the method includes identifying a number of anchor nodes in the graph and partitioning the domains around the anchor nodes such that each domain contains only one anchor node. Another embodiment of the method includes partitioning a graph without anchor nodes into a number of domains, and assigning controllers to each of the domains. Preferably, the method further includes assigning a weight to each node in the graph, and balancing the partitions as a function of the weight of each node in a respective partition.

Method for automatic partitioning of node-weighted, edge-constrained graphs

Method and apparatus for determining an enforceable policy applicable to one or more network devices. The method includes attaching one or more rule elements to one or more domain elements to create policies, the domain elements representing network devices and groups of network devices, and the rule elements defining actions, a method for determining whether a conflict exists between the polices, and a method for resolving the conflicts to produce one or more enforceable policies.

Policy management and conflict resolution in computer networks

A network management system includes a user interface, a virtual network and a device communication manager. The virtual network includes models which represent network entities and model relations which represent relations between network entities. Each model includes network data relating to a corresponding network entity and one or more inference handlers for processing the network data to provide user information. The system performs a fault isolation technique wherein the fault status of a network device is suppressed when it is determined that the device is not defective. User displays include hierarchical location views and topological views of the network configuration. Network devices are represented on the displays by multifunction icons which permit the user to select additional displays showing detailed information regarding different aspects of the corresponding network device.

Network management system using model-based intelligence

A method and apparatus for accessing resource objects contained in a distributed memory space in a communications network, including dividing the distributed memory space into a plurality of memory pools, each pool containing a collection of resource objects, providing a plurality of resource manager objects, each resource manager object having an associated set of memory pools and a registry of network unique identifiers for the resource objects in those pools, and accessing a given resource object via its network identifier. Another aspect of the invention is to provide a relativistic view of state of a plurality of objects, each object generating a state vector representing that object's view of its own state and the state of all other objects, each object sending its state vector to other objects, and each object maintaining a state matrix of the state vectors.

Replicated resource management system for managing resources in a distributed application and maintaining a relativistic view of state

A network system includes a hierarchical directory which includes a plurality of nodes in a tree structure. Each node contains a set of address mappings relating a first address to a second address. An address resolution request attempts to resolve a first address to a target address in a node in which the first address is located. If the resolution of this first address cannot be accomplished in this first node, the process moves to a next higher node in the hierarchy and again attempts to resolve the request. The address mappings become less specific as the process moves up the hierarchy and, as a result, more general addresses will be used to resolve the first address to the target address.

Perspective-based shared scope address resolution method and apparatus

A method for selecting a communication path over which to send a communication load between a first station and a second station in a communication network, in which the communication network has a plurality of possible communication paths between the first and second stations. The method comprises identifying at least one of the possible communication paths between the first and second stations, determining a first path metric for each identified path, the first path metric having a value that may vary as distribution of the load across the network varies and selecting one of the at least one identified paths based on the value of the first path metric for each identified path.

Distribution of communication load over multiple paths based upon link

A network management system includes a user interface, a virtual network and a device communication manager. The virtual network includes models which represent network entities and model relations which represent relations between network entities. Each model includes network data relating to a corresponding network entity and one or more inference handlers for processing the network data to provide user information. The system can poll or communicate with certain network entities and can infer the status of network connectors and other network entities for which polling is impossible or impractical. The system performs a fault isolation technique wherein the fault status of a network device is suppressed when it is determined that the device is not defective. User displays include hierarchical location views and topological views of the network configuration. Network devices are represented on the displays by multifunction icons which permit the user to select additional displays showing detailed information regarding different aspects of the corresponding network device.

Method and apparatus for monitoring the status of non-pollable devices

A system and method for controlling access to a shared object among a plurality of interconnected processes. A lock token is associated with a shared object. In order for a process to access or modify the associated object, it must possess the lock token. Whenever a process establishes control of the lock token, it transmits a message to each other process indicating that the process controls the lock token. In some instances, in order for a process to establish control of the lock token, the process must receive approval from each other process. Further, when two or more processes request the lock token at the same time, neither process will gain control and each process will then wait for a random time period before again seeking control of the token.

Establishing control of lock token for shared objects upon approval

Apparatus and method for establishing 'virtual connections' through a packet switched data communications network, the network including a plurality of end systems and switches connected by links. Each end system has a unique physical layer address and each switch has a connection database of valid connections between different ports on the switch and a switching mechanism for establishing temporary connections. Each switch is registered with a connection server such that, prior to transmission of a connectionless datagram from a first end system to a second end system, a path of valid connections through one or more switches from the first end system to the second end system is determined by configuring the connection table of each switch on the path with a connection identifier identified by the physical layer addresses of the first and second end systems, and wherein the data packet remains as a connectionless datagram. In other aspects, an improved method is providing for allocating bandwidth among competing devices requesting access to a bandwidth limited shared resource (e.g., the previously defined switch), and to a search method for making a best path determination through the network based on a number of constraints.

Method of transmitting data packets in a packet switched communications

Method and apparatus for providing a call-tapping point in a switched network with point-to-multipoint functionality. The tapping point is added as an additional destination for data being sent from a source node to a first destination node. The tapping point is also added as a destination for data being sent from the first destination node to the source node. A merge operation is performed for finding and combining common segments of the paths between the source and destination, the source and tapping point, and the destination and tapping point.

Use of multipoint connection services to establish call-tapping points

System for determining the status of an entity in a computer network

Growing community of inventors

Durham, NH, United States of America

Roger H Dev