Method for minimizing street crossings and meeting maximum capac

Details Method for minimizing street crossings and meeting maximum capac Method for minimizing street crossings and meeting maximum capac

1997-06-05

1999-10-05

Patel, Ajit

Multiplex communications

Data flow congestion prevention or control

Flow control of data transmission through a network

370254, 39520072, H04J 116, H04J 314, H04J 100, H04J 1226

Patent

active

059635444

ABSTRACT:
A method for designing a telecom network includes retrieving data corresponding to a plurality of network node locations, a plurality of subscriber locations and other relevant information such as associated street blocks and distance values. Each network node location and subscriber location combination having a distance value therebetween greater than a maximum distance is initially eliminated. Thereafter, each network node location and subscriber location combination is assigned a priority value, based on constraints such as the proximity between their associated street blocks and/or the maximum capacity of each network node location. The total sum of priority values and total number of subscriber locations are then calculated for those sets of network node locations and corresponding subscriber locations that are selected by the algorithm. A final set of network node locations and assigned subscriber locations is identified by determining the set having the lowest total sum of priority values, which minimizes the street crossings in the design, and the highest number of subscriber locations.

REFERENCES:
patent: 5079760 (1992-01-01), Nemirovsky et al.
patent: 5291477 (1994-03-01), Liew
patent: 5317566 (1994-05-01), Joshi
patent: 5608721 (1997-03-01), Natarajan et al.
An article by P.J. Densham and G. Rushton, entitled Providing Spatial Decision Support For Rural Public Service Facilities That Require A Minimum Workload (in press)(1996).
An article by P.J. Densham and G. Rushton, entitled A More Efficient Heuristic For Solving Large P-median Problems, Papers in Regional Science 71, 3:307-29 (1992).
An article by M.F. Goodchild and V.T. Noronha, entitled Location-Allocation For Small Computers, Monograph 8, Dept. of Geography, the University of Iowa (1983).
An article by E.L. Hillsman, entitled Heuristic Solutions To Location-Allocation Problems, Monograph 7, Dept. of Geography, The University of Iowa (1980).
An article by R.L. Church and C.S. Revelle, entitled The Maximal Covering Location Problem, Papers of the Regional Science Association, 32: 101-118 (1974).
An article by M.B. Teitz and P. Bart, entitled Heuristic Methods For Estimating The Generalized Vertex Median of a Weighted Graph, Operation Research 16:955-61 (1968).
An article by E.W. Dijkstra, entitled A Note On Two Problems in Connection With Graphs, Numererische Mathematik, vol. 1, pp. 269-271 (1959).

Affiliated with

Also associated with

Rating

Method for minimizing street crossings and meeting maximum capac 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 minimizing street crossings and meeting maximum capac, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for minimizing street crossings and meeting maximum capac will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1179955