Methods and systems for communicating SS7 messages over packet-based network using transport adapter layer interface

Information

  • Patent Grant
  • 7525997
  • Patent Number
    7,525,997
  • Date Filed
    Tuesday, July 19, 2005
    18 years ago
  • Date Issued
    Tuesday, April 28, 2009
    15 years ago
Abstract
A transport adapter layer interface (TALI) includes messages, processes, and packet structures for sending and receiving SS7 information over a stream-oriented connection, such as a TCP/IP connection. For example, the TALI interface includes test messages for testing the status of a connection and allow and prohibit messages for enabling and disabling service data communications without invoking a TCP handshaking procedure. The TALI interface also includes SYNC and LENGTH fields for facilitating extraction of individual message packets over a stream-oriented connection.
Description
TECHNICAL FIELD

The present invention relates to methods and systems for communicating SS7 messages over a packet-based network. More particularly, the present invention relates to methods and systems for communicating SS7 messages over a packet-based network using a transport adapter layer interface.


BACKGROUND ART

The traditional public switched telephone network (PSTN) consists of signaling nodes connected via dedicated signaling system 7 (SS7) signaling links. The three primary types of signaling nodes in the conventional PSTN network are service switching points (SSPs), signal transfer points (STPs), and service control points (SCPs). Service switching points are end office switches that handle both voice and data traffic. Signal transfer points are switching nodes that route SS7 messages between SS7 signaling points. Service control points are databases and associated computers that provide data in response to SS7 queries. Examples of such data include billing information, 800 number translation information, and number portability information.


These conventional SS7 nodes have typically communicated by sending SS7 messages to each other over dedicated SS7 signaling links. While such signaling links provide a highly reliable means for communicating SS7 traffic, SS7 signaling links provide only fixed bandwidth to a user regardless of the user's needs. As a result, users must install or lease sufficient call signaling bandwidth to handle peak or worst-case traffic conditions. Installing or leasing sufficient call signaling bandwidth for peak conditions is inefficient since peak conditions rarely occur. Moreover, because SS7 call signaling bandwidth is expensive, there exists a need for an alternative to dedicated SS7 signaling links.



FIG. 1 is a block diagram of the conventional PSTN network. In FIG. 1, SSPs 100 and 102 communicate with SSPs 104 and 106 through STPs 108, 110, 112, and 114. SCP database nodes 116 and 120 provide data in response to queries from SSPs 100, 102, 104 and 106 and/or from STPs 108, 110, 112, and 114. All of the lines interconnecting the nodes in FIG. 1 represent conventional SS7 signaling links. As stated above, such links are often under-utilized and are expensive to install or lease.


In packet-based networks, such as transmission control protocol/Internet protocol (TCP/IP) networks, bandwidth can be shared among multiple users. In addition, the growth and popularity of the global Internet have made components for such networks readily available and cost efficient. However, integrating the traditional PSTN network with a packet-based network, such as a TCP/IP network, creates a number of problems.


For example, one problem with sending traditional call signaling traffic over a TCP/IP network is that in a TCP/IP network, transmissions between a sender and a receiver are stream-oriented. That is, TCP software on a sending machine is not guaranteed to send data in the same boundaries defined by a sending application. The amount of data sent over a TCP connection depends on the window size advertised by the receiver, the number of bytes of data that have been acknowledged by the receiver, and the maximum segment size of the physical network connecting the sender and the receiver. Accordingly, the receiving application may not receive data in the same boundaries created by the sending application. Thus, when sending call signaling messages over a TCP/IP network, several messages may be combined in one TCP segment. Alternatively, a single call signaling message may be divided among multiple TCP segments. In conventional networks, it is the job of the receiving application to parse the incoming data stream and extract the individual packets. Such parsing is difficult and increases the complexity of application programs that utilize TCP.


Another problem with sending conventional call signaling messages over a TCP/IP connection is that the timeout period for disabling a connection in TCP is too long for call signaling applications. For example, some implementations of TCP include a keep-alive timer. The keep-alive timer is reset every time a TCP segment is received. When the timer expires, it causes one side of the connection to determine if the other side is still operating. No mechanism is specified in the TCP protocol specifications for determining whether the other side is operating. In addition, the timeout period for the keep-alive timer is on the order of minutes. Thus, one side of a connection could go down and the other side could wait for minutes before resetting the connection. Such a long timeout period wastes resources on the machine that is waiting for data from the other side and is unsuitable for telephony applications.


Yet another problem with integrating conventional telephony and packet-based networks, such as TCP/IP networks, is that TCP/IP requires lengthy handshake procedures for connection establishment and termination. For example, in order to establish a TCP connection, a client application sends a synchronization (SYN) packet to a server application. The server application then sends an acknowledgement (ACK) and a SYN back to the client. The client then sends an acknowledgement to the SYN+ACK from the server. During the initial exchange of SYN and ACK messages, the client and server exchange sequence numbers. Once the client sends acknowledgement to the SYN+ACK to the server, the TCP software on the client machine is in an open state in which data can be received from the server and data from the sending application can be sent to the server.


In order to terminate a TCP connection, when an application closes a connection, the TCP software associated with that application sends a FIN packet to the TCP software on the other side of the connection. The TCP software of the machine that receives the FIN sends an ACK to the FIN and informs the application that a FIN has been received. If the application is finished sending data, the application closes the connection. In response to the application close, the TCP software sends a FIN to the TCP software that sent the original FIN. In response to receiving the FIN, the TCP software sends an ACK. Once this ACK is sent, the connection is considered to be closed by both sides of the connection.


While TCP connection establishment and termination procedures have proven to be reliable and account for a variety of error conditions, such procedures are cumbersome and require many round trip times in order to complete. For example, in TCP connection establishment, a minimum of 1.5 round trip times is required. In the TCP connection termination scenario described above, at least two round trip times are required. In addition, TCP software on both sides of the connection is required to maintain state and perform additional processing during connection establishment and termination.


For all of these reasons, the number of occurrences of TCP connection establishment and termination procedures should be minimized. For example, if it is desired to upgrade software in a telephony device that currently communicates with a remote device over a TCP connection, the connection must be terminated. Connection termination requires the handshaking procedure discussed above. Once the software is upgraded, the connection must be reestablished. Connection reestablishment requires the three-way handshaking procedure described above. Thus, performing a software upgrade requires an initial TCP connection establishment, a TCP connection termination, followed by another TCP connection establishment. These procedures waste resources and should be minimized, especially in high-traffic telecommunications switches.


In light of all these difficulties associated with integrating conventional telephony networks, such as SS7 networks, and stream-oriented packet-based networks, such as TCP networks, there exists a need for novel methods and systems for integrating these networks that avoid at least some of the difficulties associated with the prior art.


DISCLOSURE OF THE INVENTION

The present invention includes methods and systems for communicating SS7 messages between signaling nodes over a packet-based network using a transport adapter layer interface. As used herein, the phrase transport adapter layer interface refers to an interface that resides above the transport layer in the TCP protocol stack that facilitates integration between the SS7 protocol stack and the TCP/IP protocol stack. Such an interface includes functionality for prohibiting and allowing communications over a socket without invoking conventional TCP connection establishment and termination handshaking procedures. In addition, the interface provides monitor and test messages that are respectively used to measure performance and test the status of a connection. The interface also provides a mechanism for encapsulating SS7 messages that allows individual message identification over a stream-oriented connection.


Embodiments of the invention will be described below as modules, layers, or processes for implementing SS7 and IP communications functions. It is understood that these modules, layers, or processes can be implemented as hardware, software, or a combination of hardware and software. For example, transport adapter layer interface functionality is described below as a process implemented on a data communications module. The data communications module may include hardware, such as a microprocessor and associated memory, for executing and storing programs. The TALI process may be executed by the microprocessor to perform the TALI functions described below.


Accordingly, it is an object of the invention to provide novel methods and systems for communicating SS7 messages over a stream-oriented packet-based network that avoids the problems with conventional stream-oriented packet-based networks.


It is another object of the invention to provide methods and systems for allowing and prohibiting service data communications over a stream-oriented connection without invoking a TCP handshaking procedure.


It is yet another object of the invention to provide methods and systems for identifying message packets received over a stream-oriented connection.


Some of the objects of the invention having been stated hereinabove, other objects will be evident as the description proceeds, when taken in connection with the accompanying drawings as best described hereinbelow.





BRIEF DESCRIPTION OF THE DRAWINGS

Preferred embodiments of the invention will now be described with reference to the accompanying drawings of which:



FIG. 1 is a block diagram illustrating the conventional PSTN network;



FIG. 2 is a block diagram of an exemplary operating environment for embodiments of the present invention;



FIG. 3 is a block diagram of a signaling gateway capable of sending SS7 messages over a packet-based network using a transport adapter layer interface according to an embodiment of the present invention;



FIGS. 4(
a) and 4(b) are block diagrams illustrating the relationships between the SS7 and IP protocol stacks and methods for integrating the protocol stacks using a transport adapter layer interface according to embodiments of the present invention;



FIG. 5 is a block diagram illustrating an exemplary packet structure for encapsulating of SCCP messages using a transport adapter layer interface according to an embodiment of the present invention;



