Method for assigning a priority to a data transfer in a network, and network node using the method

A technology of data transmission and network nodes, which is applied in the field of network communication to achieve the effect of preventing network congestion, improving data throughput, and improving data throughput

Inactive Publication Date: 2006-07-19
THOMSON LICENSING SA
View PDF1 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in some cases it may be better if the user or application can modify the automatically found solution

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for assigning a priority to a data transfer in a network, and network node using the method
  • Method for assigning a priority to a data transfer in a network, and network node using the method
  • Method for assigning a priority to a data transfer in a network, and network node using the method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] The present invention is described by taking an owner zone based on a peer-to-peer network structure as an example, in which nodes have individual node identifiers and a common peer group identifier, and nodes belonging to the peer group can freely communicate with each other, exchange messages and other data, etc. It can also be applied to other types of networks, and is particularly advantageous for networks whose nodes are organized fairly autonomously.

[0024] 1. The concept of priority

[0025] The present invention introduces the idea of ​​a two-level concept, involving the distinction between first-level and second-level priorities: first-level or implicit priority is a relative priority, or priority relationship to which the included nodes conform, For example, peers in the owner zone. It does not have an explicit value associated with it, such as numeric priority or numbers. Thus, the set of implicit priorities represents a node's internal "knowledge" of th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A data transfer in a network comprises a first node sending out a request for a particular data unit, a second node receiving and analysing the request, detecting that it may provide the requested data unit and sending to the first node a message indicating that it may provide the requested data unit, the first node receiving and selecting the message and sending a second request to the second node to request transfer of the particular data unit, and the second node transferring the particular data unit upon reception of the second request. A method for assigning a priority to such data transfer in a network comprises the first node assigning an identifier corresponding to a first priority to the request, the second node evaluating the identifier and, based on the identifier, calculating a second priority and assigning the calculated second priority to said transfer.

Description

technical field [0001] The present invention relates generally to network communications. In particular, the invention relates to a method for assigning priorities to data transfers in a network and a network node using said method. Background technique [0002] In a network such as a Distributed Storage System (DSS), data transfer can be understood as a task to be performed. Data transfers are typically in response to requests or tasks. For example, a task may be a search task or a data transfer task, and a characteristic flow of messages occurs between the nodes involved in the task. Often, several (data transfer) tasks may occur simultaneously and in parallel. Due to limited capacity in terms of bandwidth, storage space or other parameters, this will lead to conflicts or bottleneck situations. [0003] Different nodes in a peer-to-peer based network (for example owner domain as described in European patent application EP 1 427 141) may try to allocate another node's r...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/06
CPCH04L67/16H04L67/325H04L67/322H04L47/821H04L47/2458H04L67/104H04L47/2416H04L47/32H04L67/1068H04L47/826H04L67/32H04L47/2433H04L47/10H04L67/51H04L67/61H04L67/62H04L67/60H04L12/28
Inventor 迪特马尔·黑珀迈诺尔夫·布拉瓦沃尔夫冈·克劳斯伯格斯蒂凡·库布施李辉
Owner THOMSON LICENSING SA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap