200 S Laurel Ave - Bldg B
John G. Klincewicz is a Principal Member of Technical Staff in the Optimization, Reliability and Customer Analytics Division of AT&T Labs in Middletown, N.J.
John received an S.B. in Mathematics from M.I.T in 1975 and a Ph.D. in Operations Research from Yale University in 1979.
Since joining AT&T in 1979, he has worked on a variety of applications, including IP backbone network design, cache server location, ring network planning, capacity expansion and logistics.
His research interests include telecommunication network design, facility location models and heuristics for combinatorial problems. He has over thirty refereed publications and is a member of INFORMS.
Traffic matrix estimation method and apparatus,
November 6, 2007
A method and apparatus for the estimation of traffic matrices in a network are disclosed. Mechanisms are disclosed for measuring traffic volume from a plurality of ingress points to a plurality of egress points in a large scanl network, such as an IP backbone network. The traffic matrix is advantageously inferred from widely available link load measurements such as SNMP data.
Apparatus And Method For Designing A Network,
August 23, 2005
An apparatus and method for designing a network are disclosed. The network is designed wherein nodes originate and terminate traffic to keep delay related to node-to-node delay-sensitive communication below a specified threshold. The method obtains an initial network topology including links and traffic routing based on a volume of traffic, allocates a maximum delay to each link in the network topology in proportion to the square root of an imputed cost for each link, sizes a bandwidth required for each link based on a current traffic routing and at least one of a maximum delay allocated to the link, determines link lengths and reroutes traffic according to shortest paths with respect to the determined link lengths.
Method for Designing a Network,
February 24, 2004
A method and apparatus for designing a network that supports an integrated environment for all types of applications while satisfying individual performance requirements. An initial network topology is retrieved or created, including links and traffic routing based on a volume of traffic. A maximum delay is then allocated to each link in the network topology so that the delay limits on node-to-node communication are satisfied. Further, a bandwidth required for each link is sized based on a current traffic routing as well as a maximum delay allocated to the link and total link utilization. Link lengths are then determined, based on marginal costs, and traffic is rerouted according to shortest paths with respect to the link lengths.
Method for Designing SONET Ring Networks Suitable for Local Access,
May 9, 2002
A method is provided for designing a hierarchical architecture for a synchronous optical network (SONET) given a plurality of demand nodes at which communications traffic originates and at least one destination node at which the communications traffic is collected for transmission to a switch. The method includes the steps of: (a) dividing the plurality of demand nodes into distinct groups of demand nodes; (b) selecting at least one node for each group to serve as a ring hub for connection to a backbone ring; (c) designing a backbone ring topology that includes at least the ring hubs and the destination node; (d) designing an access ring topology for each of the demand node groups so that the backbone ring and access ring topologies constitute a preliminary network topology; (e) evaluating a cost associated with the preliminary network topology; (f) selecting at least one alternative ring hub to provide a new set of ring hubs; (g) repeating steps (c)-(e) for the new set of ring hubs to determine if a resulting network cost estimate is reduced; (h) repeating steps (f)-(g) until a minimum cost network topology is produced. Other aspects of the invention are directed to hub and spoke topology design and SONET transport design.