FIG. 6 is a flowchart illustrating exemplary steps that may be performed by a signaling gateway in encapsulating SCCP messages using a transport adapter layer interface according to an embodiment of the present invention;



FIG. 7 is a block diagram illustrating an exemplary packet structure for encapsulating MTP3 messages using a transport adapter layer interface according to an embodiment of the present invention;



FIG. 8 is a block diagram illustrating an exemplary packet structure for encapsulating SS7 messages using an ATM adaption layer and a transport adapter layer interface according to an embodiment of the present invention;



FIG. 9 is a flowchart illustrating exemplary steps for identifying individual message packets received over a stream-oriented connection according to an embodiment of the present invention;



FIG. 10 is a flowchart illustrating exemplary steps for monitoring connection status using transport adapter layer interface messages according to an embodiment of the present invention;



FIG. 11 is a flowchart illustrating exemplary steps for allowing and prohibiting communications using a transport adapter layer interface according to embodiments of the present invention; and



FIG. 12 is a flowchart illustrating exemplary steps for measuring round trip time using transport adapter layer interface messages according to an embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION


FIG. 2 illustrates an exemplary operating environment for embodiments of the present invention. In FIG. 2, conventional SS7 network elements, such as SSPs 200, 202, and 204 and SCP 206, communicate with each other over SS7 network 208. IP nodes, such as media gateways (MGs) 210, 212, and 214, media gateway controllers (MGCs) 216 and 218 and Internet service provider (ISP) 220, communicate with each other over first packet-based network 222. Similarly, signaling gateways 224 and 226 communicate with MGCs 216 and 218 and with SCP 228 via second packet-based network 230. First and second packet-based networks 222 and 230 may each comprise IP networks. Moreover, first and second packet-based networks 222 and 230 may be the same logical network. The reason that networks 222 and 230 are illustrated separately in FIG. 2 is that first packet-based network 222 carries packetized media stream communications between MGs, and media control information between MGCs and MGs, and second packet-based network 230 carries call signaling traffic to and from SGs 224 and 226.


The conventional SS7 network elements, such as SSPs and SCPs, are described in detail above. Hence a description thereof will not be repeated herein. The additional network elements illustrated in FIG. 2 include media gateways 210, 212, and 214, media gateway controllers 216 and 218, signaling gateways 224, and 226, and Internet service provider (ISP) 220. Media gateways 210, 212, and 214 encapsulate media stream communications, such as audio, video, and data, in IP packets to be transmitted over first packet-based network 222. An example of a protocol used to send media stream communications over a packet-based network is the real time protocol (RTP) as defined in RFC 1889, RTP: A Transport Protocol for Real Time Applications, Jacobson et al., January 1996.


MGCs 216 and 218 control MGs 210, 212, and 214 using a control protocol. An example of a control protocol that may be implemented by MGCs 216 and 218 is the media gateway control protocol as described in Media Gateway Control Protocol (MGCP), http://search.ietf.org/internet-drafts/draft-huitema-mejaco-mgcp-v0r1-05.txt, Feb. 21, 1999. ISP 220 provides Internet services to subscribers. Accordingly, ISP 220 may include a network access server to provide user access to the Internet.


Signaling gateways 224 and 226 implement an interface between SS7 network 208 and second packet-based network 230. In a preferred embodiment of the invention, signaling gateways 224 and 226 provide a transport adapter layer interface to allow conventional network elements, such as SSPs 200, 202, and 204, to communicate with IP network elements, such as MGCs 216 and 218. However, the transport adapter layer interface is not limited to communications between SSPs and MGCs. For example, the transport adapter layer interface according to embodiments of the present invention may also be used to communicate call signaling messages to IP-based SCPs, such as SCP 228 and other devices equipped with an IP interface.



FIG. 3 is a block diagram illustrating a signaling gateway for implementing transport adapter layer interface functionality according to an embodiment of the present invention. In FIG. 3, signaling gateway 224 includes SS7 link interface module (LIM) 300 for sending and receiving SS7 messages over an SS7 network and data communications module (DCM) 302 for sending and receiving SS7 messages over one or more stream-oriented connections. Signaling gateway 224 may also include additional modules, such as database service module (DSM) 304, for providing SCCP and database services. Modules 300, 302 and 304 are connected by an interprocessor message transport (IMT) bus 306. IMT bus 306 is preferably a dual ring counter rotating bus for increased reliability.


Link interface module 300 includes a number of processes for sending and receiving SS7 messages over SS7 links. In the illustrated embodiment, link interface module 300 includes MTP level 1 and 2 process 307 for performing SS7 layer 1 and 2 processing of incoming messages. I/O queue 308 enqueues incoming and outgoing SS7 messages. Message discrimination process 309 determines whether incoming messages are addressed to signaling gateway 224 or to another node. For example, message discrimination process 309 may analyze the SS7 destination point code in an incoming message to determine whether the message is addressed to signaling gateway 224 or to another node. If message discrimination process 309 determines that the message is addressed to signaling gateway 224, message discrimination process 309 forwards the message to message distribution process 310. Message distribution process 310 routes the message to another internal module for further processing.


DSM 304 provides database and SCCP service for SS7 messages. Accordingly, DSM 304 may include signaling connection routing control (SCRC) and SCCP processes 312 and 314 for interpreting SCCP layer information of incoming messages and routing the messages to database process 316. Database process 316 may perform a lookup in database 318 to obtain routing or other information for an incoming message. For example, database 318 may be a number portability database, a circuit identification code routing database, a billing code database, or other database for performing routing or other functionality. Routing process 320 routes the message to the appropriate module for outgoing processing based on MTP layer 3 information in the message.


DCM 302 includes transport adapter layer interface process 322 for performing transport adapter layer interface functionality. Such functionality includes encapsulating SS7 messages in a transport adapter layer interface packet to be sent over a stream-oriented connection, allowing and prohibiting communication over a stream-oriented connection, monitoring the other end of the stream-oriented connection, etc. DCM 302 preferably also includes a stream-oriented communication process such as TCP/IP process 324. TCP/IP process 324 performs conventional TCP/IP protocol stack functions. Such functions include reliable delivery of TCP/IP packets, flow control, packet sequencing, and other stream-oriented transport functionality.



FIG. 4(
a) is a block diagram illustrating the relationships between the SS7 protocol stack and the transport adapter layer interface protocol stack according to an embodiment of the present invention. In FIG. 4, SS7 protocol stack 400 includes MTP layer 1402, MTP layer 2404, and MTP layer 3406. MTP layer 1402, also referred to as the physical layer, communicates with hardware to send and receive data over a physical medium. MTP layer 2404, referred to as the data link layer, provides error correction/detection and properly sequenced delivery of SS7 message packets. MTP layer 3406, also referred to as the network layer, is responsible for SS7 message routing, message discrimination, and message distribution.


Residing above MTPs layers 1-3 is the user parts and application parts layer 408. User parts and application parts layer 408 is divided into ISDN user part (ISUP) layer 410, signaling connection control part (SCCP) layer 412 and transaction capabilities application part (TCAP) layer 414. ISDN user part layer 410 performs SS7 call setup and call tear-down functions. SCCP layer 412 performs signaling connection control part functions, such as database subsystem addressing. TCAP layer 414 is used for database transactions, such as 800 number translations, number portability transactions, and billing transactions. Finally, SS7 application layer 416 can perform any function that uses the underlying services provided by SS7. Examples of such applications include billing applications, network monitoring applications, etc.


TALI protocol stack 418 includes IP protocol stack portion 420, TALI portion 422, and SS7 portion 424. IP protocol stack portion 420 includes a physical and MAC layer 426, a network layer 428, and a transport layer 430. Physical and MAC layer 426 interfaces with network hardware for communication between connected machines and transports network frames between machines connected to the same network. Network layer 428 handles routing and addressing of datagrams between different physical networks. In a preferred embodiment of the invention, network layer 428 performs addressing and routing functions according to the Internet protocol, such as Internet protocol version 4 or Internet protocol version 6. Transport layer 430 provides communication between application programs. In a preferred embodiment of the present invention, transport layer 430 includes stream-oriented transport software, such as TCP software, for implementing reliable stream-oriented transport between applications.


It should be noted that although TALI protocol stack 418 illustrated in FIG. 4(a) includes MTP3 layer 406, MTP layer 3 functionality, other than processing point codes, is optional and may be omitted from TALI protocol stack 418.


According to an important aspect of the present invention, transport adapter layer interface portion 422 includes functions and packet structures that facilitate interoperability between the SS7 and TCP protocols. For example, transport adapter layer interface portion 422 includes packet structures that facilitate extraction of SS7 packets from a TCP data stream, commands for allowing and prohibiting connections without invoking TCP connection establishment and termination procedures, monitor messages for measuring round trip time, and test messages for determining whether a TCP connection is enabled or disabled. Each of these functions will be discussed in more detail below.


Traditional SS7 devices 436, such as SSPs, STPs, and SCPs, communicate with signaling gateway 224 using SS7 protocol stack 400. TCP/IP devices 438, such as MGCs and IP-based SCPs, communicate with signaling gateway 224 using TALI protocol stack 418. Accordingly, signaling gateway 224 preferably includes software for implementing both SS7 protocol stack 400 and TALI protocol stack 418.


