Abstract: A method for improving next hop selection between internet routers (R) defined by their respective IP addresses. A source is identified by a source IP address and a source port identification. A destination or target is defined by a target port identification. Equivalent routes toward the destination host are identified conventionally. Each of the equivalent routes is defined by next router IP address. The source IP address, source port identification and target port identification are logically combined to derive a connection identifier (HO) for a first router common to all paths. An set of additional logical operations are performed to derive next hop selection identifiers. Final next hop route selection is based on predefined criterion.

Abstract: A method and system for improving traffic operation in an internet environment by speeding up data packet transfers between a source host attached to a first Local Area Network (LAN), and a target host attached to a second (different) LAN, both LANs being interconnected by a router. The invention enables said router self configuring into a bridge over the path between said source and target hosts, selectively and dynamically during traffic operation. To that end, upon first packet being sent, the source host pushes said packet over the first LAN toward the router. When receiving said first packet, the router reads its IP table locating the target host on its LAN, and then runs a conventional ARP over its LAN to get the address of the target sending back its MAC address. The router stores the MAC address of the target host into an ARP table and sets an entry into a so-called transparent bridging table accordingly.

Abstract: A method of updating an inverse ARP table in an IP network over a partially meshed Frame Relay network (10) wherein the Frame Relay network includes at least a hub (12 or 14) which is linked to each one of a set of spokes (16, 18, 24 or 20, 22, 24) by a Permanent Virtual Circuit (PVC) identified by a first Data Link Connection Identifier (DLCI) associated with the hub and a second DLCI associated with the spoke, the hub and the set of spokes defining an IP subnet having a subnet address, and each spoke having an inverse ARP table in which the first DLCI identifying a PVC is mapped with the IP address of the hub as entry. The method comprises automatically entering an entry into the inverse ARP table which defines the first DLCI being mapped with a default IP address identifying the hub as destination for any frame addressed to one or several spokes of the subnet.

Abstract: The invention enables the surveillance of computer-like devices while they are connected to a communications network. This latter includes a Network Surveillance Server (NSS). Upon joining said communications network, a device is first required to log-in to NSS. After which, NSS polls it while connected on the network so that an alarm can be issued, from NSS, to a central surveillance unit, if the device fails responding to polling. Hence, prior to leaving the communications network, the computer-like device is also required to log-out to NSS. Thus, as long as it is connected to the communications network, the computer-like device is watched.

Abstract: An IP network over a partially meshed Frame Relay network wherein the Frame Relay network includes at least a hub which is linked to each one of a set of spokes by a Permanent Virtual Circuit (PVC) identified by a first Data Link Connection Identifier (DLCI) associated with the hub and a second DLCI associated with the spoke The hub and the set of spokes define an IP subnet having a subnet address. Each spoke has an inverse ARP table in which the first DLCI identifying a PVC is mapped with the IP address of the hub as entry. The inverse ARP table of each spoke comprises, further to the entries corresponding to the IP addresses of the hubs to which the spoke is linked, at least a default entry identifying the subnet address whereby any frame the IP address of which corresponds to a spoke is routed to the hub by scanning inverse ARP table.

Abstract: The invention allows a system to prevent robots from browsing a Web site beyond a welcome page. When an initial request from an undefined originator is received Web site responds to it with a welcome page including at least one trap. Then, on receiving further requests from the undefined originator Web site can check whether a trap is used or not. If not used the undefined originator is assumed to be a human being and is authorized to go on. If a trap is however used the undefined originator is assumed to be a robot in which case site access is further denied. The invention prevents Web site contents from being investigated by robots while not requiring users to have to log on.

Abstract: A system and method for converting a window based data link flow control to a rate based flow control. In addition to the conventional data link control window, a second window is established under control of an adaptive committed information rate (ACIR). When either the DLC window or the second window is closed information frames are queued. The second window is closed when a frame exceeds the burst size authorized in the ACIR.

