Movatterモバイル変換


[0]ホーム

URL:


CN101222391B - Method for constructing topological tree in server/client terminal structure - Google Patents

Method for constructing topological tree in server/client terminal structure
Download PDF

Info

Publication number
CN101222391B
CN101222391BCN2007100775274ACN200710077527ACN101222391BCN 101222391 BCN101222391 BCN 101222391BCN 2007100775274 ACN2007100775274 ACN 2007100775274ACN 200710077527 ACN200710077527 ACN 200710077527ACN 101222391 BCN101222391 BCN 101222391B
Authority
CN
China
Prior art keywords
network element
node
tree
data
topological tree
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN2007100775274A
Other languages
Chinese (zh)
Other versions
CN101222391A (en
Inventor
黄平刚
彭宇环
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Guoren Wireless Communication Co Ltd
Original Assignee
Shenzhen Guoren Communication Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Guoren Communication Co LtdfiledCriticalShenzhen Guoren Communication Co Ltd
Priority to CN2007100775274ApriorityCriticalpatent/CN101222391B/en
Publication of CN101222391ApublicationCriticalpatent/CN101222391A/en
Application grantedgrantedCritical
Publication of CN101222391BpublicationCriticalpatent/CN101222391B/en
Activelegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Images

Landscapes

Abstract

The invention relates to a topological tree constructing method in a server/client structure, which comprises the following steps: according to the related attribute data of managed equipment, a topological tree structure is defined and stored in a server database; a user is related with at least one topological tree structure; network element data and related topological tree structure data are read from the server database; a topological tree node data set is established; a topological tree is constructed according to the defined topological tree structure; in the constructing process, data corresponding to each node is added to the topological tree node data set for rapidly positioning the nodes of the topological tree. The topological tree constructing method in the server/client structure is implemented and has the advantages that: the topological tree constructed by the method has abundant structure and good searching performance.

Description

A kind of method of in the server/customer end structure, constructing topological tree
Technical field
The present invention relates to the method for location managed devices in the network, more particularly, relate to a kind of method of in the server/customer end structure, constructing topological tree.
Background technology
In network management, one of brass tacks that the manager must know be have how much equipment is connected in the native system, the attribute of the position of each equipment (logical relation that comprises the management level of this equipment and other equipment or some setting), this equipment etc., usually, people use the mode of topological diagram to organize and represent the above-mentioned fact, so that management.Topological diagram commonly used comprises bus-type topology, tree topology etc., and tree topology to be topological tree use morely in network, the method for conventional construction topological tree mainly realizes by recursive algorithm.Its main thought is node of structure, judges then whether it has child node, if having, then constructs its child node successively.In its child node process of structure, with regard to method above the recurrence.Aspect data organization, the data model of conventional construction tree is generally: ID, title, father ID.It is exactly the only corresponding in the tree nodes of data that the tree of this structure construction has individual characteristics.This method construct topological tree, though thinking, method are very simple, the structure of its topological tree is single, abundant, the data volume of constructing topological tree if desired is huge, then suitable bad of performance.On the other hand, even tree has constructed, but will be mostly to adopt the method by the node traversal from setting node of Search and Orientation, search performance is also very poor.
Summary of the invention
The technical problem to be solved in the present invention is, the defective of, search performance difference single at the said structure of prior art provides the method for the structure topological tree that a kind of structure is abundant, search performance is good.
The technical solution adopted for the present invention to solve the technical problems is: construct a kind of method of constructing topological tree in the server/customer end structure, comprise the steps:
A) according to the attribute data of the managed devices that links to each other, define the topological tree structure, and be stored in the described server database;
B) make user and at least one topological tree structurally associated connection;
C) from server database, read network element data and associated topological tree structured data, and create topological tree node data collection;
D) by the topological tree structure construction topological tree of definition, corresponding each node in construction process is concentrated the adding corresponding data at the topological tree node data, is used for locating fast the node of described topological tree.
In the method for structure topological tree of the present invention, described steps A) further comprise the steps:
A1) definition comprises the description of topological tree: tree numbering, tree title;
A2) structure of definition topological tree comprises: tree numbering, node level, network element attribute.
In the method for structure of the present invention topological tree, described steps A 2) network element attribute in comprises the attribute that is comprised in the attribute data of managed devices.
In the method for structure of the present invention topological tree, described step B) interrelational form comprises Customs Assigned Number, tree numbering, DISPLAY ORDER in.
In the method for structure of the present invention topological tree, described step C) packet purse rope meta-attribute name, network element attribute value and tree node pointer to object that the topological tree node data collection described in is comprised.
In the method for structure topological tree of the present invention, described step C) further comprise the steps:
C1) according to described topological tree structure, the data directory that creates NE by described index order, obtains the network element data collection with the network element data that reads;
C2) the structure objects chained list that creates NE.
The form of the network element data index in the method for structure of the present invention topological tree, described step C1) comprises: node level 1 network element attribute+node level 2 network element attributes+... + node level N network element attribute.
The attribute of the network element structure objects in the method for structure of the present invention topological tree, described step C2) comprises: tree numbering, node level, network element attribute, node pointer, father node pointer and a last value.
In the method for structure topological tree of the present invention, described step D) further comprise the steps:
D1) network element data pointer and network element structure objects pointer and initial value thereof are set, the initial value of network element data pointer points to first row of network element data collection, the initial value of network element structure objects pointer is 0, points to first the network element structure objects of coming of network element structure objects chained list;
D2) judge whether the network element data that network element data is concentrated travels through, as finish that then the structure of topological tree, execution in step D8 are finished in expression); As unfinished, execution in step D3);
D3) judge whether the network element structure objects in the network element structure objects chained list travels through, and in this way, the network element data pointer adds 1, and execution in step D2), as not, carry out next step D4);
D4) from this network element structure objects, obtain the network element attribute value, concentrate the field value that takes out field described network element attribute value by name in the current line at network element data, be worth relatively with last one in the network element structure objects, if do not wait, then carry out next step D5), otherwise execution in step D7);
D5) a newly-built in the tree network element node, its father node is the father node pointer in the current network structure objects, a last value of current network structure objects is replaced with the field value of described field described network element attribute value by name, the father node pointer that begins from the next object of the network element structure objects of network element structure objects pointed in the network element structure objects chained list is pointed to this newly-built node entirely, and a last value then all is set to initial value;
D6) concentrate the insertion data line to described topological tree node data, its network element attribute is called described network element attribute value, and the network element attribute value is the field value of field described network element attribute value by name in the current line, and the tree node pointer to object points to newly-built node;
D7) described network element structure objects pointer adds 1, returns step D3);
DS) finish.
In the method for structure topological tree of the present invention, at described step D5) in, when described father node pointer was nil, this newly-built network element node was a root node.
Implement method of in the server/customer end structure, constructing topological tree of the present invention, the structure of topological tree has following beneficial effect: owing to can be set by user oneself, and the user can select the topological tree structure that is associated with oneself, simultaneously also owing to be provided with topological tree node data collection, and all corresponding data is put into the topological tree node data and concentrate when network node of every establishment, so the topological tree structure of constructing with this method is abundant, search performance is good.
Description of drawings
The invention will be further described below in conjunction with drawings and Examples, in the accompanying drawing:
Fig. 1 is a kind of flow chart of constructing the method embodiment of topological tree in the server/customer end structure of the present invention;
Fig. 2 is the flow chart that reading of data is created topological tree node data collection step in the embodiment of the invention;
Launch the flow chart of network element data in Fig. 3 embodiment of the invention by the topological tree structure.
Embodiment
Below with realizing in the repeater management system in communication that method of the present invention as embodiment, specifies the specific embodiment of the present invention.As shown in Figure 1, in the server/customer end structure, construct among the method embodiment of topological tree, comprise the steps: in the present invention
S11 is according to the network element attribute data, definition topological tree structure, be stored in the server database: server is collected the various attributes with its managed devices that links to each other by network in this step, as: affiliated area, device type, supplier, Dai Wei manufacturer, power, user mode, running status or the like, the summation of these attributes constitutes the network element attribute data; In addition, the user need be defined in the structure of the topological tree of using in the native system, comprise description of topological tree and the formation of topological tree, in the present embodiment, be described as [tree numbering] to topological tree adds [tree title], promptly describe topological tree with two fields, first is variable [a tree numbering], and second is variable [tree title]; (every promptly be stored in the one or more bytes in the computer herein, indicate no longer especially later on by the variable that is of symbol [] mark.) definition to the topological tree structure in the present embodiment is: [tree numbering], [node level], [network element attribute].Wherein [network element attribute] must be the attribute that repeater equipment possesses, and promptly can only choose from the repeater equipment attribute.In the present embodiment, we define one " manufacturer's topology " tree, and its primary structure is " center-manufacturer-area-logical station ".
S12 associated user and at least one topological tree structure: the topological tree structure that can show when the user being set logining, its interrelational form are [Customs Assigned Number], [tree numbering], [DISPLAY ORDER].Owing to allow a user to show many topological trees simultaneously,, then need to be provided with [DISPLAY ORDER] so will show many trees simultaneously if a user is provided with.
S13 reads network element data and associated topological tree structured data, data set and topological tree node data collection create NE: in this step, the user accesses the data of storing or defining automatically in step S11 and S12 in system after client or the server log, and utilize these data, generate network element data collection and topological tree node data collection, in the present embodiment, the user is by after the client login, the above-mentioned data of reading back from the data in server storehouse, and these data are temporarily stored in the internal memory of client.
S14 expands into tree by setting structure with network element data, and in expansion process corresponding each network node, concentrate to add corresponding data at the topological tree node data: the data that obtain according to preceding step, setting according to the user who accesses, to expand into the tree type by the network element data that server end reads, and in above-mentioned expansion process when setting up node each time, it is concentrated to deposit corresponding data in above-mentioned topological tree node data, thereby can find the position of this node in the Tree Network metadata of launching in needs rapidly.
As shown in Figure 2, in the present embodiment, step S13 further comprises the steps:
S21 reads network element data: the network element data of client reading and saving in server database, and be kept in the internal memory of client with the form of a data set.
S22 reads associated topological tree structure: client is according to the incidence relation of user who sets among the step S12 and topological tree, the topological tree structure of reading and saving in server database, and formula is kept in the internal memory of client; When comprising DISPLAY ORDER in the incidence relation among the step S12, also to read a plurality of topological tree structures by DISPLAY ORDER.
S23 the create NE data directory and the network element data that sorts, obtain the network element data collection: the above-mentioned network element data that is stored in client is set up index by the tree structure that will show, index is: node level 1 network element attribute+node level 2 network element attributes+... + node level N network element attribute, after obtaining this index, network element data is resequenced by this index, thereby obtain the network element data collection.
The S24 structure objects chained list that creates NE: construct a network element structure objects chained list, the network element construction packages is become object, be pressed into this network element structure objects chained list, the network element structure objects is by [the node level] of the topological tree organization definition that will show ordering in this chained list.The network element structure objects comprises attribute: [tree numbering], [node level], [network element attribute], [node pointer], [father node pointer], [a last value].[node pointer] of all network element structure objects is nil with [father node pointer] in the initialization chained list, and [a last value] is made as a special initial value, and this particular value must guarantee can not appear in the property value of equipment.
S25 creates topological tree node data collection: the internal storage data collection of a sky of dynamic creation, i.e. and topological tree node data collection, its structure is: [network element attribute name], [network element attribute value], [tree node pointer to object].It mainly acts on is to use for searching for the locating tree node fast.At this moment, its data are empty.
Step S14 further comprises the steps: equally, in the present embodiment
S301 is provided with network element data pointer and network element structure objects pointer and initial value thereof, wherein the network element data pointer is meant that the network element data when pre-treatment is to be in the position that the said network element structured data is concentrated, network element structure objects pointer is meant position in the network element structure chained list at its place of network element structure objects when pre-treatment (in network element structure objects chained list, the network element structure objects is by [node level] ordering of the topological tree organization definition that will show); Its initial value is represented its original position respectively, and in the present embodiment, the initial value of network element data pointer points to first row of network element data collection, and the initial value of network element structure objects pointer is 0, points to first the network element structure objects of coming of network element structure objects chained list.
Does S302 finish the network element data traversal? judge whether to finish the traversal of network element data, in this way, the expression topological tree has constructed and has finished execution in step S311; As denying execution in step S304.
S303 network element data pointer adds one: the network element data pointer is added one point to next line, and return execution in step S302
Does S304 finish the traversal of network element structure objects chained list? judge whether to finish the traversal of network element structure objects, in this way, show that current network data pointer network element data pointed disposes, then execution in step S303; As denying execution in step S306.
S306 obtains the field value of network element attribute value by name and the last value in the network element structure: in this step, at first obtain from the network element structure objects [network element attribute], establish its value and be P1; Afterwards, concentrate the field value that takes out field P1 by name in the current line, establish its value and be V1 at network element data; Simultaneously, from this network element structure objects, obtain [a last value], establish its value and be V2.
The more above-mentioned two-value of S307 is with denying: more above-mentioned V1 and V2, if the two does not wait, then carry out S308; Otherwise jumping to step S310 continues to carry out.
The newly-built network element node of S308, the father node pointer of the network element object after it in its attribute and this network element structure objects chained list is set: a newly-built network element node on topological tree, its father node are [the father node pointer] in the network element structure objects.Then the field value V2 in [a last value] of current network structure objects is replaced with field value V1.[the father node pointer] of the network element structure objects that begins from K+1 in the network element structure objects chained list pointed to newly-built node entirely, and [a last value] then all is changed to initial value.
S309 concentrates to the topological tree node data and inserts newly-built node data: concentrate toward above-mentioned topological tree node data and insert data line, wherein [network element attribute name] equals P1, and [network element attribute value] equals V1, and [tree node pointer to object] points to newly-built node.
The position of S310 network element structure objects in its chained list adds 1: the position of network element structure objects in its chained list to one of pusher, be about to K and become K+1, and then execution in step S304.
S311 finishes:
Form with form specifies the variation of network element structure objects chained list in the process of implementation below:
Behind execution in step S23, obtain network element data collection such as following table:
The centerSupplierThe areaLogical station...
Network management centerCompatriotsThe FeitianCI scape X hotel?
Network management centerCompatriotsThe FeitianThe blue X stone of CI home?
Network management centerCompatriotsLuohuC1 name X mansion?
Network management centerCapital XThe FeitianMountain villa, CI X mountain?
Behind execution in step S24, it is as follows to obtain network element structure objects chained list:
The tree numberingThe node levelNetwork element attributeThe father node pointerA last value
1 1The center nil NULL
1 2Supplier nil NULL
1 3The area nil NULL
1 4Logical station nil NULL
Behind execution in step S25, it is as follows to obtain topological tree node data collection:
The network element attribute nameThe network element attribute valueThe tree node pointer
???
After execution instep 301, first row of network element data pointed network element data, first network element structured data in the network element structure objects pointed network element structure objects chained list, promptly the node level is 1 network element structure objects.
In step S306, can obtain P1 according to said network element structure objects chained list is " " center "; V1 is the field " value of " center ": " network management center " by name in the said network element data centralization current line; V2 is NULL.
In step S308, a newly-built tree node N (network management center) (following replace all newly-built nodes) with N (XX); Because [father node pointer] in the table 5 item is nil, so N (network management center) is a root node; Then [a last value] is revised as " network management center ".[the father node pointer] of the network element structure objects that begins from K+1 in the network element structure objects chained list pointed to newly-built node entirely, and [a last value] is changed to initial value entirely.After executing this step, the data in the network element structure objects chained list become as following table:
The tree numberingThe node levelNetwork element attributeThe father node pointerA last value
1 1The center?nilNetwork management center
1 2SupplierN (network management center) NULL
1 3The areaN (network management center) NULL
1 4Logical stationN (network management center) NULL
Concentrate insertion delegation corresponding data to the topological tree node data, topological tree node data collection becomes:
The network element attribute nameThe network element attribute valueThe tree node pointer
The centerNetwork management centerTree node N (network management center) address pointer
So far, first network element structure objects in the network element structure objects chained list is finished dealing with, and at step S310, network element structure objects pointer adds 1, execution in step S304-S309, so network element structure objects chained list and topological tree node data collection become respectively:
The tree numberingThe node levelNetwork element attributeThe father node pointerA last value
1 1The center?nilNetwork management center
1 2SupplierN (network management center)Compatriots
The tree numberingThe node levelNetwork element attributeThe father node pointerA last value
1 3The areaN (compatriots) NULL
1 4Logical stationN (compatriots) NULL
The network element attribute nameThe network element attribute valueThe tree node pointer
The centerNetwork management centerTree node N (network management center) address pointer
SupplierCompatriotsTree node N (compatriots) address pointer
The network element structure objects of remainder in the processing net element structure objects chained list, network element structure objects chained list becomes:
Figure DEST_PATH_GSB00000029355000081
Figure DEST_PATH_GSB00000029355000091
So far, network element data concentrates first row to dispose, execution in step S303, the network element data pointer adds 1, points to second row that network element data is concentrated, repeat above-mentioned steps after, it is as follows to obtain network element structure objects chained list:
The tree numberingThe node levelNetwork element attributeThe father node pointerA last value
1 1The center?nilNetwork management center
1 2SupplierN (network management center)Compatriots
1 3The areaN (compatriots)The Feitian
1 4Logical stationN (Feitian)The blue X stone of CI home
Equally, behind processing net element data set the third line, it is as follows to obtain network element structure objects linked list data:
The tree numberingThe node levelNetwork element attributeThe father node pointerA last value
1 1The center?nilNetwork management center
1 2SupplierN (network management center)Compatriots
1 3The areaN (compatriots)Luohu
1 4Logical stationN (Luohu)CI name X mansion
Similarly, during processing net element data centralization fourth line data, because supplier's variation, so need newly-built supplier node.This moment, network element structure objects linked list data became:
The tree numberingThe node levelNetwork element attributeThe father node pointerA last value
1 1The center?NilNetwork management center
1 2SupplierN (network management center)Capital X
1 3The areaN (capital X) NULL
1 4Logical stationN (capital X) NULL
Last value owing to the area is reset then, and regional node needs newly-built again, but the superior node of this time newly-built regional node is N (capital X).Last newly-built logical station node.So network element data concentrates whole 4 line data just to dispose.
Because every newly-built node all can be concentrated toward memory table topological tree node data to add data line.Therefore when the user has the Search and Orientation of needs node, only need to search in this memory table, just can obtain this node pointer rapidly, efficient is higher.
Though above description the specific embodiment of the present invention, those of ordinary skills should be known in that these only for illustrating, can make numerous variations or modification to these execution modes, and not deviate from principle of the present invention and essence.