As illustrated in FIG. 3, SS7 protocol stack 400 may be implemented by or on LIM 300 and TALI protocol stack 418 may be implemented by or on DCM 302. However, the present invention is not limited to such an implementation. For example, in an alternative embodiment of the invention, SS7 protocol stack 400 and TALI protocol stack 418 may be implemented on a single card or module within signaling gateway 224 or in another node in which SS7 and IP communication capability is desirable.



FIG. 4(
b) is a block diagram illustrating an alternative implementation of the TALI protocol stack according to an embodiment of the present invention. In FIG. 4(b), SS7 protocol stack 400a includes MTP3, SCCP, TCAP, ISUP, and application layers 406, 412, 414, and 416 that are identical to the correspondingly numbered layers described with respect to FIG. 4(a). However, in FIG. 4(b) MTP layers 1 and 2 are replaced by asynchronous transport mode (ATM) layer 450, ATM adaption layer 5452, and signaling ATM adaption layer 454. Layers 450, 452, and 454 perform functions for transmitting SS7 traffic over a broadband network, such as an ATM network.


TALI protocol stack 418a includes MAC, network, transport, TALI, and SS7 layers 426, 428, 430, 422, and 424, that are identical to the correspondingly numbered layers described with respect to FIG. 4(a). However, TALI protocol stack 418a includes signaling ATM adaption layer (SAAL) 454 to provide sequencing of SS7 data transferred across a TCP/IP connection. When TALI protocol stack 418a is implemented without SAAL layer 454, as illustrated in FIG. 4(a), the SS7 sequence number, which is included in the SS7 MTP2 header, is not transferred across a TCP/IP connection. This sequence number is used to preserve message sequencing and to support complex SS7 procedures involving MSU retrieval during link changeover and changeback. Changeover is an SS7 procedure whereby a link request is sent over one SS7 link to move SS7 traffic from that link to another SS7 link. Changeback is an SS7 procedure for moving the SS7 traffic back to the original link. TALI protocol stack 418 illustrated in FIG. 4(a) without SAAL layer 454 still guarantees correct sequencing of SS7 data because TCP layer 430 provides sequencing of TCP segments that carry the SS7 traffic.


When TALI protocol stack 418a is implemented with SAAL layer 454, the sequence number of the SS7 MSU is part of the data transferred across a TCP/IP connection. This sequence number may be included as a header, a trailer, or in any other portion of a transport adapter layer interface packet. In the illustrated example, the sequence number is a 24-bit value included in a service specific connection oriented protocol (SSCOP) trailer provided by SAAL layer 454. This 24-bit sequence number serves the same purpose as the 8-bit SS7 sequence number. Accordingly, TALI protocol stack 418a illustrated in FIG. 4(b) can be used for SS7 changeover and changeback with data retrieval and can minimize MSU loss when SS7 links are deactivated.


SCCP Encapsulation Using TALI


FIG. 5 illustrates a packet structure for encapsulating SCCP MSUs in IP packets using the transport adapter layer interface according to an embodiment of the present invention. In FIG. 5, SS7 MSU 500 includes SCCP layer information 502 and TCAP layer information 504 that are encapsulated in service portion 506 of TALI packet 508. SS7 MSU 500 also includes service indicator octet 510 and routing label 512. In one embodiment of the invention, service indicator octet 510 and routing label 512 may be encapsulated directly in service portion 506 of TALI packet 508. However, in the illustrated embodiment, service indicator octet 510 and routing label 512 are omitted from TALI packet 508. Omitting the service indicator octet and routing label information from the TALI packet simplifies processing by the receiving TALI process.


Rather than encapsulating service indicator octet 510 and routing label 512 directly in service field 506 of TALI packet 508, TALI protocol software according to embodiments of the present invention may store information from SIO 510 and routing label 512 in other information fields. For example, the destination point code from routing label 512 may be stored in the SCCP called party point code field of SCCP layer 502. Similarly, the originating point code from routing label 512 may be stored in the SCCP calling party point code field of routing label 512. Message type identification information from SIO 510 may be merged to OPCODE field 514 of TALI packet 508. For example, OPCODE field 514 may store information for identifying the message type. In the illustrated embodiment, OPCODE field 514 may be set to a predetermined value for identifying the message as an SCCP message. The remaining fields of SS7 MSU 500 are preferably omitted from TALI packet 508. That is, SS7 layer 2 information, opening flags, closing flags, and frame check sequences are preferably omitted from TALI packet 508. This information can be omitted because the TCP/IP protocol stack provides analogous functions to SS7 layers 1 and 2. Omitting SS7 layers 1 and 2 from TALI packet 508 decreases overhead for sending packets over a network.


In addition to service field 506 and OPCODE field 514, TALI packet 508 also includes LENGTH field 516 and SYNC field 518. LENGTH field 516 specifies the length of the service portion of the data packet. SYNC field 518 contains a predetermined bit sequence for identifying the start of TALI packet 508. LENGTH field 516 and SYNC field 518 may be used by receiving TALI protocol software to extract individual TALI packets from a stream-oriented connection. Thus, the TALI packet structure in FIG. 5 solves the problem of receiving data over a stream-oriented communication and delivers individual TALI packets to an application. This simplifies application design, as will be discussed in more detail below.


TALI packet 508 is encapsulated in data portion 520 of network frame 522. Network frame 522 may be any suitable frame for delivering packets to machines connected to the same network. For example, network frame 522 may be an Ethernet frame. Accordingly, network frame 522 includes a mediated access control (MAC) header 524. IP header 526 follows MAC header 524. Finally, TCP header 528 follows IP header 526. The structure of headers 524, 526, and 528 is known to those of ordinary skill in the art and need not be described herein.



FIG. 6 is a flowchart illustrating exemplary steps that may be performed by TALI process 322 illustrated in FIG. 3 for performing TALI encapsulation of an SCCP MSU. In FIG. 6, in step ST1, TALI process 322 receives an SS7 MSU. The SS7 MSU may originate from an SS7 node, such as an SSP. In step ST2, TALI process 322 discards MTP layer 2 information, SRC, and flags from the SCCP MSU. In step ST3, TALI process 322 places the destination point code from the routing layer into the called party address field of the SCCP layer. In step ST4, TALI process 322 places the originating point code from the routing label in the calling party address field of the SCCP layer. It is understood that steps ST3 and ST4 are optional and can be omitted if the entire MTP3 portion of the SCCP MSU is encapsulated in the service portion of the TALI packet.


In step ST5, TALI process 322 sets the SYNC field in the header of the TALI packet to indicate the beginning of the TALI packet. In ST6, TALI process 322 sets the OPCODE field of the TALI packet to SCCP. In step ST7, TALI process 322 sets the LENGTH field is set to the number of octets in the service field of the TALI packet. Finally, in step ST8, TALI process 322 sends the packet to TCP/IP process 324 for TCP/IP encapsulation and transmission to an external node.


The steps for processing an incoming TALI packet are essentially the reverse of the steps illustrated in FIG. 6. Novel steps for processing incoming TALI packets will be discussed in more detail below in the section entitled “Identifying Individual Message Packets Received Over Stream-Oriented Connection.”


MTP3 Encapsulation Using TALI


FIG. 7 is a block diagram illustrating an exemplary packet structure for encapsulating MTP3 messages in IP packets according to a preferred embodiment of the present invention. As used herein, an MTP3 message is an SS7 message that is not an SCCP or an ISUP message. These messages correspond to service indicator values of 0-2, 4, and 6-15. In FIG. 7, SS7 MSU 700 includes layer 2702, layer 3703, and opening and closing information 704 and 706. Unlike the example illustrated in FIG. 5, in this example, all of layer 3 information is encapsulated in service portion 506 of TALI packet 508. Like the example illustrated in FIG. 5, layer 2 information 702, and opening and closing information 704 and 706 are preferably discarded.


In TALI packet 508, LENGTH field 516 is set to the length of service portion 506. OPCODE field 514 is set to a predetermined value for identifying an MTP3 packet. SYNC field 518 is set to a predetermined value for identifying the start of TALI packet 508. TALI packet 508 is encapsulated in network frame 522 in the same manner described above with respect to FIG. 5. Thus, the present invention provides a method for encapsulating MTP3 messages other than ISUP and SCCP messages in network frames using a transport adapter layer interface.


SAAL Encapsulation Using TALI

As illustrated above with regard to FIG. 4(b), one embodiment of the transport adapter layer interface protocol stack includes a SAAL layer. TALI also provides a corresponding SAAL OPCODE that indicates that a SAAL message is being transported. This OPCODE may be used to transport any type of SS7 message, including ISUP messages, SCCP messages, and MTP3 messages that includes SAAL information. In addition, the SAAL OPCODE may be used to transport non-SS7 messages, such as SAAL peer-to-peer messages.



