Method and system for controlling package-oriented network traffic

• US 6,917,982 B1
• Filed: 12/15/1999
• Issued: 07/12/2005
• Est. Priority Date: 12/19/1998
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dueck, Gunter, Volk, Klaus, Spies, Marcus
• Primary Examiner(s): Alam, Hosain
• Assistant Examiner(s): WON, MICHAEL YOUNG
• Application Number:
  US09/465,481
• Time in Patent Office: 2,036 Days
• Field of Search: 709/235
• US Class Current: 709/235
• CPC Class Codes: G06Q 10/047 Optimisation of routes or paths, e.g. travelling salesman problem
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
• CPC Class Codes: H04L 41/0853 by actively collecting configuration information or by backing up configuration information
• CPC Class Codes: H04L 41/0896 Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities flow or congestion control using dynamic resource allocation, e.g. in-call renegotiation, H04L47/76

Abstract

A method for optimizing package-oriented network traffic control is proposed which can involve constraints to the optimization model which emerged dynamically during the optimization period. Thus, unpredictable events can be considered amongst foreseeable events during the optimization process. For achieving this the method according to the invention uses graphs which are dynamically generated and eventually be varied during the optimization process for managing the above said complex inter-dependencies.

Unexpected changes of the time and loading schedules can be balanced and their negative impact on just in-time delivery of goods can be lowered. Generally, transport costs are reduced and natural resources are saved.

In a preferred embodiment of the inventional method a variable time buffer extension is introduced which is used to extend the availability of the transport vehicle'"'"'s capacity.

Claims

1. A method for optimizing network traffic control in a network having a plurality of transport paths between respective nodes, each transport path having a transport capacity realized by respective transport means (V1,V2,V3,C1), in which network at least a portion of transport objects are package-oriented and can be checked for divisability into sub-objects, said transport objects each to be shipped compliant with suitable pickup and delivery time windows from a respective originating node (10,11,12) to a respective destination node (14,15,16) along a routing node sequence, the method comprising the steps of

globally collecting (110) current transport movements information (19) from at least a part (18) of the network, and

globally collecting (120) for a predetermined planning period current transport requirements information (17) concerning at least said part (18) of the network,

checking (125) all transport system elements for availability for reloading,

checking (130) for a given transport object if it is able to be divided in at least two sub-objects,

checking (140) if at least one of the sub-objects of said load can be redirected on a transport path different to that said object was scheduled before,

dynamically establishing non-permanent nodes for reloading and redirecting an object to a different route,

the method being characterized by the steps of evaluating (150), at least in part using pro-active organizational means, said information (17,19) gathered before by using graphs comprising possible dynamic time buffers related to transport system elements, said buffers embedding at least temporarily said pickup and delivery time windows in order to achieve globally optimized network traffic,

reloading (160) of sub-objects onto either of the plurality of objects according to an optimization decision (23) based on said step of evaluating (150), and/or

dividing (170) transport objects into sub-objects according to an optimization decision (25) based on said step of evaluating (150),

providing specific for each of a plurality of transport requirements and transport movements a dynamic time window comprising at least two fixed minimum time windows with respective variable time buffers each defining a start time and an end time necessary for adapting the dynamically varying schedules of said transport elements to one another,

basing the optimization decision (23,25) on a sequence of steps,

dividing at each of the nodes, if possible, the incoming transport object in at least two sub-objects,

determining the transport capacity on at least one of the node'"'"'s outgoing paths within the dynamic time buffer,

propagating said total time windows, and

moving objects and/or sub-objects within the dynamic time buffer.

2. A program stored on a data carrier usable to install a computer program implementing the method according to claim 1 when read into a computer device.

3. User interface means for user interaction with a computer program implementing the method according to claim 1 for usage with transporting material objects, the interface means comprising means for specifying optimization objects, said optimization objects being at least one of

tour segments for vehicles,

load and time schedule for orders or suborders including reload processes,

type of vehicles used for orders, suborders or paths in the network.

4. The user interface means according to claim 3 comprising

graphical input and/or output means for supporting user interaction, the input/output means comprising a flag-like attributes collection being directly associated to said optimization objects and the attributes representing object features being relevant in the network controlling process,

a list of proposals coming from a result of said optimization method to be performed only after reconfirmation by the operator.

5. A data storage device having logic instructions stored thereon which implement the user interface means according to either one of claims 3 or 4.

6. Use of the method according to claim 1 for optimizing network traffic with material loads.

7. Use of the method according to claim 1 for optimizing network traffic in a computer communication network.