CN101534477A - List item management method and device - Google Patents
List item management method and device Download PDFInfo
- Publication number
- CN101534477A CN101534477A CN200910082667A CN200910082667A CN101534477A CN 101534477 A CN101534477 A CN 101534477A CN 200910082667 A CN200910082667 A CN 200910082667A CN 200910082667 A CN200910082667 A CN 200910082667A CN 101534477 A CN101534477 A CN 101534477A
- Authority
- CN
- China
- Prior art keywords
- multicast
- pointer
- firms
- information
- storage unit
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a list item management method and a device. The method comprises the followings: in the memory space of multicasting/broadcasting list, the multicasting/broadcasting list is organized in the manner of pointer chained list, the service condition of each unit memory cell in the memory space of multicasting/broadcasting list is marked by using free pointer table, and the pointer chained list and free pointer table corresponding to the appointed multicasting/broadcasting list are correspondingly amended when the members included in the multicasting/broadcasting list are changed. The technical proposal of the invention improves the operating factor of memory space.
Description
Technical field
The present invention relates to data communication technology field, refer to a kind of entry management method and device especially.
Background technology
In recent years, along with development of internet technology, the range of application of multicasting technology also more and more widely, as video conference, fields such as long-distance education.
The forwarding of multicast message is to rely on the multicast list of all information about firms of preserving in the multicast group on the network equipment to finish.Wherein, multicast list on the network equipment needs safeguard according to the applicable cases of reality in real time, operation such as comprise interpolation to multicast list, delete and search.
Fig. 1 is the schematic diagram of multicast message repeating process in the prior art.As shown in Figure 1, when network device interface arrives multicast message, search the multicast concordance list according to the multicast index value that carries in this message and obtain corresponding search index value, this search index value is the initial address of corresponding multicast table, search all information about firms that multicast table obtains corresponding multicast group according to search index then, according to the multicast member information that is obtained multicast message is duplicated one by one and to send to each multicast member, thereby realize the forwarding of duplicating of multicast message.
Fig. 2 is the organizational form schematic diagram of multicast table of the prior art.As shown in Figure 2, in the prior art whole multicast table memory space being divided into a lot of (is the minimum particle size space in the multicast table memory space by 128 unit storage units, only deposit a multicast member information) list item space formed, be called bucket (bucket), promptly per 128 unit storage units are one barrel.The flag bit whether each unit storage unit also has a next unit storage unit that is used to represent neighbor address to be used except storing a multicast member information, this flag bit is that the next unit storage unit of 1 expression is used, is that the next unit storage unit of 0 expression is not used.If certain multicast group comprises 129 members, need two buckets so, the search index value is the initial address of first barrel, first bucket is preserved 127 multicast member information, and (last unit storage unit of gn1～gn127) and its is used to preserve the initial address idxn of second bucket, find the inlet of second bucket by idxn, thereby find two other multicast member information (gq1 and gq2).
Because in the middle of the reality, number of members in multicast group can change, for example there is the member to withdraw from or has the newcomer to add, this moment need according to actual conditions to multicast table add, refresh operation is safeguarded in deletion etc., in the prior art, maintenance to multicast table refreshes by upper layer software (applications), and promptly CPU finishes, and need not hardware and intervenes any operation.
Big unusual in order to guarantee that flux of multicast can not occur, in the prior art by safeguarding that two identical multicast tables are so that be used for carrying out the masterslave switchover of multicast table.The forwarding of multicast message is carried out with multicast table according to main, when multicast member changes, upper layer software (applications) carries out masterslave switchover by the masterslave switchover request after upgrading the standby multicast table that finishes, standby multicast table originally becomes main uses multicast table, thus guaranteed multicast table safeguard that multicast data flow still can normally be transmitted in the refresh process.
But still there is following shortcoming in existing multicast table management method:
1, waste multicast table memory space
At first, need to safeguard two identical multicast tables, wasted memory space;
Secondly, with whole multicast list space be divided into a lot of by 128 unit storage units forms barrel mode also can waste memory space, for example, also need the memory space with a bucket when a multicast group has only a member, other 127 unit storage units in this bucket have then been wasted.
2, the speed of response to network topology is slow
Owing to carry out active and standby table when switching at needs, if the current multicast message that carrying out is transmitted, then need to finish with multicast table and just can carry out active and standby table after multicast message is transmitted and switch according to current master, under the more situation of oversized frame and multicast member, can cause switching time longer, thereby cause the speed of response to network topology slower.
Summary of the invention
The invention provides a kind of entry management method, this method can be saved memory space, and has improved the speed of response to network topology.
The present invention also provides a kind of list item management devices, and this device can be saved memory space, and has improved the speed of response to network topology.
For achieving the above object, technical scheme of the present invention specifically is achieved in that
The invention discloses a kind of entry management method, this method comprises:
The information about firms that in multicast/broadcast table memory space, is comprised with pointer chain sheet form storage multicast/broadcast group, wherein, the unit storage unit in multicast/broadcast table memory space storage information about firms and with the address pointer of the next information about firms of multicast/broadcast group;
Safeguard the free pointer table, each free pointer in this free pointer table is corresponding one by one with the constituent parts memory cell in the multicast/broadcast table memory space; Whether the unit storage unit that each free pointer is used for the mark correspondence is used;
When member that designated multicast/the broadcasting group is comprised changed, pairing pointer chained list and free pointer table were organized in this designated multicast/broadcasting of corresponding modify.
The invention also discloses a kind of list item management devices, this device comprises: free pointer table memory module, transmit memory module and maintenance module, wherein,
Transmit memory module, be used for the information about firms that is comprised with pointer chain sheet form storage multicast/broadcast group; Wherein, transmit in the memory module unit storage unit storage information about firms and with the address pointer of the next information about firms of multicast/broadcast group;
Free pointer table memory module is used to store the free pointer table, and each free pointer of free pointer table is corresponding one by one with the constituent parts memory cell in transmitting memory module; Wherein, whether each free pointer unit storage unit of being used for the mark correspondence is used;
Maintenance module is used for when the member that designated multicast/the broadcasting group is comprised changes, and pairing pointer chained list and free pointer table are organized in this designated multicast/broadcasting of corresponding modify.
As seen from the above technical solution, the present invention is this to organize the multicast/broadcast table with the form of pointer chained list in multicast/broadcast table memory space, utilize the operating position of the constituent parts memory cell in the free pointer list notation multicast/broadcast table memory space, when the member who is comprised when the multicast/broadcast group changes, the technical scheme of pairing pointer chained list and free pointer table is organized in this designated multicast/broadcasting of corresponding modify, can improve to greatest extent and knit multicast/broadcast table operating factor of memory space, and need as prior art, dispose two identical list items and carry out masterslave switchover, therefore also improved the speed of response to network topology greatly.
Description of drawings
Fig. 1 is the schematic diagram of multicast message repeating process in the prior art;
Fig. 2 is the organizational form schematic diagram of multicast table of the prior art;
Fig. 3 is the flow chart of a kind of multicast table management method of the embodiment of the invention;
Fig. 4 is the organizational form schematic diagram of the multicast table in the embodiment of the invention;
Fig. 5 is the organizational form schematic diagram of the free pointer table in the embodiment of the invention;
Fig. 6 is a kind of flow chart of broadcasting table management method of the embodiment of the invention;
Fig. 7 is the composition structured flowchart of a kind of list item management devices of the embodiment of the invention.
Embodiment
Core concept of the present invention is: multicast table is divided into minimum particle size (corresponding multicast member) manages, in the multicast table memory space, organize multicast table with the form of pointer chained list, wherein, a unit storage unit in the multicast table memory space is only stored an information about firms and with the address pointer of the next information about firms of multicast group, and utilize the operating position of the constituent parts memory cell in the free pointer list notation multicast table memory space, when needs add the newcomer in multicast table, find the unit storage unit that is not used to be used to store the information about firms of new interpolation according to free pointer, and this unit storage unit is labeled as uses, and when removing members from multicast table, the unit storage unit that it is corresponding is labeled as and is not used.
Fig. 3 is the flow chart of a kind of multicast table management method of the embodiment of the invention.As shown in Figure 3, this method may further comprise the steps:
In the embodiment of the invention, information about firms of unit storage unit storage in the multicast table memory space and with the address pointer of the next information about firms of multicast group, the minimum particle size (i.e. multicast member) that is about in the multicast table manages as a link unit in the chained list.
In this step, need to prove that space pointer is each pointer in the general reference free pointer table, rather than refer in particular to the pointer corresponding, represent with the value of free pointer whether its corresponding unit storage unit is used here with idle unit storage unit.Free pointer can value be 0 or 1, and wherein the corresponding unit storage unit of 1 expression uses, and the corresponding unit storage unit of 0 expression is not used.
In this step, when in the designated multicast group, adding the member, find a unit storage unit that is not used and the free pointer that it is corresponding to be labeled as according to the free pointer table and use, in the unit storage unit that this finds, write the information about firms that will add and be inserted in the pairing pointer chained list of designated multicast group.
In this step, the unit storage unit that writes the information about firms of new interpolation can be inserted into any position in the pairing pointer chained list of designated multicast group.This is that its sequencing in chained list is not represented any implication because the status between the member in the multicast group is an equality.
In this step, when removing members from the designated multicast group, the unit storage unit of removing members information is treated in deletion storage from the pairing pointer chained list of this designated multicast group, and will be somebody's turn to do the pairing free pointer of the unit storage unit of deleting be labeled as and be not used from the pointer chained list.
Link unit one-level of deletion is inserted the operating process of a link unit with operation of the prior art from the pointer chained list.
For making purpose of the present invention, technical scheme and advantage clearer, below the present invention is described in more detail with reference to accompanying drawing.
Fig. 4 is the organizational form schematic diagram of the multicast table in the embodiment of the invention.As shown in Figure 4, for multicast group n, its multicast table comprises k information about firms, be respectively gn1～gnk, organize this k information about firms with the form of pointer chained list, be about to each information about firms and leave in the unit storage unit in the multicast table memory space, and unit storage unit is a link unit in the pointer chained list.Each unit storage unit is also stored a flag bit and next member's address pointer except preserving an information about firms, wherein, flag bit is used to represent whether to exist the next member with multicast group, and promptly whether the member in our unit's memory cell is last member in the multicast group.
For example, referring to Fig. 4, for multicast group n, preserve the 1st the information about firms gn1 of following information: multicast group n in the 1st link unit (size equals a unit storage unit) of the pointer chained list of its multicast table correspondence, flag bit 1 (expression also has next information about firms), and the address pointer next-n1 of next information about firms gn2; Next-n1 points to the 2nd link unit of pointer chained list, preserves the 2nd the information about firms gn2 of following information: multicast group n in the 2nd link unit, flag bit 1, and the pointer address next-n2 of next information about firms; And the like, next-n (k-1) points to last link unit of pointer chained list, preserve last information about firms gnk of following information: multicast group n in this last link unit, flag bit is 0, it is last information about firms of multicast group n that expression does not have next information about firms, promptly current gnk, owing to there is not next information about firms, therefore corresponding pointer address is an invalid value, in Fig. 4, use " * * * " expression.In addition, the first address of the multicast table chained list of multicast group n is the search index value n of multicast group n, and is general when the multicast message of receiving group group n, promptly can obtain search index value n according to the multicast index value n inquiry multicast concordance list that carries in the message.Content about the multicast concordance list is a prior art, no longer describes in detail here.
In Fig. 4, multicast group m comprises j member, its multicast table chained list second chained list as shown in Figure 4, and the multicast table chained list of its particular content and multicast group n is similar, no longer repeats here.
In Fig. 4, also can not preserve the flag bit that is used to represent whether to exist next information about firms in each link unit, but represent whether there is next information about firms with the pointer address of next information about firms, if promptly the pointer address of next information about firms effectively then there is next information about firms in expression, otherwise there is not next information about firms in invalid representation.
Fig. 5 is the organizational form schematic diagram of the free pointer table in the embodiment of the invention.As shown in Figure 5, free pointer in the free pointer tabulation is corresponding one by one with the unit storage unit in the multicast table memory space, in this one-to-one relationship, unit storage unit with the address information labelling correspondence, in Fig. 5, represent the address of different unit storage units respectively with Address1～Address5.And, in Fig. 5, when being " 1 ", the value of free pointer represents that corresponding unit storage unit has been used, when being " 0 ", the value of free pointer represents that corresponding unit storage unit is not used.
The process of in the embodiment of the invention multicast table with chain sheet form tissue as shown in Figure 4 being safeguarded comprises:
1) when needs adds a newcomer in multicast group n, earlier finding a free pointer according to the free pointer table in transmitting memory space is 0 unit storage unit, the pairing free pointer of this unit storage unit that finds is changed to 1, in the unit storage unit that this finds, write newcomer's information, and insert in the pairing pointer chained list of multicast group n as a link unit at this unit storage unit.
Here, write any position that the unit storage unit of newcomer's information can insert the pairing pointer chained list of multicast group n.For example, the simplest method is the afterbody that is inserted into the pointer chained list, at this moment, flag bit in last link unit in the chained list of multicast group n is revised as 1, represent the follow-up multicast member that also has, and invalid value that will be wherein " * * * " address of being revised as the unit storage unit of new insertion, and the new unit storage unit that inserts is owing to be last link unit, therefore wherein be masked as 0, address information is an invalid value.
2) when needs are deleted a member from multicast group n, find the first address of pointer chained list earlier with search index value n, find the link unit at the member place that will delete then step by step according to the pointer address in the chained list, the address that address pointer in its previous link unit is revised as its next link unit, simultaneously, the corresponding free pointer of the link unit that will delete from chained list is revised as 0.
The process of carrying out the multicast message forwarding according to as shown in Figure 4 the multicast table with chain sheet form tissue in the embodiment of the invention comprises: when receiving multicast message, inquire about the first address (being the search index value) that the multicast concordance list obtains the pairing multicast pointer of corresponding multicast group chained list according to the multicast index value that this multicast message carries, first address according to the pointer chained list that obtains is searched step by step, up to flag bit be 0 or address pointer be the afterbody link unit of invalid value, at this moment, expression has found out all information about firms of corresponding multicast group, and the multicast message that is received duplicated sends to each member who is found out.
Can improve to greatest extent by such scheme and to knit the multicast table operating factor of memory space, can reach 100% in theory, carry out masterslave switchover nor need as prior art, dispose two identical list items, therefore improved the speed of response to network topology greatly.
The front was once mentioned in addition, and the maintenance to multicast table in the prior art refreshes by upper layer software (applications), and promptly CPU finishes, and this has also brought a lot of problems.For example, all multicast lists are controlled by CPU, therefore need also safeguard a same multicast list at software view; CPU need be responsible for Dynamic Maintenance and refresh multicast table, can take more cpu resource when the network topology structure dynamic mapping is very fast, and also influence responds the speed that topological structure switches simultaneously; Under the more situation of multicast group, if owing to the multicast table insufficient memory with causing CPU to refresh multicast table when unsuccessful, be difficult to return to last state.
The present inventor has provided following solution for this reason: finished the maintenance work that refreshes of multicast table according to the instruction of CPU by hardware module.For example, when hardware module receive that CPU issues in certain multicast group, add newcomer's instruction the time, carry out step 303 as shown in Figure 3; Equally, when the instruction of removing members from certain multicast group that hardware module receives that CPU issues, carry out step 304 as shown in Figure 3.
The above-mentioned method that multicast table is managed among the present invention is equally applicable to the broadcasting table in the broadcasted application.
Fig. 6 is a kind of flow chart of broadcasting table management method of the embodiment of the invention.As shown in Figure 6, this method may further comprise the steps:
Step 601, the information about firms that in broadcasting table memory space, is comprised with pointer chain sheet form stored broadcast group, wherein, the unit storage unit storage information about firms in the broadcasting table memory space and with the address pointer of the next information about firms of broadcasting group.
Step 602 is safeguarded the free pointer table, and each free pointer in this free pointer table is corresponding one by one with the constituent parts memory cell in the broadcasting table memory space; Whether the unit storage unit that each free pointer is used for the mark correspondence is used.
Step 603, when the member who is comprised when the designated broadcast group changes, pairing pointer chained list of this designated broadcast group of corresponding modify and free pointer table.
In this step, when in the designated broadcast group, adding the member, find a unit storage unit that is not used and the free pointer that it is corresponding to be labeled as according to the free pointer table and use, in the unit storage unit that this finds, write the information about firms that will add and be inserted in the pairing pointer chained list of designated broadcast group.
In this step, when removing members from the designated broadcast group, the unit storage unit of removing members information is treated in deletion storage from the pairing pointer chained list of this designated broadcast group, and will be somebody's turn to do the pairing free pointer of the unit storage unit of deleting be labeled as and be not used from the pointer chained list.
Comprise according to the process of carrying out the broadcasting packet forwarding with the broadcasting table of chain sheet form tissue in the embodiment of the invention: when receiving broadcasting packet, broadcast the first address (being the search index value) that concordance list obtains the pairing broadcasting pointer of respective broadcast group chained list according to the broadcasting index value inquiry that this broadcasting packet carries, find out all information about firms of respective broadcast group according to the first address of the pointer chained list that obtains, and the broadcasting packet that is received duplicated send to each member who is found out.
Fig. 7 is the composition structured flowchart of a kind of list item management devices of the embodiment of the invention.As shown in Figure 7, this device comprises: free pointer table memory module 701, transmit memory module 702, maintenance module 703 and forwarding module 704.
When this device shown in Figure 7 is used for the managing multicast table:
Transmit memory module 702, be used for the pointer chain sheet form storage information about firms that multicast group was comprised; Wherein, transmit in the memory module 702 unit storage unit storage information about firms and with the address pointer of the next information about firms of multicast group;
Free pointer table memory module 701 is used to store the free pointer table, and each free pointer of free pointer table is corresponding one by one with the constituent parts memory cell in transmitting memory module; Wherein, whether each free pointer unit storage unit of being used for the mark correspondence is used;
Maintenance module 703 is used for when the member that the designated multicast group is comprised changes, pairing pointer chained list of this designated multicast group of corresponding modify and free pointer table.For example, when in the designated multicast group, adding the member, be used for finding a unit storage unit that is not used and the free pointer that it is corresponding to be labeled as to use from transmitting memory module 702, in the unit storage unit that this finds, write the information about firms that will add and be inserted in the pairing pointer chained list of designated multicast group according to the free pointer table; When at removing members from the designated multicast group, be used for treating the unit storage unit of removing members information, and will be somebody's turn to do the pairing free pointer of the unit storage unit of from the pointer chained list, deleting and be labeled as and be used from the pairing pointer chained list of this designated multicast group deletion storage.
Forwarding module 704, be used for when receiving multicast message, the multicast index value that carries according to this multicast message obtains the first address of the pairing pointer chained list of corresponding multicast group, find out all information about firms of corresponding multicast group according to the first address of the pointer chained list that obtains, and the multicast message that is received duplicated send to each member who is found out;
When transmitting information about firms that the unit storage unit in the memory module 702 stores and being last member of multicast group, the address pointer of the next information about firms of storing in this unit storage unit is an invalid value; Perhaps, the unit storage unit of transmitting in the memory module 702 is also further stored a flag bit, and this flag bit is used to represent whether the information about firms that this unit storage unit is stored is last information about firms of multicast group;
Maintenance module 703 is used for finishing according to the instruction of CPU and describedly adds the member and the work of removing members from the designated multicast group in the designated multicast group.
When this device shown in Figure 7 is used to manage the broadcasting table:
Transmit memory module 702, be used for the information about firms that is comprised with pointer chain sheet form stored broadcast group; Wherein, transmit in the memory module 702 unit storage unit storage information about firms and with the address pointer of the next information about firms of broadcasting group;
Free pointer table memory module 701 is used to store the free pointer table, and each free pointer of free pointer table is corresponding one by one with the constituent parts memory cell in transmitting memory module; Wherein, whether each free pointer unit storage unit of being used for the mark correspondence is used;
Maintenance module 703 is used for when the member that the designated broadcast group is comprised changes, pairing pointer chained list of this designated broadcast group of corresponding modify and free pointer table.For example, when in the designated broadcast group, adding the member, be used for finding a unit storage unit that is not used and the free pointer that it is corresponding to be labeled as to use from transmitting memory module 702, in the unit storage unit that this finds, write the information about firms that will add and be inserted in the pairing pointer chained list of designated broadcast group according to the free pointer table; When at removing members from the designated broadcast group, be used for treating the unit storage unit of removing members information, and will be somebody's turn to do the pairing free pointer of the unit storage unit of from the pointer chained list, deleting and be labeled as and be used from the pairing pointer chained list of this designated broadcast group deletion storage.
Forwarding module 704, be used for when receiving broadcasting packet, the broadcasting index value that carries according to this broadcasting packet obtains the first address of the pairing pointer chained list of respective broadcast group, find out all information about firms of respective broadcast group according to the first address of the pointer chained list that obtains, and the broadcasting packet that is received duplicated send to each member who is found out;
When transmitting information about firms that the unit storage unit in the memory module 702 stores and being last member of broadcasting group, the address pointer of the next information about firms of storing in this unit storage unit is an invalid value; Perhaps, the unit storage unit of transmitting in the memory module 702 is also further stored a flag bit, and this flag bit is used to represent whether the information about firms that this unit storage unit is stored is last information about firms of broadcasting group;
Maintenance module 703 is used for finishing according to the instruction of CPU and describedly adds the member and the work of removing members from the designated broadcast group in the designated broadcast group.
As seen from the above technical solution, the present invention is this to organize the multicast/broadcast table with the form of pointer chained list in multicast/broadcast table memory space, utilize the operating position of the constituent parts memory cell in the free pointer list notation multicast/broadcast table memory space, when needs add the newcomer in the multicast/broadcast table, find the unit storage unit that is not used to be used to store the information about firms of new interpolation according to free pointer, and when removing members from the multicast/broadcast table, the unit storage unit that it is corresponding is labeled as and is not used, knit multicast/broadcast table operating factor of memory space thereby can improve to greatest extent, and do not need as prior art, to dispose two identical list items and carry out masterslave switchover, therefore also improved the speed of response to network topology greatly.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention, all any modifications of being made within the spirit and principles in the present invention, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (12)
1, a kind of entry management method is characterized in that, this method comprises:
The information about firms that in multicast/broadcast table memory space, is comprised with pointer chain sheet form storage multicast/broadcast group, wherein, the unit storage unit in multicast/broadcast table memory space storage information about firms and with the address pointer of the next information about firms of multicast/broadcast group;
Safeguard the free pointer table, each free pointer in this free pointer table is corresponding one by one with the constituent parts memory cell in the multicast/broadcast table memory space; Whether the unit storage unit that each free pointer is used for the mark correspondence is used;
When member that designated multicast/the broadcasting group is comprised changed, pairing pointer chained list and free pointer table were organized in this designated multicast/broadcasting of corresponding modify.
2, the method for claim 1 is characterized in that, described when member that designated multicast/the broadcasting group is comprised changes, pairing pointer chained list is organized in this designated multicast/broadcasting of corresponding modify and the free pointer table comprises:
When in designated multicast/broadcasting group, adding the member, find a unit storage unit that is not used and the free pointer that it is corresponding to be labeled as according to the free pointer table and use, in the unit storage unit that this finds, write the information about firms that will add and be inserted into designated multicast/broadcasting and organize in the pairing pointer chained list;
3, the method for claim 1 is characterized in that, described when member that designated multicast/the broadcasting group is comprised changes, pairing pointer chained list is organized in this designated multicast/broadcasting of corresponding modify and the free pointer table comprises:
When removing members from designated multicast/broadcasting group, organize the pairing pointer chained list deletion storage from this designated multicast/broadcasting and treat the unit storage unit of removing members information, and will be somebody's turn to do the pairing free pointer of the unit storage unit of from the pointer chained list, deleting and be labeled as and be not used.
4, as each described method in the claim 1 to 3, it is characterized in that this method further comprises:
When receiving multicast, the multicast/broadcast index value that carries according to this multicast obtains the first address of the pairing pointer chained list of corresponding multicast/broadcast group, find out all information about firms of corresponding multicast/broadcast group according to the first address of the pointer chained list that obtains, and the multicast that is received duplicated send to each member who is found out.
5, as each described method in the claim 1 to 3, it is characterized in that,
Described unit storage unit storage information about firms and comprise with the address pointer of the next information about firms of multicast/broadcast group: when the information about firms of unit storage unit storage was last member of multicast/broadcast group, the address pointer of the next information about firms of storing in this unit storage unit was an invalid value;
Perhaps, unit storage unit is also further stored a flag bit, and this flag bit is used to represent whether the information about firms that this unit storage unit is stored is last information about firms of multicast/broadcast group.
6, as each described method in the claim 1 to 3, it is characterized in that, described in designated multicast/broadcasting group, add the member and from designated multicast/broadcasting group the work of removing members finish according to the instruction of central processor CPU by hardware module.
7, a kind of list item management devices is characterized in that, this device comprises: free pointer table memory module, transmit memory module and maintenance module, wherein,
Transmit memory module, be used for the information about firms that is comprised with pointer chain sheet form storage multicast/broadcast group; Wherein, transmit in the memory module unit storage unit storage information about firms and with the address pointer of the next information about firms of multicast/broadcast group;
Free pointer table memory module is used to store the free pointer table, and each free pointer of free pointer table is corresponding one by one with the constituent parts memory cell in transmitting memory module; Wherein, whether each free pointer unit storage unit of being used for the mark correspondence is used;
Maintenance module is used for when the member that designated multicast/the broadcasting group is comprised changes, and pairing pointer chained list and free pointer table are organized in this designated multicast/broadcasting of corresponding modify.
8, device as claimed in claim 7 is characterized in that,
Described maintenance module, be used for when designated multicast/broadcasting group is added the member, from transmit memory module, find a unit storage unit that is not used and the free pointer that it is corresponding to be labeled as according to the free pointer table and use, in the unit storage unit that this finds, write the information about firms that will add and be inserted into designated multicast/broadcasting and organize in the pairing pointer chained list.
9, device as claimed in claim 7 is characterized in that,
Described maintenance module, be used for the time from designated multicast/broadcasting group removing members, organize the pairing pointer chained list deletion storage from this designated multicast/broadcasting and treat the unit storage unit of removing members information, and will be somebody's turn to do the pairing free pointer of the unit storage unit of from the pointer chained list, deleting and be labeled as and be not used.
10, as each described device in the claim 7 to 9, it is characterized in that this device further comprises:
Forwarding module, be used for when receiving multicast, the multicast/broadcast index value that carries according to this multicast obtains the first address of the pairing pointer chained list of corresponding multicast/broadcast group, find out all information about firms of corresponding multicast/broadcast group according to the first address of the pointer chained list that obtains, and the multicast that is received duplicated send to each member who is found out.
11, as each described device in the claim 7 to 9, it is characterized in that,
When the information about firms that the described unit storage unit of transmitting in the memory module is stored was last member of multicast/broadcast group, the address pointer of the next information about firms of storing in this unit storage unit was an invalid value;
Perhaps, the described unit storage unit of transmitting in the memory module is also further stored a flag bit, and this flag bit is used to represent whether the information about firms that this unit storage unit is stored is last information about firms of multicast/broadcast group.
12, as each described device in the claim 7 to 9, it is characterized in that,
Described maintenance module is used for finishing according to the instruction of CPU and describedly adds the member and the work of removing members from designated multicast/broadcasting group at designated multicast/broadcasting group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910082667A CN101534477A (en) | 2009-04-23 | 2009-04-23 | List item management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910082667A CN101534477A (en) | 2009-04-23 | 2009-04-23 | List item management method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101534477A true CN101534477A (en) | 2009-09-16 |
Family
ID=41104817
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910082667A Pending CN101534477A (en) | 2009-04-23 | 2009-04-23 | List item management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101534477A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546439A (en) * | 2012-02-22 | 2012-07-04 | 杭州华三通信技术有限公司 | Management method and equipment of entries |
| CN102591573A (en) * | 2011-12-22 | 2012-07-18 | Tcl集团股份有限公司 | Prompting application method and device |
| CN104702507A (en) * | 2015-03-24 | 2015-06-10 | 深圳中兴网信科技有限公司 | Method and system for dynamically updating table items |
| CN106375532A (en) * | 2016-10-20 | 2017-02-01 | 惠州Tcl移动通信有限公司 | Mobile-terminal-based contact information processing method and system |
| CN106534453A (en) * | 2016-12-21 | 2017-03-22 | 惠州Tcl移动通信有限公司 | Method and system for storing contact person information based on mobile terminal and mobile terminal |
| US10545867B2 (en) | 2015-06-26 | 2020-01-28 | Sanechips Technology Co., Ltd. | Device and method for enhancing item access bandwidth and atomic operation |
| CN114884910A (en) * | 2022-06-08 | 2022-08-09 | 芯河半导体科技(无锡)有限公司 | Dynamic management method for super-large memory data |
| CN116074767A (en) * | 2021-11-04 | 2023-05-05 | 苏州盛科通信股份有限公司 | Method and application for supporting multicast replication of discrete editing |
-
2009
- 2009-04-23 CN CN200910082667A patent/CN101534477A/en active Pending
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102591573A (en) * | 2011-12-22 | 2012-07-18 | Tcl集团股份有限公司 | Prompting application method and device |
| CN102546439A (en) * | 2012-02-22 | 2012-07-04 | 杭州华三通信技术有限公司 | Management method and equipment of entries |
| CN102546439B (en) * | 2012-02-22 | 2016-08-31 | 杭州华三通信技术有限公司 | The management method of a kind of list item and equipment |
| CN104702507A (en) * | 2015-03-24 | 2015-06-10 | 深圳中兴网信科技有限公司 | Method and system for dynamically updating table items |
| CN104702507B (en) * | 2015-03-24 | 2018-09-14 | 深圳中兴网信科技有限公司 | List item dynamic updating method and system |
| US10545867B2 (en) | 2015-06-26 | 2020-01-28 | Sanechips Technology Co., Ltd. | Device and method for enhancing item access bandwidth and atomic operation |
| CN106375532A (en) * | 2016-10-20 | 2017-02-01 | 惠州Tcl移动通信有限公司 | Mobile-terminal-based contact information processing method and system |
| CN106534453A (en) * | 2016-12-21 | 2017-03-22 | 惠州Tcl移动通信有限公司 | Method and system for storing contact person information based on mobile terminal and mobile terminal |
| CN106534453B (en) * | 2016-12-21 | 2021-02-19 | 惠州Tcl移动通信有限公司 | Contact information storage method and system based on mobile terminal and mobile terminal |
| CN116074767A (en) * | 2021-11-04 | 2023-05-05 | 苏州盛科通信股份有限公司 | Method and application for supporting multicast replication of discrete editing |
| CN114884910A (en) * | 2022-06-08 | 2022-08-09 | 芯河半导体科技(无锡)有限公司 | Dynamic management method for super-large memory data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101534477A (en) | List item management method and device | |
| CN104135539B (en) | Date storage method, SDN controllers and distributed network storage system | |
| CN102411637B (en) | Metadata management method of distributed file system | |
| CN101267331A (en) | A search method and device for multicast forward table | |
| RU2595764C2 (en) | Method and device for processing messages | |
| CN101159619B (en) | Fast adding method, device and switching arrangement of ARP table | |
| CN105138571B (en) | Distributed file system and method for storing massive small files | |
| CN102769640B (en) | The update method of user profile, server and system | |
| CN104134173A (en) | Main and distribution network graph/model/data integrated system based on remote retrieval and information interaction | |
| CN102999571B (en) | The implementation method of unit multinode in a kind of cluster | |
| CN103095758B (en) | A kind of method processing file data in distributed file system and this system | |
| CN104820717A (en) | Massive small file storage and management method and system | |
| CN105184540A (en) | Intelligent express delivery cabinet system control method | |
| CN103500120A (en) | Distributed cache high-availability processing method and system based on multithreading asynchronous double writing | |
| CN105843933B (en) | The index establishing method of distributed memory columnar database | |
| CN101923571B (en) | Method and device for managing terminal data logging | |
| CN102012899A (en) | Method, system and equipment for updating data | |
| CN104202424B (en) | A kind of method using software architecture to expand buffer memory | |
| CN102486753B (en) | Build and allow the method for access cache, equipment and storage system | |
| CN103152191A (en) | Processing method and system of service gateway data of internet of things | |
| CN102510407A (en) | Method and system for reading and writing microblog | |
| CN103179009A (en) | Dynamic adaptive calling method of distributed management system | |
| CN102821045A (en) | Method and device for copying multicast message | |
| CN100393072C (en) | Method and apparatus for storing table entry, and inquiry method | |
| CN106453155A (en) | Message processing method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20090916 |