FIG. 8 illustrates encapsulation of SAAL messages using a transport adapter layer interface according to an embodiment of the present invention. In FIG. 8, SS7 MSU 800 includes layer 2 and layer 3 portions 802 and 803 and opening and closing portions 804 and 805, as previously described. Layer 3 portion 802 includes an SIO value 806, a routing label 807, and other layer 3 information 808. Other layer 3 information 808 can include ISUP information, application part information, or MTP3 information, as previously described. In the illustrated embodiment, all of layer 3 information 803 is encapsulated in service portion 810 of TALI packet 812.


TALI packet 812 includes LENGTH field 814, OPCODE field 816, and SYNC field 818. In addition, TALI packet 812 includes SSCOP trailer 820. LENGTH field 814 specifies the number of octets in service portion 810, OPCODE field 816 is set to a predetermined value for identifying TALI packet 812 as a SAAL packet, and SYNC field 818 is set to a predetermined value for indicating the beginning of TALI packet 812. SSCOP trailer 820 contains a sequence number for sequencing TALI service data packets when a TCP/IP link fails. TALI packet 812 is encapsulated in network frame 522 in the manner described above. SAAL decapsulation can occur in a manner similar to that described above with respect to FIG. 6 if service portion 810 of TALI packet 812 contains an SS7 MSU. If service portion 810 of TALI packet 812 contains a SAAL peer-to-peer message, decapsulation may be performed by the SAAL layer, rather than the TALI layer.


TALI State Machine

Table 1 shown below is a state machine for the TALI protocol. In Table, 1, columns represent protocol states and the rows represent events that may or may not cause transitions between protocol states. Blank cells in the table indicate that no action occurs for a given state in response to a given event. Cells with text indicate functions performed by TALI protocol implementations and state transitions that occur in response to events.


The states in the TALI protocol are: out-of-service (OOS), connecting, near end prohibited—far end prohibited (NEP-FEP), near end prohibited—far end allowed (NEP-FEA), near end allowed—far end prohibited (NEA-FEP), and near end allowed—far end allowed (NEA-FEA). In the out of service state, a TCP connection has either not been established or has been disabled. In the connecting state, a TCP connection is being established between TCP software associated with TALI endpoints. “Prohibited” refers to a condition in which a TCP connection is established but TALI service messages are not permitted to be sent to the side for which message flow is prohibited. Finally, “allowed” refers to the willingness of one side of a connection to accept TALI service messages. As used herein, TALI service messages are messages that carry application data. TALI messages are messages such as allow, prohibit, monitor, and test, that carry TALI control information. SAAL messages that are not used to carry application data also fall into the TALI messages group. Thus, when in the prohibited state, TALI messages are permitted, while TALI service messages are not permitted.


The events listed in column 1 of Table 1 include timer expirations, receipt of messages, protocol violations, etc. The TALI protocol includes four main timers: T1, T2, T3, and T4. The T1 timer represents the time interval between the origination of a test message at each TALI implementation. Each time T1 expires, a TALI implementation should send a test message. The test message will be discussed in more detail below with regard to monitoring the status of a TALI connection.


The timer T2 represents the amount of time that a TALI implementation has to return an allow or a prohibit message in response to a test message. If the far end of a TALI connection fails to reply with an allow or prohibit message before T2 expires, the sender of the test message treats the T2 message as a protocol violation (PV).


The timer T3 controls the length of time that the near end of the TALI connection should process service data that is received from the far end of a TALI connection after a management prohibit traffic event has occurred at the near end. As used herein, a “management event” is an action performed by an application that resides above and uses the TALI layer. The timer T3 is used when a transition from NEA-FEA (both ends allowed to send service data) to NEP-FEA (only far end willing to send service data) occurs. When an endpoint transitions to the prohibited state, the endpoint is indicating that the endpoint desires to stop receiving service message traffic. That is, if A and B are the endpoints, and endpoint B wishes to not receive service message traffic, then endpoint B sends a prohibit message to endpoint A. After sending the prohibit message, endpoint B receives and processes traffic for T3 seconds. After T3 expires, no service messages are processed by endpoint B. Endpoint A starts diverting traffic to a node other than endpoint B once it receives the prohibit message from endpoint B.


Some data may have been given to the TCP layer at endpoint A for transmission after endpoint B sent the prohibit message but before the prohibit message was received by endpoint A. The application at endpoint A does not have control over messages already given to TCP. If endpoint B did not wait some amount of time, then endpoint B would discard valid messages. Endpoint A would stop passing data to the TCP layer once it has received the prohibit message.


The T4 timer represents the time interval between the origination of the monitor message. Each time T4 expires, the TALI implementation should send a monitor message. The use of monitor messages to measure the round trip time of a connection will be discussed in more detail below.


Other messages illustrated in the events column of Table 1 are special (spcl) messages and extended service (xsrv) messages. Extended service messages are use to transport types of service traffic other than those described above. Special messages are vendor specific messages used to provide services other than those provided by TALI.


Another feature of the invention illustrated in Table 1 is the use of monitor messages to identify the TALI software version of the far end of a TALI connection. For example, according to Table 1, when an implementation receives a monitor message in any state except out of service or connecting, the implementation updates the TALI version of the far end of the connection. Exemplary fields in the monitor message used to identify TALI version will be discussed in more detail below.


The following description illustrates an exemplary path through the state machine illustrated in Table 1. First, TCP software associated with a near end TALI implementation may establish a TCP connection with TCP software associated with a far end TALI implementation. During the TCP connection establishment phase, both TALI implementations are in the connecting state. Once a TCP connection is established, both TALI implementations are in the NEP-FEP state, indicating that TALI service messages cannot be sent. When the near end TALI implementation receives an allow message, the state machine switches to the NEP-FEA state. In the NEP-FEA state, the near end TALI implementation will send an allow message when a management allow traffic event occurs. As used herein, the phrase “management allow traffic event” refers to an event that notifies the TALI implementation that service messages can be sent on the socket in question. Once the near end TALI implementation sends an allow message, the state machine transitions to the NEA-FEA state. In the NEA-FEA state, both TALI implementations can send and receive TALI service messages.









TABLE 1







TALI State Machine













STATE→








EVENT ↓
OOS
Connecting
NEP-FEP
NEP-FEA
NEA-FEP
NEA-FEA





T1 Timer


Send test
Send test
Send test
Send test


Expired


Start T1
Start T1
Start T1
Start T1





Start T2
Start T2
Start T2
Start T2


T2 Timer


PV
PV
PV
PV


Expired


T3 Timer


PV
PV


Expired




T4 Timer


Send moni
Send moni
Send moni
Send moni


Expired


Start T4
Start T4
Start T4
Start T4


Received


Send proh
Send proh
Send allo
Send allo


Test




Message




Received


Stop T2
Stop T2
Stop T2
Stop T2.


Allow


NEP-FEA

NEA-FEA


Message


Received


Stop T2.
Stop T2
Stop T2
Stop T2.


Prohibit


Send proa
Send proa
Send proa
Flush or re-


Message



NEP-FEP

route data








Send proa








NEA-FEP


Received


Stop T3
Stop T3


Prohibit


Acknowledg-


ment


Message


Received


Update ‘far end
Update ‘far end
Update ‘far end
Update ‘far end


Monitor


version’ based
version’ based
version’ based
version’ based


Message


on moni content
on moni content
on moni
on moni





Convert moni to
Convert moni to
content
content





mona
mona
Convert moni to
Convert moni to





send mona
send mona
mona
mona







send mona
send mona


Received


Implementation
Implementation
Implementation
Implementation


Monitor


dependent
dependent
dependent
dependent


Acknowledg-


processing.
processing.
processing.
processing.


ment




Message




Received


PV
If T3 running
PV
Process data


Service



 Process data


Message



Else PV


Received


If ‘far end
If ‘far end
If ‘far end
If ‘far end


‘mgmt’


version’ < 2.0
version’ < 2.0
version’ < 2.0
version’ < 2.0


Message


 PV
 PV
 PV
 PV





Else
Else
Else
Else





 Process
 Process
 Process
 Process





according to the
according to the
according to
according to





nodes 2.0 mgmt
nodes 2.0 mgmt
the nodes 2.0
the nodes 2.0





capabilities.
capabilities.
mgmt
mgmt







capabilities.
capabilities.


Received


If ‘far end
If ‘far end
If ‘far end
If ‘far end


‘xsrv’


version’ < 2.0
version’ < 2.0
version’ < 2.0
version’ < 2.0


Message


 PV
 PV
 PV
 PV





Else
Else
Else
Else





 Process
 Process
 Process
 Process





according to the
according to the
according to
according to





nodes 2.0 xsrv
nodes 2.0 xsrv
the nodes 2.0
the nodes 2.0





capabilities.
capabilities.
xsrv
xsrv







capabilities.
capabilities.


Received


If ‘far end
If ‘far end
If ‘far end
If ‘far end


‘spcl’


version’ < 2.0
version’ < 2.0
version’ < 2.0
version’ < 2.0


Message


 PV
 PV
 PV
 PV





Else
Else
Else
Else





 Process
 Process
 Process
 Process





according to the
according to the
according to
according to





nodes 2.0 spcl
nodes 2.0 spcl
the nodes 2.0
the nodes 2.0





capabilities.
capabilities.
spcl
spcl







capabilities.
capabilities.


Connection

start T1


Established

