Network Design

The TV CDS enables cable operators and multiple service operators (MSOs) to offer VOD and MediaX services to consumer customers over their existing hybrid fiber coaxial (HFC) network, with existing next-generation digital STBs. The TV CDS solution uses a Gigabit Ethernet (GE) transport network from the headend to the distribution hub, where the HFC network terminates. TV CDS grows seamlessly from a single server implementation to multiple servers. As growth continues, TV CDS allows operators to install distributed servers to address concentrations of subscribers while leaving content ingest and management centralized. Streamer arrays can be distributed close to the subscriber and linked back to the central Vault locations by way of the Cisco Cache Control Protocol (CCP). CCP automatically ensures that any new content that is required by a customer edge device is transferred within a maximum of a 250-millisecond delay to the appropriate edge location, so all content appears local to each edge site, even though most content is stored at the central Vault location. The TV CDS offers different configurations with regards to network topology, business management systems (BMSs), and streaming modes.

[1]  David P. Williamson,et al.  Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.

[2]  Joseph Naor,et al.  Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality , 1993, Math. Program..

[3]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[4]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[5]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[6]  F. Hwang,et al.  The Steiner Tree Problem , 2012 .

[7]  Toshihide Ibaraki,et al.  On sparse subgraphs preserving connectivity properties , 1993, J. Graph Theory.

[8]  David Hartvigsen,et al.  Multiterminal flows and cuts , 1995, Oper. Res. Lett..

[9]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[10]  Said Salhi,et al.  Discrete Location Theory , 1991 .

[11]  Mihalis Yannakakis,et al.  Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.

[12]  M. Stoer,et al.  A polyhedral approach to multicommodity survivable network design , 1994 .

[13]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[14]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[15]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[16]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[17]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[18]  Peter Elias,et al.  A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.

[19]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[20]  Dan Gusfield,et al.  Very Simple Methods for All Pairs Network Flow Analysis , 1990, SIAM J. Comput..

[21]  M. Stoer.  Design of Survivable Networks , 1993 .

[22]  Andrew V. Goldberg,et al.  Experimental study of minimum cut algorithms , 1997, SODA '97.

[23]  Béla Bollobás,et al.  Graph Theory: An Introductory Course , 1980, The Mathematical Gazette.

[24]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[25]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[26]  David B. Shmoys,et al.  Computing near-optimal solutions to combinatorial optimization problems , 1994, Combinatorial Optimization.

[27]  Mechthild Stoer,et al.  A Simple Min Cut Algorithm , 1994, ESA.

[28]  Takao Nishizeki,et al.  k-Connectivity and Decomposition of Graphs into Forests , 1994, Discret. Appl. Math..

[29]  James B. Orlin,et al.  A Faster Algorithm for Finding the Minimum Cut in a Directed Graph , 1994, J. Algorithms.

[30]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[31]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[32]  Samir Khuller,et al.  Balancing Minimum Spanning and Shortest Path Trees , 1993, SODA.

[33]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[34]  Robert E. Tarjan,et al.  A faster deterministic maximum flow algorithm , 1992, SODA '92.

[35]  András A. Benczúr,et al.  Counterexamples for Directed and Node Capacitated Cut-Trees , 1995, SIAM J. Comput..

[36]  David R. Karger,et al.  An Õ(n2) algorithm for minimum cuts , 1993, STOC.