Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2008-01-01
2008-01-01
Orgad, Edan (Department: 2616)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S400000
Reexamination Certificate
active
07315516
ABSTRACT:
A method of generating relay paths among a plurality of participants in multi-transmission is provided for transmitting predetermined data to the participants. The method includes a first step of analyzing access paths of the participants; a second step of generating a binary tree structure of relay paths among participants belonging to each subnet group; a third step of arranging gateways on the access paths of the participants according to the order on a connection path connecting the gateways to a data server; a fourth step of classing gateways, which are connected to the same upper gateway and are at the same level as a result of the arrangement, as a subordinate set of the upper gateway; and a fifth step of calculating the number of hops of each gateway within the subordinate set to a corresponding subnet group and generating a binary tree structure of relay paths starting from a gateway having relatively fewer hops toward a gateway having relatively more hops.
REFERENCES:
patent: 5355371 (1994-10-01), Auerbach et al.
patent: 5666360 (1997-09-01), Chen et al.
patent: 5926463 (1999-07-01), Ahearn et al.
patent: 5946316 (1999-08-01), Chen et al.
patent: 6032194 (2000-02-01), Gai et al.
patent: 6061712 (2000-05-01), Tzeng
patent: 6078590 (2000-06-01), Farinacci et al.
patent: 6088333 (2000-07-01), Yang et al.
patent: 6163807 (2000-12-01), Hodgkinson et al.
patent: 6192051 (2001-02-01), Lipman et al.
patent: 6388995 (2002-05-01), Gai et al.
patent: 6618755 (2003-09-01), Bonn
patent: 6697365 (2004-02-01), Messenger
patent: 6707796 (2004-03-01), Li
patent: 6914894 (2005-07-01), Wilmer et al.
patent: 7042878 (2006-05-01), Li
patent: 7103054 (2006-09-01), Novaes
patent: 7185077 (2007-02-01), O'Toole et al.
patent: 0 598 671 (1994-05-01), None
patent: 1 107 507 (2001-06-01), None
“The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees”; Authors: Hiroshi Fujinoki and Kenneth J. Christensen; 8 Pgs., Oct. 1999.
“An Efficient Multicast Routing Algorithm for Delay-Sensitive Applications with Dynamic Membership.”; Authors: Sung-Pil Hong, Heesang Lee and Bum Hwan Park; IEEE; 1998; pp. 1433-1440.
“Distributed Algorithms for Multicast Path Setup in Data Networks”; Authors: Fred Bauer and Anujan Varma; IEEE; 1995;pp. 1374-1378.
“Distributed Algorithms for Multicast Path Setup in Data Networks”; Authors: Fred Bauer and Anujan Varma; Transactions on Networking, vol. 4, No. 2; IEEE; Apr. 1996; pp. 181-191.
“Multicast Routing in Internetworks Using Dynamic Core Based Trees”; Authors: A.D. Reghavendra and S. Rai; IEEE; 1996; pp. 232-238.
“Multicast Tree Construction in Directed Networks”; Author: J. Eric Klinker; IEEE; 1996; pp. 496-500.
“A Dynamic Programmable Shared Virtual Path Assignment Algorithm for Multipoint Communication in ATM Networks”; Authors: S. Selvakumar, J. Karthik, G.V. Ravi Shankar and Y. Ramakrishna; IEEE; 1999; pp. 254-258.
“Distributed Quality of Service Multicast Routing with Multiple Metrics for Receiver Initiated Joins”; Authors: Miguel Rio and Peter F. Linington; IEEE; 2000; pp. 180-187.
Burrowes Lawrence J
Cantor & Colburn LLP
Ghizi Soft Co., Ltd.
Orgad Edan
LandOfFree
Method for generating casting path among participants for... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for generating casting path among participants for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for generating casting path among participants for... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2787481