Distributed Server Network for Providing Triple and Play Services to End Users

• US 20100235432A1
• Filed: 08/21/2006
• Published: 09/16/2010
• Est. Priority Date: 08/21/2006
• Status: Abandoned Application

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Trojer, Elmar
• Application Number:
  US12/438,450
• Publication Number:
  US 20100235432A1
• Time in Patent Office: Days
• US Class Current: 709/203
• CPC Class Codes: H04L 12/2861 Point-to-multipoint connection from the data network to the subscribers
• CPC Class Codes: H04L 65/1101 Session protocols
• CPC Class Codes: H04L 65/612 for unicast
• CPC Class Codes: H04L 65/80 Responding to QoS
• CPC Class Codes: H04L 67/06 specially adapted for file transfer, e.g. file transfer protocol [FTP]
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1008 based on parameters of servers, e.g. available memory or workload monitoring of computer activity G06F11/30
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1076 Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments
• CPC Class Codes: H04L 67/1089 Hierarchical topologies
• CPC Class Codes: H04L 67/1091 Interfacing with client-server systems or between P2P systems
• CPC Class Codes: H04L 67/56 Provisioning of proxy services store-and-forward switching systems in data switching networks H04L12/54
• CPC Class Codes: H04L 67/5681 Pre-fetching or pre-delivering data based on network characteristics
• CPC Class Codes: H04L 67/5682 Policies or rules for updating, deleting or replacing the stored data
• CPC Class Codes: H04N 21/21815 comprising local storage units
• CPC Class Codes: H04N 21/222 Secondary servers, e.g. proxy server, cable television Head-end provisioning of proxy services in data packet switching networks H04L67/56
• CPC Class Codes: H04N 21/2225 Local VOD servers
• CPC Class Codes: H04N 21/23106 involving caching operations prefetching while addressing of a memory level in which the access to the desired data or data block requires associative addressing means within memory systems or architectures G06F12/0862; caching at an intermediate stage in a data network H04L67/568
• CPC Class Codes: H04N 21/23113 involving housekeeping operations for stored content, e.g. prioritizing content for deletion because of storage space restrictions storage management, e.g. defragmentation G06F3/0604; snloading stored programs G06F9/445; housekeeping operations in file systems, e.g. deletion policies G06F16/10; buffering arrangements in a network node or in an end terminal in packet networks H04L49/90
• CPC Class Codes: H04N 21/4788 : communicating with other users, e.g. chatting arrangements for providing for computer conferences, e.g. chat rooms, to substation in data switching networks H04L12/1813; distributed application using peer-to-peer [P2P] networks H04L67/104
• CPC Class Codes: H04N 21/6408 : Unicasting
• CPC Class Codes: H04N 21/8456 : by decomposing the content in the time domain, e.g. in time segments
• CPC Class Codes: H04N 7/17318 : Direct or substantially direct transmission and handling of requests
• CPC Class Codes: H04N 7/17354 : in an intermediate station common to a plurality of user terminals

Abstract

A distributed server framework for distributing streamed electronic content to users. The framework includes a central server connected to regional edge servers, which are connected to local groups of access servers closest to the users. A file sharing protocol maintains hit lists indicating the relative popularity of various content. To reduce the traffic load from the central server and regional servers, popular material is stored on the access servers; less popular material is stored on the edge servers; and seldom requested material is stored on the central server. A sliding window and cursor mechanism enable smart distribution of hot material and breaking news among the access servers.

Claims

1-20. -20. (canceled)

21. A distributed server framework for providing triple and play services to end users, using a streaming technique, said framework comprising:

a central server having a central data store for storing large amounts of data material;

a plurality of regional edge servers connected to the central server, the edge servers having a regional data store for temporary storing of fragments of the data material; and

a plurality of local groups of access servers connected to the regional servers, the access servers having an access data store for temporary storage of fragments of the data material;

wherein the access servers of a given group are connected to a given edge server over respective first links, the edge servers are connected to the central server over respective second links, and the access servers within each group are inter-connected over third links;

wherein each access server is connected to a multiplexer/demultiplexer to which equipment of a limited number of end users are connected;

the central server, edge servers and access servers each having client/server file sharing software for communication over the first, second, and third links using an IP-based file sharing protocol, wherein when the software is run on a processor of each server, the servers are caused to;

(a) diffuse file fragments of data material requested by end users from the central server to the edge servers and to the access servers, and

(b) store diffused file fragments at respective edge servers and access servers for a respective predefined time in accordance with the frequencies by which the stored data material is requested by end users.

22. The distributed server framework as recited in claim 21, wherein:

