Abstract: The present invention introduces a congestion control mechanism for constant bit rate (CBR) multimedia data flows in cable operator IP networks. A flow drop method within a congestion control unit of the present invention chooses a subset of multimedia data flows to drop, in whole, to alleviate a congestion condition. After the congestion condition is detected and the congestion control unit begins dropping multimedia data flows, the remaining multimedia data flows are no longer degraded for the end user, as compared to conventional congestion management systems.

Abstract: A credit based queue scheduler dynamically adjusts credits depending upon at least a moving average of incoming packet size to alleviate the impact of traffic burstiness and packet size variation, and increase the performance of the scheduler by lowering latency and jitter. For the case when no service differentiation is required, the credit is adjusted by computing a weighted moving average of incoming packets for the entire scheduler. For the case when differentiation is required, the credit for each queue is determined by a product of a sum of credits given to all queues and priority levels of each queue.

Abstract: Active directory (AD) Domain Controllers (DC) discovery includes determining the topology of the network, such as the nodes and connections in the network. For example, synthetic data may be transferred within the network and traced to determine the presence and relationships of the various network components. Alternatively, other mapping techniques are based upon mapping a known set of nodes to determine the relationship of the nodes. Next, Lightweight Directory Access Protocol (LDAP) commands are forwarded to the various nodes to identify the AD DC within a range of IP addresses discovered during the mapping of to the topology of the network.

Abstract: In a data communication system comprising a plurality of peripherals having respective interfaces, the interfaces having device drivers and being coupled to a common bus for communication with a management system, the interfaces having different real time requirements; an ATM SAR and scheduler employs a predefined PHY level interface with different levels of service, the PHY interface being used as a QOS (Quality of Service) aware common master-slave bus for the peripherals which act as slave devices, whereby respective device driver requirements can be simplified or eliminated. A predefined PHY level interface is the ATM Forum UTOPIA, each peripheral being addressed as a separate UTOPIA slave port. The invention discloses how a system required to support interfaces with differing real time requirements may be supported through the use of a common bus.

Abstract: Methods and computer readable mediums are described that facilitate inviting user entities on a network. The method may include initiating a first application for sending an invitation by a first user entity on a first endpoint, selecting a second user entity to receive the invitation, and selecting an activity. The method may also include sending from the first endpoint to the second user entity the invitation to participate in the activity if the first endpoint determines the activity is supported by a computing application on the first endpoint.

Abstract: A communicating apparatus for relaying a data communication between a first network and a second network, includes a receiving unit having an interface for a first network connection and serving to receive a packet from a terminal connected to the first network; and a control processor that acquires an IP address of the terminal from the packet received by the receiving unit, obtains a range of a subnet mask value which can be taken by the terminal based on the IP address, obtains a candidate for a host address corresponding to each subnet mask value, sets the host address candidate accessibly from the terminal, determines an estimated value of the subnet mask value of the terminal based on a state of the packet which is received from the terminal and is transmitted to the host address candidate, and sets the estimated value as a subnet mask value corresponding to an interface for the first network connection.

Abstract: An improved system and method are disclosed for peer-to-peer communications. In one example, the method enables an endpoint to transfer data directly to another endpoint.

Abstract: A technique performs an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. The novel CSPF technique is triggered upon the detection of an event in the computer network that could create a more optimal path, such as, e.g., a new or restored network element or increased path resources. Once the novel CSPF technique is triggered, the computing node (e.g., a head-end node of the TE-LSP or a Path Computation Element, PCE) determines the set of nodes adjacent to the event, and further determines which of those adjacent nodes are within the TE-LSP (“attached nodes”). The computing node performs a CSPF computation rooted at the closest attached node to determine whether a new computed path cost is less than a current path cost (e.g., by a configurable amount), and if so, triggers optimization of the TE-LSP along the new path.

Abstract: A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.

Abstract: An arrangement for scheduling scans of internal network nodes for reachability events by a border node of a network domain, schedules the scans according to the rate at which reachability notifications are received by the node. As the rate at which notifications are received increases, the interval between scans also increases. Conversely, as the rate of notifications decreases, the interval also decreases.

Abstract: A secure socket layer virtual private network (SSL VPN) network appliance includes a set of virtual systems having respective context information. Each of the virtual systems represents a VPN for a different subscriber network. The network appliance includes a network interface to receive a first network communication associated with a first one of the virtual systems. In response to the network communication, the SSL VPN network appliance sets a context identifier that identifies the first one of the virtual systems. The network appliance further comprises a set of VPN software processes executing on the network appliance to process the first network communication, wherein the set of VPN software processes generate data access requests. A configuration access application programming interface (API) dynamically directs the data access requests from the VPN software processes to the first one of the virtual systems based on the context identifier.

Abstract: Provided are a method, system, and program for processing multicast packets. A multicast packet is received to transmit to destination addresses. A payload of the multicast packet is written to at least one packet entry in a packet memory. Headers are generated for the destination addresses and at least one descriptor is generated addressing the at least one packet entry in the packet memory including the payload to transmit to the destination addresses. For each destination address, at least one indicator is generated including information on the generated header for the destination address and the at least one descriptor, wherein indicators for the destination addresses address the at least one descriptor.

Abstract: An OVPN user register an L1 signal type information which is used in the user's device in an OVPN terminating device in advance together with an IP address and a VPNID which are allocated to the user's device. Registered contents are notified to other OVPN terminating devices which control the same VPNID as that of the user's device. Otherwise, when a calling connection request arrives from the user's device, the registered contents are notified other OVPN terminating devices which control the devices which receive the notification. By doing this, it is possible to handle a request by the user for changing the setting for the signal format which is employed in the user's device quickly. Also, it is possible to realize an OVPN which can perform a process for a calling connection request from the user efficiently and improve an operability for the user.

Abstract: A connection is established between a node on a first network and at least one node on a second network lacking a valid address on the first network by receiving at a gateway a connection request from the node on the first network, sending information related to the connection request to a plurality of nodes on the second network, receiving responses to the sent information from at least one of the nodes on the second network, and establishing at least one connection between at least one of the nodes on the second network from which responses are received, and the node on the first network, according to the order of the received responses or according to priority weighting information or according to priority weighting information concerning the nodes from which the responses are received.

Abstract: SONET/SDH ring aggregation with distributed traffic. The system may include a packet-switched fabric adapted to switch TDM and PDU over the same fabric. The system provides logical functionality of one or more of SONET/SDH ADMs, fiber patch panels, coax patch panels, DCSs, and packet switches. Integrated management provides management of remote ADMs attached to multiple SONET/SDH rings, even of ADMs manufactured by different vendors. A management system may provide native termination of OSI over DCC and IP over DCC to provide integration of equipment from various vendors.

Abstract: Scheduling techniques for use with buffered crossbar switches, without speedup, which can provide 100% throughput are described. Each input/output may keep track of the previously served VOQ/crosspoint buffer. The queue lengths of such VOQs and the queue lengths of VOQs corresponding to a uniform probability selection output (e.g., from a Hamiltonian walk schedule) are used to improve the schedule at each time slot.

Abstract: A communication system includes: communication terminals; and a server that can connect to and communicate with the communication terminals, wherein: the server including: a first communication section that communicates with the communication terminals; a storage section that stores a plurality of connection patterns each of which indicates timings at which the communication terminal will access the server; a pattern selection section that selects one of the connection patterns from the storage section; and a first control section that controls the first communication section to transmit the connection pattern selected by the pattern selection section to the communication terminal the first communication section connects to; and the communication terminal including: a second communication section that communicates with the server; and a second control section that controls the second communication section to connect to the server at timing indicated in the connection pattern received by the second communicati

Abstract: A transmitting apparatus includes a network interface for connecting between networks; an information embedding unit that embeds, in a frame output from the network interface, first port information for identifying a first port through which the frame is received; and a path deciding unit that decides, when second port information for designating a second port that is an output destination of the frame is embedded in the frame received through the network interface, to output the frame to the second port.

Abstract: Packet forwarding apparatus comprises a plurality of line interfaces and a protocol processing unit for controlling packet forwarding among the line interfaces and for forwarding a connection initiation request packet received from a user terminal to a plurality of redundant gateways, wherein the protocol processing unit has a management table for storing forwarding control information to control forwarding of communication control packets for each user terminal, selectively forwards one of response packets replied from the plurality of gateways in response to the connection initiation request packet to the requester user terminal and discards the other response packets based on the forwarding control information.

Abstract: Network traffic is sent via alternate paths in cases of network link or node failure. An alternate node responds to U-Turn traffic from a primary neighbor to select a further alternate. An algorithm for determining the alternate paths is provided to select loop-free neighbors.