Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2008-10-08
2010-06-15
Tran, Phuc (Department: 2471)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S408000
Reexamination Certificate
active
07738406
ABSTRACT:
Peer-to-peer communications sessions involve the transmission of one or more data streams from a source to a set of receivers that may redistribute portions of the data stream via a set of routing trees. Achieving a comparatively high, sustainable data rate throughput of the data stream(s) may be difficult due to the large number of available routing trees, as well as pertinent variations in the nature of the communications session (e.g., upload communications caps, network link caps, the presence or absence of helpers, and the full or partial interconnectedness of the network.) The selection of routing trees may be facilitated through the representation of the node set according to a linear programming model, such as a primal model or a linear programming dual model, and iterative processes for applying such models and identifying low-cost routing trees during an iteration.
REFERENCES:
patent: 7636789 (2009-12-01), Li et al.
patent: 2002/0161898 (2002-10-01), Hartop et al.
patent: 2003/0185166 (2003-10-01), Belcea
patent: 2004/0236863 (2004-11-01), Shen et al.
patent: 2006/0007947 (2006-01-01), Li et al.
patent: 2006/0187860 (2006-08-01), Li
patent: 2007/0064405 (2007-03-01), Chen
patent: 2007/0094405 (2007-04-01), Zhang
patent: 2007/0280255 (2007-12-01), Tsang et al.
patent: 2008043092 (2008-10-01), None
Hefeeda, et al.,“Promise: Peer-to-Peer Media Streaming Using CollectCast”, Retrieved at <<http://dslab.csie.ncu.edu.tw/94html/paper/pdf/PROMISE:%20Peer-to-Peer%20Media%20Streaming%20Using%20CollectCast.pdf>>, MM'03, Nov. 2-8, 2003, ACM, Berkeley, California, USA, pp. 10.
Xiang, et al., “Peer-to-Peer Based Multimedia Distribution Service”, Retrieved at <<http:/
sl.cs.surrey.sfu.ca
rg/papers/XZZZ04.pdf>>, IEEE Transactions on Multimedia, vol. 6, No. 2, Apr. 2004, pp. 343-355.
Kwon, et al., “Distributed Multimedia Streaming over Peer-to-Peer Networks”, Retrieved at <<http://dcslab.snu.ac.kr/paper/europar.pdf>>, 2003, pp. 1-8.
Cheng, et al., “Adaptive peer-to-peer streaming with MutualCast”. Retrieved at <<http://www.zju.edu.cn/jzus/2006/A0605/A060509.pdf>>, Journal of Zhejiang University Science A, 2006, pp. 737-748.
Dai, et al., “Maximizing Throughput in Layered Peer-to-peer Streaming”, Retrieved at <<http://vanets.vuse.vanderbilt.edu/˜dail/papers/icc07-dai-maximizing.pdf>>, pp. 1-6.
Padmanabhan, et al., “Resilient Peer-to-Peer Streaming”, Retrieved at <<http://research.microsoft.com/˜helenw/papers/icnp2003.pdf>>, 2003, pp. 12.
Charikar, et al., “Approximation Algorithms for Directed Steiner Problems”, Retrieved at <<http://dclab.cs.nthu.edu.tw/˜kwc/20030821/Approximation%20Algorithms%20for%20Directed%20Steiner%20Problems.pdf>>, on Sep. 30, 2008, pp. 192-200.
Feige, et al., “A Threshold of In n for Approximating Set Cover”, Retrieved at <<http://citeseer.ist.psu.edu/cache/papers/cs/15679/http:zSzzSzwww.wisdom.weizmann.ac.ilzSz˜feigezSzApproxzSzsetcover.pdf/feige98threshold.pdf>>, Apr. 2, 1998, pp. 1-23.
Huang, et al.,“Can Internet Video-on-Demand be Profitable?”, Retrieved at <<http://research.microsoft.com/˜chengh/papers/profitableVoD.pdf>>, SIGCOMM'07, Aug. 27-31, 2007, Kyoto, Japan, ACM Publication, pp. 1-12.
Lau, et al., “Survivable Network Design with Degree or Order Constraints”, Retrieved at <<http://www.andrew.cmu.edu/user/mohits/sndp.pdf>>, STOC'07, Jun. 11-13, 2007, San Diego, California, USA, ACM Publication, pp. 1-10.
Li, et al., “Mutualcast: An Efficient Mechanism for One-To-Many Content Distribution”, Retrieved at <<http://msw3.stanford.edu/˜ivmsjc/esetton/jc—apr27.pdf>>, ACM Sigcomm Asia'04, Apr. 10-12, 2004, Beijing, China, ACM Publication, 2004, pp. 10.
“Jupiter Research Tech.”, “US Broadband Forecast, 2007 to 2012'—JupiterResearch Report—May 9, 2007”, Retrieved at <<http://www.imnewswatch.com/archives/2007/05/us—broadband—fo.html?visitFrom=2>>, on May 5, 2008, pp. 1-5.
Chiang Mung
Chou Philip Andrew
Li Jin
Liu Shao
Sengupta Sudipta
Microsoft Corporation
Tran Phuc
LandOfFree
Models for routing tree selection in peer-to-peer... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Models for routing tree selection in peer-to-peer..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Models for routing tree selection in peer-to-peer... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4157875