Abstract: The SATME method and system estimates source-to-destination traffic matrices using a simulated annealing algorithm, the traffic matrix estimation being represented as a probability distribution over the set of all possible matrices that satisfy a set of given constraints. The constraints explicitly encode information that the user knows about the network traffic as components of an objective function (a fitness function), that is then minimized using simulated annealing. With the method according to the invention, arbitrary constraints of any form can be included, and the case where there are no feasible solutions can be diagnosed by the objective function not converging to zero.

Abstract: The FastSATME method and system estimate source-to-destination traffic matrices using a simulated annealing algorithm, the traffic matrix estimation being represented as a probability distribution over the set of all possible matrices that satisfy a set of given constraints. The constraints explicitly encode information that the user knows about the network traffic as components of an objective function (a fitness function), that is then minimized using simulated annealing. With the method according to the invention, arbitrary constraints of any form can be included. FastSATME works over a series of time steps. At the first time step FastSATME acts the same as SATME but in subsequent time steps, the estimate of the traffic matrix at time t is based on the estimate at t-1.

Abstract: Systems and methods for managing network services between private networks are disclosed. Advertisement of network services which are available in a services network is controlled in accordance with a policy associated with each network service. Network service information is advertised to an external services network only for those network services which have associated policies permitting distribution of the network services through external networks. External network services may also or instead be advertised to a services network from one or more external services networks and subsequently made available in the services network.

Abstract: Public and private network service management systems and methods are disclosed. Rules for accessing a private services network in which network services are available are enforced so as to restrict access to the services network through a public network in accordance with policies of the services network. Use of network services by a client of the private services network through the public network is controlled according to network service access policies associated with the network services. Network services provided by clients of the services network which access the services network through a public network may also be offered to other clients of the services network through the services network and the public network.

Abstract: A backpressure mechanism uses a TDM backpressure bus with each port card being assigned time slot. During its time slot, each ingress card/port writes on the bus the number of packets it transmitted to an egress ports during the last data refresh cycle. This information is read by the egress ports and used to compute current depth of the switch fabric output queues. In addition to information received from ingress cards, egress cards keep count of number of packets received from the appropriate switch fabric port and based on it estimate/calculate the current depth of the switch fabric output queue. Congestion states are calculated for all queues by comparing the queue depth with a respective threshold. Each egress card uses these congestion states to generate backpressure signals to ingress cards. Ingress card are using these signals to make decision whether to send or not traffic to destination egress card/port.

Abstract: The ad-hoc router enables a decentralized IP routing network (mobile of fixed) amongst a set of network devices, and can offer quality of services for voice, video and data applications. The ad-hoc router is divided into a receiving, control/management processing, IP datapath/routing, randomizer, scheduler and transmission blocks. The IP datapath/routing block provides, in addition to the standard datapath routing functionality, per packet labels that uniquely identify the source device of the packet in the network. The scheduler maintains a plurality of QoS queues, which are then dequeued with a WFQ scheduler, which can be based on standard technology or a simplified low-cost implementation. The randomizer uses the labels to route the packets to a queue such that all packets from the source device, indicated by the label, enter the same queue. For greater security, the randomizer uses a random mapping function that is re-computed periodically.

Abstract: A system and method are provided for enabling an efficient processing environment for a functional programming language runtime machine. Separate processors are provided for the main FP processor and the garbage collector as well as separate access to the heap. The routine maintenance performed by the garbage collector does not compete for resources of the main FP processor. The processor implementation for the main FP processor also includes a separate bus to each of the program memory, the heap, and the stacks.

Abstract: Publication subscription service apparatus and methods are disclosed. Restricted forwarding of an electronic publication that is made available to a publication subscription service by a publishing entity may be provided by determining, based on a forwarding restriction established for the electronic publication by the publishing entity, whether the electronic publication is to be forwarded to subscriber systems that are associated with respective subscriptions to the publication subscription service. In a distributed publication subscription service, electronic publication forwarding decisions are independently made at gateway devices or access points that provide access to the service for subscriber systems.

Abstract: Service-centric communication network monitoring apparatus and methods are provided. Service traffic, associated with a third-party service provided by an external service provider that is controlled independently of a communication network, is identified in communication traffic that is being transferred through that communication network. The identified service traffic is monitored, for example, to compile service usage statistics, to police usage of the service, to generate billing records for usage of the service, and/or to mirror the identified service traffic. A registry in which the service is registered may interact with a monitoring system of the communication network so as to establish monitoring for the service traffic.