Claims (10)

1. the method for a structure topological tree in the server/customer end structure is characterized in that, comprises the steps:
A) according to the attribute data of the managed devices that links to each other, define the topological tree structure, and be stored in the described server database;
B) make user and at least one topological tree structurally associated connection;
C) from server database, read network element data and associated topological tree structured data, and create topological tree node data collection;
D) by the topological tree structure construction topological tree of definition, corresponding each node in construction process is concentrated the adding corresponding data at the topological tree node data, is used for locating fast the node of described topological tree.
2. the method for structure topological tree according to claim 1 is characterized in that described steps A) further comprise the steps:
A1) definition comprises the description of topological tree: tree numbering, tree title;
A2) structure of definition topological tree comprises: tree numbering, node level, network element attribute.
3. the method for structure according to claim 2 topological tree is characterized in that described steps A 2) in network element attribute comprise the attribute that is comprised in the attribute data of managed devices.
4. the method for structure according to claim 1 topological tree is characterized in that described step B) in interrelational form comprise Customs Assigned Number, tree numbering, DISPLAY ORDER.
5. the method for structure according to claim 1 topological tree is characterized in that described step C) described in topological tree node data collection the packet purse rope meta-attribute name, network element attribute value and the tree node pointer to object that are comprised.
6. the method for structure topological tree according to claim 5 is characterized in that described step C) further comprise the steps:
C1) according to described topological tree structure, the data directory that creates NE by described index order, obtains the network element data collection with the network element data that reads;
C2) the structure objects chained list that creates NE.
7. the method for structure according to claim 6 topological tree is characterized in that described step C1) described in the form of network element data index comprise: node level 1 network element attribute+node level 2 network element attributes+... + node level N network element attribute.
8. the method for structure according to claim 7 topological tree is characterized in that described step C2) described in the attribute of network element structure objects comprise: tree numbering, node level, network element attribute, node pointer, father node pointer and a last value.
9. the method for structure topological tree according to claim 8 is characterized in that described step D) further comprise the steps:
D1) network element data pointer and network element structure objects pointer and initial value thereof are set, the initial value of network element data pointer points to first row of network element data collection, the initial value of network element structure objects pointer is 0, points to first the network element structure objects of coming of network element structure objects chained list;
D2) judge whether network element data that network element data is concentrated travels through and finish, as finish that then the structure of topological tree, execution in step D8 are finished in expression); As unfinished, execution in step D3);
D3) judge whether network element structure objects in the network element structure objects chained list travels through and finish that in this way, the network element data pointer adds 1, and execution in step D2), as not, carry out next step D4);
D4) from this network element structure objects, obtain the network element attribute value, concentrate the field value that takes out field described network element attribute value by name in the current line at network element data, be worth relatively with last one in the network element structure objects, if do not wait, then carry out next step D5), otherwise execution in step D7);
D5) a newly-built in the tree network element node, its father node is the father node pointer in the current network structure objects, a last value of current network structure objects is replaced with the field value of described field described network element attribute value by name, the father node pointer that begins from the next object of the network element structure objects of network element structure objects pointed in the network element structure objects chained list is pointed to this newly-built node entirely, and a last value then all is set to initial value;
D6) concentrate the insertion data line to described topological tree node data, its network element attribute is called described network element attribute value, and the network element attribute value is the field value of field described network element attribute value by name in the current line, and the tree node pointer to object points to newly-built node;
D7) described network element structure objects pointer adds 1, returns step D3);
D8) finish.
10. the method for structure topological tree according to claim 9 is characterized in that, at described step D5) in, when described father node pointer was nil, this newly-built network element node was a root node.
CN2007100775274A2007-11-302007-11-30Method for constructing topological tree in server/client terminal structureActiveCN101222391B (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN2007100775274ACN101222391B (en)2007-11-302007-11-30Method for constructing topological tree in server/client terminal structure

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN2007100775274ACN101222391B (en)2007-11-302007-11-30Method for constructing topological tree in server/client terminal structure

Publications (2)

Publication NumberPublication Date
CN101222391A CN101222391A (en)2008-07-16
CN101222391Btrue CN101222391B (en)2010-08-18

Family

ID=39631982

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN2007100775274AActiveCN101222391B (en)2007-11-302007-11-30Method for constructing topological tree in server/client terminal structure

Country Status (1)

CountryLink
CN (1)CN101222391B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN102045154B (en)*2009-10-192013-10-23中国移动通信集团江苏有限公司 Power equipment data synchronization method, system and power resource management server
CN101799753B (en)*2009-12-172013-01-16中国电力科学研究院Method and device for realizing tree structure
WO2012167549A1 (en)*2011-11-152012-12-13华为技术有限公司Method and device for data exchange between network administrator and network element
CN103078751B (en)*2011-12-132016-05-18上海寰创通信科技股份有限公司The efficient internal memory querying method of network management system and in batches loading method
CN105933148B (en)*2016-04-152019-04-02烽火通信科技股份有限公司A kind of SDNization GIS network topology model implementation method
CN107181613A (en)*2017-05-102017-09-19广东工业大学A kind of kautz tree topology control methods based on wireless sensor network
CN107888415B (en)*2017-11-032020-11-13北京佳讯飞鸿电气股份有限公司Network management system data maintenance method
CN108509397B (en)*2018-03-212020-07-31清华大学 Storage and parsing method and system of hierarchical structure data based on identifier technology
CN111107131B (en)*2019-11-052023-07-21远景智能国际私人投资有限公司 Management method, device, server and storage medium of Internet of things equipment

Citations (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
EP1069727A2 (en)*1999-07-162001-01-17Canon Kabushiki KaishaSystem for searching a device on a network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
EP1069727A2 (en)*1999-07-162001-01-17Canon Kabushiki KaishaSystem for searching a device on a network

Also Published As

Publication numberPublication date
CN101222391A (en)2008-07-16

Similar Documents

PublicationPublication DateTitle
CN101222391B (en)Method for constructing topological tree in server/client terminal structure
CN102843298B (en)Realize the method and system of exchanger chip Openflow stream table priority
CN102346747B (en)Method for searching parameters in data model
CN103177094B (en)Cleaning method of data of internet of things
US8176034B2 (en)Method for integrating road names and points of interest in source data
Zeinalipour-Yazti et al.The threshold join algorithm for top-k queries in distributed sensor networks
CN111190904B (en)Method and device for hybrid storage of graph-relational database
CN107402927A (en)A kind of enterprise's incidence relation topology method for building up and querying method based on graph model
ATE487987T1 (en) DISTRIBUTED DATABASE SYSTEM
JPH03139936A (en)Path selection method
CN109002484A (en)A kind of method and system for sequence consumption data
CN103365991B (en)A kind of dictionaries store management method realizing Trie tree based on one-dimensional linear space
CN103324763B (en)Presenting method for tree-form data structure of mobile phone terminal
CN102243660A (en)Data access method and device
CN108829880B (en)Method for configuration management of optical network terminal equipment
CN114138246B (en)Topology automatic generation method, device, computing equipment and storage medium
CN102930027A (en)Data processing system and processing method in cloud computing multi-tenant architecture
CN103336782A (en)Relational distributed database system
CN105608228B (en)A kind of efficient distributed RDF data storage method
CN112685175B (en)Construction method and device of service topological graph and computer readable storage medium
CN108595711B (en)Graph mode association rule mining method in distributed environment
CN103885950A (en)Method and device for acquiring correspondence between abbreviations and POI
CN104125300A (en)Synchronizing method for set-card separate type domestic gateway business configuration data
CN104283966A (en) Data distribution algorithm and device of cloud storage system
CN108259195A (en)The determining method and system of the coverage of anomalous event

Legal Events

DateCodeTitleDescription
C06Publication
PB01Publication
C10Entry into substantive examination
SE01Entry into force of request for substantive examination
C14Grant of patent or utility model
GR01Patent grant
ASSSuccession or assignment of patent right

Owner name:SHENZHEN GUOREN COMMUNICATION CO., LTD.

Free format text:FORMER OWNER: GUOREN COMMUNICATION CO LTD., SHENZHEN

Effective date:20150805

C41Transfer of patent application or patent right or utility model
TR01Transfer of patent right

Effective date of registration:20150805

Address after:518000 Shenzhen city Nanshan District high tech park of science and technology in three Chinese central road building A building room 13F1303

Patentee after:Shenzhen compatriots limited company that communicates by letter

Address before:518057 building of three people's road, middle science and technology, Nanshan District science and Technology Park, Shenzhen, Guangdong

Patentee before:Guoren Communication Co., Ltd., Shenzhen

TR01Transfer of patent right

Effective date of registration:20191009

Address after:Room 1403, building a, Guoren building, No. 5, Keji Zhongsan Road, gaoxinyuan Middle District, Maling community, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province

Patentee after:Shenzhen Guoren Wireless Communication Co., Ltd.

Address before:518000 Shenzhen city Nanshan District high tech park of science and technology in three Chinese central road building A building room 13F1303

Patentee before:Shenzhen compatriots limited company that communicates by letter

TR01Transfer of patent right

[8]ページ先頭

©2009-2025 Movatter.jp