Process for depicting paths within a graphical representation of a network

• US 6,304,273 B1
• Filed: 05/22/1998
• Issued: 10/16/2001
• Est. Priority Date: 05/23/1997
• Status: Expired due to Term

• Current Assignee: Hanger Solutions, LLC (IP Investments Group LLC)
• Original Assignee: Orange S.A.
• Inventors: Bonnet, Dominique
• Primary Examiner(s): Luu, Matthew
• Assistant Examiner(s): Chung, Daniel J
• Application Number:
  US09/083,588
• Time in Patent Office: 1,243 Days
• Field of Search: 345/440, 345/441, 345/442, 345/134, 345/335, 345/115, 345/116
• US Class Current: 345/440
• CPC Class Codes: H04Q 2213/13141 Hunting for free outlet, circuit or channel
• CPC Class Codes: H04Q 2213/13525 GUI - graphical user interface, inc. for service creation
• CPC Class Codes: H04Q 2213/13541 routing
• CPC Class Codes: H04Q 3/66 Traffic distributors

Abstract

In order to depict a set of paths which are available for transporting a stream from a first node (1) to a second node (6) of the network, one or more perimeters are placed around each symbol designating a departure node of an elementary link of a path of the set, and a respective flag is placed at the intersection between each arc designating an elementary link of the set of paths and a perimeter surrounding the symbol designating the departure node of said elementary link. This depiction technique permits clear visualization of various routing conditions, in a manner which is independent of the positions of the nodes in the graphical representation of the network. It is particularly well suited to computer tools for assisting the design or simulation of networks.

Claims

1. Process for depicting paths within a graphical representation of a network, said graphical representation comprising symbols and arcs, the symbols being connected together by the arcs, the symbols designating nodes of the network, and the arcs designating elementary links existing between said nodes, in which a set of paths available for transporting a stream from a first one of said nodes to a second one of said nodes is depicted, said set being such that:

each path includes, between the first node and the second node, an elementary link or a succession of elementary links each having a respective departure node and a respective arrival node among said nodes, said first node constitutes the departure node of an elementary link of each path, said second node constitutes the arrival node of an elementary link of each path, and each arrival node of an elementary link of a path of the set other than said second node constitutes the departure node of another elementary link of said path, said process comprising the steps of;

surrounding each symbol designating a departure node with at least-one respective perimeter; and

placing a respective flag at an intersection between each arc designating an elementary link of the set of paths and a perimeter surrounding the symbol designating the departure node of said designated elementary link.

2. Process for depicting paths according to claim 1, wherein the set of paths is such that at least one node of the network constitutes a departure node common to several elementary links, among which at least one main link has priority over at least one auxiliary link, the process further comprising the steps of:

surrounding the symbol designating said common departure node by first and second concentric perimeters,

placing the flag relating to each main link having said common departure node at an intersection between the arc designating said main link and the first concentric perimeter, and

placing the flag relating to each auxiliary link having said common departure node at an intersection between the arc designating said auxiliary link and the second concentric perimeter.

3. Process for depicting paths according to claim 1, wherein the set of paths comprises at least first and second paths each passing through a constrained node and each including a respective elementary arrival link of which said constrained node constitutes the arrival node and a respective elementary departure link of which said constrained node constitutes the departure node, and wherein no path of the set to be depicted simultaneously includes the elementary arrival link of the first path and the elementary departure link of the second path, and wherein, on a perimeter surrounding the symbol designating the constrained node and having a flag at an intersection with the arc designating the elementary departure link of the second path, a flag of another type is further placed at an intersection with the arc designating the elementary arrival link of the second path, and no flag of the other type is placed at an intersection with the arc designating the elementary arrival link of the first path.