Abstract: The WS-Mobile Gateway is the interworking gateway between users of a mobile network and a WS extranet. The mobile gateway comprises a mobile end-user interface on the side of the mobile network, for user authentication and for separating the web services (WS) traffic from the non-WS traffic. A logic unit performs protocol conversion, address resolution, policy enforcement/definition and publishing operations on the WS traffic. An extranet interface processor routes the WS packets carrying control messages between the gateway and a WS controller which maintains the services registry, while the WS packets carrying data are routed between the mobile gateway and the WS provider.

Abstract: A distributed, multistage agent for monitoring, diagnosis and maintenance of network devices comprises an input/output interface for receiving input monitoring and diagnostic data relevant to operation of a first neighboring agent and transmitting output monitoring and diagnostic data relevant to operation of the host network device to a second neighboring agent. An agent process analyzes the input data and generates processed data characterizing operation of the host network device, using a local database which stores expected performance data on operation of said network device. The processed data is correlated with the expected data any error is signaled to the network operator. The agents may be designed as a multiple stage process, the stages being triggered by the data output by an earlier stage only when needed.

Abstract: The FastSATME method and system estimate source-to-destination traffic matrices using a simulated annealing algorithm, the traffic matrix estimation being represented as a probability distribution over the set of all possible matrices that satisfy a set of given constraints. The constraints explicitly encode information that the user knows about the network traffic as components of an objective function (a fitness function), that is then minimized using simulated annealing. With the method according to the invention, arbitrary constraints of any form can be included. FastSATME works over a series of time steps. At the first time step FastSATME acts the same as SATME but in subsequent time steps, the estimate of the traffic matrix at time t is based on the estimate at t-1.

Abstract: Communication session admission control systems and methods are disclosed. A state of a communication system is monitored, and admission of a communication session into the communication system is controlled based on a random admission control procedure and a current state of the communication system. Monitoring of the current state of equipment in the communication system, connections in the communication system, communication sessions in progress in the communication system, special monitoring sessions established in the communication system, and/or an overall state of the communication system can have several benefits. These benefits may include improving utilization of resources in the system, and providing a session admission control scheme that is capable of reacting to actual observed conditions and adapting to changing system topologies following a fault, for instance.

Abstract: A single chip architecture with multiple programmable processors is described. Each processor has a small and fast acting kernel-based operating system which has primitives for performing only fundamental functions of multi-processing. Many distributed threads may be executed simultaneously on many processors while allowing the device to be programmed as a single monolithic system.

Abstract: Methods and systems of managing processing operations are disclosed. Processing operations are not restricted to being executed by any particular processor of a multi-processor system. Information associated with a processing operation may be transferred to one processor for use by the processor in executing the processing operation. The processor may or may not actually execute the processing operation. Subsequently, information for the processing operation may be transferred to the same processor or a different processor which has capacity to accept the processing operation for execution. The disclosed techniques are not restricted only to multi-processor systems, and may be useful to transfer information between an external memory and processor registers in a single processor system, for example.

Abstract: Systems and methods of controlling transfer of information associated with processing operations, illustratively threads, are disclosed. Instead of transferring information from all storage locations in which information associated with a processing operation is stored for use by a processor in executing the processing operation, a determination is made regarding to or from which, if any, of the storage locations information is to be transferred. Information is then transferred to or from any determined storage locations.

Abstract: Systems and methods for managing network services between private networks are disclosed. Advertisement of network services which are available in a services network is controlled in accordance with a policy associated with each network service. Network service information is advertised to an external services network only for those network services which have associated policies permitting distribution of the network services through external networks. External network services may also or instead be advertised to a services network from one or more external services networks and subsequently made available in the services network.

Abstract: Public and private network service management systems and methods are disclosed. Rules for accessing a private services network in which network services are available are enforced so as to restrict access to the services network through a public network in accordance with policies of the services network. Use of network services by a client of the private services network through the public network is controlled according to network service access policies associated with the network services. Network services provided by clients of the services network which access the services network through a public network may also be offered to other clients of the services network through the services network and the public network.

Abstract: Network services infrastructure systems and methods are disclosed. Policies for client access to a services network and network services available in the services network are enforced at client gateways. Once authenticated and authorized at a client gateway, a client of the services network may make its own network service(s) available in the services network, use network services provided by other clients of the services network, or both. The policies are centrally managed within a services network and distributed to the client gateways. Various registries which store policies, information associated with network services, and possibly other information may also be provided.

Abstract: The SATME method and system estimates source-to-destination traffic matrices using a simulated annealing algorithm, the traffic matrix estimation being represented as a probability distribution over the set of all possible matrices that satisfy a set of given constraints. The constraints explicitly encode information that the user knows about the network traffic as components of an objective function (a fitness function), that is then minimized using simulated annealing. With the method according to the invention, arbitrary constraints of any form can be included, and the case where there are no feasible solutions can be diagnosed by the objective function not converging to zero.