[go: up one dir, main page]

WO2000079719A2 - Systeme de reseau integre - Google Patents

Systeme de reseau integre Download PDF

Info

Publication number
WO2000079719A2
WO2000079719A2 PCT/US2000/040207 US0040207W WO0079719A2 WO 2000079719 A2 WO2000079719 A2 WO 2000079719A2 US 0040207 W US0040207 W US 0040207W WO 0079719 A2 WO0079719 A2 WO 0079719A2
Authority
WO
WIPO (PCT)
Prior art keywords
node
network
connection
request
priority
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/US2000/040207
Other languages
English (en)
Other versions
WO2000079719A3 (fr
Inventor
Ichiro Masaki
Ichiro Mizunuma
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Mitsubishi Electric Corp
Massachusetts Institute of Technology
Original Assignee
Mitsubishi Electric Corp
Massachusetts Institute of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mitsubishi Electric Corp, Massachusetts Institute of Technology filed Critical Mitsubishi Electric Corp
Priority to US09/763,142 priority Critical patent/US6996630B1/en
Priority to JP2001515893A priority patent/JP2003506985A/ja
Publication of WO2000079719A2 publication Critical patent/WO2000079719A2/fr
Publication of WO2000079719A3 publication Critical patent/WO2000079719A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B25/00—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems
    • G08B25/01—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems characterised by the transmission medium
    • G08B25/08—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems characterised by the transmission medium using communication transmission lines
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B25/00—Alarm systems in which the location of the alarm condition is signalled to a central station, e.g. fire or police telegraphic systems
    • G08B25/007—Details of data content structure of message packets; data protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/22—Alternate routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
    • H04L63/0272—Virtual private networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
    • H04L63/104—Grouping of entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/90—Services for handling of emergency or hazardous situations, e.g. earthquake and tsunami warning systems [ETWS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/50—Connection management for emergency connections

Definitions

  • the present invention relates generally to communication networks, and more particularly, to network protocols.
  • private networks Two known types of communication networks are private networks and public networks.
  • Examples of private networks include communication networks owned or rented by road administration authorities, police, electricity companies, railway companies, and other institutions. These networks are dedicated to communications for the institutions that own or rent them such that third parties cannot access them even if they are idle.
  • Exemplary public networks include public telephone, cellular phone, and the Internet.
  • many private networks are not as sustainable as desired.
  • private networks typically have fewer nodes, and therefore, fewer potential pathways from source to destination. A connection failure between nodes within the private network may significantly impact or prevent communication between first and second locations.
  • a public network typically has a relatively large number of potential pathways such that a break between nodes can easily be avoided with relatively little service degradation.
  • a road authority installs a surveillance camera for monitoring traffic conditions and connects the camera to a traffic control center through the road authority private network. If this private network is replaced with a public cellular phone network, there is no impact under normal conditions. However, if a serious traffic accident occurs and a traffic jam is created, many people near the scene will try to use their cellular phones. Since the network users are provided service on a "first come, first serve" basis, the high cellular phone traffic may prevent the surveillance camera from sending its data to the traffic center because the public cellular phone network is busy. In other words, the traffic surveillance system cannot work when it is most needed if it utilizes the public networks instead of the private network.
  • the IPv6 protocol is an example of a protocol with conventional priority control that classifies messages into eight priority classes depending on the category of each message.
  • Exemplary message categories include background messages (including netnews), email, file transfer, interactive transfer (including telnet), and network control messages.
  • Messages in the same category do not have different priorities. For example, if ten traffic monitoring cameras request to send their images to a traffic control center and if there is a transmission capacity for only one camera, priority control in the IPv6 protocol does not differentiate between the cameras because all of the ten requests are in the same category and the requests are serviced on a "first come, first serve" basis. If one camera keeps occupying the transmission line by continually sending real-time video information, the other nine cameras must wait until the transmission line becomes available in a the carrier sense multiple access/collision detection scheme, for example.
  • a first network e.g., a private network
  • a second network e.g., a public network
  • migrate data requests from a first node to a second node based upon the capacity, for example, of the first node.
  • the present invention provides an integrated network formed from a plurality of network that assigns a higher priority to data traffic associated with a first network than data traffic associated with a second network.
  • This arrangement allows a private network, such as a traffic surveillance network, to be integrated to a public network, such as a cellular phone network, so as to increase the overall capacity of the network while preventing the lower priority cellular traffic from blocking higher priority private network traffic.
  • a traffic surveillance network for providing vehicle traffic and accident images to a traffic control center
  • an integrated network in accordance with the present invention is applicable to any network configuration in which messages associated with one network should be given priority over messages associated with another network.
  • an integrated network includes a first network having a plurality of nodes generating message traffic with a higher priority than message traffic associated with a second network.
  • a request by a first node of the first network can preempt existing connections associated with the second network on as needed basis.
  • an existing connection is preempted when a requested connection cannot be established and the existing connection has a lower priority than the requested connection. If there is not a lower priority connection that exists, the requested connection is moved to another output link if possible.
  • the priority of a request is determined from a plurality of priority factors, such as a value assigned to a node, a value that corresponds to elapsed time, a value corresponding to conditions proximate the requested server, a value corresponding to the requested bandwidth, and a value corresponding to nodes that neighbor a requested server.
  • priority factors such as a value assigned to a node, a value that corresponds to elapsed time, a value corresponding to conditions proximate the requested server, a value corresponding to the requested bandwidth, and a value corresponding to nodes that neighbor a requested server.
  • selected ones of the priority factors are added to provide a priority for the request.
  • a request to a first node can be migrated to a second node.
  • the first node determines its load and capacity to service the request.
  • the first node can respond by refusing the request, decreasing the requested bandwidth and accepting the request, terminating an existing lower priority connection and accepting the request, or attempting to migrate the request to a neighboring node.
  • the first node can include a neighboring node table that includes values for each of the neighboring nodes indicative of the similarity of the camera fields of view.
  • the first node selects a neighboring node and sends to it a request migrate message.
  • the neighboring node returns either a reject migrate message or an acknowledge migrate message.
  • notify migration messages can be sent to clients with existing connections in advance of closing certain existing connections as necessary to service the migrated request.
  • FIG. 1 is a schematic diagram of a prior art configuration of public and private networks
  • FIG. 2 is a schematic diagram of an integrated network system in accordance with the present invention.
  • FIG. 3 is a block diagram of a further integrated network in accordance with the present invention.
  • FIG. 4 is a schematic diagram of a camera sensor that can form a part of the integrated network of FIG. 3;
  • FIG. 5 is a schematic block diagram of a router that can form a part of the integrated network of FIG. 3;
  • FIG. 6 is flowchart showing an exemplary sequence of steps for establishing a connection in accordance with the present invention.
  • FIG. 7 is a flowchart showing an exemplary sequence of steps for pre-empting an existing connection in accordance with the present invention.
  • FIG. 8 is a flowchart showing an exemplary sequence of steps for closing a connection in accordance with the present invention.
  • FIG. 9 is a flowchart showing an exemplary sequence of steps for handling a failed link in accordance with the present invention.
  • FIG. 10 is a flowchart showing an exemplary sequence of steps for migrating a request from one node to another in accordance with the present invention.
  • the present invention provides an integrated network that can include a plurality of networks, such as private networks and public networks.
  • private network generally refers to a network, such as a police or traffic surveillance network, having messages that deserve greater priority than messages in a typical public network, such as a cellular phone network.
  • a conventional private network e.g., independent network, that is integrated with other networks, e.g., public networks, may still be referred to as a "private" network for purposes of describing an integrated network in accordance with the present invention.
  • the outer nodes of the plurality of networks are connected to each other to form a single integrated network.
  • a private network to a public network
  • discontinuities in the private network can be avoided by utilizing the public network while giving priority to messages associated with the private network.
  • accessing the public network enhances the sustainability of private network communications by providing routing pathways external to the private network.
  • FIG. 1 shows first and second private networks 10,20 and first and second public networks 30,40 in a conventional architecture.
  • the four networks 10,20,30,40 are independent of each other such that, for example, communication between points A and B in the first private network 10 becomes unavailable if network paths C and D are broken.
  • FIG. 2 shows an integrated network 100 in accordance with the present invention in which the networks 10,20,30,40 of FIG. 1 are connected to each other so as to integrate the private and public networks.
  • Points A and B can communicate unless each of network paths C-N are broken.
  • Prioritizing connections between certain nodes enhances the sustainability of the networks in the event of network node failures.
  • a router can schedule packets according to the priorities of the packets themselves or the priorities of the connections to which the packets belong. The priorities can be either constant or changed dynamically.
  • points X and Y on the second public network 40 can communicate through points A and B if the cellular network 40 is busy and the first private network 10, e.g., a vehicle traffic surveillance network, is idle.
  • Point A can be a surveillance camera
  • point B can be a traffic center
  • points X,Y can be drivers having cellular phones coupled to the cellular network 40.
  • cellular customers X and Y may not be able to communicate because the communication demands of the public cellular phone cell proximate the accident can saturate the cellular network.
  • X and Y may not be allowed to communicate through A and B because a direct connection between A and B should be used to send the scene image taken by the surveillance camera A to the traffic center B.
  • Priority control within the networks in accordance with the present invention can prohibit X and Y from communicating through A and B, because a connection between the surveillance camera A and the traffic center B has a higher priority.
  • the priority control scheme in accordance with the present invention allows A and B to communicate through X and Y even if the lines between X and Y are being used by cellular network customers.
  • the lines between X and Y can be assigned to A and B by terminating at least some of the existing connections between cellular customers X and Y.
  • a and B can communicate if any one of links C-N is operational.
  • the integrated network 100 can provide dedicated connections to priority users, as in private networks, by using another network, e.g., a public network, on an as needed basis.
  • FIG. 3 shows an exemplary embodiment of an integrated network 200 in accordance with the present invention.
  • the integrated network includes a first network PRNa having first, second, third and fourth routers Ral-4 that form a serial pathway from a first sensor Sal to a series of clients Cal-3.
  • a second sensor Sa2 is coupled to the second router Ra2 and a third sensor Sa3 is coupled to the third router.
  • the integrated network 200 further includes a second network PRNb having a plurality of serially connected routers Rbl-4 and a third network PUNc also having a plurality of serially connected routers Re 1-4.
  • the routers can have any number of devices connected thereto, and can include subnets.
  • the routers form an array having three rows and four columns.
  • the first network routers Ral-4 comprise the first row of the array
  • the second network routers Rbl-4 comprise the second row
  • the third network routers Re 1-4 comprise the third row.
  • the first router Ral,Rbl,Rcl in each of the first, second and third networks comprise the first column of the array
  • the second routers Ra2,Rb2,Rc3 comprise the second column
  • the third routers Ra3.Rb3.Rc3 comprise the third row
  • the fourth routers Ra4,Rb4,Rc4 comprise the fourth column. It is understood, of course, that this configuration can be readily varied by one of ordinary skill in the art.
  • the sensors Sal -3 can be selected from a variety of devices that transmit and/or receive data, which can be in the form of text, video, audio, and multimedia data, for example.
  • the term client is understood to include any device that can request data from one or more of the sensors Sal -3.
  • FIG. 4 shows an exemplary sensor Sal that can be coupled to the network 200.
  • the camera sensor Sal includes a video camera VC for providing digital image data of a predetermined field of view (FOV) to a client, which can include any type of computer that can request information from the camera sensors Sal -3.
  • the sensor can be used as a surveillance camera to provide traffic condition information to a traffic control center. Operation of the camera VC is controlled by position device PD that determines the camera's FOV under the control of a CPU.
  • a network device ND provides an interface between the sensor Sal and the network 200.
  • the sensor further includes a request table RT and a neighbor node table NNT, which are described below.
  • the request table RT includes client request info, such as client identification and bandwidth information
  • the neighbor node table NNT includes information relating to possible overlap in neighboring camera FOV's to facilitate connection migration from one camera to another.
  • the clients Cal-3 request data from the sensors Sal -3 to allow the traffic center monitor traffic conditions.
  • the sensors Sal -3 can request a connections to clients Cal-3 as well.
  • data transfer between the sensors Sal -3 and the clients Cal-3 is generally routed within the first network PRNa.
  • the first network routers Ral-3 can route data from the second and third networks PRNb,PUNc to destinations external (and internal) to the first network PRNa.
  • connections to the first network clients Cal-3 have priority over connections from outside the first network.
  • FIG. 5 shows an exemplary configuration for a router 300 in an integrated network in accordance with the present invention having a series of input links 302 and a series of output links 304.
  • a connection between an input link and an output link is provided by the router switching fabric 306.
  • the switching fabric 306 is controlled by a routing table 308 and a router connection management table (CMT) 310, which combine to manage connections between the input and output links 302,304. Connections whose route includes the router are registered in the CMT 310 and managed by the connection manager.
  • the connection manager will be activated by a request, such as a request to establish a new connection, a request to close a connection, and a notification of a link failure.
  • Table 1 shows an exemplary embodiment of a router connection management table (CMT). Table 1
  • the connection ID is unique to the router and locally identifies the connection.
  • the routing layer field indicates the layer, e.g., 3, 4, or 7, in which the connection is routed, as described further below.
  • the content/protocol field identifies the type of information, e.g., video, data, etc., and the corresponding input and output protocols that are used for the connection.
  • the I/O link identifies the input link and the output link of the router for the connection.
  • the bandwidth (BW) requirement field indicates the bandwidth parameters, e.g., maximum, minimum, and average, for the connection.
  • the bandwidth sharing field contains information for determining if and how a connection shares bandwidth with another connection, as described more fully below.
  • the priority parameters field provide priority information for the connection, which is also described below.
  • Each router also includes a routing table.
  • An exemplary routing table is set forth below in Table 2. Table 2
  • each record there is a corresponding destination IP address and a relationship between an input link and an output link.
  • FIG. 6, in combination with FIGS. 3-5, show an exemplary series of steps for implementing a protocol for an integrated network that provides priority to certain connections in accordance with the present invention. While reference is made to the traffic surveillance network of FIG. 3, it is understood that the invention is equally applicable to other applications. In addition, the steps indicate a sequence of events from a network viewpoint and not a particular node. Furthermore, it should be noted that the invention is described in the context of a connection based arrangement but is not limited thereto. That is, the invention is also applicable to so-called connectionless embodiments.
  • a node e.g., client
  • the adjacent node e.g., Ra4 selects an output link based upon the information in the routing table 308 (FIG. 5).
  • the connection manager examines whether the router can guarantee bandwidth requirements of the connections that already exist in addition to the requested connection.
  • the connection manager locates a record for the destination IP address of the connection and chooses one of the active output links from the output link list.
  • a link is considered active when the nodes can communicate with each other through the link.
  • the routing table 308 is static with connection between nodes being established in a predetermined order. That is, the routing tables are set up to route connections in a predetermined, prioritized order.
  • routing can also be dynamic such that routing paths can be modified or re-prioritized.
  • the adjacent node e.g., Ra4
  • attempts to establish a connection to the client Cal if the connection is established successfully, as determined in step 406, node Ra4 updates its CMT and sends a REQ ESTABLISH message to an adjacent node, e.g., Ra3 in step 408.
  • the terminal node e.g., Sal
  • the terminal node receives a REQ ESTABLISH message
  • step 420 if the connection was not successfully established with an adjacent node, the adjacent node determines if it contains a lower priority connection in the same output link. If there is a lower priority connection, such as from a remote client in the second network, a PREEMPT procedure is run in step 421, which is described further below. If there is not a lower priority connection, in step 422 the adjacent node determines whether another output link is available. If another output link is available, the adjacent node attempts to selects another output link in step 402. If another output link is not available, the adjacent node sends a REQ_CLOSE message to the preceding node in step 418.
  • a lower priority connection such as from a remote client in the second network
  • FIG. 7 shows an exemplary sequence of steps for the PREEMPT procedure.
  • step 500 a given node, such as the client Cal, generates a REQ_CLOSE message and sends it to succeeding and preceding nodes, e.g., router Ra4.
  • step 502 the nodes delete the record corresponding to the connection from its CMT based upon information in the REQ_CLOSE message, which identifies the connection to be closed.
  • the node e.g., Ra4, sends a REQ CLOSE message to preceding and succeeding nodes, e.g cauliflower Ra3, in step 504.
  • the succeeding and preceding node delete the corresponding record from their respective CMTs in step 506, and forward the REQ_CLOSE message to further preceding and succeeding nodes in step 508 until the terminal nodes are reached in step 510. It is understood that for a terminal node, there is only a preceding node as in the present example.
  • FIG. 9 shows an exemplary sequence of steps for handling a link failure in the network to allow a detour connection around the failed link.
  • a node receives a REQ LINKFAILURE message generated by a device or software that detects the link failure in the same node. The node closes the connection for each input link corresponding to the failed link in step 552.
  • the node sends a REQ-CLOSE message to the succeeding node in the connection in step 556, and in step 558, the node attempts to establish a new connection such as by running the ESTABLISH CONNECTION procedure (FIG. 6). In step 560, if the connection is successfully established the procedure terminates. If the connection is not established, in step 562, it is determined if the node is a terminal node. If the node is a terminal node, in step 564, the terminal node sends a REQ CLOSE message to the preceding node.
  • step 566 if the node is not a terminal node, the connection is closed, i.e., the record is deleted from the CMT, and in step 568, the node sends a REQ DETOUR message to the preceding node and attempts to establish a new connection in step 558 based upon the information in the REQ_DETOUR message, which is described below.
  • FIG. 10 shows an exemplary implementation for migrating a connection to a neighboring node in accordance with the present invention.
  • a given server e.g., a sensor
  • receives a new request from a client determines its availability, and determines whether to accept, modify, or attempt to migrate the request to another sensor having a similar FOV.
  • a sensor e.g., Sa2 receives a REQ_ESTABLISH message from a client, e.g., Ca2.
  • the sensor Sa2 responds to the client request in a number of possible ways including refusing the request, degrading request and/or connection bandwidth, terminating an existing connection to service the new request, and selecting a neighboring node for migrating the request or existing connection.
  • the sensor determines whether the BW requirements of the request can be satisfied in view of the current load of the sensor. If the sensor can handle the request, the requested connection is established in step 603. The connection can be established with the ESTABLISH_CONNECTION procedure, for example. If the request BW can not be satisfied, the sensor determines whether the request BW can be satisfied by degrading the BW of the request and/or connection to a minimum bandwidth in step 604. The minimum bandwidth is a parameter that can form part of the R£Q_ESTABLISH message, as shown and described in conjunction with Table 4, for example. If BW degradation allows the sensor to service the request, the sensor decreases the bandwidth of the request and/or one or more existing connections as needed, in step 606.
  • the priority of the request and connections can be used to reduce the bandwidths.
  • the requested connection can be established in step 607. If the request can be serviced by degrading the bandwidth(s), the sensor determines in step 608 whether there any active neighboring nodes.
  • the sensor determines in step 616 if there any connections at the output link that have a lower priority than the request. If there are no lower priority connections, the request is refused in step 620. If there is a lower priority connection, it is terminated in step 618 and the requested connection can be established in step 619.
  • the sensor determines in step 610 whether there are any lower priority connections than the requested connection. If there is not a lower priority connection, the sensor attempts to migrate the request to a neighboring node in step 614. If there is a lower priority connection, the sensor attempts to migrate the lower priority connection to the neighboring node in step 612.
  • each sensor includes a neighboring node table (NNT) that includes information regarding the similarity of the FOV of the other sensors.
  • NNT neighboring node table
  • the neighboring node table is used to identify the sensor having the most similar FOV to the node from which the connection is being migrated. Table 3
  • each sensor e.g., Sal
  • each sensor includes a neighboring node table having fields containing the IP address of the other sensors Sa2,Sa3 and a relative value indicative of the similarity between FOV of the first sensor and the sensors.
  • the sensor attempts to migrate the request or an existing connection, in step 622, the sensor sends a REQ_MIGRATE message to the selected neighboring node and attempts to establish a connection in step 624.
  • step 626 it is determined whether the connection with the neighboring node was established. If the connection is not established, a REJECT MIGRATE message is sent in step 628, and if a connection is established an ACK_MIGRATE message is sent in step 630.
  • the neighboring node then sends a NOTIFY_MIGRATE message to clients having an existing connection with the node in step 632.
  • existing connections are terminated as needed to service the requested connection.
  • Table 4 Exemplary formats for the messages described above are set forth in Tables 4- 8.
  • the header field identifies the message type, e.g., REQ_ESTABLISH message.
  • the REQ ESTABLISH message includes BW requirement fields that define the resources needed for the connection. Based on the bandwidth requirements in the message, the node can accept, refuse, modify, or migrate (for a sensor for example) the connection request, as described above.
  • the REQ_ESTABLISH message includes fields for a maximum bandwidth requirement, a minimum bandwidth requirement, an average bandwidth requirement, and a bandwidth share percentage.
  • the router transmits all packets to the output link as long as the sum of the current bandwidth (number of packets*size/time) does not exceed the connection bandwidth.
  • the bandwidth parameters in the REQ ESTABLISH message allow the route to make BW sharing decisions. If the output link BW is exceeded, the router may drop packets in a connection.
  • the share percentage if less than one hundred percent for example, would enable the connection bandwidth to be shared with other connections having compatible sharing percentages.
  • the REQ_ESTABLISH message can further include a seventh layer switching indicator to enable protocol conversion, as described below.
  • the traffic type field identifies the type of traffic, e.g., video, for protocol conversion or dynamic priority determinations for example.
  • the REQ_ESTABLISH message can also include first, second, and third priority parameters that can determine the priority of the connection. This arrangement provides some control over connection prioritization to a client. In addition, multiple clients, such as the clients Cal-3 connected to the first network, can make intelligent decisions regarding the priority of connections among the sensors Sal -3.
  • the first priority parameter corresponds to a time factor.
  • the first priority parameter can be set to a predetermined value that can be increased in the case where an elapsed time becomes greater than desired. For example, the first priority parameter is five but if the elapsed time is greater than ten seconds, the first priority parameter is increased to eight. Elapsed time refers to the time from the connection is established to the current time.
  • the second priority parameter can correspond to a situation factor.
  • the third priority parameter can be a constant value, which can vary for each terminal to prevent terminals from having the same priority under similar conditions.
  • an application program in the sensor can increase the priority of a connection upon detecting certain conditions by sending a SITUATION ON message to an adjacent node. The message is forwarded to each router in the connection so as to increase the priority of the connection. If an application program in the sensor detects an emergency condition, such a fire, the program can send a SITUATION_ON message. The program can send a SITUATION OFF message to change the connection priority back to normal.
  • the first, second, and third priority parameters provide a programmable priority function F(p).
  • F(t) is a priority factor assigned to each terminal
  • F( c) is a condition factor that represents the condition of each terminal
  • F( n) is a priority condition factor that represents the conditions of the neighboring terminals.
  • a traffic monitoring camera and a normal cellular phone can have 10 and 0 points as their F(t) values, respectively.
  • F( c) can be 20 for calling 911 and the F(c ) can be 0-30 points for depending on the image processing data transfer requirements.
  • the F( c) value can also vary depending on other factors.
  • the F( c) value can be 30 for sending a 128x128-pixel image once every second while the F( c) value can be 5 for sending 640x480-pixel image every 33msec.
  • a server e.g., a camera sensor
  • a client can each provide the priority parameters in a REQ_ESTABLISH message.
  • a client e.g., Cal
  • the client would know the priority factors for the sensor.
  • a sensor attempts to establish a connection, it can determine the priority parameters. For example, if a sensor detects a problem based on acquired image date, e.g., a traffic accident for a vehicle traffic surveillance network, the sensor can attempt to establish a connection with a relatively high F(c ), for example.
  • nodes send the REQ CLOSE message to adjacent nodes in a connection until the terminal nodes are reached.
  • a node such as a router deletes the record corresponding to the connection from its connection management table (CMT).
  • CMT connection management table
  • the switching fabric 306 in a router 300 can detect a link failure in a conventional manner. Upon detecting the link failure, the router sends a
  • REQ LINKFAILURE message to other nodes affected by the failure.
  • a router receiving a REQ LINKFAILURE message closes connections to the failed input link and attempts to establish a new connection to replace the failed output link. If a new connection can not be established a REQ_DETOUR message is sent to a preceding node to find an alternate connection path in accordance with a predetermined routing scheme.
  • the REQ_DETOUR message is sent by a node with a failed output link to a preceding node to establish an alternate routing path, as described above.
  • all the available routes for a connection between two nodes are determined by the routing tables in the routers. These routers are prioritized by the output link lists in the routing tables. Thus, a failed link is avoided by connecting to another node in accordance with a predetermined order. Table 8
  • IP address of requested node load to be migrated IP address of requested node load to be migrated
  • MIGRATE messages cooperate to migrate a client request from one node to another.
  • the sensor has four options: refuse the new request; degrade the bandwidth of the new request; terminate an existing connection to service the new request; or migrate the request to a neighboring node.
  • a neighboring node which can have the most similar FOV for a camera system
  • the first sensor sends a REQ_MIGRATE message to the selected neighboring node, which then responds by sending a REJECT MIGRATE message to the first sensor or an ACK MIGRATE message.
  • the accepting neighboring node then sends NOTIFY MIGRATE messages to clients having lower priority connections that will be closed.
  • a router having connections with first and second networks converts traffic from one protocol to another depending upon the type of data being sent.
  • protocol conversion information is contained in certain fields of the REQ_ESTABLISH message described above.
  • a protocol for a connection can be converted when passing from an input link to an output link of a router (switch) according to the type of the traffic, e.g., video, audio, data, etc.
  • Protocol conversion can be based upon a variety of factors including bit-error-rate of links, delay requirements, and security requirements.
  • Protocol conversion in accordance with the present invention is applicable for routing between an intranet, which can provide high security and high reliability, and the Internet, where security and reliability parameters are generally lower than intranets.
  • security and reliability parameters are generally lower than intranets.
  • the Internet one may want to use the UDP protocol, for example, to avoid unpredictable retransmission of TCP protocol from interrupting smooth transmission of video traffic.
  • a router between an intranet and the Internet converts the protocol of the video traffic from TCP to UDP protocol when the traffic passes from the intranet to the Internet through the router.
  • a protocol supporting encryption of the traffic can be used in the Internet that is unnecessary within the intranet.
  • a router adds a security protocol, such as SSL or IP- SEQ, to the traffic which goes out to the Internet.
  • a protocol conversion can be done between a wired network and a wireless network having a packet-loss ratio higher than the wired network, between different ISPs (internet service providers) that provide different quality of service, and between intranets and the Internet.
  • the second network PRNb which can be an intranet
  • the third network PUNc which can be the Internet
  • the router Rbl can include a protocol conversion table an exemplary embodiment of which is set forth in Table 12.
  • the REQ ESTABLISH message which is described in conjunction with Table 4 above, can provide the type of traffic content for a connection that can form the basis for the conversion.
  • a router For each connection, a router will check whether protocol conversion is specified for the connection in the connection management table. If the connection includes protocol conversion, the router will read the type of traffic content from the table and the protocol suites specified for the first and second networks that are connected to each other through the router. If the router cannot find a record for the type of traffic content, the router will not do any protocol conversion. If found, the router converts the protocols of the traffic in the manner specified by the protocols.
  • the integrated network can assign a priority to each transmission request.
  • priority assignments include unconditional and conditional assignments. With an unconditional assignment, each terminal has an assigned priority. For example, traffic surveillance cameras have a higher priority than cellular phones. With conditional priority assignment, the priority of each terminal changes depending on conditions.
  • a traffic monitoring terminal can include a camera and an image processor that can detect a traffic incident by analyzing the images acquired by the camera. With the conditional assignment scheme, the priority of this terminal is increased when the incident is detected by the image processor. Preferably, all the traffic monitoring terminals do not have identical priority. The terminals should have different priorities so that one of them is selected for communication.
  • terminals in the integrated network contribute to the priority control. For example, if all the terminals that were turned down by the routers keep sending transmission requests every second, the network must spend a large portion of its resources to continue masking out low-priority requests.
  • Each terminal can include a function to hold a transmission request for a certain time period that is determined by the routers based on traffic conditions. The terminals can also select the data to be transmitted within the assigned data amount.
  • a first option is to choose one camera.
  • Another option is to decrease the image resolution of the first camera to a half, for example, and decrease the image resolution of second and third cameras to a quarter.
  • a further option is to decrease the number of image frames per second instead of the image resolution. Additional options for altering the bandwidth will be readily apparent to one of ordinary skill in the art.
  • the terminal can selected the best option within the available capacity.
  • an integrated network provides enhanced quality of service.
  • One conventional protocol is known as the resource reservation protocol (RRP), which reserves a communication line so that video information can be transmitted continuously in real-time for TV conferences.
  • RRP resource reservation protocol
  • the quality of service provided by RRP does not match many of intelligent transportation system applications. For example, at a given moment it may be important to transmit image data from a traffic monitoring first camera to the traffic control center. At the next moment, if a larger accident occurs in the area that is covered by a second monitoring camera, the right of communication should be moved from the first camera to the second camera even in the middle of the transmission from the first camera.
  • the present invention provides a conditional resource reservation protocol.
  • a traffic accident occurs in the area monitored by the first camera, which is assigned 50 and 200 priority points for 1Mbps and 200Kbps transmissions, respectively.
  • the right of communication is assigned to all the messages that have 50 or more priority points. If there is more than a 1Mbps communication capacity left, for example, the first camera sends images to the traffic center at the rate of 1Mbps.
  • a new message-request with 60 priority points is raised and that the network does not have enough capacity to accept this request.
  • the data rate from the first camera is decreased from 1Mbps to 200Kbps and its priority points are increased from 50 to 200.
  • the integrated network includes a distributed control capability to handle concentrated access with minimum cost.
  • access to traffic monitoring cameras will be uneven. More particularly, clients may not try to access a camera terminal if its terminal processor indicates that the traffic is flowing smoothly in the area monitored by that terminal. In contrast, there may be many requests to access the camera that covers a severe traffic accident.
  • the routers in the integrated network include a function to switch among unicast, multicast, and broadcast modes depending on the form and degree of the concentration. The routers can also create mirror terminals to eliminate over- access to a particular terminal.
  • traffic monitoring camera #1 gets three requests for images from internet addresses A( >B, C@B. and D@E.
  • the communication is reconfigured for one multicast to A(S>B and C@B and one unicast to D@E.
  • the number of multicast service clients at domain B is two.
  • the communication service from camera #1 to the clients in domain B is switched to the broadcast service if the number of clients exceeds the programmed threshold value.
  • the number of accesses to a certain terminal exceeds the capacity of that terminal, its neighboring terminals become its mirror servers. If the access rate is larger than the capacity of those neighboring terminals, the neighboring terminals of the original neighboring terminals also become minor terminals. The number of the mirror servers increases until the access rate becomes within the acceptable range. The number of the mirror servers decreases when the access rates become lower than the lower threshold.
  • an integrated network includes a higher level protocol which defines what protocol is utilized at each link. For example, suppose that it is desired to send image data from camera #1 to a local control station by a wireless network and then from the local control station to the traffic control center by an optical fiber. The error rate for optical fibers is significantly lower compared to wireless communication.
  • the high level protocol utilizes, for example, the TP++ protocol and the user datagram protocol for the links between the camera and the local control station and the local control station and the traffic center, respectively.
  • the error control scheme can be chosen by both the error rate of each link and the nature of each message.
  • the high level protocol includes a representation of the acceptable error rate for each message, and the error rate of each link is stored in associated routers.
  • an integrated network includes a network scheme that includes multiple subsets of networks.
  • higher security requires higher cost.
  • the required security levels of the messages transmitted through an integrated network in accordance with the present invention is diversified significantly. For example, electronic transactions need higher security than the broadcast of weather forecast.
  • Conventional network security research developed a number of technologies that increase the security level.
  • SSL and IPSEC are examples of encryption techniques.
  • Each network subset has a different security level, and the servers for the higher security network have tighter management by certified institutions. Messages are assigned to appropriate subsets of networks to satisfy their security requirements with minimum cost. At the same time, messages can be assigned to different security networks for a better load balance among network subsets.
  • the integrated network includes a hierarchy of security levels.
  • the integrated network includes several subsets of networks for several different security levels.
  • the police network can be divided into three security levels: highest, higher, and high security networks.
  • the highest security network is isolated from others and is not integrated into the network.
  • the high security network is integrated into the network.
  • the high security police messages are transferred only through police servers if possible. If not, those messages are transferred through other secured network such as bank networks.
  • Those messages can be transferred through normal public network if the capacity of all the secured networks is not large enough. Those messages are protected only by encryption technologies while being transferred through normal public network. Secured networks are safer because the servers of secured network are controlled by certified institutions.
  • the higher security network is normally isolated from the integrated network, but it is connected to the integrated network immediately in case of emergency. In other words, the higher security network is the same with the highest one under normal conditions and is the same with the high security network in emergency cases.
  • an integrated network includes an option control for integrating connection and connectionless communication schemes.
  • the connection scheme establishes a connection before starting the communication, and keeps the connection until the communication is completed.
  • connection scheme As known to one of ordinary skill in the art, telephone calls, for example use a connection scheme. It is less efficient because the communication line is idle while neither person is speaking. Internet takes the connectionless scheme in which the messages are divided into packets and the packets are transferred independently. The packets for a single message may be transferred through different routes and the earlier packet may be delivered to the destination later. Connectionless schemes are more efficient but cannot be used for telephone applications directly because it can not guarantee that the voice information is delivered within a certain time period.
  • a conventional solution for using the connectionless scheme for telephone applications is a reservation method. With the reservation method, a communication line is reserved to guarantee the delivery of voice information within a certain time period. This method is effective but hurts the efficiency of the network, because the reservation method has both the drawbacks and merits of the connection scheme.
  • An option right in accordance with the present invention, can keep a certain communication line assigned to a pair of clients.
  • the communication line is used by them if either client is speaking.
  • the communication line becomes available to the other clients if neither is talking.
  • the communication line is assigned back to the clients who have the option when either of them resumes talking.
  • images acquired by surveillance cameras are converted into edge images to protect the privacy of individuals, for example. It is desirable to get images that are acquired by TV cameras installed at key points on roads for knowing traffic conditions and for finding the best route to a destination.
  • One problem with providing such images is privacy protection.
  • Edges are defined as points where the intensity changes significantly in spatial scanning.
  • the edge images can be in either binary or gray-level.
  • the edge images represent shapes of cars very well although they do not show human faces well because the intensity change over the human face is continuous and there is no clear edges.
  • images acquired by roadside TV cameras are compressed and transferred to local stations. Conventionally, the local stations decompress the compressed images and recognize whether they include incidents. The compressed images are further transferred to upper level stations if incidents are recognized in the images. It would, however, be desirable if the local stations can carry out recognition processes without decompressing the compressed images.
  • a compression method provides recognition processing without decompressing the compressed images.
  • the image is segmented by edges and other information.
  • the intensity and color of each segmented section are represented as a group.
  • a typical group representation form is a linear representation with which it is assumed that the intensity and color change linearly in space within each segment.
  • an integrated network includes multiple networks that are funded by different institutions.
  • the first private network 10 needs to pay some fee to the second public network 20 if A and B communicate through X and Y.
  • the routers in the integrated network that connect difference ones of the networks 10,20,30,40 include a cost control function that allocates costs based on the traffic between the networks.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Emergency Management (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Telephonic Communication Services (AREA)

Abstract

L'invention concerne un réseau intégré qui donne la priorité au trafic de messages associé à un premier réseau, par rapport au trafic de messages associé à un second réseau, une configuration qui permet l'intégration d'un réseau privé du type réseau de communication d'urgence à un réseau public du type réseau cellulaire, sans que le trafic du réseau cellulaire ne bloque le trafic du réseau de communication d'urgence. Il est possible d'établir des connexions prioritaires qui l'emportent sur des connexions non prioritaires. Le réseau intégré considéré peut transférer une demande depuis un premier noeud vers un noeud voisin et procéder à un réacheminement en établissant une connexion qui contourne telle ou telle connexion défaillante.
PCT/US2000/040207 1999-06-18 2000-06-15 Systeme de reseau integre Ceased WO2000079719A2 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US09/763,142 US6996630B1 (en) 1999-06-18 2000-06-15 Integrated network system
JP2001515893A JP2003506985A (ja) 1999-06-18 2000-06-15 統合網及び統合網において通信経路を選択する方法

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US14028499P 1999-06-18 1999-06-18
US60/140,284 1999-06-18

Publications (2)

Publication Number Publication Date
WO2000079719A2 true WO2000079719A2 (fr) 2000-12-28
WO2000079719A3 WO2000079719A3 (fr) 2001-07-05

Family

ID=22490560

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2000/040207 Ceased WO2000079719A2 (fr) 1999-06-18 2000-06-15 Systeme de reseau integre

Country Status (2)

Country Link
JP (1) JP2003506985A (fr)
WO (1) WO2000079719A2 (fr)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002067499A1 (fr) * 2001-02-23 2002-08-29 Telefonaktiebolaget Lm Ericsson Transmission de donnees electroniques via une infrastructure reseau
DE10354323A1 (de) * 2003-11-20 2005-06-30 Siemens Ag Effiziente Ausfall- und Störungssicherung für Kommunikationsnetze
WO2007054612A1 (fr) * 2005-11-11 2007-05-18 Telcont Oy Procede et dispositif terminal permettant de recevoir et/ou de transmettre une information d'alarme, d'etat et/ou de commande
EP2131562A1 (fr) 2008-05-14 2009-12-09 AT&T Mobility II LLC Modification de la priorité attribuée à une session active de données ou vocale
RU2659469C1 (ru) * 2017-09-13 2018-07-02 Олег Иванович Завалишин Способ глобального мониторинга жизнеобеспечения региона с помощью единой сети локальных контрольно-корректирующих станций
US12034570B2 (en) 2022-03-14 2024-07-09 T-Mobile Usa, Inc. Multi-element routing system for mobile communications

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006215977A (ja) * 2005-02-07 2006-08-17 Sumitomo Electric Ind Ltd 交通管制システム

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5237695A (en) * 1991-11-01 1993-08-17 Hewlett-Packard Company Bus contention resolution method for network devices on a computer network having network segments connected by an interconnection medium over an extended distance
US5555244A (en) * 1994-05-19 1996-09-10 Integrated Network Corporation Scalable multimedia network
EP0714192A1 (fr) * 1994-11-24 1996-05-29 International Business Machines Corporation Procédé pour la préemption de connections dans un réseau de commutation de paquets à haute vitesse
US5699347A (en) * 1995-11-17 1997-12-16 Bay Networks, Inc. Method and apparatus for routing packets in networks having connection-oriented subnetworks

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002067499A1 (fr) * 2001-02-23 2002-08-29 Telefonaktiebolaget Lm Ericsson Transmission de donnees electroniques via une infrastructure reseau
DE10354323A1 (de) * 2003-11-20 2005-06-30 Siemens Ag Effiziente Ausfall- und Störungssicherung für Kommunikationsnetze
WO2007054612A1 (fr) * 2005-11-11 2007-05-18 Telcont Oy Procede et dispositif terminal permettant de recevoir et/ou de transmettre une information d'alarme, d'etat et/ou de commande
EP2131562A1 (fr) 2008-05-14 2009-12-09 AT&T Mobility II LLC Modification de la priorité attribuée à une session active de données ou vocale
US8300792B2 (en) 2008-05-14 2012-10-30 At&T Mobility Ii Llc Changing assigned priority of active voice or data session
RU2659469C1 (ru) * 2017-09-13 2018-07-02 Олег Иванович Завалишин Способ глобального мониторинга жизнеобеспечения региона с помощью единой сети локальных контрольно-корректирующих станций
US12034570B2 (en) 2022-03-14 2024-07-09 T-Mobile Usa, Inc. Multi-element routing system for mobile communications

Also Published As

Publication number Publication date
WO2000079719A3 (fr) 2001-07-05
JP2003506985A (ja) 2003-02-18

Similar Documents

Publication Publication Date Title
US6996630B1 (en) Integrated network system
US10547528B2 (en) Emergency network services by an access network computing node
US7489687B2 (en) Emergency bandwidth allocation with an RSVP-like protocol
US7911959B2 (en) System and method for providing integrated services across cryptographic boundaries in a network
US6931011B2 (en) Method and systems for bandwidth management in packet data networks
CN114391250B (zh) 带宽管理方法及装置、计算机存储介质及芯片
US8254412B2 (en) Implementing priority based dynamic bandwidth adjustments
JP2003199144A (ja) リソース制御システム、リソース制御方法、及びこれらに用いて好適な基地局及び移動局
EP1176766A1 (fr) Réseau de télécommunications avec accords de qualité de service basée sur la priorité
US7457287B1 (en) System and method for assigning call priority
US12457251B2 (en) Voice call controller
CN1409526A (zh) 用于网络信令资源有效利用的智能路由
US20120221706A1 (en) Method and arrangement for network resource management
CN100499459C (zh) 一种实现下一代网络中信息流传输的方法
WO2000079719A2 (fr) Systeme de reseau integre
JP3438857B2 (ja) ネットワークの通信品質制御システム及びトラフィック管理装置
US8239534B1 (en) Precedence adjusted resource allocation
US12477399B2 (en) Method and apparatus for edgeless enterprises
CN115379016B (zh) 资源访问方法、访问服务平台、装置、设备及存储介质
JP2005527127A (ja) 移動インターネットプロトコルベースのネットワーク上でのルータ発見プロトコル
JP4549435B1 (ja) トラフィック制御装置及びトラフィック制御システム
EP1612674A2 (fr) Méthode et système de contrôle d'admission
US20250113200A1 (en) Wireless access control via configuration settings
JP4473227B2 (ja) リソース管理装置、通信システムおよび通信方法
JP4831605B2 (ja) 通信システムおよびその発呼規制方法ならびに視聴者端末

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): JP US

ENP Entry into the national phase

Ref country code: JP

Ref document number: 2001 515893

Kind code of ref document: A

Format of ref document f/p: F

AK Designated states

Kind code of ref document: A3

Designated state(s): JP US

WWE Wipo information: entry into national phase

Ref document number: 09763142

Country of ref document: US