최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
DataON 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Edison 바로가기다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
Kafe 바로가기국가/구분 | United States(US) Patent 등록 |
---|---|
국제특허분류(IPC7판) |
|
출원번호 | US-0887053 (2015-10-19) |
등록번호 | US-9992279 (2018-06-05) |
발명자 / 주소 |
|
출원인 / 주소 |
|
인용정보 | 피인용 횟수 : 0 인용 특허 : 365 |
A method, system and computer program product for managed object replication and delivery redirects, directly or indirectly, a client's request for an object that is not available at a best or optimal handling edge server of a network to a parent server that has the requested object. So, where the r
A method, system and computer program product for managed object replication and delivery redirects, directly or indirectly, a client's request for an object that is not available at a best or optimal handling edge server of a network to a parent server that has the requested object. So, where the requested object is not available at the handling edge server, the client's request is redirected directly to the parent server that can provide the requested object to the client or indirectly via one or more parent servers to a parent server that can provide the requested object to the client. The method, system and computer program product further intelligently replicates the object to the edge server if the object is popular enough. Likewise, an object is removed from an edge server when it is no longer popular. All redirection and replication operations are preferably transparent to the end-user and do not degrade the quality of service.
1. In a content delivery network having (CDN) comprising a plurality of servers, a computer-implemented method for handling replication of objects on the plurality of servers, the method comprising, creating a linked list of size (N) for a first object, wherein size (N) represents a total number of
1. In a content delivery network having (CDN) comprising a plurality of servers, a computer-implemented method for handling replication of objects on the plurality of servers, the method comprising, creating a linked list of size (N) for a first object, wherein size (N) represents a total number of time sub-intervals each having an equal duration in time;initializing a dynamic measure of popularity for the first object;initializing the linked list for the first object, thereby commencing count of the first time sub-interval,at the conclusion of the first time sub-interval, incrementing the dynamic measure of popularity by a number of client requests for the first object made during the first time sub-interval;at the conclusion of each subsequent time sub-interval, incrementing the dynamic measure of popularity by a number of client requests for the first object made during each subsequent time sub-interval; andreplicating at least some of the first object on at least a first server when the dynamic measure of popularity of the first object exceeds a dynamic replication threshold based at least in part on a measure of capacity associated with the first server. 2. The method of claim 1, wherein the first object is segmented in to chunks, including initial chunks and remaining chunks, and wherein the step of replicating replicates only initial chunks of the first object. 3. The method of claim 2, wherein the remaining chunks of the first object are selectively replicated based at least in part on how many of the initial chunks are served to a client. 4. The method of claim 1, wherein the measure of capacity associated with the first server comprises a measure of storage available on the first server.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.