CN102833151B - User individuation priority routing algorithm based on content coverage and feedback mechanism - Google Patents
User individuation priority routing algorithm based on content coverage and feedback mechanism Download PDFInfo
- Publication number
- CN102833151B CN102833151B CN201210226518.8A CN201210226518A CN102833151B CN 102833151 B CN102833151 B CN 102833151B CN 201210226518 A CN201210226518 A CN 201210226518A CN 102833151 B CN102833151 B CN 102833151B
- Authority
- CN
- China
- Prior art keywords
- priority
- subscriber
- routing
- subscription
- message
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a priority routing algorithm, comprising the following steps of: generating a network topology into a loop-free structure according to a minimum spanning tree algorithm, and setting a plurality of adjusting nodes; subscribing information by a subscriber, and setting individuation priority; transmitting the subscribed information in a network, storing one subscription routing table by each node, sorting every item of the routing table based on the priority obtained by the subscriber, receiving the subscription information, matching according to the routing table, and deciding whether the subscription information is updated to the routing table or not by virtue of a mergence coverage routing algorithm; issuing an event to an agent node by an issuer, matching with the subscription routing table, and if matching is successful, routing the event to the subscriber which is interested to the event; carrying out periodic statistics on information average of subscriber information by a boundary agent, and sending the information average to the adjusting nodes; adjusting by the adjusting nodes according to the average, flow and subscriber weight, and returning non-zero adjustment values to the boundary agent; and adjusting the priority of a local routing table by the boundary agent, and flooding the priority to a network. The priority routing algorithm disclosed by the invention has the advantages of high efficiency, fairness and low redundancy.
Description
Technical field
The present invention relates to network field, be specifically related to the user individual priority method for routing of a kind of content-based covering and feedback mechanism.
Background technology
At present, in the network system that Information Monitoring amount is huge, as in " Shanghai rail transit electric power safety supervisory control system ", adopt based on existing content-based Pub/Sub system architecture, the monitoring station information of subscribing to all will event issue laggard enter network, and then be delivered to corresponding subscriber.But in amount of information when excessive or unstable networks, it is congested that message distribution is easy to generation, at this time all blocking message will be queued up on the intermediate node, attempt to mail to down hop with the order of first come, first served, then this message may continue blocking in down hop again, worse situation may congestedly too seriously directly cause event to lose or refuse to pass, and such situation occurs in the responsive especially message taken notice of of user and is difficult to tolerance.As, according to user A wish, once there is the event of " voltage >380 lies prostrate ", so the very first time to notify him, otherwise may life and property loss be caused.According to the congestion situation of the content-based Pub/Sub system of above-mentioned tradition, once have this type of event produce and network block again, the distribution of information not in time so caused, not only directly can reduce the user satisfaction of system, also likely cause the result that can not put up with and maybe cannot retrieve.Therefore, problems is badly in need of solving.
Content covers routing algorithm and proposes for subscription on the basis of filter, it carries out content matching by resolving already present item in the subscription condition that obtains of route messages and routing table, if subscribe to the middle term of Condition Coverage Testing routing table, then with renewal routing table, then to be forwarded; If subscription condition is routed table, middle term covers, then abandon this message, no longer forward.This algorithm can reduce the routing table size on each node, and corresponding minimizing every bar message is in the processing time of each node.And the covering relation in utilization subscription between filter condition, the route messages quantity propagated in a network also can reduce, thus saves the network bandwidth.Famous Siena, Rebeca, JEDI and Hermes etc. have employed the route supporting covering relation.Thus, content can be utilized to cover the performance of routing algorithm raising system as huge in message distribution amounts such as above-mentioned " Shanghai rail transit electric power safety supervisory control systems ".
Priority routing algorithm is applied in the internet already to some extent, and its object mainly provides service differentiation function, also is namely subject to make high-priority message can arrive destination quickly in limited time at physical resources such as bandwidth.But in legacy network, priority route by realization be according to agreement or port numbers, different application messages is distinguished substantially; Or as in JMS mechanism, user indicates at boundary node, then carries out simple transmission at go-between, and no longer relate to the method for priority adjustment and so on.But these conventional methods do not support that user is to the personalized customization of message priority, under the physical condition restrictions such as finite bandwidth, once there is network congestion, systematic function will be subject to obvious impact, can reduce user satisfaction.Therefore, proposing user individual routing algorithm is the inevitable choice met under users ' individualized requirement and limited physical resource.
Summary of the invention
The object of the present invention is to provide the user individual priority method for routing of a kind of content-based covering and feedback mechanism, cover routing algorithm and priority routing algorithm and exist to solve existing content and do not support that user carries out personalized customization to message priority, transmission of messages tape tolerance system is large, the technical problem that the problems such as network congestion cause user satisfaction low easily occurs.
For achieving the above object, the object of the present invention is to provide the user individual priority method for routing of a kind of content-based covering and feedback mechanism, comprising the following steps:
Step one: network topology is generated without ring structure according to minimal spanning tree algorithm;
Step 2: according to nodes number, goes out the degree of depth of in-degree and tree for judging basis with node, adopt election algorithm to select several knot modifications, is responsible for the part subscriber in network separately;
Step 3: Subscriber subscriptions's message, and the priority to its setting individual, be specifically divided into high priority, normal priority and low priority;
Step 4: subscribe message is transmitted in middle-agent's network, each agent node stores one and subscribes to routing table, the priority that routing table every all draws based on subscriber sorts, after receiving subscribe message, mate according to routing table, and determine whether subscribe message is updated to routing table or carries out giving up process by merging covering routing algorithm;
Step 5: publisher issues event, event arrives each agent node, mates with subscription routing table wherein, if the match is successful, is routed to interested subscriber from reverse path.
Step 6: the information that the subscriber that each boundary proxy records its connection in one section of predetermined period respectively receives;
Step 7: when reaching the predetermined period time interval, each boundary proxy adds up the information mean value of each subscriber, and information mean value is sent to the knot modification belonging to it;
Step 8: after each knot modification receives all subscriber's message that it is responsible for, adjust according to each mean value, flow and each subscriber weight, adjust the adjusted value of the high scope priority corresponding to each subscriber, ordinary range priority, and the adjusted value not for 0 is returned to boundary proxy belonging to each subscriber;
Step 9: after each boundary proxy receives the message of step 8 transmission, regulates the priority of the corresponding subscription of local routing table according to different brackets priority, and the subscription through adjustment is again flooded in network.
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, the subscription process of transmitting in step 3 adopts flooding to complete.
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, step 2 also comprises: according to network size cases, classification setting is carried out to knot modification, be specially: one-level knot modification and secondary knot modification are set, wherein, one-level knot modification collects the feedback message that in one piece of region, each subscriber sends, and the feedback message that secondary knot modification collects the transmission of one-level knot modification carries out global fair adjustment.
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, also comprise between step 2 and step 3: the priority weighting of specifying different subscriber, determine the message transmission quality in a network of the different priorities that a node is subscribed to according to weight;
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, in step 4, the subscription merging covering relation that has meeting different subscriber carries common route at co-route.
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, step 7 is periodic process to step 9, each boundary proxy automatic clear after the concurrent carry information mean value of each statistical information mean value is to knot modification in step 7.
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, the event that in step 5, publisher issues does not have priority, after it arrives boundary proxy, obtain initial priority, and priority upgrades according to the subscription priority of subscribing to down hop in routing table on each intermediate node.
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, the information in step 6 specifically comprises: total priority, total queue wait time, total delay, total flow and message number.
According to the user individual priority method for routing of the content-based covering described in present pre-ferred embodiments and feedback mechanism, in step 8, adjustment is carried out to the priority limit of each subscriber and follow following principle: each priority is subscribed to and cannot be demoted or bypass the immediate leadership to other priority limits.
More than comprehensive, can find out, the user individual priority method for routing of content-based covering of the present invention and feedback mechanism, introduce first in distribution subscription system personalized priority route by, and different weight can be set to user and carry out service differentiation, considerably increase the functional of distribution subscription system and flexibility, different user's requests can be met better with limited resource.In addition, the present invention be structured in spanning tree algorithm generate Acyclic Network topology on, also combine the routing algorithm of content-based covering, therefore effectively reduce message in systems in which redundancy send situation.And, subscribe in order to avoid user too " greediness " arranges high priority in personalized subscription procedure, present invention also offers a series of Fairness Guarantee measure, guarantee that personalized priority is subscribed to and fairness depositing.Particularly, according to network size and amount of information size, different knot modification numbers, level feedback arrangement or distributed communication can be selected.Therefore, compared with prior art, the present invention proposes the subscription of personalized priority first, improve systemic-function, and allow user and subscription to carry out priority two-region to divide, have and transmit key message efficiently, greatly reduce redundancy message traffic volume, and take into account the advantage of fairness.
Accompanying drawing explanation
Fig. 1 the present invention is based on content to cover and the user of feedback mechanism subscribes to the personalized priority route that divides two-region by algorithm flow schematic diagram;
Fig. 2 applies the network architecture figure that the user that the present invention is based on content covering and feedback mechanism subscribes to the personalized priority routing algorithm that two-region is divided.
Embodiment
Below in conjunction with accompanying drawing, illustrate the present invention.
The inventive method achieve to add in traditional distribution subscription system personalizedly subscribe to prioritization, user's weight (weight and priority are equivalent conception) is distinguished, based on the function such as Fairness Guarantee of feedback mechanism.Three roles are had: subscriber, publisher and middle-agent in distribution subscription system.Wherein subscriber's distribution subscription, publisher issue event, middle-agent carries out coupling and forward; It should be noted that in addition, in Fairness Guarantee mechanism, special role in middle-agent has boundary node, one-level knot modification and secondary knot modification (to see network size, network too small then one-level knot modification, just do not need secondary knot modification; If network is very large, so likely need one-level, secondary, three grades of knot modifications, this is the common feedback mechanism regulated of the local overall situation of a level in a word.Secondary knot modification may do not had or have three grades of knot modifications).In the methods of the invention, the boundary node being connected with subscriber will bear the responsibility of monitoring subscriber behavior, each attribute of the event that main periodic ground record subscriber receives, and then feed back layer by layer, the whole network regulates.
Refer to Fig. 1, the user individual priority method for routing of a kind of content-based covering and feedback mechanism, comprises the following steps:
S11: network topology is generated without ring structure according to minimal spanning tree algorithm.
S12: according to nodes number, goes out the degree of depth of in-degree and tree for judging basis with node, adopt election algorithm to select several knot modifications, is responsible for the part subscriber in network separately.
According to network size, knot modification can have one, also can have multiple.Under network is of moderate size situation, one-level knot modification and secondary knot modification can be set, wherein one-level knot modification collects the feedback message that in one piece of region, each subscriber sends, and the feedback message that secondary knot modification then collects the transmission of one-level knot modification carries out global fair adjustment.The feedback information mean value obtained first can be issued secondary knot modification by one-level knot modification, and the calculating then starting local zone is compared, and two processes carry out saving portion of time simultaneously.Then the adjustment information of the overall situation can be returned to one-level knot modification by secondary knot modification again, at the enterprising Row sum-equal matrix of one-level knot modification compartmentalization adjusting range, finally will the nodal information of adjustment (mainly adjusting high, medium priority) be needed to feed back to each boundary proxy again.In like manner, if when network node is huge, can three grades of knot modifications etc. be set by that analogy.If but period distances is not very long, do not recommend the number of plies too much, otherwise the time obtaining feeding back can be acted on behalf of by Delay boundary conditions.
S13: Subscriber subscriptions's message, and the priority to its setting individual, be specifically divided into high priority, normal priority and low priority.
Because system adopts acyclic topological structure, the subscription process of transmitting of this step utilizes flooding to complete, and message can not be caused to repeat to forward and take the situation of unnecessary system resource.Simultaneously because system adopts is the routing algorithm of content-based covering, to subscribe to and capped message just can forward again, saved the system resources such as bandwidth further.In addition, in system improve priority, normal priority and low priority and refer to three scopes.
Divided by the priority of this step, the high-priority message that self governable Internet resources just preferentially can be supplied to setting by subscriber uses, thus can transmit faster and receive key message.But the subscription priority due to personalization is arranged may exist inequitable problem---such as oneself all subscription wolfishly all may be set to high priority by certain user, thus in middle-agent's node system preempting resources.Therefore, for the fairness of system, except the mechanism " died of hunger " except preventing low priority message, system also can be examined the priority of all subscription of each user.In order to personalized and Fairness Guarantee, between above-mentioned step 2 and step 3, also comprise following operation:
Specify the different priority weighting referring to subscriber, determine the message transmission quality in a network of the different priorities that a node is subscribed to according to weight.
Specifically, be exactly to any subscription, its priority be all by its significance level in all subscription of user itself and user itself in systems in which weight determine.In some systems, user's weight can carry out commercial fee, distinguishes to reach service quality.Thus native system can specify the weight of different user (comprising publisher and subscriber), thus determines the message transmission quality in a network of the different priorities that a node is subscribed to according to weight.
Such as, if user's wolfishly it is all or most of subscription is all set to high priority, (prerequisite is that subscription is more than 5, and total subscription range exceedes certain ratio, or the later stage is when flowing exceed some), so system can start two kinds of strategies: one is subscribed to reduce in proportion, makes wherein high-priority message quantity be unlikely too much.Two is consider from business perspective, and to can Fare Collection System, the high-priority message can subscribed to for user be charged, and from angle of controlling cost, user can scientifically formulate subscription priority naturally; To non-can Fare Collection System, also can distribute to the maximum high priority budget of whole user one, once reach budget, just can not renew one's subscription high-priority message again, and user will regulate message priority by importance for self-demand.
S14: subscribe message is transmitted in middle-agent's network, each agent node stores one and subscribes to routing table, the priority that routing table every all draws based on subscriber sorts, after receiving subscribe message, mate according to routing table, and determine whether subscribe message is updated to routing table or carries out giving up process by merging covering routing algorithm.
The routing algorithm of same content-based covering, the subscription merging covering relation that has meeting different subscriber carries common route at co-route, therefore also saves system resource further.
S15: publisher issues event, event arrives each agent node, mates with subscription routing table wherein, if the match is successful, is routed to interested subscriber from reverse path.
The event that publisher issues does not have priority, after it arrives boundary proxy, obtains initial priority, and priority upgrades according to the subscription priority of subscribing to down hop in routing table on each intermediate node.
S16: the information that the subscriber that each boundary proxy records its connection in one section of predetermined period respectively receives.
This information specifically comprises: total priority, total queue wait time, total delay, total flow and message number.
S17: when reaching the predetermined period time interval, each boundary proxy adds up the information mean value of each subscriber, and information mean value is sent to the knot modification belonging to it.
S18: after each knot modification receives all subscriber's message that it is responsible for, adjust according to each mean value, flow and each subscriber weight, adjust the adjusted value of the high scope priority corresponding to each subscriber, ordinary range priority, and the adjusted value not for 0 is returned to boundary proxy belonging to each subscriber.
Concrete, adjustment is carried out to the priority limit of each subscriber and follows following principle: each priority is subscribed to and cannot be demoted or bypass the immediate leadership to other priority limits.
S19: after each boundary proxy receives the message of step 8 transmission, regulates the priority of the corresponding subscription of local routing table according to different brackets priority, and the subscription through adjustment is again flooded in network.
Above-mentioned step 7 to step 9 is periodic process, and step 7 Counter is automatic clear after the concurrent carry information mean value of each statistical information mean value is to knot modification.
Below in conjunction with Fig. 2, the application process of the user of content-based covering of the present invention and feedback mechanism being subscribed to the personalized priority routing algorithm that two-region is divided is specifically described.
As shown in Figure 2, it is a relatively simple network topological diagram of the embodiment of the present invention.The network configuration of application the inventive method is by subscriber's (Subscriber, yellow node), publisher's (Publisher, green node) and agent node (Broker, pink colour node), composition.Wherein subscriber has different weight, and composes different priorities value can to the subscription of oneself; From functional point, agent node can be subdivided into boundary proxy node and (one-level, secondary etc.) knot modification, and they have the functions such as the coupling forwarding of generic proxy node simultaneously.
First, spanning tree algorithm generates an acyclic network topological diagram.What Fig. 2 showed is acyclic topology.In this topology, broker1, broker2, broker7, broker9 and broker10 are the boundary proxies of subscriber, and according to factors such as distance, the node degree of depth, broker3, broker8 can be elected to be one-level knot modification through election algorithm, what the former was responsible for broker1, broker2, broker7 gathers adjustment, and what latter was responsible for broker9, broker10 gathers adjustment.Further, in order to illustrate that the present invention designs, broker4 is specified to be secondary knot modification.
Secondly, subscriber's distribution subscription, utilizes flooding to propagate in the entire system, finally also can arrive boundary proxy node belonging to each event person, and this process can leave the record that event reverse path route returns subscriber in the routing table of each broker.Because what system adopted is without ring structure, so message can not repeat to forward in systems in which take unnecessary system resource, simultaneously because system adopts is the routing algorithm of content-based covering, the message of having subscribed to and be capped just can forward again, compare traditional distribution subscription system, the inventive method can effectively utilize valuable broadband and node storage resources.
Then, publisher issues event.Event can be mated with routing table at each agent node, finds next person interested, finally arrives subscriber, the reverse route route of event that Here it is.In this process, boundary proxy node, broker2, broker7, broker9 and broker10 can be responsible for recording total priority of the event that subscriber1, subscriber2, subscriber3, subscriber4 and subscriber5 receive, total queue wait time, total delay, total flow and message number respectively.
Then, periodic feedback mechanism realizes.When the scheduled time reaches, each boundary proxy can be sent to knot modification belonging to it the statistical information mean value of subscriber (divided by message number, except total flow), is broker3 and broker8 respectively.One-level knot modification is after collecting its Subscriber Information be responsible for, and continuing to average is sent to secondary knot modification broker4; Then, carry out the operation such as to compare between two of compartmentalization in this locality simultaneously, determine the high priority of each subscriber and normal priority subscribe to should adjust how many respectively.The comparison adjustment that Broker4 starts to carry out in this locality the overall situation after the feedback information collecting the one-level knot modification that it is responsible for operates---and this is to prevent zonal unjust phenomenon (region is all higher or on the low side).It should be noted that these processes above-mentioned are likely (say more broadly, distribution subscription, issue event, feedback regulation all may carried out simultaneously) that overlap is carried out in time.When broker4 calculates complete, it can return adjustment information (area preference fraction is high, common to be turned down together or heightens) to one-level knot modification.After Broker3 and broker4 receives global adaptation information, the adjustment information in they and region can be merged, and then return to boundary proxy node.And then, boundary proxy node upgrades routing table according to feedback, and carry out subscribing to again issuing for the route of changing, this process is similar to subscription process of transmitting.In order to Consumer's Experience is steady, suggestion is finely tuned at every turn, and after repeatedly periodically adjusting, system is inevitable slowly be tending towards fair.
The user of content-based covering of the present invention and feedback mechanism subscribes to the personalized priority routing algorithm divided two-region, introduce first in distribution subscription system personalized priority route by, and different weight can be set to user and carry out service differentiation, considerably increase the functional of distribution subscription system and flexibility, different user's requests can be met better with limited resource.In addition, the present invention be structured in spanning tree algorithm generate Acyclic Network topology on, also combine the routing algorithm of content-based covering, therefore effectively reduce message in systems in which redundancy send situation.And, subscribe in order to avoid user too " greediness " arranges high priority in personalized subscription procedure, present invention also offers a series of Fairness Guarantee measure, guarantee that personalized priority is subscribed to and fairness depositing.Particularly, according to network size and amount of information size, different knot modification numbers, level feedback arrangement or distributed communication can be selected.Therefore, compared with prior art, the present invention proposes personalized priority first and subscribes to, improve systemic-function, and allow user and subscription to carry out priority (weight and priority are equivalent conception) two-region to divide, have and transmit key message efficiently, greatly reduce redundancy message traffic volume, take into account the advantage of fairness simultaneously.
The above, it is only better embodiment of the present invention, not any pro forma restriction is done to the present invention, any content not departing from technical solution of the present invention, the any simple modification done above embodiment according to technical spirit of the present invention, equivalent variations and modification, all belong to the scope of technical solution of the present invention.
Claims (9)
1. a user individual priority method for routing for content-based covering and feedback mechanism, is characterized in that, comprise the following steps:
Step one: network topology is generated without ring structure according to minimal spanning tree algorithm;
Step 2: according to nodes number, goes out the degree of depth of in-degree and tree for judging basis with node, adopt election algorithm to select several knot modifications, is responsible for the part subscriber in network separately;
Step 3: Subscriber subscriptions's message, and the priority to its setting individual, be specifically divided into high priority, normal priority and low priority;
Step 4: subscribe message is transmitted in middle-agent's network, each agent node stores one and subscribes to routing table, the priority that routing table every all draws based on subscriber sorts, after receiving subscribe message, mate according to routing table, and determine whether subscribe message is updated to routing table or carries out giving up process by merging covering routing algorithm;
Step 5: publisher issues event, event arrives each agent node, mates with subscription routing table wherein, if the match is successful, is routed to interested subscriber from reverse path;
Step 6: the information that the subscriber that each boundary proxy records its connection in one section of predetermined period respectively receives;
Step 7: when reaching the predetermined period time interval, each boundary proxy adds up the information mean value of each subscriber, and information mean value is sent to the knot modification belonging to it;
Step 8: after each knot modification receives all subscriber's message that it is responsible for, adjust according to each mean value, flow and each subscriber weight, adjust the adjusted value of the high scope priority corresponding to each subscriber, ordinary range priority, and the adjusted value not for 0 is returned to boundary proxy belonging to each subscriber;
Step 9: after each boundary proxy receives the message of step 8 transmission, regulates the priority of the corresponding subscription of local routing table according to different brackets priority, and the subscription through adjustment is again flooded in network.
2. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, is characterized in that, the subscription process of transmitting in step 3 adopts flooding to complete.
3. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, it is characterized in that, step 2 also comprises: according to network size cases, classification setting is carried out to knot modification, be specially: one-level knot modification and secondary knot modification are set, wherein, one-level knot modification collects the feedback message that in one piece of region, each subscriber sends, and the feedback message that secondary knot modification collects the transmission of one-level knot modification carries out global fair adjustment.
4. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, it is characterized in that, also comprise between step 2 and step 3: the priority weighting of specifying different subscriber, determine the message transmission quality in a network of the different priorities that a node is subscribed to according to weight.
5. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, is characterized in that, in step 4, the subscription merging covering relation that has meeting different subscriber carries common route at co-route.
6. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, it is characterized in that, step 7 is periodic process to step 9, each boundary proxy automatic clear after the concurrent carry information mean value of each statistical information mean value is to knot modification in step 7.
7. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, it is characterized in that, the event that in step 5, publisher issues does not have priority, after it arrives boundary proxy, obtain initial priority, and priority upgrades according to the subscription priority of subscribing to down hop in routing table on each intermediate node.
8. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, it is characterized in that, the information described in step 6 specifically comprises: total priority, total queue wait time, total delay, total flow and message number.
9. the user individual priority method for routing of content-based covering as claimed in claim 1 and feedback mechanism, it is characterized in that, in step 7, adjustment is carried out to the priority limit of each subscriber and follow following principle: each priority is subscribed to and cannot be demoted or bypass the immediate leadership to other priority limits.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210226518.8A CN102833151B (en) | 2012-07-02 | 2012-07-02 | User individuation priority routing algorithm based on content coverage and feedback mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210226518.8A CN102833151B (en) | 2012-07-02 | 2012-07-02 | User individuation priority routing algorithm based on content coverage and feedback mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102833151A CN102833151A (en) | 2012-12-19 |
| CN102833151B true CN102833151B (en) | 2015-07-08 |
Family
ID=47336124
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210226518.8A Active CN102833151B (en) | 2012-07-02 | 2012-07-02 | User individuation priority routing algorithm based on content coverage and feedback mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102833151B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US12034570B2 (en) | 2022-03-14 | 2024-07-09 | T-Mobile Usa, Inc. | Multi-element routing system for mobile communications |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281242B (en) * | 2013-06-19 | 2016-04-13 | 迈普通信技术股份有限公司 | protocol stack routing table maintenance method and device |
| CN103685013B (en) * | 2013-11-29 | 2017-02-08 | 中国科学院计算技术研究所 | Mixed routing method and device based on contents |
| US9424083B2 (en) * | 2014-03-14 | 2016-08-23 | Google Inc. | Managing metadata for a distributed processing system with manager agents and worker agents |
| CN105991463B (en) * | 2015-02-13 | 2020-12-25 | 创新先进技术有限公司 | Method, message main node, token server and system for realizing flow control |
| WO2017214813A1 (en) * | 2016-06-13 | 2017-12-21 | 深圳天珑无线科技有限公司 | Distributed network message returning method, node and system |
| CN107370678B (en) * | 2017-06-19 | 2020-04-14 | 深圳市盛路物联通讯技术有限公司 | Method and system for updating routing forwarding table applied to Internet of things |
| CN108156086B (en) * | 2017-12-19 | 2022-04-22 | 北京奇艺世纪科技有限公司 | Policy rule issuing method and device |
| CN111698024B (en) * | 2020-06-22 | 2022-05-06 | 泰州市柯普尼通讯设备有限公司 | Ship satellite vsat video bandwidth allocation information transmission system and method |
| CN114124704B (en) * | 2021-11-19 | 2024-01-23 | 北京天融信网络安全技术有限公司 | Route optimization method, device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0731583A1 (en) * | 1995-03-08 | 1996-09-11 | International Business Machines Corporation | Method and system for routing messages in a multi-node data communication network |
| CN1625119A (en) * | 2004-12-09 | 2005-06-08 | 中国科学院软件研究所 | Routing method of pub/sub system on structural P2P network |
| CN1815989A (en) * | 2004-10-26 | 2006-08-09 | 国际商业机器公司 | Method for efficient construction of network overlays through interconnection topology embedding |
| CN101635895A (en) * | 2009-07-31 | 2010-01-27 | 青岛海信移动通信技术股份有限公司 | Website content subscribing system, website content subscribing method, mobile communication terminal and server |
-
2012
- 2012-07-02 CN CN201210226518.8A patent/CN102833151B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0731583A1 (en) * | 1995-03-08 | 1996-09-11 | International Business Machines Corporation | Method and system for routing messages in a multi-node data communication network |
| CN1815989A (en) * | 2004-10-26 | 2006-08-09 | 国际商业机器公司 | Method for efficient construction of network overlays through interconnection topology embedding |
| CN1625119A (en) * | 2004-12-09 | 2005-06-08 | 中国科学院软件研究所 | Routing method of pub/sub system on structural P2P network |
| CN101635895A (en) * | 2009-07-31 | 2010-01-27 | 青岛海信移动通信技术股份有限公司 | Website content subscribing system, website content subscribing method, mobile communication terminal and server |
Non-Patent Citations (5)
| Title |
|---|
| 内容发布订阅服务网络中的路由策略;金源等;《计算机工程与应用》;20061230(第12期);第171-174页 * |
| 基于DDS的发布/订阅中间件设计;曹万华等;《计算机工程》;20070930;第33卷(第18期);第78-80页 * |
| 基于内容的发布何阅模型中高效的匹配算法;张彩云;《河北师范大学学报》;20090730;第33卷(第4期);第452-第455页 * |
| 应用P2P网络实现基于内容的发布订阅系统;薛涛等;《微电子学与计算机》;20071230;第24卷(第9期);第89-第91页 * |
| 薛涛.移动自组网中基于内容的发布/订阅路由协议.《计算机工程》.2009,第35卷(第6期),第130-第144页. * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US12034570B2 (en) | 2022-03-14 | 2024-07-09 | T-Mobile Usa, Inc. | Multi-element routing system for mobile communications |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102833151A (en) | 2012-12-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102833151B (en) | User individuation priority routing algorithm based on content coverage and feedback mechanism | |
| US8763062B2 (en) | Method and apparatus for controlling information available from content distribution points | |
| EP2761503B1 (en) | Caching in mobile networks | |
| CN101127721B (en) | Bandwidth control method and bandwidth control device | |
| US20120275304A1 (en) | Hierarchical profiled scheduling and shaping | |
| CN106533939B (en) | A kind of wide dynamic adjusting method of software definition soft exchange convergence mesh belt and device | |
| CN106453111A (en) | Traffic management method based on aggregation link and traffic management device thereof | |
| CN105340237A (en) | Content distribution system and method | |
| CN105340216A (en) | Content distribution system and method | |
| CN101001203A (en) | Route selection method and device | |
| CN111082978A (en) | SDN-oriented utility bandwidth allocation method | |
| CN101980505A (en) | 3Tnet-based video-on-demand load balancing method | |
| CN110572320A (en) | Named data single-source multi-path routing method, system and medium based on NDN | |
| CN100466593C (en) | Method of implementing integrated queue scheduling for supporting multi service | |
| CN102404133B (en) | Method and device for internet protocol (IP) network data interaction | |
| CN110535770B (en) | QoS-aware-based intelligent routing method for video stream in SDN environment | |
| CN105359537A (en) | Content distribution system and method | |
| CN101340423B (en) | Multi-cluster job scheduling method based on element scheduling ring | |
| CN106941695B (en) | It is a kind of in opportunistic network to be based on the matched data distributing method of interest | |
| CN101836196A (en) | Methods and systems for providing efficient provisioning of data flows | |
| CA3167618A1 (en) | System and method for prioritizing network traffic in a distributed environment | |
| CN103473630A (en) | Service resource management method in information grid system | |
| CN101175064B (en) | Forwarding periodic line scheduling method based on service quality | |
| CN114490018A (en) | Service scheduling algorithm based on resource feature matching | |
| Alweimine et al. | Implementing beneficial prioritization of traffic flow in complex networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200116 Address after: Room 1709, Building No. 8, Binjiang West Road, Jiangyin City, Wuxi City, Jiangsu Province Patentee after: Jiangyin Daily Information Technology Co., Ltd. Address before: 200240 Dongchuan Road, Shanghai, No. 800, No. Patentee before: Shanghai Jiaotong University |