start T2




start T4




if




sock_allowed ==




TRUE




 Send moni




 Send allo




 Send test




 NEA_FEP




Else




 Send moni




 Send proh




 Send test




 NEP_FEP


Connection


PV
PV
PV
PV


Lost




Protocol


Stop all timers
Stop all timers
Stop all timers
Stop all timers


Violation


Close the socket
Close the socket
Close the
Close the





Connecting
Connecting
socket
socket







Connecting
Connecting


Manage-
Open


ment Open
the


Socket
socket



Connect-



ing


Manage-

Close the
Stop all timers
Stop all timers
Stop all timers
Stop all timers


ment Close

socket
Close the socket
Close the socket
Close the
Close the


Socket

OOS
OOS
OOS
socket
socket







OOS
OOS


Manage-
sock_all
sock_allowed =
sock_allowed =
sock_allowed =
sock_allowed =
sock_allowed =


ment Prohibit
owed =
FALSE
FALSE
FALSE
FALSE
FALSE


Socket
FALSE



Send proh
Send proh







Start T3
Start T3







NEP-FEP
NEP-FEA


Manage-
sock_all
sock_allowed =
sock_allowed =
sock_allowed =
sock_allowed =
sock_allowed =


ment Allow
owed =
TRUE
TRUE
TRUE
TRUE
TRUE


Traffic
TRUE

Send allo.
Send allo.





NEA-FEP
NEA-FEA


User Part
Reject
Reject data
Reject data
Reject data
Reject data
Send data


Messages
data


Request


If ‘far end
If ‘far end
If ‘far end
If ‘far end


from higher


version’ < 2.0
version’ < 2.0
version’ < 2.0
version’ < 2.0


software


 Ignore/reject
 Ignore/reject
 Ignore/reject
 Ignore/reject


layers to


Else
Else
else
Else


send ‘mgmt’


 Process
 Process
 Process
 Process


messages


according to the
according to the
according to
according to





nodes 2.0 mgmt
nodes 2.0 mgmt
the nodes 2.0
the nodes 2.0





capabilities.
capabilities.
mgmt
mgmt







capabilities.
capabilities.


Request


If ‘far end
If ‘far end
If ‘far end
If ‘far end


from higher


version’ < 2.0
version’ < 2.0
version’ < 2.0
version’ < 2.0


software


 Ignore/reject
 Ignore/reject
 Ignore/reject
 Ignore/reject


layers to


Else
Else
Else
Else


send ‘xsrv’


 Process
 Process
 Process
 Process


messages


according to the
according to the
according to
according to





nodes 2.0 xsrv
nodes 2.0 xsrv
the nodes 2.0
the nodes 2.0





capabilities.
capabilities.
xsrv
xsrv







capabilities.
capabilities.


Request


If ‘far end
If ‘far end
If ‘far end
If ‘far end


from higher


version’ < 2.0
version’ < 2.0
version’ < 2.0
version’ < 2.0


software


 Ignore/reject
 Ignore/reject
 Ignore/reject
 Ignore/reject


layers to


Else
Else
Else
Else


send ‘spcl’


 Process
 Process
 Process
 Process





according to the
according to the
according to
according to





nodes 2.0 spcl
nodes 2.0 spcl
the nodes 2.0
the nodes 2.0





capabilities.
capabilities.
spcl
spcl







capabilities.
capabilities.









Identifying Individual Message Packets Received over Stream-Oriented Connection

As discussed above, one of the problems associated with receiving data over a stream-oriented connection, such as a TCP connection, is that the packet boundaries created by a sending application may not be preserved by the underlying TCP software. As a result, the receiving application may not receive data in the intended units. The present embodiment solves this problem with regard to TALI packets using the SYNC and LENGTH fields. FIG. 9 is a flowchart illustrating exemplary steps that may be performed by TALI process 322 illustrated in FIG. 3 for identifying TALI packets received over a stream-oriented connection. In step ST1, a stream-oriented connection such as a TCP connection is established between endpoints. The endpoints may be a signaling gateway and a media gateway controller. In step ST2, TALI process 322 receives data over the connection. In step ST3, TALI process 322 reads a predetermined number of bytes to extract the header from the stream of data received over the connection. The predetermined number of bytes is equal to the size of the header as set by the TALI version. For example, the header may be twenty bytes in length.


In step ST4, TALI process 322 breaks the header into SYNC, OPCODE, and LENGTH fields. In step ST5, TALI process 322 determines whether the value in the SYNC field is valid. If the value in the SYNC field is not valid, TALI process 322 treats the message as a protocol violation. If TALI process 322 determines that the SYNC field is valid, TALI process 322 may then determine whether the LENGTH and OPCODE fields are valid (step ST7). In step ST8, TALI process 322 reads the next LENGTH bytes in the data stream after the header. In step ST9, TALI process 322 passes the packet up the protocol stack to be processed by the TALI state machine. Once the TALI packet has been passed up the protocol stack, TALI process 322 returns to step ST3 to read the next data header. Because TALI process 322 uses the SYNC and LENGTH fields to determine packet boundaries, SS7 application design is greatly simplified. There is no need for an SS7 application to be concerned with packet boundaries.


TALI Peer-To-Peer Messages

TALI peer-to-peer messages are messages that are transmitted by the TALI layer of one side of a stream-oriented connection and that are terminated by the TALI layer of the other side of a stream-oriented connection. The TALI peer-to-peer messages that are described herein include test messages for testing the status of a connection, allow and prohibit messages for allowing and prohibiting communications over a connection without invoking TCP connection establishment or termination procedures, and monitor messages for measuring the round trip time of a connection. Each of these messages will now be discussed in more detail.


Test messages are used by a TALI implementation to query the remote end of a TALI connection with respect to the willingness of the remote end to carry SS7 service data. Test messages are preferably sent periodically by each TALI implementation based on a predetermined timeout value. Upon receiving a test message, a TALI implementation must reply with either a prohibit or an allow message to indicate whether the TALI implementation will carry SS7 service data over a TALI connection. If no response is received within the predetermined time period, the connection may be reset and/or reestablished.


Table 1 below illustrates the packet structure of a test message. In Table 1, the test message includes a SYNC field, an OPCODE field, and a LENGTH field. The SYNC field is set to TALI, the OPCODE field is set to test, and the LENGTH field is set to 0.









TABLE 1







Test Message









Octets
Field Name
Description





0 . . . 3
SYNC
‘TALI’


4 . . . 7
OPCODE
‘test’


8 . . . 9
LENGTH
Length = 0










FIG. 10 is a flowchart illustrating exemplary steps that may be performed by a TALI process in monitoring the status of the connection using test messages. In step ST1, TALI process 322 sends a test message to a peer on the other side of a connection. In step ST2, TALI process 322 starts timers T1 and T2. The timer T1 may be used to determine when to send the next test message and the timer T2 may be used to determine the time for receiving a valid response to the test message. In step ST3, timers T1 and T2 are compared to predetermined values. For example, the predetermined value for timer T1 may be set to a time period for sending the next test message. The timer value T2 may be set to a predetermined time period that is preferably less than the keep-alive timer for TCP. For example, the timeout period may be set for two round trip times for the given connection. A method for measuring the round trip time of a connection will be discussed in more detail below.


In step ST4, TALI process 322 determines whether the timer T2 has expired or stopped. The timer T2 expires when it reaches the timeout period set for T2. The timer T2 stops when an allow or a prohibit message is received. If the timer T2 has not expired or stopped, TALI process 322 continues to check the timer. In step ST5, if TALI process 322 determines that the timer T2 has expired, TALI process 322 determines whether a valid response to the test message has been received. As discussed above, a valid response to the test message may be an allow message or a prohibit message. If a valid response has been received, TALI process 322 determines whether timer T1 has expired or stopped, and, if so, sends another test message to the other side (steps ST6 and ST1). In step ST7, if a valid response has not been received, TALI process 322 may reset and attempt to reestablish the connection. Since the timeout period is preferably less than that of a TCP connection, monitoring of connection status using test messages provides more efficient connection management that TCP. Moreover, because test messages are periodically sent and acted upon, TALI connections can be reliably maintained.


Allow and Prohibit Messages

As discussed above, the TALI protocol provides allow and prohibit message for allowing and prohibiting communications over a TCP connection without invoking TCP connection and establishment and termination procedures. The allow message is sent in reply to a test query or in response to an internal implementation event to indicate that a TALI implementation is willing to carry SS7 service data over a TALI session. As used herein, a TALI session refers to TALI-level connection between endpoints. A TALI session may be created by establishing a TCP connection followed by the exchange of allow messages, as will be discussed in more detail below. The allow message informs the far end that SS7 traffic can be transmitted on the connection. Allow is one of two possible valid replies to a test message. Before SS7 traffic can be carried over a connection, both ends of the connection are required to send allow messages to each other. Table 2 shown below illustrates an exemplary packet structure for an allow message. In Table 2, the allow message includes a SYNC field, an OPCODE field, and a LENGTH field. The SYNC field is set to TALI to indicate that the packet is a TALI packet. The OPCODE field is set to ‘allo’ to identify an allow message. The LENGTH field is set to 0, since the service portion of the TALI packet does not carry any data.









