CN101360042B - Operable P2P network application routing system and route implementing method thereof - Google Patents
Operable P2P network application routing system and route implementing method thereof Download PDFInfo
- Publication number
- CN101360042B CN101360042B CN2007101383843A CN200710138384A CN101360042B CN 101360042 B CN101360042 B CN 101360042B CN 2007101383843 A CN2007101383843 A CN 2007101383843A CN 200710138384 A CN200710138384 A CN 200710138384A CN 101360042 B CN101360042 B CN 101360042B
- Authority
- CN
- China
- Prior art keywords
- node
- territory
- user terminal
- resource manager
- route
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 230000006870 function Effects 0.000 claims abstract description 7
- 230000005540 biological transmission Effects 0.000 claims abstract description 3
- 238000007726 management method Methods 0.000 claims description 7
- 230000004044 response Effects 0.000 claims description 7
- 230000002452 interceptive effect Effects 0.000 claims description 4
- 238000012216 screening Methods 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 claims 1
- 230000006855 networking Effects 0.000 abstract description 2
- 239000012634 fragment Substances 0.000 description 14
- 230000007246 mechanism Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000008859 change Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000009792 diffusion process Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000009472 formulation Methods 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000013517 stratification Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention relates to a novel application routing system used for P2P digital media services as well as a routing implementation method thereof. The system comprises a Level III route selection structure, namely, the system includes an explorer (RM), an appointed explorer (DM) and common nodes (NN), nodes of different levels are responsible for different routing management, computation and route selection functions. The route information acquired by nodes at a receiving end of P2P is screened to make a terminal acquire an application route with optimal performance, and avoid the selection of goal objects with poor processing performance and network connectivity state, thereby ensuring the speed and efficiency of content transmission, improving the quality of P2P services and meeting the requirements of large-scale networking for operators.
Description
Technical field
The present invention relates to the new application route system and the route implementing method thereof of a kind of P2P of being used for Digital Media business.
Background technology
In the P2P network, before terminal and content source or other user terminals connect, must obtain relevant application routing iinformation.At a certain contents fragment, use address and port numbers that routing iinformation comprises peer node (Peer) at least.
Terminal is the main body of content exchange and Communications service, and efficient, reasonability and the accuracy of application route will be related to the service quality of the stable operation and the application of P2P network, therefore uses the key that routing mechanism is the P2P network design.Modes such as many employings of application routing mechanism center picked at random of existing P2P network, distributed random diffusion.Because terminal is numerous in the P2P network, the service ability difference of different user terminals node is also very big, the state variation of node is than very fast, therefore the picked at random mode makes terminal obtain that handling property is low, the application route of network-in-dialing state difference easily, and then influence the service quality of final service, be difficult to satisfy carrier network high stability, professional high-quality networking demand.
Summary of the invention
In order to improve the service quality of P2P network, the present invention proposes a kind of P2P and use route system and route implementing method thereof, wherein screen by the routing iinformation that the P2P receiving terminal node is obtained, make terminal obtain the application route of performance the best, avoid selecting that those handling properties are low, the destination object of network-in-dialing state difference, thereby guarantee the speed and the efficient of content delivery, improve the service quality of P2P business, satisfied the demand of operator's large-scale network-estabilishing.
For realizing above-mentioned target, P2P of the present invention uses route system and has comprised that tertiary road is by routing structure, promptly this system comprises explorer (RM), allocated resource manager (DM) and ordinary node (NN), is responsible for different routing managements, calculating and routing function by the node of different stage.
Explorer (RM) is a first order Router Management Center, is responsible for the routing statistics information in each territory of storage; Receive the route requests of DM, and return overseas routing inquiry information; And realization GSLB.
Allocated resource manager (DR) is autonomous territory, a second level Router Management Center, is responsible for the storage routing iinformation relevant with this territory, reports the routing statistics information in this territory to RM; Feature according to node is carried out Preliminary screening to resource data, and regularly pushes route to node; The routing information request of response and Acknowledge interior nodes, the overseas route that the representative of consumer terminal node please be looked for novelty to RM; And realization territory internal burden equilibrium.
Ordinary node (NN) is meant domestic consumer's terminal node that rank is minimum, its in route is handled with allocated resource manager (DR) interactive refreshing state information, and finish final route according to the routing iinformation that allocated resource manager (DR) pushes and calculate.
The present invention also provides at above-mentioned P2P and has used the method that realizes route in the route system, and this method comprises according to the disposal ability of different service types and node selects in the following mode one or more to make user's terminal node obtain routing iinformation: by explorer/allocated resource manager (RM/DR) active push routing iinformation, the autonomous request route information of user terminal node and exchanging routing information between reciprocity terminal node (peer).
Under first kind of route implementing mode, DR is according to the COS of user terminal and the needs of Network Load Balance, stage by stage, periodically push routing iinformation to user terminal.Wherein DR is the region priority principle to the basic principle of terminal selection and propelling movement route, promptly according to the residing region of node, preferentially be chosen between the content node of same region service is provided,, optimize the network traffics and the flow direction to improve the response speed and the service quality of content.
Because dissimilar business demands has nothing in common with each other, at dissimilar business, DR will adopt different routes to push strategy, comprise:
1. at non-real-time service, as content download type business, it is to time delay and insensitive, and contents fragment to obtain sequence independence critical, therefore when route pushes, mainly adopt following principle:
1) terminal fragment difference principle, promptly to the fragment route of intra domain user terminal propelling movement different content, the different fragments of using different user to download is as far as possible shared to promote the content between the intra domain user.
2) rare fragment priority principle, be the existing contents fragment of each terminal in the DR statistics territory, and impel the rare fragment that lacks in this territory preferentially to download, keep contents fragment as much as possible in the territory thereby make, can realize between each terminal in the territory that content shares, reduce the flow between cross-domain.
2. at real time business, as demand (telecommunication) service etc., accurately, in time pushing of fragment is the factor of overriding concern, so DR mainly adopts preestimating method when route pushes, and its principle is as follows:
Every some cycles, terminal will be calculated in following a period of time the fragment of (for example in 5 minutes) required broadcast according to spatial cache and the playing progress rate of self, regularly initiates request to DR then, and DR will push corresponding routing update to terminal.Consider the dynamic change of MTN terminal, for same contents fragment, DR will push many (for example 3-4 bar) routes for user terminal, realizing backup, thereby guarantee the service quality of terminal.
Under second kind of route implementing mode, consider frequently withdrawing from and adding of MTN terminal, DR is that the routing iinformation that terminal pushes can not ensure that the user obtains the contents fragment of real time business exactly, for this reason, when user terminal is found self to lack some contents fragment route, can also initiatively initiate route requests to affiliated DR.
In this case, DR follows the region priority principle when selecting route for terminal, and has adopted two session information searching algorithms:
In the phase I, DR will check the local route requests that whether satisfies terminal, if can meet consumers' demand in this locality, then directly return local search results; If can not meet consumers' demand in this locality, then user's request is transmitted to RM.
In second stage, RM inquires about the statistical information storehouse in each territory of its storage, to search the territory at the content segments place that the user asked.Comprise the required content segments of user if find the neither one territory, return final query result to the user then to DR returned content source-routed information, and by DR.
If RM retrieves some territory and stores this content segments, then the DR to the territory, place initiates routing inquiry request, after obtaining relevant routing iinformation, returns this routing iinformation to DR, and returns final query result by DR to the user.
When transmitting terminal is subjected to own resource restriction and can't satisfy the receiving terminal request time, can recommends corresponding routing iinformation to receiving terminal according to connection and the routing iinformation of self.
Under the third route implementing mode, obtain the approach of routing iinformation for the terminal that further extends one's service, go back content segments information and the routing iinformation that real-time exchange is stored separately between the terminal (peer), thereby make receiving terminal peer can according to self demand and system resource initiatively to opposite end peer request content segment, the existing connection transmit more segment to maximally utilise, and reduce switching time.
User terminal will be each routing iinformation calculating priority level according to predetermined rule after having obtained routing iinformation.When the transmission content, preferentially select the higher route of priority for use according to the priority that is calculated.Terminal setting influences the shared weight of each influencing factor of priority, and calculates the priority (Priority) of each service node according to following formula:
Wherein b is an influencing factor, the weighted factor of a for adjusting according to system's operating experience, and n is the number of influencing factor.
The influencing factor that will consider when calculating priority level can comprise:
(1) node service ability: the connection speed of node, service bandwidth and existing load state are the key factors of decision opposite end service ability.When connecting first, node with the service ability information of opposite end self circular as basis for estimation.After connecting, the MTN terminal will adopt the 10k message detection algorithm of light weight, be used to measure the parameter such as bandwidth, time delay of opposite end, and dynamic evaluation node service ability preferentially selects 4 the strongest nodes of service ability as connecting object.
(2) node credit rating: the selection to node also needs to consider its stability factor in the past, so that in heterogeneous network system, select stable performance, reliable, the shared strong client of wish that service is provided, reduce the interruption that connects and switch, improve overall quality of service, optimize response time and efficient.
(3) nodal cache Cache: preferential chosen content also provides service at the client node of content caching, and promptly preferential selection has watched that just the client node of this programme content dispatches, and to improve service response speed, reduces client hard disk operation number of times.
(4) node type: the priority of scheduling is: the priority of other client node is the highest, the priority of content caching server secondly, the priority of original contents server is minimum.Can provide system's retractility like this, the system service ability be increased with the user expand, the reservation server resource provides service for non-popular program simultaneously.
(5) route acquisition source: compare with the route of obtaining from the peer end, Router Management Center DR and RM have taken into account the load balancing of the whole network in the process that pushes route, and for this reason, this class route is set to have higher priority, to reduce the uncontrollability of flow.
Terminal with selecting the high node of priority to download node as target in order, connects with it after finishing route calculating, to realize sharing of content.
According to the present invention, the stronger node of some service ability becomes the focus of content requests and load is overweight in the system, and P2P uses route system and adopted the two-stage load-balancing mechanism, i.e. GSLB and partial load equilibrium.
P2P uses the GSLB of route system and is mainly realized by RM, comprises following function: when each territory pushes overseas routing iinformation, preferentially select the node service of the lighter node of load for other territories according to the node service statistical information in each territory; Nearer content source memory node is selected for each territory in memory location according to content source, pushes relevant routing iinformation to DR; And under the situation of content download services, impel the not rare segment of the preferential download in more multiple terminals of same area, and share with the content between the further promotion user, reduce the service pressure of content source.
The balanced main DR by each territory of partial load realizes.When the node in the territory pushes routing iinformation, for same content segments, DR will preferentially select internal burden lighter node in territory to be other node services according to the load information of territory interior nodes circular.
The present invention has realized the application routing framework system of high expansion.By adopting the routing architecture of stratification, introduce the two-stage load-balancing mechanism simultaneously, not only can adjust automatically and the expansion center control platform according to the dynamic change of node, but also resource management, route calculating, content delivery pressure are distributed in each control, management and terminal node in the system effectively, solved the scaling concern of platform preferably.
Simultaneously, the present invention has improved quality of real-time service.By introducing concentrated resource management and content route controlling platform, for providing, the transfer of data of media stream in real time business requires more strict resource management and controlled function, and higher content route search, the computing function of efficient, thereby help to provide the service quality of real time business.
In addition, the present invention has promoted the localization of flow.By the modulation and the formulation of routing policy, make member's shared resource in the territory as much as possible, reduce the cross-region flow, thereby alleviated the pressure of backbone network.
Description of drawings
Below with reference to accompanying drawing and can understand the present invention better to the specific descriptions of embodiment.As shown in the figure:
Fig. 1 shows tertiary road according to the present invention by the routing system.
Fig. 2 shows the process of user terminal to DR and RM request route, and this process is a recursive procedure.
Embodiment
As shown in Figure 1, P2P of the present invention uses route system and has adopted tertiary road by routing structure, promptly this system comprises explorer RM, allocated resource manager DM and ordinary node NN, is responsible for different routing managements, calculating and routing function by the node of different stage.
Wherein explorer RM is responsible for the routing statistics information in each territory of storage as first order Router Management Center; Receive the route requests of allocated resource manager, and return the overseas routing inquiry information of some; And GSLB.
Allocated resource manager DR is responsible for the storage routing iinformation relevant with this territory as autonomous territory, second level Router Management Center, reports the routing statistics information in this territory to RM; Feature according to node is carried out Preliminary screening to resource data, and regularly pushes route to node; The route requests of response and Acknowledge interior nodes, the overseas route that representative of consumer please be looked for novelty to RM; And territory internal burden equilibrium.
Ordinary node (NN) is meant user terminal, its in route is handled with DR interactive refreshing state information, and finish final route according to the routing iinformation that DR pushes and calculate.
In system of the present invention, can independently ask between route and peer node (peer) these three kinds of modes of exchanging routing information to provide routing iinformation by Router Management Center (DR/RM) active push route, terminal to terminal.Can take different routing iinformations to transmit and computational methods according to the difference of type of service, and when routing, also consider the disposal ability of each node.
Fig. 2 shows the process of user terminal to DR and RM request route.At first, the allocated resource manager DR1 request route of user terminal in this territory, DR1 inquires about the routing iinformation that exists in this territory.If have this content segments in this territory, then return corresponding routing iinformation.
When the routing iinformation of this territory stored can't satisfy the route requests of user terminal, DR1 will initiate route requests to explorer RM.
RM will inquire about the content resource statistical information in own each territory of having jurisdiction over, and select corresponding D R2 to initiate route requests.The routing iinformation in requested DR2 inquiry self territory, place, the route requests of response RM returns to RM with Query Result.
Subsequently, RM returns to DR1 with Query Result, and DR1 returns to Query Result and sends the requesting users terminal.
Claims (14)
1. a P2P uses route system, it is characterized in that described system comprises tertiary road by routing structure, i.e. explorer (RM), allocated resource manager (DM) and ordinary node (NN), be responsible for different routing managements, calculating and routing function by the node of different stage, wherein
Explorer (RM) is a first order Router Management Center, is responsible for the routing statistics information in each territory of storage; Receive the route requests of allocated resource manager (DM), and return overseas routing inquiry information; And realization GSLB;
Allocated resource manager (DR) is autonomous territory, a second level Router Management Center, is responsible for the storage routing iinformation relevant with this territory, reports the routing statistics information in this territory to explorer (RM); Feature according to the user terminal node is carried out Preliminary screening to resource data, and regularly pushes routing iinformation to the user terminal node; The route requests of user terminal node in response and the Acknowledge, the overseas route that the representative of consumer terminal node please be looked for novelty to explorer (RM); And realization territory internal burden equilibrium;
Ordinary node (NN) is meant domestic consumer's terminal node that rank is minimum, its in route is handled with allocated resource manager (DR) interactive refreshing state information, and finish final route according to the routing iinformation that allocated resource manager (DR) pushes and calculate.
2. use the method that realizes route in the route system at the described P2P of claim 1 for one kind, it is characterized in that, described method comprises according to the disposal ability of different service types and node selects in the following mode one or more to make user's terminal node obtain routing iinformation: by explorer/allocated resource manager (RM/DR) active push routing iinformation, the autonomous request route information of user terminal node, and between reciprocity terminal node exchanging routing information.
3. method as claimed in claim 2, it is characterized in that, described method comprises: when by allocated resource manager (DR) according to the COS of user terminal node and the needs of Network Load Balance, stage by stage, periodically when the user terminal node pushes routing iinformation, according to the residing region of user terminal node, preferentially be chosen between the content node of same region service is provided.
4. method as claimed in claim 3, it is characterized in that, described method comprises: at non-real-time service, when the user terminal node of allocated resource manager (DR) in this territory pushes routing iinformation, make the different user terminals node download to different content segments, to promote the resource-sharing between the intra domain user.
5. method as claimed in claim 3, it is characterized in that, described method comprises: at non-real-time service, when the user terminal node of allocated resource manager (DR) in this territory pushes routing iinformation, allocated resource manager (DR) is added up the existing content segments of each user terminal node in this territory, the rare segment that lacks in this territory is preferentially downloaded, kept segment content as much as possible in this territory thereby make.
6. method as claimed in claim 3, it is characterized in that, described method comprises: at real time business, every some cycles, the user terminal node will be estimated required broadcast segment in following a period of time according to self spatial cache and playing progress rate, and regularly initiate request to allocated resource manager (DR), allocated resource manager (DR) will push corresponding routing update to this user terminal node.
7. method as claimed in claim 6 is characterized in that, described method comprises: for same content segments, allocated resource manager (DR) pushes many routing iinformations for the user terminal node, to realize backup.
8. method as claimed in claim 2 is characterized in that, described method comprises: when the user terminal node is found self to lack some content, initiatively initiate route requests to affiliated allocated resource manager (DR1);
Receive the route requests of user terminal node initiation when affiliated allocated resource manager (DR1) after, check at first whether this territory can satisfy the route requests of this user terminal node, if this route requests is satisfied in this territory, then directly return local search results to this user terminal node; If this route requests can not be satisfied in this territory, then this route requests is transmitted to explorer (RM);
Subsequently, explorer (RM) is inquired about the statistical information storehouse in each territory of himself storing, to search the territory at the content segments place that the user terminal node asked, if the neither one territory comprises this content segments, return final Query Result then to the routing iinformation in allocated resource manager (DR1) the returned content source of filing a request, and by the allocated resource manager (DR1) of filing a request to the user terminal node;
If explorer (RM) retrieves some territory and stores this content segments, then initiate routing inquiry request to the allocated resource manager (DR2) in territory, place, after obtaining relevant routing iinformation, this routing iinformation is returned to the allocated resource manager (DR1) of filing a request, and return final Query Result to the user terminal node by the allocated resource manager (DR1) that this is filed a request.
9. method as claimed in claim 8 is characterized in that, described method comprises: when transmitting terminal is subjected to own resource restriction and can't satisfy the receiving terminal request time, recommends corresponding routing iinformation according to self connection and routing iinformation to receiving terminal.
10. method as claimed in claim 2, it is characterized in that, described method comprises: real-time, interactive is stored separately between each user terminal node content segments and routing iinformation, thereby make receiving terminal user terminal node according to self demand and system resource initiatively to peer node request content segment, the existing connection transmit more segment to maximally utilise, and reduce switching time.
11. as each described method in the claim 2 to 10, it is characterized in that described method comprises: the user terminal node calculates the priority of each service node according to following formula after obtaining routing iinformation:
Wherein Priority represents priority, and b is an influencing factor, the weighted factor of a for adjusting according to system's operating experience, and n is the number of influencing factor;
When the transmission content, select the higher node of priority to download node as target according to the priority that is calculated.
12. method as claimed in claim 11 is characterized in that, described method comprises: be used for determining that the described influencing factor of priority is node service ability, node credit rating, nodal cache, node type and route acquisition source.
13. method as claimed in claim 2, it is characterized in that, described method comprises: realize GSLB by explorer (RM), wherein explorer (RM) is preferentially selected the node service of the lighter node of load for other territories when each territory pushes overseas routing iinformation according to the node service statistical information in each territory; Nearer content source memory node is selected for each territory in memory location according to content source, pushes relevant routing iinformation to allocated resource manager (DR); And under the situation of content download services, impel the not rare segment of the preferential download of more users terminal node of same area.
14. method as claimed in claim 2, it is characterized in that, described method comprises: the allocated resource manager (DR) by each territory is realized the partial load equilibrium, wherein when the node in the territory pushes routing iinformation, for same content segments, the load information that allocated resource manager (DR) is circulated a notice of according to the territory interior nodes preferentially selects internal burden lighter node in territory to be other node services.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101383843A CN101360042B (en) | 2007-08-01 | 2007-08-01 | Operable P2P network application routing system and route implementing method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101383843A CN101360042B (en) | 2007-08-01 | 2007-08-01 | Operable P2P network application routing system and route implementing method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101360042A CN101360042A (en) | 2009-02-04 |
| CN101360042B true CN101360042B (en) | 2010-12-08 |
Family
ID=40332385
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101383843A Active CN101360042B (en) | 2007-08-01 | 2007-08-01 | Operable P2P network application routing system and route implementing method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101360042B (en) |
Families Citing this family (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101500022B (en) * | 2009-03-09 | 2013-03-20 | 北大方正集团有限公司 | Data access resource allocation method, system and equipment therefor |
| CN101860559B (en) | 2009-04-08 | 2014-11-05 | 中兴通讯股份有限公司 | Peer-to-peer network and resource information backup operation method based on same |
| CN101572605B (en) * | 2009-06-01 | 2012-07-11 | 上海山牡泽牡网络科技有限公司 | Architecture based on P2P and P4P platforms and processing method thereof |
| CN102143290B (en) * | 2010-02-03 | 2014-08-20 | 中兴通讯股份有限公司 | Method and system for selecting transit node of voice over internet protocol service in peer-to-peer network |
| CN102148871B (en) * | 2011-03-18 | 2013-07-10 | 浪潮(北京)电子信息产业有限公司 | Storage resource scheduling method and device |
| CN102857536B (en) * | 2011-07-01 | 2017-11-24 | 中兴通讯股份有限公司 | The method and system of data backup and migration are realized in peer-to-peer network |
| CN102970689B (en) * | 2011-08-31 | 2017-10-24 | 索尼公司 | wireless network coding management method and system |
| CN104980348A (en) | 2014-04-04 | 2015-10-14 | 中兴通讯股份有限公司 | Business chain routing method, business chain routing system and device in system |
| CN104507066A (en) * | 2014-12-26 | 2015-04-08 | 电子科技大学 | Node discovery method for P2P (peer to peer) systems |
| CN104506537B (en) * | 2014-12-26 | 2019-03-29 | 电子科技大学 | P2P system node selection method |
| CN106210776A (en) * | 2015-05-07 | 2016-12-07 | 南宁富桂精密工业有限公司 | Control equipment and the method controlling video request program thereof |
| CN106413131B (en) * | 2016-10-21 | 2019-07-26 | 国网黑龙江省电力有限公司信息通信公司 | Point-to-point communication method for electric vehicles |
| CN107295103B (en) * | 2017-07-26 | 2020-05-26 | 南京邮电大学 | Node Management Method Based on Centralized P2P System |
| CN111385315B (en) * | 2018-12-27 | 2022-12-16 | 阿里巴巴集团控股有限公司 | Point-to-point resource downloading method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1780298A (en) * | 2004-11-23 | 2006-05-31 | 微软公司 | System and method for a distributed server for peer-to-peer networks |
| CN1852164A (en) * | 2006-04-25 | 2006-10-25 | 清华大学 | P2P network management method based on federal model |
-
2007
- 2007-08-01 CN CN2007101383843A patent/CN101360042B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1780298A (en) * | 2004-11-23 | 2006-05-31 | 微软公司 | System and method for a distributed server for peer-to-peer networks |
| CN1852164A (en) * | 2006-04-25 | 2006-10-25 | 清华大学 | P2P network management method based on federal model |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101360042A (en) | 2009-02-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101360042B (en) | Operable P2P network application routing system and route implementing method thereof | |
| EP1911210B1 (en) | Heavy load packet-switched routing | |
| Jiang et al. | Orchestrating massively distributed CDNs | |
| JP4974888B2 (en) | Distributed request routing | |
| US7415527B2 (en) | System and method for piecewise streaming of video using a dedicated overlay network | |
| Pham et al. | Increasing the network performance using multi-path routing mechanism with load balance | |
| US20120317293A1 (en) | Peer selection method, network device, and system | |
| KR20100057828A (en) | A unified peer-to-peer and cache system for content services in wireless mesh networks | |
| Liu et al. | Prediction-based mobile data offloading in mobile cloud computing | |
| US8780730B2 (en) | Load-balancing gateways | |
| Mukerjee et al. | The impact of brokers on the future of content delivery | |
| US20140143427A1 (en) | Providing Resources in a Cloud | |
| WO2018068635A1 (en) | Scheduling method, server, first peer node and computer-readable storage medium | |
| CN101854287B (en) | Method and device for optimizing P2P traffic | |
| Khan et al. | Nice: Network-oriented information-centric centrality for efficiency in cache management | |
| US20140188974A1 (en) | System and method for orchestrating massively distributed content delivery networks | |
| Diab et al. | Joint content distribution and traffic engineering of adaptive videos in telco-cdns | |
| Meng et al. | Elastic caching solutions for content dissemination services of ip-based internet technologies prospective | |
| JP4146373B2 (en) | Service selection method and service selection system in dynamic network | |
| Thinh et al. | An efficient qoe-aware http adaptive streaming over software defined networking | |
| JP2011146788A (en) | Network service providing system | |
| Dubin et al. | Hybrid clustered peer-assisted DASH-SVC system | |
| US20130138732A1 (en) | Access to a network of nodes distributed over a communication architecture with the aid of a topology server with multicriteria selection | |
| JP2016046785A (en) | Cache server selection device, distributed cache system, and cache server selection method | |
| Gupta et al. | Service differentiation in peer-to-peer networks utilizing reputations |
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 |