Disclosed herein are system and method embodiments for streaming media. An embodiment operates by receiving, at at least one computing device, a request for media from a viewer. At least one program is identified in which at least a portion of the media is available. A presentation is generated to identify the at least the portion of the media based on the at least one program and at least one order, wherein the order comprises at least one order component associated with the at least one program. The embodiment further includes dynamically generating an identification of an advertising clip for the presentation and then transmitting the presentation to the viewer.

An apparatus and method is disclosed for segment routing (SR) over label distribution protocol (LDP). In one embodiment, the method includes a node receiving a packet with an attached segment ID. In response, the node may attach a label to the packet. Thereafter, the node may forward the packet with the attached label and segment ID to another node via a label switched path (LSP).

Example implementations described herein are directed to a configurable Network on Chip (NoC) element that can be configured with a bypass that permits messages to pass through the NoC without entering the queue or arbitration. The configurable NoC element can also be configured to provide a protocol alongside the valid-ready protocol to facilitate valid-ready functionality across virtual channels.

Example implementations described herein are directed to a configurable Network on Chip (NoC) element that can be configured with a bypass that permits messages to pass through the NoC without entering the queue or arbitration. The configurable NoC element can also be configured to provide a protocol alongside the valid-ready protocol to facilitate valid-ready functionality across virtual channels.

In one aspect, a method for managing streaming of video content to a client device includes providing the video content to a content distribution network for storage in a plurality of geographically separated resources of the content distribution network, dynamically selecting an advertisement media clip based on statistical information associated with a user of the client device, and receiving, from the client device via a packet-based telecommunication network, signaling to have the stored video content streamed to the client device. In response to the received signaling, the method includes transmitting to the client device via the packet-based telecommunication network and in one or more files having a format compatible with a media player on the client device, (i) an identification of a first resource of the content distribution network available to facilitate streaming of the stored video content to the client device, the identification being dependent at least in part on a relationship between a geographic location of the client device and a geographic location of at least one of the resources of the content distribution network and (ii) an identification of an advertising server, the identification of the advertising server being dependent at least in part on a relationship between the geographic location of the client device and a geographic location of the advertising server, wherein the one or more files, when processed by the client device, cause the client device to communicate with the first resource of the content distribution network and the advertising server to cause the stored video to be streamed to the client device by first resource of the content distribution network and cause the selected advertisement media clip to be streamed from the advertising server to the client device.

Methods, systems, and apparatus guarantee bandwidth for a network transaction. A network is logically organized as a tree having a plurality of nodes. Each node can guarantee service for a network transaction through the network. Each node monitors its traffic and reserves predefined amounts of unused bandwidth with its adjacent node. If a particular node needs additional bandwidth, that node borrows the bandwidth from its adjacent node.

A T-SDN controller including a T-LSP manager, a temporal path element, a T-TED, a T-LDB, a T-LSPDB, and a network interface. The T-LSP receives a path request including time intervals and a set of constraints. The temporal path element obtains traffic engineering information and computes a path satisfying time intervals and a set of constraints. The T-TED reserves bandwidth corresponding to the path during the time intervals upon request by the T-LSP manager. The T-LDB reserves labels for the links during the time intervals upon request by the T-LSP manager. The T-LSPDB stores the time intervals, the set of constraints, the labels, and the bandwidth. The network interface permits the T-LSP manager to communicate with the nodes in the network to establish a temporal LSP along the path as computed.

A method for establishing a temporal label switched path (T-LSP) implemented in a node in a network. The method includes receiving a path request including a time interval and a set of constraints; obtaining traffic engineering information from a first database; computing, by the node, a path satisfying the time interval and the set of constraints based on the traffic engineering information obtained; storing the time interval and the set of constraints in a second database; and instructing an ingress node of the temporal LSP to signal the temporal LSP in the network along the path computed at a start of the time interval identified in the path request and to tear down the temporal LSP at an end of the time interval identified in the path request.

Methods to achieve bounded router buffer sizes and Quality of Service guarantees for traffic flows in a packet-switched network are described. The network can be an Internet Protocol (IP) network, a Differentiated Services network, an MPLS network, wireless mesh network or an optical network. The routers can use input queueing, possibly in combination with crosspoint queueing and/or output queueing. Routers may schedule QoS-enabled traffic flows to ensure a bounded normalized service lead/lag. Each QoS-enabled traffic flow will buffer O(K) packets per router, where K is an integer bound on the normalized service lead/lag. Three flow-scheduling methods are analysed. Non-work-conserving flow-scheduling methods can guarantee a bound on the normalized service lead/lag, while work-conserving flow-scheduling methods typically cannot guarantee the same small bound. The amount of buffering required in a router can be reduced significantly, the network links can operate near peak capacity, and strict QoS guarantees can be achieved.

A task dispatching method, applied in an edge computing system comprising an edge computing device and a mobile device, is disclosed. The method comprises sending, by the mobile device, a resource inquiry message to the edge computing device through a connection, wherein the connection comprises a wireless connection, a one-way transmission latency of the connection is less than 10 milliseconds, and the resource inquiry message comprises an inquiry of which resource type the edge computing device is equipped with; sending, by the edge computing device, a resource response message corresponding to the resource inquiry message; and determining, by the mobile device, to dispatch the second type of computing task to the second computing device when the resource response message indicates that the edge computing device comprises the second computing device equipped with the second type of processor.