TABLE 2







Allow Message









Octets
Field Name
Description





0 . . . 3
SYNC
‘TALI’


4 . . . 7
OPCODE
‘allo’


8 . . . 9
LENGTH
Length = 0









Like the allow message, the prohibit message is sent in reply to a test query or in response to an internal implementation event. However, unlike the allow message, the purpose of the prohibit message is to indicate that a TALI implementation is not willing to carry SS7 service over the TALI session. The prohibit message informs the far end that SS7 traffic cannot be transmitted over the connection. As long as one end of the connection remains prohibited, SS7 traffic cannot be carried over the connection. Table 3 illustrates an exemplary packet structure for a prohibit message. In Table 3, the prohibit message includes a SYNC field, an OPCODE field, and a LENGTH field. The SYNC field is set to TALI to identify the message as a TALI packet. The OPCODE field is set to ‘proh’ for prohibit. The LENGTH field is set to 0, since the message does not carry any data in the service portion of the message.









TABLE 3







Prohibit Message









Octets
Field Name
Description





0 . . . 3
SYNC
‘TALI’


4 . . . 7
OPCODE
‘proh’


8 . . . 9
LENGTH
Length = 0









A prohibit acknowledgement message is a message sent by TALI implementation in response to receiving a prohibit message from the far end of a connection. Receipt of a prohibit acknowledgement message indicate that the prohibit message was received correctly and will be acted on accordingly. The side of a connection receiving a prohibit acknowledgement message can thus assume that no more data will be transferred over the connection and that it is okay to perform some desired action associated with the connection. Table 4 shown below illustrates a prohibit acknowledgement message according to an embodiment of the present invention. In Table 4, prohibit acknowledgement message includes a SYNC field, an OPCODE field, and a LENGTH field. The SYNC field may include the value TALI to indicate that the message is a TALI message. The OPCODE field may store the value ‘proa’ to indicate that the message is a prohibit acknowledgement message. The LENGTH field may include a value of 0, because the service portion of the message does not contain any data.









TABLE 4







Prohibit Acknowledgement Message









Octets
Field Name
Description





0 . . . 3
SYNC
‘TALI’


4 . . . 7
OPCODE
‘proa’


8 . . . 9
LENGTH
Length = 0










FIG. 11 is a flowchart illustrating the advantages of using prohibit and acknowledgement messages to enable and disable connections. In step ST1, a TALI session is established between two nodes, node A and node B. Nodes A and B may each be any type of node previously described in which it is desirable to implement a TALI protocol stack. For example, either node may be a signaling gateway, a media gateway controller, or an IP-capable SCP. Establishing a TALI session may include establishing a TCP connection between nodes A and B followed by the exchange of allow messages between nodes A and B. Once the connection is established and communications are allowed, in step ST2, nodes A and B communicate using the TALI session. Such communication may include exchange of SS7 call signaling messages, such as SCCP messages, TCAP messages, ISUP messages, and MTP3 messages. In step ST3, node A sends a prohibit message to node B. The reason for sending the prohibit message may be that node A desires to perform a software upgrade. In step ST4, node A determines whether a prohibit acknowledge message has been received. If a prohibit acknowledge message has not been received, node A may retransmit the prohibit message.


In step ST5, once node A receives the prohibit acknowledge message, node A can assume that data will not be received from node B over the prohibited connection. Accordingly, the manager of node B can perform some desired action, such as a software upgrade. When the desired action is complete, in step ST6, node A can send an allow message to node B over the connection. Once node B receives the allow message, node B can resume communications over the disabled connection. Because a transport adapter layer interface connection can be allowed and prohibited without invoking TCP connection establishment and termination procedures, the time and processing resources required for these operations are reduced over conventional TCP procedures.


Performance Measurement and Version Identification

According to another aspect of the invention, messages may be sent between TALI implementation to measure performance of a specific connection and to communicate the TALI version number between communication endpoints. One performance measurement that may be of interest is the round trip time. The round trip time is the time for a message to travel from one side of a connection to the other and back. The vehicle for measuring the round trip time according to the present embodiment includes a monitor message and a monitor acknowledgement message. A monitor message provides a generic echo capability that can be used by a TALI implementation in order to measure the round trip time. Table 5 shown below is an example packet structure for the monitor message. In Table 5, the monitor message includes a SYNC field, an OPCODE field, a LENGTH field, a version label field, and a Data field. The SYNC field identifies the monitor message as a TALI message. The OPCODE field includes the value ‘moni’ to identify the message as a monitor message. The LENGTH field includes the length of the data portion of the monitor message, which contains vendor-dependent data. The version label field in the monitor message may be used to communicate the TALI version number to the far end of a connection. The possible version label field values xxx.yyy specify the major and minor TALI version numbers. For example, a version label field value of 001.000 specifies TALI version 1.0.









TABLE 5







Version Control ‘moni’ Message










Octets
Field Name
Description
Type of Field





0 . . . 3
SYNC
‘TALl’
4 byte Ascii text


4 . . . 7
OPCODE
‘moni’
4 byte Ascii text


8 . . . 9
LENGTH
Length (include the
Integer




version label and data




fields)


10 . . . 21
VER. LABEL
‘vers xxx.yyy’
12 byte Ascii text


22 . . . X 
Data
Vendor Dependent
Variable




Maximum length of this




message (as coded in




bytes 8-9, and stored in




bytes 10-x) should not




exceed 200 bytes









In response to receiving a monitor message, a TALI session preferably sends a monitor acknowledgement message. Table 6 shown below illustrates an example packet structure for a monitor acknowledgement message. In the illustrated example, the monitor acknowledgement message includes a SYNC field, an OPCODE field, a LENGTH field, and a Data field. The SYNC field stores the value TALI to indicate the start of a TALI packet. The OPCODE field stores the value ‘mona’ to identify the packet as a monitor acknowledgement message. The LENGTH field stores the length of the data portion of the monitor acknowledgement message. The data portion of the monitor acknowledgement message preferably includes the same data that was sent in the monitor message. The matching of data allows the monitor message to be paired with the monitor acknowledgement message.









TABLE 6







Monitor Acknowledgement Message









Octets
Field Name
Description





0 . . . 3
SYNC
‘TALl’


4 . . . 7
OPCODE
‘mona’


8 . . . 9
LENGTH
Length


10 . . . X 
Data
Vendor




Dependent










FIG. 12 is a flowchart illustrating the use of the monitor message and the monitor acknowledgement message to measure the round trip time of a connection and to communicate the TALI version number to the far end of a connection. In step ST1, a TALI implementation reads a timer value associated with the local machine and includes the timer value in a monitor message. In step ST2, the TALI implementation places its TALI version number in the monitor message. The version number is used by the other side of a TALI connection to keep track of the version number. For example, upon receiving a monitor message, an endpoint may determine whether the monitor message has a valid version label value in the version label field. This may include comparing bytes located where the version label field should be in the monitor message to a predetermined list of version values. If the value matches one of the values in the list, then the endpoint stores that value as the TALI version for the other side. If the match is not found, the endpoint may store a default version for the other side, e.g., 1.0. Since both sides of a connection preferably send monitor messages to each other and the monitor messages can include the sending sides TALI version number, each side of the connection can determine the current version of the other side.


In step ST3, the TALI implementation sends the monitor message to the other side of a connection. As discussed above, the other side of the connection may use the version label to update the TALI version of the sending side. The other side of the connection changes the OPCODE of the message from monitor to monitor acknowledgment and sends the message back to the sending TALI implementation. In step ST4, the TALI implementation receives the monitor acknowledgement message from the other side of the connection and extracts a timer value from the monitor acknowledgement message. In step ST5, the TALI implementation reads the local timer value when the monitor acknowledgement message was received. In step ST6, the TALI implementation computes the round trip time for the connection based on the difference between the local timer value when the monitor message was received and timer value read from the monitor acknowledgement message. Computing the round trip time in this manner allows optimization of other timers, such as retransmission timers.


Authentication of Critical Messages

As indicated above, many of the messages sent between TALI implementations can allow and/or prohibit communications over a connection. Since such messages could be disastrous in a telecommunications environment, it is preferable that security messages be implemented to ensure that only authorized users can send these messages. One method for providing this security is to authenticate critical messages. Examples of critical messages described herein are prohibit messages and test messages. To ensure that these messages are transmitted by authorized users, encryption and/or authentication procedures can be used. In one example, a public key encryption algorithm, such as Rivest, Shamir, Adleman (RSA), can be used to verify that the message originated from an authorized user. In order to authenticate a message using a public key encryption algorithm, the sending node sends its public key to the receiving node. The sending node then signs the message using its private key. The receiving node then authenticates the message using the sending node's public key. If the message authenticates correctly, i.e., if a valid TALI message is received, then the receiving node knows that the message came from an authorized user. In this manner, the security of TALI connections can be increased.


