Multiplex communications – Data flow congestion prevention or control – Flow control of data transmission through a network
Reexamination Certificate
2002-03-12
2008-09-02
Jung, Min (Department: 2616)
Multiplex communications
Data flow congestion prevention or control
Flow control of data transmission through a network
C370S400000, C709S238000
Reexamination Certificate
active
07420923
ABSTRACT:
The present invention is related to optimizing software distribution in large communication networks (e.g. UMTS). A distribution graph including the nodes involved in the distribution spanned out by logical links assigned cost values is constructed. On basis of the distribution graph, the shortest paths from the distribution node (e.g. an OMC) to each of the other nodes (e.g. BSC, SGSN, RBS) are calculated. These paths are placed in groups of overlapping paths. The paths in each group are then ordered according to the number of nodes in each path, wherein the path with the lowest number of nodes is placed first. Then the software distribution is executed in each group, starting by loading the software from the first to the second node of the first ordered path, then the same is done for the second ordered path, and so on, but the loading between the same two nodes is not taking place more than once even if they appear as the first and the second node in more than one path. After reaching the last ordered path, the first node of each path in the group is removed. These loading and removing steps are repeated until all the nodes in the group are provided with the software.
REFERENCES:
patent: 5430729 (1995-07-01), Rahnema
patent: 6023586 (2000-02-01), Gaisford et al.
patent: 6088333 (2000-07-01), Yang et al.
patent: 6289021 (2001-09-01), Hesse
patent: 6771604 (2004-08-01), Dommety et al.
patent: 6813272 (2004-11-01), An et al.
patent: 2002/0006112 (2002-01-01), Jaber et al.
patent: 0766430 (1997-04-01), None
patent: 1014652 (2000-06-01), None
patent: 1 014 652 (2000-07-01), None
patent: 1107113 (2001-06-01), None
patent: WO 00/19291 (2000-04-01), None
Sahasrabuddhe et al., Multicast Routing Algorithms and Protocols: A Tutorial, Jan./Feb. 2000, IEEE Network, pp. 90-102.
Design Implementation Guide, Multicast Deployment Made Easy, IP Multicast Planning and Deployment Guide, pp. 1-20.
John Chung, Pricing Multicast Communication: A Cost-Based Approach, pp. 1-16.
Introduction to IP Multicast Routing, An IP Multicast Initiative White Paper, pp. 1-13.
J. Moy, RFC1585, MOSPF: Analysis and Experience, Mar. 1994, pp. 1-10.
J. Moy, RFC1245, OSPF Protocol Analysis, Jul. 1991, pp. 1-9.
International Search Report.
International Preliminary Examination Report dated Feb. 2, 2003.
Communication issued in European Application No. 02 703 997.3—2211 dated Dec. 12, 2007.
E.W. Dijkstra, “A Note on Two Problems in Connexion with Graphs”, Numerische Mathematik, vol. 1, pp. 269-271, Dec. 1959.
T. H. Cormen, et al., “Introduction to Algorithms”, The MIT Press, 1989.
J. Postal, et al., RFC0959 File Transfer Protocol, Updated by RFC2228 and RFC2640, Oct. 1985.
J. Moy, RFC2328 OSPF Version 2, Apr. 1998.
S. Deering, RFC1256 ICMP Router Discovery Messages, Sep. 1991.
Jung Min
Telefonaktiebolaget LM Ericsson (publ)
LandOfFree
Optimizing software distribution in large communication... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Optimizing software distribution in large communication..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing software distribution in large communication... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3985277