Abstract:
The invention relates to a method for synchronizing a clock of a network component (A) with a clock of a further network component (B) communicatively connected to the network component (A) in a network and a network component, whereby the method comprises the following steps: determining a set of forward transition delays for transmission of messages from the network component (A) to the further network component (B) and a set of corresponding backward transition delays for transmission of messages from the further network component (B) to the network component (A), selecting a minimum forward transition delay (minF) from the set of forward transition delays, selecting a minimum backward transition delay from the set of backward transition delays (minB), deriving an estimated value for an offset between the clock of the network component (A) and the clock of the further network component (B) from the selected minimum forward transition delay (minF) and minimum backward transition delay (minB), and adjusting the clock of the network component (A) in accordance with the estimated value for the offset estimate.
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:
The invention relates to a method for managing network resources in a network (10) with a network management device (M), a network component (A), and a further network component (B), and a network management device (M), the method comprising the following steps: transmitting a request for an advance reservation of a network resource (2) by the network component (A) to the network management device (M), wherein the request includes information regarding a reservation start time (11) and a reservation end time (13); transmitting a request for an ad-hoc reservation of a further network resource (4) by the further network component (B) to the network management device (M); allocating the further network resource (4) to the further network component (B) by the network management device (M); and allocating the network resource (2) to the network component (A) by the network management device (M) at the reservation start time (11), wherein the network resource (2) comprises a part or all of the further network resource (4).
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 SN and a receiving node RN over a packet switching network, data being sent with a current data rate SR onto a protocol-specific buffer BU of the receiving node RN, an application AP reading data stored in the buffer BU at a playback rate SPR, According to the invention, it involves the following steps: - Notifying by the sending node SN to the receiving node RN about its maximum sending rate SRMax; - Determining by the receiving node RN a desired sending rate DSR value for the sending node SN from playback rate SPR value; - when the desired sending rate DSR value is significantly different from the current data rate SR value, notifying the desired sending rate DSR value by the receiving node RN to the sending node SN.
Abstract:
The invention relates to a method for transporting data over a data connection between a sending network component (1) and a receiving network component (3) via a network (5), and a network component (3). 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 get 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 therefore disregards the fact that no statement about the reception of the acknowledge message can get back to the receiver before the RTT has elapsed. For wide area connections in high bandwidth networks, where high RTT values exist, this has the advantage that significant delays in carrying on sending data or unnecessary retransmissions of significant amount of data can be avoided.
Abstract:
The invention concerns a method of evaluating network performances with low impact on existing network traffic. Furthermore, the invention also relates to an apparatus for evaluating network performances. More particularly the invention concerns a method for evaluating network performance during normal operation of the network. The network comprises links connecting nodes, the link L jk connecting the two nodes N i , N k . According to the invention, the method has low impact on normal operation traffic in the network.
Abstract:
In video production sites, video material is stored on video servers in digital form. High speed networks are available for transferring video content from the video servers to workstations for post-processing like video editing, colour management etc. Most networks and a lot of software for post-processing are available for exchanging data with Internet protocol. Extensions for the RTP protocol are available for transporting high definition video/audio data based on an Internet Protocol stack. The invention enables the overall control of the data streaming by setting two incompatible flags (405, 406) in one and the same RTP packet without the need of a further extension of the RTP protocol. In one example the end of a data stream is signalled by setting the frame begin plus frame end flag (405, 406) in the packet transporting the last part of the last DPX frame in the stream.
Abstract:
The invention relates to a method for transferring data packets from a source entity (10) connected to a network into a destination entity (20) by a zero-copy mechanism over a data transfer connection, the method comprising steps of: sending, by the source entity (10), the data packets received from the network to the destination entity (20) over the data packet transfer connection, receiving the data packets by the storage entity (20), and storing the received data packets in a memory space of the destination entity (20) according to a data packet memory assignment (50), wherein for the received data packets a consistency of order check is performed for the received data packets, and the data packet memory assignment (50) is updated according to a data packet order update information indicating an inconsistency of order in the received data packets when the inconsistency of order is observed in the consistency of order check. The invention further relates to a computer network assembly, especially a video or film production computer network assembly, comprising a software-implemented order check module configured to perform the method. The invention also relates to an adapted network station.
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:
This invention relates to a design of an efficient buffer management model in order to increase the efficiency of data exchange between two process threads, - e.g. when implementing a network transport protocol stack. This invention proposes to use an interconnected system of different kinds of memory buffers (100, 101, 102), implemented as asynchronous read/write ring buffers ARWRB. These buffers are organized in a way, in which data can be stored into the buffer or fetched from the buffer essentially avoiding synchronization means like mutexes or semaphores. In contrast to the conventional buffer management model, three ring buffers, namely send ring buffer (100), send token ring buffer (101) and receive ring buffer (102), are used within the transport protocol stack.
Abstract translation:本发明涉及一种高效的缓存器管理模型的设计,以增加两个处理线程之间的数据交换的效率 - E. G. 当实现一个网络传输协议栈。 本发明提出了作为异步读/写环形缓冲器ARWRB在不同种类的存储器缓冲器(100,101,102),来实现的互连的系统中使用。 这些缓冲器的方式,在该数据可被存储到从基本上避免同步缓存器中的缓冲或取出组织等手段或互斥信号量。 与此相反的常规缓冲器管理模式,三个环形缓冲器,即发送环形缓冲器(100),发送令牌环缓冲器(101)和接收环形缓冲区(102)的传送协议栈内被使用。