According to another aspect of the invention, critical messages may be authenticated in a different manner using a public key cryptosystem. For example, a sender and a receiver may exchange public keys. That is, the sender S may send S's public key to the receiver R, and R may send R's public key to S. S may then encrypt a critical message, such as a prohibit message using R's public key. When R receives the message, R may decrypt the message using R's private key. If the message decrypts correctly, R knows that the message comes from someone who has access to R's public key. R may then encrypt a response message, such as a prohibit acknowledgement message, using S's public key. R may then send the message to S. S may decrypt the message using S's private key. If the message decrypts correctly, S knows that the message originated from someone with access to S's public key. In this manner, two-way authentication may be achieved.


It will be understood that various details of the invention may be changed without departing from the scope of the invention. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation—the invention being defined by the claims.

Claims
  • 1. A method for processing transport adapter layer interface (TALI) messages received over a stream-oriented connection, the method comprising: (a) receiving a plurality of TALI messages over a stream-oriented connection;(b) identifying the beginning of each of the TALI messages using a first field in each of the TALI messages;(c) identifying the end of each of the TALI messages using a second field in each of the TALI messages; and(d) extracting individual TALI message packets using the first and second fields.
  • 2. The method of claim 1 comprising identifying the content of each of the TALI messages using a third field in each of the TALI messages.
  • 3. The method of claim 2 wherein identifying the content of each of the TALI messages using a third data field includes identifying the content of each of the TALI messages using an OPCODE field for specifying the content of each of the TALI messages.
  • 4. The method of claim 1 wherein receiving a plurality of TALI messages over a stream-oriented connection includes receiving a plurality of TALI messages over a transmission control protocol (TCP) connection.
  • 5. The method of claim 1 wherein identifying the beginning of each of the TALI messages includes identifying each of the TALI messages using a SYNC field in each of the TALI messages.
  • 6. The method of claim 1 wherein identifying the end of each of the TALI messages using a second data field includes identifying the end of each of the TALI messages using a LENGTH field for specifying the length of a data portion of each of the TALI messages.
  • 7. The method of claim 1 wherein a data portion of each of the TALI messages carries SS7 information.
  • 8. A computer-readable medium encoded with instruction capable of being executed by computer for performing computer program steps comprising: (a) receiving a plurality of transport adapter layer interface (TALI) messages over a stream-oriented connection;(b) identifying the beginning of each of the TALI messages using a first field in each of the TALI messages;(c) identifying the end of each of the TALI messages using a second field in each of the TALI messages; and(d) extracting individual TALI message packets using the first and second fields.
  • 9. The computer program product of claim 8 comprising identifying the content of each of the TALI messages using a third field in each of the TALI messages.
  • 10. The computer program product of claim 8 wherein receiving a plurality of TALI messages over a stream-oriented connection includes receiving a plurality of TALI messages over a transmission control protocol (TCP) connection.
  • 11. The computer program product of claim 8 wherein identifying the beginning of each of the TALI messages includes identifying each of the TALI messages using a SYNC field in each of the SS7 messages.
  • 12. The computer program product of claim 8 wherein identifying the end of each of the TALI messages using a second data field includes identifying the end of each of the TALI messages using a LENGTH field for specifying the length of a data portion of each of the TALI messages.
  • 13. The computer program product of claim 9 wherein identifying the content of each of the TALI messages using a third data field includes identifying the content of each of the TALI messages using an OPCODE field for specifying the content of each of the TALI messages.
  • 14. The computer program product of claim 8 wherein a data portion of each of the TALI messages carries SS7 information.
RELATED APPLICATIONS

This application is a divisional of U.S. patent application Ser. No. 09/588,852 filed Jun. 6, 2000, now U.S. Pat. No. 7,002,988 which is a continuation-in-part of U.S. patent application Ser. No. 09/443,712 filed Nov. 19, 1999 now U.S. Pat No. 7,050,456, which is a continuation-in-part of U.S. patent application Ser. No. 09/205,809 filed Dec. 4, 1998 (now U.S. Pat. No. 6,324,183), and further claims the benefit of U.S. Provisional Application Ser. No. 60/137,988 filed Jun. 7, 1999, the disclosures of each of which are incorporated herein by reference in their entireties.

