Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2011-05-10
2011-05-10
Moe, Aung S (Department: 2474)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S230000, C370S408000, C370S539000, C709S233000, C709S224000, C375S257000
Reexamination Certificate
active
07940699
ABSTRACT:
Techniques are disclosed for generation of spanning trees that support provision of performance-guaranteed services over a circuit-switched network such as, for example, an optical-based network. For example, a technique for generating a spanning tree for use in forwarding Ethernet-based data in a circuit-switched network comprises the following steps/operations. Input information is obtained. The input information comprises a representation of the network, a set of Ethernet-enabled nodes in the network, and a set of demands. A spanning tree is computed based on at least a portion of the input information such that the spanning tree substantially satisfies one or more performance requirements (e.g., one or more bandwidth requirements) associated with the set of demands. Advantageously, in one embodiment, such techniques may provide for generation of spanning trees for use in supporting bandwidth-guaranteed Ethernet services such as E-LAN over a SONET (and SDH) network.
REFERENCES:
patent: 4320520 (1982-03-01), Graham
patent: 5581555 (1996-12-01), Dubberly et al.
patent: 5881050 (1999-03-01), Chevalier et al.
patent: 5886643 (1999-03-01), Diebboll et al.
patent: 6151327 (2000-11-01), Sofman et al.
patent: 6310883 (2001-10-01), Mann et al.
patent: 7046671 (2006-05-01), Chang et al.
patent: 7246172 (2007-07-01), Yoshiba et al.
patent: 7301912 (2007-11-01), Hong et al.
patent: 2002/0181499 (2002-12-01), Kfir et al.
patent: 2005/0008014 (2005-01-01), Mitra et al.
patent: 2005/0008042 (2005-01-01), Rouaud
patent: 2005/0063321 (2005-03-01), Imai
patent: 2005/0141526 (2005-06-01), Green et al.
patent: 2005/0152289 (2005-07-01), Nagata et al.
patent: 2006/0209886 (2006-09-01), Silberman et al.
T.C. Hu, “Optimum Communication Spanning Trees,” SIAM Journal on Computing, vol. 3, No. 3, pp. 188-195, Sep. 1974.
T. Radzik, “Fast Deterministic Approximation for the Multicommodity Flow Problem,” Symposium on Discrete Algorithms, Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, (SODA), pp. 486-492, 1995.
R. Santitoro, “Metro Ethernet Services—A Technical Overview,” Metro Ethernet Forum, http://www.metroethernetforum.org/PDF—Documents/metro-ethernet-services.pdf, Apr. 2003, pp. 1-19.
A. Agrawal et al., “When Trees Collide: An Approximation Algorithm For The Generalized Steiner Problem On Networks,” Proceedings of the 23nd Annual ACM Symposium on Theory of Computing, 1991, pp. 134-144.
A. Agrawal et al., “When Trees Collide: An Approximation Algorithm For The Generalized Steiner Problem On Networks,” Brown University Department of Computer Science Tech Report CS-90-32, Jun. 1994, reprinted in SIAM Journal on Computing, 1995, pp. 440-456, vol. 24.
D. Banerjee et al., “Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study,” IEEE/ACM Transactions on Networking, Oct. 2000, pp. 598-607, vol. 8, Issue 5.
A. Narula-Tam et al., “Survivable Routing Of Logical Topologies In WDM Networks,” Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pp. 348-357, 2001, vol. 1.
B. Yang et al., “A Tree Building Technique for Overlay Multicasting in DiffServ Domains,” Proceedings of the International Conference on Internet Computing, IC '03, Jun. 2003, pp. 893-899, vol. 2, Nevada.
J.M. Kleinberg, “Single-Source Unsplittable Flow,” Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), 1996, pp. 1-35.
Y. Dinitz et al., “On the Single-Source Unsplittable Flow Problem,” Combinatorica, Nov. 1999, pp. 17-41, vol. 19, No. 1.
S. Acharya et al., “Precomputing High Quality Routes for Bandwidth Guaranteed Traffic,” IEEE Global Telecommunications Conference (GLOBECOM), Nov. 2004, pp. 1202-1207, vol. 2.
S. Acharya et al., “PESO: Low Overhead Protection for Ethernet over SONET Transport,” Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), Mar. 2004, 11 pages.
Acharya Swarup
Gupta Bhawna
Risbood Pankaj
Alcatel-Lucent USA Inc.
Javaid Jamal
Moe Aung S
Ryan & Mason & Lewis, LLP
LandOfFree
Spanning tree generation for supporting... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Spanning tree generation for supporting..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spanning tree generation for supporting... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2647515