System and method for data stream fragmentation with scalability

1. A method comprising:

receiving a content fragment request;

determining, based on the content fragment request, an approximate time code;

determining, based on the approximate time code, a content fragment comprising a time code closest to the approximate time code, wherein the content fragment comprises a universally unique identifier (UUID) that identifies a name of a next content fragment following the content fragment and wherein the content fragment further comprises a quality level of the next content fragment; and

sending, to a distribution network, the content fragment.

2. The method of claim 1 , wherein the time code is associated with a beginning of the content fragment.

3. The method of claim 1 , wherein the approximate time code comprises an approximation of a time code associated with a desired content fragment.

4. The method of claim 1 , wherein the content fragment comprises an identifier of a next in time content fragment.

5. The method of claim 1 , wherein the content fragment comprises a horizon window indicating one or more next in time content fragments and the quality level for each next in time content fragment of the one or more next in time content fragments.

6. A method comprising:

receiving, from a first computing device, content;

causing output of the content;

determining an interruption in receiving the content;

sending, to a second computing device based on the interruption, a content fragment request comprising an approximate time code, wherein the content fragment request causes a determination, based on the approximate time code, of a content fragment comprising a time code that is closest to the approximate time code, wherein the content fragment comprises a universally unique identifier (UUID) that identifies a name of a next content fragment following the content fragment and wherein the content fragment further comprises a quality level of the next content fragment; and

receiving, from the second computing device, the content fragment.

7. The method of claim 6 , wherein the time code is associated with a beginning of the content fragment.

8. The method of claim 6 , wherein the output of the content is continuous during the interruption.

9. The method of claim 6 , wherein the approximate time code comprises an approximation of a time code associated with a desired content fragment.

10. The method of claim 6 , wherein the content fragment comprises a horizon window indicating one or more next in time content fragments and the quality level for each next in time content fragment of the one or more next in time content fragments.

11. An apparatus comprising:

one or more processors; and

a memory storing processor-executable instructions that, when executed by the one or more processors, cause the apparatus to:

receive a content fragment request;

determine, based on the content fragment request, an approximate time code;

determine, based on the approximate time code, a content fragment comprising a time code closest to the approximate time code, wherein the content fragment comprises a universally unique identifier (UUID) that identifies a name of a next content fragment following the content fragment and wherein the content fragment further comprises a quality level of the next content fragment; and

send, to a distribution network, the content fragment.

12. The apparatus of claim 11 , wherein the time code is associated with a beginning of the content fragment.

13. The apparatus of claim 11 , wherein the approximate time code comprises an approximation of a time code associated with a desired content fragment.

14. The apparatus of claim 11 , wherein the content fragment comprises an identifier of a next in time content fragment.

15. The apparatus of claim 11 , wherein the content fragment comprises a horizon window indicating one or more next in time content fragments and the quality level for each next in time content fragment of the one or more next in time content fragments.

16. An apparatus comprising:

one or more processors; and

a memory storing processor-executable instructions that, when executed by the one or more processors, cause the apparatus to,

receive, from a first computing device, content;

cause output of the content;

determine an interruption in receiving the content;

send, to a second computing device based on the interruption, a content fragment request comprising an approximate time code, wherein the content fragment request causes a determination, based on the approximate time code, of a content fragment comprising a time code that is closest to the approximate time code, wherein the content fragment comprises a universally unique identifier (UUID) that identifies a name of a next content fragment following the content fragment and wherein the content fragment further comprises a quality level of the next content fragment; and

receive, from the second computing device, the content fragment.

17. The apparatus of claim 16 , wherein the approximate time code is associated with a beginning of the content fragment.

18. The apparatus of claim 16 , wherein the output of the content is continuous during the interruption.

19. The apparatus of claim 16 , wherein the approximate time code comprises an approximation of a time code associated with a desired content fragment.

20. The apparatus of claim 16 , wherein the content fragment comprises a horizon window indicating one or more next in time content fragments and a quality level for each next in time content fragment of the one or more next in time content fragments.

21. The method of claim 1 , wherein the time code is derived from a continuously increasing time scale.

22. The method of claim 6 , wherein the time code is derived from a continuously increasing time scale.

23. The apparatus of claim 11 , wherein the time code is derived from a continuously increasing time scale.

24. The apparatus of claim 16 , wherein the time code is derived from a continuously increasing time scale.