US Referenced Citations (242)
Number Name Date Kind
5008929 Olsen et al. Apr 1991 A
5142622 Owens Aug 1992 A
5173897 Schrodi et al. Dec 1992 A
5208811 Kashio et al. May 1993 A
5239542 Breidenstein et al. Aug 1993 A
5315641 Montgomery et al. May 1994 A
5384840 Blatchford et al. Jan 1995 A
5420916 Sekiguchi May 1995 A
5430727 Callon Jul 1995 A
5477531 McKee et al. Dec 1995 A
5509010 LaPorta et al. Apr 1996 A
5568487 Sitbon et al. Oct 1996 A
5581558 Horney, II et al. Dec 1996 A
5583926 Venier et al. Dec 1996 A
5583927 Fly et al. Dec 1996 A
5586177 Farris et al. Dec 1996 A
5592530 Brockman et al. Jan 1997 A
5610910 Focsaneanu et al. Mar 1997 A
5612949 Bennett Mar 1997 A
5638431 Everett et al. Jun 1997 A
5640446 Everett et al. Jun 1997 A
5650998 Angenot et al. Jul 1997 A
5651002 Van Seters et al. Jul 1997 A
5657452 Kralowetz et al. Aug 1997 A
5661790 Hsu Aug 1997 A
5664102 Faynberg Sep 1997 A
5675635 Vos et al. Oct 1997 A
5680437 Segal Oct 1997 A
5680552 Netravali et al. Oct 1997 A
5694463 Christie et al. Dec 1997 A
5696809 Voit Dec 1997 A
5701301 Weisser, Jr. Dec 1997 A
5706286 Reiman et al. Jan 1998 A
5712903 Bartholomew et al. Jan 1998 A
5732213 Gessel et al. Mar 1998 A
5740374 Raffali-Schreinemachers Apr 1998 A
5754752 Sheh et al. May 1998 A
5761281 Baum et al. Jun 1998 A
5761290 Farris et al. Jun 1998 A
5761500 Gallant et al. Jun 1998 A
5764750 Chau et al. Jun 1998 A
5764955 Doolan Jun 1998 A
5768361 Cowgill Jun 1998 A
5768525 Kralowetz et al. Jun 1998 A
5774695 Autrey et al. Jun 1998 A
5781534 Perlman et al. Jul 1998 A
5787255 Parlan et al. Jul 1998 A
5793425 Balakrishnan Aug 1998 A
5793771 Darland et al. Aug 1998 A
5802285 Hirviniemi Sep 1998 A
5805587 Norris et al. Sep 1998 A
5809028 Nethercott et al. Sep 1998 A
5812669 Jenkins et al. Sep 1998 A
5812781 Fahlman et al. Sep 1998 A
5815669 Lee et al. Sep 1998 A
5828844 Civanlar et al. Oct 1998 A
5838782 Lindquist Nov 1998 A
5852660 Lindquist et al. Dec 1998 A
5867495 Elliott et al. Feb 1999 A
5870565 Glitho Feb 1999 A
5872782 Dendi Feb 1999 A
5878129 Figurski et al. Mar 1999 A
5889954 Gessell et al. Mar 1999 A
5892822 Gottlieb et al. Apr 1999 A
5898667 Longfield et al. Apr 1999 A
5905724 Carson et al. May 1999 A
5912887 Sehgal Jun 1999 A
5917900 Allison et al. Jun 1999 A
5920562 Christie, deceased et al. Jul 1999 A
5923659 Curry et al. Jul 1999 A
5926482 Christie et al. Jul 1999 A
5933490 White et al. Aug 1999 A
5940598 Strauss et al. Aug 1999 A
5949871 Kabay et al. Sep 1999 A
5958016 Chang et al. Sep 1999 A
5966431 Reiman et al. Oct 1999 A
5971900 Miller Oct 1999 A
5974052 Johnson et al. Oct 1999 A
5991301 Christie Nov 1999 A
5995608 Detampel, Jr. et al. Nov 1999 A
5999301 Chin et al. Dec 1999 A
6002754 Jaiswal et al. Dec 1999 A
6006098 Rathnasabapathy et al. Dec 1999 A
6011780 Vaman et al. Jan 2000 A
6011794 Mordowitz et al. Jan 2000 A
6011803 Bicknell et al. Jan 2000 A
6014379 White et al. Jan 2000 A
6018515 Sorber Jan 2000 A
6021126 White et al. Feb 2000 A
6023502 Bouanaka et al. Feb 2000 A
6026091 Christie et al. Feb 2000 A
6028921 Malik et al. Feb 2000 A
6035020 Weinstein et al. Mar 2000 A
6047005 Sherman Apr 2000 A
6055202 Merritt Apr 2000 A
6055302 Schmersel et al. Apr 2000 A
6061364 Hager et al. May 2000 A
6064653 Farris May 2000 A
6067546 Lund May 2000 A
6069890 White et al. May 2000 A
6075783 Voit Jun 2000 A
6078582 Curry et al. Jun 2000 A
6079036 Moharram Jun 2000 A
6081589 Jiang et al. Jun 2000 A
6084892 Benash et al. Jul 2000 A
6084956 Turner et al. Jul 2000 A
6094437 Loehndorf, Jr. et al. Jul 2000 A
6097036 Teshima et al. Aug 2000 A
6097719 Benash et al. Aug 2000 A
6097805 Figurski et al. Aug 2000 A
6111780 Bertin Aug 2000 A
6111870 Kurtz Aug 2000 A
6111893 Volftsun et al. Aug 2000 A
6112090 Valentine Aug 2000 A
6115383 Bell et al. Sep 2000 A
6118779 Madonna Sep 2000 A
6118780 Dunn et al. Sep 2000 A
6119160 Zhang et al. Sep 2000 A
6122255 Bartholomew et al. Sep 2000 A
6122263 Dahlin et al. Sep 2000 A
6122363 Friedlander et al. Sep 2000 A
6122365 Yegoshin Sep 2000 A
6125111 Snow et al. Sep 2000 A
6125177 Whittaker Sep 2000 A
H1880 Vines et al. Oct 2000 H
H1896 Hoffpauir et al. Oct 2000 H
6128379 Smyk Oct 2000 A
6134235 Goldman et al. Oct 2000 A
6134246 Cai et al. Oct 2000 A
6137869 Voit et al. Oct 2000 A
6137874 Brown et al. Oct 2000 A
6138110 Jahn et al. Oct 2000 A
6144667 Doshi et al. Nov 2000 A
6144670 Sponaugle et al. Nov 2000 A
6147999 Honda et al. Nov 2000 A
6151390 Volftsun et al. Nov 2000 A
6154445 Farris et al. Nov 2000 A
6154467 Hager et al. Nov 2000 A
6157710 Figurski et al. Dec 2000 A
6167025 Hsing et al. Dec 2000 A
6178181 Glitho Jan 2001 B1
6189031 Badger et al. Feb 2001 B1
6192051 Lipman et al. Feb 2001 B1
6195425 Farris Feb 2001 B1
6201804 Kikinis Mar 2001 B1
6208642 Balachandran et al. Mar 2001 B1
6215783 Neyman Apr 2001 B1
6236722 Gilbert et al. May 2001 B1
6278697 Brody et al. Aug 2001 B1
6285754 Sun et al. Sep 2001 B1
6292479 Bartholomew et al. Sep 2001 B1
6307926 Barton et al. Oct 2001 B1
6311186 MeLampy et al. Oct 2001 B1
6324173 Deschaine et al. Nov 2001 B1
6324183 Miller et al. Nov 2001 B1
6327258 Deschaine et al. Dec 2001 B1
6327267 Valentine et al. Dec 2001 B1
6327350 Spangler et al. Dec 2001 B1
6330250 Curry et al. Dec 2001 B1
6330614 Aggarwal et al. Dec 2001 B1
6333931 LaPier et al. Dec 2001 B1
6335937 Chao et al. Jan 2002 B1
6349099 Larikka et al. Feb 2002 B1
6366655 Book et al. Apr 2002 B1
6377799 Hameleers et al. Apr 2002 B1
6385301 Nolting et al. May 2002 B1
6393022 Hewett et al. May 2002 B1
6393581 Friedman et al. May 2002 B1
6411604 Brockman et al. Jun 2002 B1
6411632 Lindgren et al. Jun 2002 B2
6415027 Malik Jul 2002 B1
6425009 Parrish et al. Jul 2002 B1
6430189 Juntumaa et al. Aug 2002 B1
6442169 Lewis Aug 2002 B1
6459783 March et al. Oct 2002 B1
6483837 Howell et al. Nov 2002 B1
6483842 Mauger Nov 2002 B1
6487286 Reaves et al. Nov 2002 B1
6496512 Medhat Dec 2002 B1
6504923 Swale Jan 2003 B1
6507649 Tovander Jan 2003 B1
6515985 Shmulevich et al. Feb 2003 B2
6515997 Feltner et al. Feb 2003 B1
6522667 Oda et al. Feb 2003 B1
6529524 Liao et al. Mar 2003 B1
6535599 Torrey et al. Mar 2003 B1
6542497 Curry et al. Apr 2003 B1
6546003 Farris Apr 2003 B1
6553427 Chang et al. Apr 2003 B1
6563835 Chen May 2003 B1
6574216 Farris et al. Jun 2003 B1
6577626 Christie et al. Jun 2003 B2
6584190 Bressler Jun 2003 B1
6594246 Jorgensen Jul 2003 B1
6594258 Larson et al. Jul 2003 B1
6611532 Madour et al. Aug 2003 B1
6611533 Liao et al. Aug 2003 B1
6625170 Curry et al. Sep 2003 B1
6631133 Christie, et al. Oct 2003 B1
6636504 Albers et al. Oct 2003 B1
6668051 Ashdown et al. Dec 2003 B1
6674748 Dykhuizen et al. Jan 2004 B1
6678242 Simon Jan 2004 B1
6680953 Kim Jan 2004 B1
6681009 Graf et al. Jan 2004 B1
6683881 Mijares et al. Jan 2004 B1
6731741 Fourcand et al. May 2004 B1
6760343 Krishnamurthy et al. Jul 2004 B1
6782004 Brusilovsky et al. Aug 2004 B1
6912590 Lundbäck et al. Jun 2005 B1
6940866 Miller et al. Sep 2005 B1
6944184 Miller et al. Sep 2005 B1
6954526 Glenn et al. Oct 2005 B1
6965592 Tinsley et al. Nov 2005 B2
6967956 Tinsley et al. Nov 2005 B1
6987781 Miller et al. Jan 2006 B1
6990089 Benedyk et al. Jan 2006 B2
7002988 Benedyk et al. Feb 2006 B1
7031340 Sprague et al. Apr 2006 B2
7046667 Sprague et al. May 2006 B2
7050456 Sprague et al. May 2006 B1
7113581 Benedyk et al. Sep 2006 B2
7190702 Sprague et al. Mar 2007 B2
7242695 Sprague et al. Jul 2007 B2
7318091 Brendes et al. Jan 2008 B2
7327670 Sprague et al. Feb 2008 B2
20010029182 McCann et al. Oct 2001 A1
20010046227 Matsuhira et al. Nov 2001 A1
20010046234 Agrawal et al. Nov 2001 A1
20010049730 Brendes et al. Dec 2001 A1
20010055380 Benedyk et al. Dec 2001 A1
20020048360 Zambre et al. Apr 2002 A1
20020105969 Benedyk et al. Aug 2002 A1
20020131400 Tinsley et al. Sep 2002 A1
20020150221 Carson et al. Oct 2002 A1
20050238036 Miller et al. Oct 2005 A1
20050265341 Benedyk et al. Dec 2005 A1
20050286502 Benedyk et al. Dec 2005 A1
20060013204 Benedyk et al. Jan 2006 A1
20060077978 Sprague et al. Apr 2006 A1
20080075068 Brendes et al. Mar 2008 A1
20080075115 Brendes et al. Mar 2008 A1
Foreign Referenced Citations (47)
Number Date Country
2239764 Dec 1998 CA
0 853 411 Jul 1998 EP
1 014 735 Dec 1999 EP
1 054 568 May 2000 EP
1 026 861 Aug 2000 EP
1 089 575 Sep 2000 EP
1 161 819 Aug 2006 EP
1 177 660 Aug 2006 EP
1 169 829 Oct 2006 EP
1 169 816 Nov 2006 EP
1 192 758 Feb 2007 EP
1 755 295 Feb 2007 EP
1 715 658 Oct 2007 EP
1 371 246 Jul 2008 EP
1 314 324 Aug 2008 EP
WO 9711563 Mar 1997 WO
WO 9733441 Sep 1997 WO
WO 9742774 Nov 1997 WO
WO 9742776 Nov 1997 WO
WO 9746045 Dec 1997 WO
WO 9828879 Jul 1998 WO
WO 9828885 Jul 1998 WO
WO 9828897 Jul 1998 WO
WO 9909759 Feb 1999 WO
WO 9916256 Apr 1999 WO
WO 0056032 Jan 2000 WO
WO 0019758 Apr 2000 WO
WO 0022840 May 2000 WO
WO 0030369 May 2000 WO
WO 0031933 Jun 2000 WO
WO 0033519 Jun 2000 WO
WO 0035155 Jun 2000 WO
WO 0035156 Jun 2000 WO
WO 0054476 Sep 2000 WO
WO 0060812 Oct 2000 WO
WO 0060814 Oct 2000 WO
WO 0060821 Oct 2000 WO
WO 0065785 Nov 2000 WO
WO 0076134 Dec 2000 WO
WO 0111825 Feb 2001 WO
WO 0124499 Apr 2001 WO
WO 0137532 May 2001 WO
WO 0182635 Nov 2001 WO
WO 0193526 Dec 2001 WO
WO 0207455 Jan 2002 WO
WO 02056618 Jul 2002 WO
WO 02060192 Aug 2002 WO
Related Publications (1)
Number Date Country
20060013203 A1 Jan 2006 US
Provisional Applications (1)
Number Date Country
60137988 Jun 1999 US
Divisions (1)
Number Date Country
Parent 09588852 Jun 2000 US
Child 11184439 US
Continuation in Parts (2)
Number Date Country
Parent 09443712 Nov 1999 US
Child 09588852 US
Parent 09205809 Dec 1998 US
Child 09443712 US