the central server includes means for maintaining a track list of the identities of the file fragments the central server has diffused to the edge servers and access servers; and

each edge server includes means for maintaining a respective track list of the identities of the fragments diffused to the access servers and hit lists of the number of times an identified fragment has been requested.

23. The distributed server framework as recited in claim 22, wherein:

the access servers temporarily store highly popular file fragments frequently requested by end users, and each access server includes;

(a) means for allotting a first expiration time;

(b) means for deleting a highly popular file fragment when the first expiration time expires and no requests for the highly popular file fragment has been received; and

(c) means for extending the first expiration time for the highly popular file fragment each time the highly popular file fragment is requested;

the regional servers temporarily store less popular file fragments that are less frequently requested by the end users, and each regional server includes;

(a) means for allotting a second expiration time, longer than the first expiration time,

(b) means for deleting a less popular file fragment when the second expiration time expires and no requests for the less popular file fragment has been received; and

(c) means for extending the second expiration time for the less popular file fragment each time the less popular file fragment is requested; and

the central server stores least popular data material seldom requested by the users.

24. The distributed server framework as recited in claim 23, wherein each access server includes a file sharing protocol client for storing in the access store file fragments according to a sliding window and cursor mechanism.

25. The distributed server framework as recited in claim 24, wherein the sliding window and cursor mechanism comprises a window moving in real time and a cursor pointing at a fragment that has the highest fetching priority for being fetched and streamed to the end user by the access server.

26. The distributed server framework as recited in claim 25, wherein each access server also includes:

means for receiving a request for identified data material from an individual end user;

means for retrieving the requested data material from edge servers and other access servers that contain the requested data material; and

means for streaming the requested data material to the end user that made the request.

27. The distributed server framework as recited in claim 26, wherein each access server includes means for retrieving over the third links, file fragments on other access servers provided the other access servers have the requested file fragments within the other access servers'"'"' respective sliding windows.

28. The distributed server framework as recited in claim 27, wherein a first access server includes:

means for snooping requests from other access servers to see if a fragment that the first access server is lacking is within the sliding window on any of the other access servers; and

means responsive to locating the lacking fragment, for fetching the lacking fragment from the access server where the lacking fragment is located.

29. The distributed server framework as recited in claim 28, wherein at least one access server is connected to more than one multiplexer/demultiplexer.

30. The distributed server framework as recited in claim 29, wherein the multiplexer/demultiplexer is connected to a data Virtual Local Area Network (VLAN), a video VLAN, and a voice VLAN for providing data, video and voice services to the end users.

31. The distributed server framework as recited in claim 30, wherein the user equipments access the access servers through a mobile radio network.

32. The distributed server framework as recited in claim 24, wherein the user equipments access the access servers through an Ethernet-based network, and the multiplexer/demultiplexer is an IP-based digital subscriber line access multiplexer (IP-DSLAM).

33. The distributed server framework as recited in claim 24, wherein the file sharing software is a bittorrent protocol modified so that the protocol does not include end user machines in the file sharing protocol and modified so that the protocol includes the sliding window and cursor mechanism.

34. An access server for distributing an individualized stream of data material to user equipments adapted to be connected to the access server through a multiplexer/demultiplexer, the access server comprising:

a file sharing client/server protocol;

stream generation means; and

data storage means;

wherein the file sharing client/server protocol includes;

means for maintaining a hit list for counting the number of times an identified fragment of a data material is requested by the file sharing client/server protocol; and

time out means for deleting an identified fragment if there are no hits on the identified fragment during a predefined time.

35. The access server as recited in claim 34, wherein the file sharing client/server protocol also includes a sliding window and cursor mechanism for fetching and streaming to the user equipments, fragments of a requested data material in sequential order.

36. The access server as recited in claim 34, wherein the access server stores data material that is popular and frequently requested by users, and the first predefined time is less than five days.

37. The access server as recited in claim 34, further comprising duplication means for duplicating fragments at the access server.

38. An edge server located at an edge between an IP-based transport network and an access network, the edge server for distributing data material to access servers in the access network, said edge server comprising:

a file sharing client/server protocol;

stream generation means; and

data storage means;

wherein the file sharing client/server protocol includes;

a tracker comprising a list having as entries, identified fragments of data material and associated with each entry an address to an access server on which the identified fragment is stored;

a hit list for counting the number of times an identified fragment of a data material is requested by the file sharing client/server protocol; and

time out means for deleting an identified fragment if there are no hits on the identified fragment during a predefined time.

39. The edge server as recited in claim 38, wherein the edge server stores data material that is less popular and less frequently requested by users than the data material stored on access servers, and the predefined time is approximately 5 days.