Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2004-07-30
2009-02-03
Orgad, Edan (Department: 2619)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S255000
Reexamination Certificate
active
07486682
ABSTRACT:
A method and apparatus for grooming traffic demands according to mileage based tariffs. An Integer Linear Program (ILP) that captures the traffic grooming problem is defined, and such a linear program can in principle be solved by conventional linear program application systems which are fully familiar to those of ordinary skill in the art. However, the time required to solve such an ILP is fairly large, even for the moderately sized networks we are interested in. That is, there are many possible routes to consider, and hence many integer variables in the ILP. Therefore, further in accordance with the principles of the present invention, the ILP is advantageously run on the Delaunay Triangulation of the network rather than on the completely connected network graph.
REFERENCES:
patent: 6215771 (2001-04-01), Turner et al.
patent: 2003/0023412 (2003-01-01), Rappaport et al.
Dynamic traffic grooming in WDM mesh networks using a novel graph model Hongyue Zhu; Hui Zang; Keyao Zhu; Mukherjee, B.; Global Telecommunications Conference, 2002. Globecom '02. IEEE vol. 3, Nov. 17-21, 2002 pp. 2681-2685 vol. 3.
A comprehensive study on next-generation optical grooming switches Keyao Zhu; Hui Zang; Mukherjee, B.; Selected Areas in Communications, IEEE Journal on vol. 21, Issue 7, Sep. 2003 pp. 1173-1186.
Awerbuch, B., et al., “Buy-at-Bulk Network Design”,Proceedings of FOCS, (1997), pp. 542-547.
Modiano, E., et al., “Traffic Grooming in WDM Networks”,IEEE Communications Magazine, (Jul. 2001), pp. 124-129.
Mansour, Y., et al., “An Approximation Algorithm for Minimum-Cost Network Design”,Faculty of Mathematical Sciences CS94-22, Weizmann Institute of Science, (Dec. 29, 1998).
Salman, F., et al., “Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem”,Proceedings of SODA, (1997), pp. 619-628.
Fortune, S., “Voronoi Diagrams and Delaunay Triangulations”,Euclidean Geometry and Computers, World Scientific Publishing Co., (1992), pp. 193-233.
Nuzman Carl Jeremy
Wilfong Gordon Thomas
Aga Sori A
Alcatel-Lucent USA Inc.
Brown Kenneth M.
Orgad Edan
LandOfFree
Method and apparatus for grooming traffic demands according... 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 and apparatus for grooming traffic demands according..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for grooming traffic demands according... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4092857