Michael David Post

US Patent:

54044510, Apr 4, 1995

Filed:

Mar 29, 1993

Appl. No.:

8/038756

Inventors:

Paul Nemirovsky - Rockville MD
Michael Ball - Silver Spring MD
Michael Post - New York City NY

International Classification:

G06F 1300

US Classification:

395200

Abstract:

A method for selecting the most cost-efficient configuration for backbone links in a distributed data network is disclosed. The method identifies candidate links between pairs of backbone nodes, evaluates the effect on the network of adding each candidate link to the network, and adds to the network those candidate links which produce a cost savings in the network. The method also routes data through the backbone to minimize transmission delays, and eliminates redundant lines from underutilized links, and removes from the network those links whose removal reduces the cost of the backbone.

US Patent:

52531619, Oct 12, 1993

Filed:

Feb 6, 1990

Appl. No.:

7/475872

Inventors:

Paul Nemirovsky - Rockville MD
Michael Ball - Silver Spring MD
Michael Post - New York NY

International Classification:

G06F 1520
H04J 324
H04Q 1104
H04Q 1100

US Classification:

364402

Abstract:

A method to produce near-optimal routes for the flow of data between clusters in a distributed data communications network. A backbone traffic matrix and a backbone topology at the cluster level are used to produce minimum hop routes, minimum delay routes, or routes which maximize throughput. The inputs of the system are the number of requirements, the number of backbone links, and the number of backbone nodes.

US Patent:

60756314, Jun 13, 2000

Filed:

Sep 5, 1997

Appl. No.:

8/926332

Inventors:

Krishna Bala - New York NY
Georgios Nicos Ellinas - New York NY
Michael Post - Holmdel NJ
Chien-Chung Shen - Keansburg NJ
John Yee-Keung Wei - Aberdeen NJ

Assignee:

Bell Communications Research, Inc. - Morristown NJ

International Classification:

H04J 1400

US Classification:

359124

Abstract:

A method of reconfiguring a multi-wavelength communication network. The transition includes determining the union of the old and new topologies. During at least the start of the transition, the network supports the union topology. New connections are connected according to the new topology, and the old topology, as its connections expire, is gradually removed. In allocating wavelengths to a new topology, two algorithms are developed which assign wavelengths which do not color clash with the wavelength assignments of the old topology.