Abstract: The proposal concerns a method of adaptive route selection in a node of a wireless mesh communication network. Such method is based on the Reinforcement Learning-based adaptive routing scheme. The proposal includes the idea of estimating initial reward values for the path discovery phase in dependence of the signal strength of the received signal and the number of hops the received route request message (RREQ) or route reply message (RREP) experienced during traversing in the network. Further improvements concern the idea of a feedback reward calculation for the routing absent the path discovery process as well as an improved method of route selection based on calculation of a temperature parameter for a Gibbs-Boltzmann distribution, which allows a dynamic adjustment of the node selection probabilities. Another improvement concerns a part of the reward function calculation, related to an exponential fallback mechanism on packet loss events.

Abstract: The proposal concerns a method of adaptive route selection in a node of a wireless mesh communication network. Such method is based on the Reinforcement Learning-based adaptive routing scheme. The proposal includes the idea of estimating initial reward values for the path discovery phase in dependence of the signal strength of the received signal and the number of hops the received route request message (RREQ) or route reply message (RREP) experienced during traversing in the network. Further improvements concern the idea of a feedback reward calculation for the routing absent the path discovery process as well as an improved method of route selection based on calculation of a temperature parameter for a Gibbs-Boltzmann distribution, which allows a dynamic adjustment of the node selection probabilities. Another improvement concerns a part of the reward function calculation, related to an exponential fallback mechanism on packet loss events.

Abstract: The invention relates to a method for operating a memory buffer system for the fast data transport over a communication network (30) with a reliable transport protocol working in a point-to-multipoint data transfer mode in a multi-thread environment. The invention proposes a novel meta-storage in-memory organization, which enables that concurrent memory accesses could be guaranteed without using locks, such as mutexes or semaphores. The meta-storage organization involves the use of ActiveCellsBeginDescr- and Active CellsEndDescr-descriptors and the addition of mask information (MASK) for each cell reflecting for the receiving stations (21, 22, 23) of a data transfer session in the point-to-multipoint mode, the state whether or not an acknowledgment message has been received back from the respective receiving station (21, 22, 23) for the corresponding data packet being sent over the communication network (30). The invention also proposes an enhanced ACK ARQ loss report method.

Abstract: The invention relates to a method for operating a memory buffer system for the fast data transport over a communication network (30) with a reliable transport protocol working in a point-to-multipoint data transfer mode in a multi-thread environment. The invention proposes a novel meta-storage in-memory organization, which enables that concurrent memory accesses could be guaranteed without using locks, such as mutexes or semaphores. The meta-storage organization involves the use of ActiveCellsBeginDescr- and ActiveCellsEndDescr-descriptors and the addition of mask information (MASK) for each cell reflecting for the receiving stations (21, 22, 23) of a data transfer session in the point-to-multipoint mode, the state whether or not an acknowledgment message has been received back from the respective receiving station (21, 22, 23) for the corresponding data packet being sent over the communication network (30). The invention also proposes an enhanced ACK ARQ loss report method.

Abstract: A method for performing a bandwidth test for communications from a first network station to a second network station of a communication network is based on the probe rate model (PRM) in which iteratively a train of probe sample packets is transmitted from the first station to the second station with a constant packet rate per iteration. The packet rate is adapted to the available bandwidth on the data pipe per iteration. According to the disclosure the number of probe packets per train of probe sample packets is varied with the available bandwidth per iteration. This increases the accuracy of the test, in particular, in the range where a high data rate is available on the data pipe. A step decreasing factor (SDF) is applied with which the performance test is improved. Such step decreasing factor is dependent on the network jitter and further improves the performance of the test.

