Abstract: An ordering system allows a consumer to interact with an ordering system so as to view advertising or promotions from merchants and to order products or services from merchants through the ordering system. A consumer utilizes an interactive consumer interface device to interface with the ordering system. The interactive consumer interface device receives information from and displays information to the consumer. The ordering system may keep a profile of the consumer. The profile may include consumer preference information as well as order payment information. A merchant interfaces with the ordering system and can decide on a targeted consumer profile to which merchant advertising or promotional material may be displayed. When a consumer places an order which includes order delivery information, the ordering system determines when the order production should take place in order to be able to fulfill the order in accordance with the appropriate delivery information concerning the order.

Abstract: A self-service ordering system including customer favorites includes a mechanism for identifying a customer and for receiving an order from the customer. In the case of a new customer, the received order is stored in memory and correlated with the identified customer identification information. The system uses the order stored in memory and correlated with the consumer identification information to automatically identify items preferred by the customer during future purchases. In the case of a returning customer, the system presents the consumer with one or more “favorites” (previously stored items or lists of items preferred by the customer) for his or her selection without having to access a full menu which can be ordered. The system is further equipped to present a full menu of items which can be ordered by the customer wherein the items identified as preferred or favorites are positioned preferentially in the menu display.

Abstract: A mapping system receives information from a standardized order input system and maps or translate the order information into the proper format and syntax required for a vendor's receiving system. In this manner, a consumer may view and utilize a standardized ordering interface while a vendor may utilize their existing and varied order receiving systems located a various order fulfillment locations.

Abstract: 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 second customer's order is ready before the first customer's order. The system can signal a customer to wait in a predetermined location until the order is ready or can signal the customer to approach the pickup location.

Abstract: An identification medium system contains a computer-readable medium having a plurality of consumer profiles stored thereon, each consumer profile containing private account data relating to a consumer; and a terminal in communication with the computer-readable medium. The terminal containing a processor, a memory, and at least one media reader adapted to read (1) a first account tag stored on a first identification medium, wherein the first account tag corresponds to at least one consumer profile, and (2) a second account tag stored on a second identification medium (e.g., a credit or debit card issued by a financial institution).

Abstract: The present invention provides methods and system for organizing a dataset in a database by marking the dataset by a plurality of labels generated based on a pre-define policy. The policy determines the data scope accessible to each label. A user of the database can access the data within the scopes of one or more labels based on its role and privileges granted thereto by, for example, a system administrator. Moreover, a variety of shaping transformations can be applied to the tagged dataset to create a derived dataset that is suitable for the informational needs of the user. The derived dataset can be formatted to render it compatible for viewing via a selected presentation engine, such as a web browser.

Abstract: The present invention provides methods and system for organizing a dataset in a database by marking the dataset by a plurality of labels generated based on a pre-define policy. The policy determines the data scope accessible to each label. A user of the database can access the data within the scopes of one or more labels based on its role and privileges granted thereto by, for example, a system administrator. Moreover, a variety of shaping transformations can be applied to the tagged dataset to create a derived dataset that is suitable for the informational needs of the user. The derived dataset can be formatted to render it compatible for viewing via a selected presentation engine, such as a web browser.

Abstract: A system and method for detecting or reporting service level or service outages on a network includes a meta service generator that operates on a network inventory to generate service definitions. The system is a server-based model, and each service definition includes usergroup and points of presence, thus instantiating multiple services in a manner that allows the definition to focus on relevant element events amid massive network event data, and detect service outages quickly and dependably. The outages, transaction spec outages and events so determined may be aggregated to provide overall measures that are compared with thresholds, performance criteria and other service metrics specified in a user Service Level Agreement (SLA) for billing, credit, evaluation or other purposes.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.