Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Large data-set task node transferrying method based on content and relation separation

A technology for large data sets and content data, applied in data exchange networks, electrical digital data processing, special data processing applications, etc., can solve the problems of time overhead restricting migration and difficulty in restoring data sets.

Inactive Publication Date: 2007-01-17
TSINGHUA UNIV
View PDF0 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Reconstruction not only means copying data, but also restores these associations. For large data sets, it is difficult to restore the relationship of data sets in a short time
In a nutshell, the complexity of completely reconstructing data relationships in large-scale data sets takes too much time and the non-reproducibility of data associations restricts the migration of these tasks between router control plane nodes

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
  • Large data-set task node transferrying method based on content and relation separation
  • Large data-set task node transferrying method based on content and relation separation
  • Large data-set task node transferrying method based on content and relation separation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0028] The low efficiency of traditional large data set task node migration and reconstruction methods has seriously affected the development of extended software architecture. It is the main contribution of the present invention to design a more efficient moving and storage method and satisfy the two core functions of route calculation and route management in the scalable router.

[0029] In the description of the present invention, based on the idea of ​​separation of content and structure, the routing table is described by the content data memory pool, the structure data memory pool and the mapping relationship between the two memory pools, wherein the content data memory pool stores routing entries Basic information, including: target subnet, next hop, outbound interface, and priority. The structural data memory pool is used to store the basic relationship between routing entries. In order to facilitate the search, since the routing table is generally stored in the structu...

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

The invention features the following points: sequentially building a content data memory pool including routing information and a configuration data memory pool including the relation between routing items; based on the difference between the first addresses of said two memory pools, getting and building the mapping relation of said memories on the store address; separately building the idle memory link table of said each memory pool; when the routing table manages to move to a independent memory area, according to the size of each memory pool a content memory pool and a configuration memory pool are separately built in the new memory area, and a mapping relation in the new memory area and a idle memory link table are rebuilt. The invention is used to control the hollow space of memory occurring at routing maintenance process.

Description

technical field [0001] The node migration method based on the task of separating large data sets from content and relationship belongs to the research field of Internet IP router data and memory management algorithms. Background technique [0002] In a modern computer network system, a router is the core connection device. The rapid development of the Internet has brought about innovations in the architecture of routers. The next generation Internet puts forward new requirements for the architecture of the next generation IP router. Optimizing a single node to improve its processing capability is no longer the most fundamental way to improve the system, because this way is limited by the development speed of physical devices. The traditional IP router architecture based on a single node has been unable to adapt to the rapid development of the network. Scalable architecture is the main development direction of next-generation IP routers. [0003] In the scalable router so...

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
IPC IPC(8): H04L12/56H04L29/02H04L12/24G06F17/30
Inventor 徐恪吴鲲王海洋
Owner TSINGHUA UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com