Abstract: The disclosure describes a method for performing a bandwidth test for communications from a first network station (20) to a second network station (21) of a communication network. Such bandwidth test is based on the so-called PRM model (in words probe rate model) in which iteratively a train of probe sample packets is transmitted from first station (20) to the second station (21) with a constant packet rate per iteration. The packet rate however is adapted to the available bandwidth on the data pipe per iteration. According to the disclosure the number of probe sample packets per train of probe sample packets is varied with the available bandwidth per iteration. This increases the accuracy of the test in particular in the range where a high data rate is available on the data pipe. Also a step decreasing factor (SDF) is applied with which the performance test is improved. Such step decreasing factor is dependent on the network jitter and further improves the performance of the test.

Abstract: The invention is related to the field of flow control between two computing nodes over a packet switching network. Furthermore, the invention concerns a method for controlling data flow between a sending node and a receiving node over a packet switching network, data being sent with a current data rate onto a protocol-specific buffer of the receiving node, an application reading data stored in the buffer at a playback rate, According to the invention, it involves the following steps: Notifying by the sending node to the receiving node about its maximum sending rate; Determining by the receiving node a desired sending rate value for the sending node from playback rate value; when the desired sending rate value is significantly different from the current data rate value, notifying the desired sending rate value by the receiving node to the sending node.

Abstract: A method of managing a packet administration map for data packets to be received via a network. A receiver in the network monitors sequence numbers and stores missing sequence numbers within an internal data structure, called a packet administration map. A reversed keying is used which means that the upper limit of the range of contiguous missing data packets is used as the key entry in the administration map.

Abstract: A method for sending data over a network from a host computer. The host computer includes an operating system comprising at least a user space and a kernel space. The amount of data provided from the user space to the kernel space within one system call exceeds the size of an IP packet. A loop function in an application in the user space sends multiple packets to the kernel space within a single system call containing IO vectors which contain pointers to the data in the user space. A last data unit being processed may be designated using a flag included in the message header. In the kernel space a second loop function is used to reassemble the vector groups and pass them down the network stack. The data may then be passed to the network hardware using a direct memory access transfer directly from the user space to the network hardware.

Abstract: The invention relates to the field of network communication in a wide area, where a local network of a first type has a sending station that communicates with a receiving station in a local network of a second type. A network of a third type is in between the two networks and provides virtual private networking between the two local networks. The network of the first type supports a fine grained QoS, whereas the network of the third type supports a coarser grained QoS. In one example the network of the first type is RSVP capable and the network of the second type is an MPLS network. The invention resides in a component called RSVP-MPLS proxy that maps the RSVP resource advertisements and reservations within an RSVP-aware customer network to an MPLS network, whereby the receiver side doesn't participate in the RSVP communication process.

Abstract: The invention relates to a method for transporting data over a data connection between a sending network component and a receiving network component via a network. The method solves a problem with the reliable data transport protocol according to which a number of data transport packets will be acknowledged in regular time intervals. When such an acknowledge message is lost, the sending network component will have to keep the data for the purpose of retransmission and cannot free its sending buffer. The invention proposes to repeat such an acknowledge message as a precaution for the case that it gets lost after a short time. The time for repeating is set to be less than an RTT (round trip time for the connection). The solution disregards the fact that no statement about the reception of the acknowledge message can get back to the receiver before the RTT has elapsed.

Abstract: In the method for management of data transmissions in a network, switching means are provided, by means of which a change can be carried out between a first data transmission type and a second data transmission type, as alternative data transmission types between a transmitter and a receiver. The change is carried out on the basis of at least one respectively predetermined criterion. The first data transmission type corresponds to a transport protocol based on rate-based overload control. The second data transmission type corresponds to a transport protocol based on RTT-based overload control.

Abstract: A method and apparatus for file access in a storage access network (SAN) wherein a portion of a first file is accessed and an access rate computed based on time and amount of data accessed. If the computed access rate is less than an expected rate, a problem is identified and analysis performed. A first analysis accesses the first file through a second link to determine if the link is the problem. If the first file is accessed at an expected rate, the first link is identified as the problem and the file is accessed through an alternate link. A second analysis accesses a second file through the first link. If the second file is accessed at an expected rate, the first file is identified as the problem and the second file is accessed through the first link.

Abstract: The invention relates to a method for managing a data connection between a sending network component and a receiving network component via a network, and a network component, the method comprising the following steps: sending an initiating message to the receiving network component by the sending network component, to initiate a data connection between the sending network component and the receiving network component; receiving the initiating message by the receiving network component; sending further messages to the receiving network component by the sending network component; receiving the further messages by the receiving network component; calculating a transmission delay for at least one of the further messages received by the receiving network component; estimating optimal transmission parameters for transmitting messages between the sending network component and the receiving network component based on the calculated transmission delay, wherein estimating of the optimal transmission parameters substant

Abstract: The invention concerns the technical field of a so-called Path MTU (Maximum Transmission Unit) Discovery process between two computing nodes over packet switched networks. On the path between two hosts (H1, H2, H3) in the network may exist various hops, e.g. routers (R1, R2), a packet needs to pass. Each link between two hops has its own MTU which may differ on each link. Some path MTU discovery algorithms are based on sending probe packets with the DF (don't fragment) bit set in the IP header. However, security devices, e.g. firewalls, often block ICMP messages, including the ICMP error messages that are needed for these path MTU discovery algorithms to work. In order to deal with connections, on which ICMP messages are blocked within the network nodes, the invention relies on acknowledgements of probe packets with MTU sizes of common network technology based MTU values sent back by the destination host.

Abstract: Modern computers (10, 20) come with different timers having different attributes like time resolution, supported time range and time reference. Some are local timers, representing relative time values like the TSC counter (11, 21) counting CPU cycles from the power on or reset of the computer. Some are global timers, representing an absolute or real time. Having different classes of timers in the computer (10, 20), a number of computations need to be performed to tie the different timers to each other. It is the idea of the invention to define a single high resolution timer structure wherein the time value is represented with a digital number and a flag clarifies whether the timer is a global timer or local timer. The invention enables a much faster processing of the time values. The global time, tied to a high-resolution timer can be tracked much faster. This means better precision of scheduling of time critical jobs, like packet scheduling for data transport.

Abstract: The invention relates to a new type of quality of service architecture for a network assembly and a corresponding computer network system. The Internet technology as approved by the IETF organization has defined different services. One is the integrated services (IntServ) and the other the differentiated services (DiffServ) architecture. Another is the RSVP Protocol according to which Quality of Service can be implemented with accuracy and richer functionality. The invention shows a way how less sophisticated QoS managers inside the network with only DiffServ or Intserv capability, can be used for enhancing the QoS functionality based on so-called RSVP shadowing messages, and easy to implement RSVP shadowing stacks.

Abstract: A method of operating a network subnet manager, in particular Infiniband network subnet manager in a subnet of a network. Only one subnet manager entity can be master within a subnet. A problem related with this specification is that a specific vendor implementation may exist with many features and internal functionality that are not specified in the network specification. If such a subnet manager loses its exclusivity because another subnet manager enters the subnet, having higher priority, the additional features from the vendor implementation can no longer be used in the subnet. The proposed method solves this problem by allowing a subnet manager that has a lower hierarchy level and thus lower priority to maintain its managing operation by becoming the master subnet manager again.

Abstract: A method of managing a packet administration map for data packets to be received via a network. A receiver in the network monitors sequence numbers and stores missing sequence numbers within an internal data structure, called a packet administration map. A reversed keying is used which means that the upper limit of the range of contiguous missing data packets is used as the key entry in the administration map.

Abstract: The invention is related to the field of flow control between two computing nodes over a packet switching network. Furthermore, the invention concerns a method for controlling data flow between a sending node and a receiving node over a packet switching network, data being sent with a current data rate onto a protocol-specific buffer of the receiving node, an application reading data stored in the buffer at a playback rate, According to the invention, it involves the following steps: Notifying by the sending node to the receiving node about its maximum sending rate; Determining by the receiving node a desired sending rate value for the sending node from playback rate value; when the desired sending rate value is significantly different from the current data rate value, notifying the desired sending rate value by the receiving node to the sending node.