Abstract: A system and method of organizing a front-end load balancing function for implementing an Internet site so the transmission control protocol (TCP) connections, established between the front-end load balancing function and end-users, are spread over more than one individual load balancer (ILB). Each ILB consistently self-asserts a primary ILB owner for each one of the TCP connections. Hence, each ILB, for each delegated TCP connection can process each TCP connection on behalf of the load balancing function while handing off the other TCP connections to the corresponding ILB owners. Also, each ILB consistently self-asserts a backup ILB owner for each one of the TCP connections so the designated back up ILB owner takes over the processing of an ILB owned TCP connection should the ILB owner become incapable of processing the delegated TCP connection.

Abstract: A Web site using HTTP and assumed to be comprised of a plurality of individual servers, including a Network Control Scheduler (NCS) is enhanced. Any individual server may issue instructions to NCS. They are passed to NCS in a NCS-control HTTP header which includes directives that must be obeyed. Directives fall in three categories, namely: flow-control directives, sharing directives and NCS-queuing directives. A filter which limits their scope of application may be optionally included.

Abstract: The invention prevents robots from browsing a Web site beyond a welcome page. When an initial request from an undefined originator is received, the Web site responds to it with a welcome page including a challenge. Then, on receiving a further request from the undefined originator, the Web site can check whether the challenge is fulfilled or not. If fulfilled, the undefined originator is assumed to be a human being and authorized to go on. If the challenge is not fulfilled, the undefined originator is assumed to be a robot, in which case site access is further denied.

Abstract: Methods and a system for defeating TCP SYN flooding attacks are disclosed. In a server running TCP the invention assumes that, whenever receiving a SYN message, the server computes an ISR (Initial Sequence number Receiver side) and includes it in its SYN-ACK response to the client. Then, the server, also listening for the receiving of ACK messages from clients, checks the ISR. If checking fails, ACK message is dropped. If passing checking, ISR is accepted as an authentic computed ISR and decoded accordingly. Only then, resources are allocated and a TCP connection is actually established, after which, listening state is returned to in order to keep processing all received TCP messages.

Abstract: The Committed Information Rate (CIR) functionality is converted to an Adaptive Rate Base (ARB) mechanism. The solution is based on the interaction between a proactive setting of the Explicit Congestion Notifications (ECN) in the Frame Handler (FH) function of the switches and a converging Adaptive CIR algorithm in the Terminal Equipments. The result of this interaction is that when a logical bottleneck is in the process of settling in a switch, the CIR at the Terminating Equipment adapts itself to the throughput of the forming logical bottleneck. Henceforth, the logical bottleneck is exported at the boundary of the network within the Terminating Equipment. The end result is that the data sent by the data link control in the Terminating Equipment is paced so that the output matches that of the weakest point in the network, keeping it busy but not congested.

Abstract: To assure a complete transmission of frames in communication protocol such as the X25 LAPB a timer is used. The integrity of the transmission is obtained by retransmitting Iframe that are not received. Thus, each frame that is sent is controlled by a timer, called Retry Timer or T1 Timer. A short T1 Timer may cause a de-synchronization of the protocol then a connection loss. The invention aims to avoid this problem. The principle is based on the fact that the T1 Timer value is defined not only according to the speed but also to the workload of the LINK (51). The invention aims to add automatically to the initial value of the T1 Timer a queue delay. This queue delay corresponds to the delay between the enqueue of a buffer pointer (11) and the transmission of this buffer (41) on the Link. Thus, T1 Timer becomes auto-adaptive. The invention consists in performing two actions. The first action is to measure dynamically the queue delay.

Abstract: A method and apparatus for detecting the absence of an activity or event during a time period D divides the time period D into N equal time sub-periods. A register is reset upon the occurrence of an event or activity. The register is incremented at the end of each sub-period and examined to determine if it exceeds the value N in which case there has been no activity during the time period D. The precision of the measurement is regulated by increasing or decreasing the value of N and the sub-periods are determined by dividing D by N.