CN1142299A - Telecommunication switch having programmable network protocols and communications services - Google Patents

Telecommunication switch having programmable network protocols and communications services Download PDF

Info

Publication number
CN1142299A
CN1142299A CN94194237A CN94194237A CN1142299A CN 1142299 A CN1142299 A CN 1142299A CN 94194237 A CN94194237 A CN 94194237A CN 94194237 A CN94194237 A CN 94194237A CN 1142299 A CN1142299 A CN 1142299A
Authority
CN
China
Prior art keywords
mentioned
agreement
state
channel
primitive
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.)
Granted
Application number
CN94194237A
Other languages
Chinese (zh)
Other versions
CN1104797C (en
Inventor
M·P·赫伯特
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.)
Exel Industries SA
Excel Inc
Original Assignee
Excel Inc
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 Excel Inc filed Critical Excel Inc
Publication of CN1142299A publication Critical patent/CN1142299A/en
Application granted granted Critical
Publication of CN1104797C publication Critical patent/CN1104797C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q3/00Selecting arrangements
    • H04Q3/42Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker
    • H04Q3/54Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised
    • H04Q3/545Circuit arrangements for indirect selecting controlled by common circuits, e.g. register controller, marker in which the logic circuitry controlling the exchange is centralised using a stored programme
    • H04Q3/54575Software application
    • H04Q3/54583Software development, e.g. procedural, object oriented, software generation, software testing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/40Network security protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/03Protocol definition or specification 
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/14Multichannel or multilink protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/18Multiprotocol handlers, e.g. single devices capable of handling multiple protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13034A/D conversion, code compression/expansion
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1305Software aspects
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13056Routines, finite state machines
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13072Sequence circuits for call signaling, ACD systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1308Power supply
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1309Apparatus individually associated with a subscriber line, line circuits
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13093Personal computer, PC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13096Digital apparatus individually associated with a subscriber line, digital line circuits
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13097Numbering, addressing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13098Mobile subscriber
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13103Memory
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13104Central control, computer control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13106Microprocessor, CPU
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13107Control equipment for a part of the connection, distributed control, co-processing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13176Common channel signaling, CCS7
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13179Fax, still picture
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13204Protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1324Conference call
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/1325Priority service
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13292Time division multiplexing, TDM
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13299Bus
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13377Recorded announcement
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13378Speech recognition, speech analysis
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13396Signaling in general, in-band signalling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04QSELECTING
    • H04Q2213/00Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13405Dual frequency signaling, DTMF

Abstract

A telecommunications protocol development environment which enables a user to define a separate finite state machine for each port provided by a programmable telecommunications switch. Protocols for various telecommunications applications and software layers may be developed.

Description

Telecommunications switch with programmable network protocol and communication service
Background of invention
1. invention field
The present invention mainly relates to field of telecommunications, more specifically says, is the control outer computer about programmable telecommunications switch and the various telecommunications application of support.
2. to the argumentation of conventional art
Programmable telecommunications switch is used widely in various application, such as voice messaging, and electronic marketing service and similar application etc.Usually control a programmable switch by a main equipment, this main equipment generally is the computer of a corresponding telecommunications application program of operation.The user can be provided by the application program compatible mutually with main frame and exchange hardware that provides on the commercial market, perhaps also can select to write user program.
In great majority were used, a programmable switch was connected into public telephone network by one or more simulation main line or digital channels (span) (for example T1 channel) that terminate in switch.This exchange can be a tag wire to be connected to as one or more " circuit " on the equipment of telephone set etc. also.Communication on given arbitrarily trunk, channel (span) or circuit all is to finish by the signaling protocol of observing appointment.
There is the signaling protocol of many " standards " using in the world.Current widely used some agreement has E﹠amp; M flicker initiation (wink start), loop are initiated (loopstart), (groundstart) initiated on ground, and force the employing DTMF/MFR1 of use or the R2 agreement of MFR2 address signaling etc. in the world.
General programmable switch selects any signaling protocol normally equipment being decided before user delivery for certain specific main line, channel or circuit.That is to say, come switch is configured, comprise hardware, firmware or the various aspects of the two, and this configuration normally can not be easily with certain or changed fast that the method for (for example, by being stored in the firmware among the PROM) does by the manufacturer of switch.Manufacturer's configuration is that each trunk, channel or circuit are specified a specific signaling protocol effectively.
But, because this configuration commonly used has produced several problems.At first, wish by configuration switch to satisfy the requirement shortage flexibility of a certain special applications for the user.When especially after switch is initially installed, needing some specific signaling protocol adjusted, even this problem of non-recurrent adjustment is more obvious.
Another problem of the programmable switch of this routine is that they do not possess the ability that on-the-fly modifies for the signaling protocol of certain specific trunk, channel or circuit appointment.This problem might occur in some frequencies in Europe, when different country uses different pressure R2 signaling protocols, or when in same country, producing international calling by a tandem switching equipment.And being this switch, undesirable result can not suitably be processed into calling probably.
This conventional programmable switch also has a main defective to be, does not provide to make the client more easily develop and realize the function of the application of subscriber signaling agreement for satisfying some application.In the situation that switch is connected the application of (as a voice message system) between public telephone network and the miscellaneous equipment, User Agreement also is desirable if not necessary.Because this equipment can be carried out some specific function and not wish directly to be connected into public telephone network, so they do not follow the signaling protocol of standard usually.This just need allow the user can control this programmable switch as follows, promptly should remain on correct communication the between switch and the public telephone network, also will keep correct communication the between switch and the miscellaneous equipment that is connected to switch.
Yet above-mentioned conventional programmable switch also has another defective, need carry out frequent intervention by main process equipment in order to handle calling exactly.For example, in a habitual switch, normally when sending or receive numeral, need main frame intervention (exchange message between switch and main process equipment).This is necessary, and suitable because this main process equipment must indicate switch to use, available resource is to finish task at hand.In this example, this main frame may indicate switch that the tone generator is connected to certain specific channel sending numeral, or connects the tone receiver to receive numeral.If hundreds of is per hour arranged when perhaps up to ten thousand callings need be handled by switch in certain is used, the quantity of the information that must transmit between main frame and switch just becomes quite huge, and this can cause the reduction of main frame and switch performance usually.
Brief introduction of the present invention
Speak briefly, the invention provides a kind of so programmable telecommunications switch, it provides a kind of own needed in order to be processed into the signaling protocol of calling out or going out that call out, " standard " or actual routine by definition on the port basis and appointment for the user.Resident a plurality of signaling protocols simultaneously in the switch, and for certain given mouth, the fixed agreement of carrying can dynamically change in real time.
The present invention also provides a protocol development environment, and this makes separate finite state machine of each mouthful definition that the user can provide switch.Each finite state machine can define out independently by following manner, is about to a series of basic handling steps that are called atomic function and is combined into primitive, these primitive and state and composition of matter is got up to define desirable state machine again.This state machine can comprise wait state, and wait state is commonly used to reduce the intervention of main process equipment in handling calling procedure.Wait state can be represented programmable timing section, this for switch before carrying out next operation desired some action or incident a chance is provided.
In addition, the present invention can also for some communications applications as a developing instrument, for example Personal Communications Services (PCS), 800/900 business, voice mail, telecommunication market or the like.Simultaneously, the present invention also can be used for a programmable switch inside communication service is widely controlled and managed, comprise meeting, recording speech broadcasting, tone generations, tone reception, call progress analysis, speech recognition, compress speech, reach facsimile coding/decoding, etc.
Brief description of drawings
The present invention has detailed argumentation in claims.To help to understand better about above-mentioned or from now on advantage of the present invention with reference to following introduction and in conjunction with following accompanying drawing.Accompanying drawing comprises:
Fig. 1 is the block diagram of a programmatic telecommunication switch, and according to a preferred embodiment of the invention, this switch can be by the need programming of user by oneself;
Figure 2 shows that the description of the layer of the software that is used to control switch shown in Figure 1;
Fig. 3 A, Fig. 3 B have described the corresponding concrete feature and the function of each software layer of 2-5 layer of the software layer of describing among Fig. 2;
Fig. 4 is the block diagram of a finite state machine development environment constructing according to the preferred embodiments of the present invention;
Fig. 5 is the block diagram of the application of the 3rd layer (network layer), and wherein finite state machine is used for specifying needed network signaling protocol for each port of certain programmable switch;
Fig. 6 A is a state diagram that is used for using at the second layer (link layer) finite state machine that tone control is provided;
Fig. 6 B is the block diagram of finite state machine shown in Fig. 6 A, and wherein each serial atomic function all is defined as a kind of primitive;
Fig. 6 C is one group of table of representing the corresponding relation between each state shown in each atomic function, primitive and Fig. 6 B;
Fig. 7 A is one and uses the international state diagram of forcing the finite state machine of the starting stage that R2 signaling handles call setup in the 3rd layer (network layer) is used;
Fig. 7 B is the block diagram of the finite state machine shown in Fig. 7 A, and wherein each serial atomic function all is defined as a primitive;
Fig. 7 C is one group of table of representing the corresponding relation between the various states shown in each atomic function, primitive and Fig. 7 B;
Fig. 8 A is one and uses T1 E﹠amp in the 3rd layer (network layer) is used; The state diagram of finite state machine that (wink start) signaling is handled the starting stage of call setup is initiated in M flicker;
Fig. 8 B is the block diagram of the finite state machine shown in Fig. 8 A, and wherein each serial atomic function all is defined as a kind of primitive;
Fig. 8 C is one group of table of representing each atomic function, primitive, reaching the corresponding relation between the various states shown in Fig. 8 B;
Fig. 9 A is one and is used for using the state diagram that provides the finite state machine of an Interactive Voice Response of going into to call out the 4th layer (call management layer);
Fig. 9 B is the block diagram of the said finite state machine of Fig. 9 A, and wherein each serial atomic function all is defined as a kind of primitive;
Fig. 9 C is one group and represents each atomic function, primitive, and Fig. 9 B shown in various states between the table of corresponding relation;
Figure 10 A is one and is used for certain layer 5 immigration (inbound) application, for example state diagram of the finite state machine of No. 800 free (toll free) business;
Figure 10 B is the block diagram of finite state machine shown in Figure 10 A, and wherein each serial atomic function all is defined as a kind of primitive;
Figure 10 C be one group represent each atomic function, primitive, and Figure 10 B shown in various states between mapping table;
The detailed introduction of an illustrative embodiment
Be illustrated in figure 1 as the personal computer (PC) 2 that a commerce can get, it comprises 4 and hard disk drives 6 of a PC central processing unit (CPU), and these two is again interconnected by a PC I/O (I/O) bus 8 and a PC power source bus 9.The PC-AT that this PC2 is preferably sold by IBM, or its compatible.If the PC of other type has more internal memory or better CPU than PC-AT, also can adopt.What preferably move on PC2 is application oriented operating system, for example DOS or UNIX.
This PC2 comprises a frame or cabinet, has wherein assembled a motherboard, also has hard disk driver 6, and other selectable unit (SU), as floppy drive, modulator-demodulator or the like.The CPU4 of PC is contained on the motherboard, and motherboard also comprises a series of edge connectors, and other plank (or card) can insert these connectors, so that they link PC I/O bus 8 and power bus 9.
A programmatic telecommunication switch 10 resides among the PC2.CPU/ matrix card 12 is inserted one of expansion slot on the motherboards to be connected to bus 8 and 9.This CPU/ matrix card 12 also is interconnected by following 4 kinds of buses and a numeral (T1) Line cards 14, numeral (E1) Line cards 15,16, strapping tool card of Digital Signal Processing (DSP) card 17, simulation (general) Line cards 18 and a terminal card 19 simultaneously: HDLC or internal processor bus 20; A TDM bus 22; A Line cards (LC) state/control bus 24; And timing/control bus 26.A battery/ringing voltage bus 28 provides cell voltage (48VDC) and ringing voltage (109VAC) for artificial line an outpost of the tax office 18.Terminal card 19 is used for from terminating bus physically 20,22,24,26 and 28.
Line cards 14,15 and 18, and DSP card 16 all is connected to PC power source bus 9 and receives their basic operation power supply thus.Although described a numeral (T1) Line cards 14, numeral (E1) Line cards 15 and an artificial line an outpost of the tax office 18 at this, should see, the Line cards of other any kind can increase under following two physical constraints: the physical space in the maximum switching capacity of (1) CPU/ matrix card 12 and (2) PC2 frame.
An external host 30, it can comprise independently personal computer, work station or other computer, optionally is connected to CPU/ matrix card 12 by communication channel 32.CPU/ matrix card 12 preferably includes a RS-232 compatibility interface commonly used in order to connecting channel 32.This external host 30 is preferably under the application oriented operating system and moves.
If necessary, switch 10 can be placed on the passive backplane (not comprising PC CPU 4 or hard disk 6 here), and controls by this main floor acquisition power supply and by external host 30.
An external cell/ringing voltage source 31 is connected to terminal card 19 by channel 33.Voltage source 31 can comprise the power supply that commercial market for example can get.
Except numeral (E1) Line cards 15, DSP card 16 and strapping tool card 17, the patent application serial numbers the 07/953rd that the details of the formation of the various cards of other shown in Fig. 1 is being assigned to the assignee of the present invention, 690, on September 29th, 1992 submitted to, now deliver and be U.S. patent 5, all set forth to some extent in 321,744.Numeral (E1) Line cards 15 is more prone to adopt the similar hardware that is used for T1 line card 14 to constitute, and just its difference is, but traditional circuit makes that Line cards 15 can be with respect to T1 channel termination E1 channel.
About the details of the structure of DSP card 16 and strapping tool card 17 is set forth in the file that the common pending application sequence number that is assigned to present assignee was submitted on January 5th, the 08/001st, 113,1993 to some extent.
Fig. 2 is the software hierarchy model that is used to control programmable switch 10 shown in Figure 1.One of left side row are defined 7 layers of OSI(Open Systems Interconnection) reference models among Fig. 2.One of the right row are 5 layers and corresponding relations of these layerings and osi model level that are used to control switch 10 among Fig. 2.
Please also refer to Fig. 1 and Fig. 2 now, application layer 5, it is the application layer corresponding to osi model substantially, has represented the application software that is normally operated on PC CPU4 or the external host 30.The software of application layer 5 can be used to realize any amount of required telecommunication service, for example free (toll free) (No. 800) business, and voice mail is called out distribution (ACD) automatically, and unlisted other business or the like here.
Call management layer 4 is presentation layer, session layer and the transport layer corresponding to osi model substantially, and it has represented the software that operates on the CPU/ matrix card 12.Call management layer 4 is responsible for carrying out the processing capacities of the calling after concentrating, and provides a general-purpose interface that has nothing to do with switch 10 inner employed network signaling protocol types for application layer 5.Usually call management layer 4 is carried out those call setups needed function afterwards.
The network layer of osi model that network signaling protocol layer 3 is corresponding substantially.The software that network signaling protocol layer 3 is represented or operate on the CPU/ matrix card 12, perhaps operate on the Line cards of the microprocessor that has oneself, for example Line cards 14,15 or strapping tool card 17, and whether be responsible in frequency band or monitoring of outer network signal and network protocol layer control to going into to call out and going out to call out.
Link layer 2 is substantially corresponding to the data link layer of osi model.The running software of link layer 2 is in CPU/ matrix card 12 and have on the Line cards of microprocessor of oneself, DSP card 16 or strapping tool card 17 (they all have the microprocessor of oneself), and the detection of the network signal information of responsible process network or line interface and their physical transfer.
Be physical layer 1 at last, it is corresponding to the physical layer of osi model.Line cards 14,15 and 18 provides physically T1, E1 and simulation electric interfaces respectively for switch 10.
Fig. 3 A and 3B are the characteristic features that provides of each layer of 2-5 layer by software layer shown in Figure 2 and the tabulation of function.The present invention can be used as a kind of developing instrument and develops any feature shown in realization Fig. 3 A and the 3B and the corresponding software of function.To describe one below in conjunction with Fig. 6 A-10C and in the 2-5 layer, use example directly perceived of the present invention in every layer the situation.
Fig. 4 is the The general frame of a finite state machine development environment, and it is according to the preferred embodiments of the present invention structure, and it allows client or user to create and define finite state machine according to carrying out needed telecommunications functions.Before going through this figure, need the definition of the several terms of explanation.
As using at this, term " state " refers to a numeral of current " situation " of particular channel of expression or port.In a preferred embodiment of the invention, defined three types state: normal, inner and block." normally " (Normal) state can be " wait " state (i.e. SEIZE ACK) state, and under this state, following action is suspended till a particular event takes place) or " stablizing " state (i.e. session is carried out)." inside " (Internal) state is used for testing conditions and carries out the operation that branch is judged effectively.Normal condition and internal state can be described according to method of the present invention by client or user, and are defined as a finite state machine that is used to carry out own needed function." obstruction " state is generated automatically by the present invention, and together with the management of resource on the non-plate, is using by on the channel basis.
The digital number of one " incident " condition that to be a sign accepted by certain particular state.An incident can be associated with the data.
One " atomic function " is exactly to carry out a basic task, as a timer is set.Custom data can take place related by same atomic function.One " primitive " is a predetermined atomic function sequence, and it is causing by certain specific incident.The user can create or define primitive from an available atomic function storehouse.In a preferred embodiment, each primitive can comprise 20 atomic function at most.
One " state/event table " defined the validity event of certain particular state, and the primitive that generation caused of each such incident.In a preferred embodiment, a state/event table can comprise 100 states at most, and each state can comprise 400 incidents at most.
One " primitive table " defined used primitive in certain state/event table.In a preferred embodiment, a primitive table can comprise 200 primitive at most.
One " agreement " is defined as a contact between the same primitive table of state/event table, and identified by a protocol-identifier number (digital number).
A data block, for example those are represented by reference number 40a, 40n, are assigned to each channel (port) 0 of switch ... n.Each data block 40a, 40n are comprising the relevant following information of channel with its representative: the current state of this channel; A pointer that points to the state/event table of certain activation; A pointer that points to the primitive table of certain activation; A pointer that points to the state/event table of certain appointment; A pointer that points to the primitive table of appointment.
With channel 0 is example, and the primitive list index of the state/event table of activation and activation is to point to (as shown in phantom in FIG.) to use by the relevant table of resident agreement reference number 42a and that represent 0.And be that the state/event table of channel 0 appointment and the primitive list index of appointment are to point to the table of being represented by reference number 44a that dynamically pack into, that the self-defining agreement n+1 of client is relevant.
Other operational agreement is resident agreement 1 ... n (42b, 42c) and download, the self-defining agreement n+2 of client ... m (44b, 44c).That resident agreement 42a-42c represents pre-programmed or " standard " agreement, these are normally provided together with switch by manufacturer.On the contrary, the self-defining agreement 44a-44c of client is then created by certain client or user, and can be " customization " fully or " special use ".
An atomic function storehouse 46 that depends on layer is connected information is provided for the finite state machine instrument.State machine instrument 48 also is connected simultaneously, receives the state/event table pointer of activation and the primitive list index of activation with each data block from 40a-40n.
Simultaneously, as reference number 50 expressions, also provide to be used for the utility that layer relies on the environment support.
The function of state machine instrument 48 is according to each channel of the protocol-driven of distributing to it, and this agreement is defined by the primitive table of the state/event table of appointment and appointment.The validity event of a normal condition is once generation causes a primitive according to respective entries in the state/event table of appointment.Those atomic function that state machine instrument 48 uses atomic function storehouse 46 to carry out by the primitive representative that is initiated.
State machine instrument 48 will drive the internal state through any needs, generate suitable blocked state automatically, reach a normal condition again up to this channel.Till that time, the processing of being done by state machine instrument 48 will be complete, up to the generation of another validity event.
Each channel is initially specified the agreement of a self-defining agreement of client or a pre-programmed.This process is done in such a way that from application layer 5 and sends a message to call management layer 4 that same call management layer 4 is to 3 corresponding message of layer.The primitive list index of the state of appointment/event table pointer and appointment points to the agreement of last appointment.Like this, the client can specify certain agreement ID (sign) to specify one of certain allowed protocol that oneself needs simply.With such method, the present invention allows the client by on the channel basis well, specifies an agreement that oneself needs a plurality of agreements in residing in same switch.
As another selection, if perhaps customer selecting is not some or all channel specified protocol, then preferably provide default value, each channel always has an effective agreement (for example, one of resident agreement 42a-42c) and is assigned to it like this.
Offer the state/event table of activation of state machine instrument 48 and the primitive list index of activation, point to the agreement (activation) of current this channel of control.
The agreement of the activation of being used by certain channel needs not to be permanent, can be used as the response of the generation of certain allocate event is dynamically changed in real time, as in conjunction with Fig. 5 described in detail.Furtherly because the atomic function that is provided by storehouse 46 representative is basic functions, so client or user preferably can realize easily the required change of agreement be need not to bottom code do any essence or might some change.In addition, provide environment to support utility to simplify protocol development for client or user.Utility provides ready-to-use resource management function (for example timer), and this has simplified the needed logic state machine of the required agreement of realization greatly.For each software layer provides different utilities, because each layer resource needed may be different.
Fig. 5 is the software block diagram of an expression the present invention in a representative applications of network signaling protocol layer 3.Mentioned as above-mentioned, the software on the 3rd layer normally operate in switch 2 CPU/ matrix card 12, Line cards 14 15 or strapping tool card 17 on (Fig. 1).
Data block 52a, 52n are assigned to each channel of switch.With channel 0 is example, and the primitive list index of the state/event table of activation and activation all points to as shown in phantom in FIG., with the resident relevant table of service fault agreement 58a.For the primitive list index of the state/event table of channel 0 appointment and appointment then points to the relevant table of representing with reference number 60a with certain, download of the self-defined procotol n+1 of client.
Other operational agreement is residing network agreement 58b, 58c and download, the self-defined procotol 60b of client, 60c.
Connected a layer 3 atomic function storehouse 54 and provide information to give state machine instrument 48.
The 3rd layer of environment supports that utility 56 comprises: receiving lines signal/scanning management; Digital Signal Processing (DSP) function activation/management; Alarm/service fault (OOS) management; Timer management; And dynamic memory management etc.
The primitive list index that offers the state/event table pointer of the activation of state machine instrument 48 and activation all points to the agreement of current this channel of control.Under normal operation, the agreement of activation should be same with specified agreement.But in this figure, the agreement of activation but is a service imbalance procotol 0.This may occur under the following situation, such as, because detect alarm conditions on channel 0, this channel automatically is transformed into service fault procotol 0.
Need not to be nonvolatil by the employed agreement that is activated of certain particular channel, it can be used as the response of the incident generation of certain appointment is dynamically changed in real time.For example, as shown in Figure 5, be the state/event table and the former pin sensing of the primitive table self-defined procotol 1 of client (60a) of channel 0 appointment.Suppose that receiving one at channel 0 goes into to call out, but the network signaling protocol of going into to call out but is different with the self-defined procotol 1 of client (60a).At this moment, can send a message to layer 4 by layer 3, this goes into to call out the agreement that expression needs the change activity with correct processing.In response, layer 4 can return a message to layer 3 simply, changes the agreement that is activated and continues to handle this and go into to call out, and perhaps sends a message with request instruction to application layer 5.In case this goes into end of calling, then can reassign original agreement (or other is any available a kind of in switch) for this channel, this can finish by certain atomic function in the agreement of message like the category or activation.
Under a situation that goes out to call out, can carry out similar function.In other words, if be that certain available channel that to call out has been specified an agreement, and be that the agreement of this channel appointment is not suitable for this and goes out (for example to call out, dialed digit shows that this purpose side that goes out to call out is a foreign country that uses different agreement), so by send the agreement that a corresponding message just can dynamically change this channel by layer 4.Equally, in case this call treatment finishes, can reassign its original agreement or needed other agreement for this channel again.
In Fig. 6 A and subsequent each figure, with a circle certain state is described, represent certain atomic function with a rectangle frame, to be positioned at an incident of a phrase abbreviation expression on the next door, path that certain state draws.Parameter or data that information representation in certain atomic function in the round parentheses is relevant with this function.
Fig. 6 A is the example of the present invention in the application of link layer 2 to 6C.
Agreement is in normal condition 1 (NS1) beginning by correlated channels, and this normal condition 1 is idle (IDLE) state 62.But 2 layers of foundation of the 3rd layer of incident to the are used to transmit R2 signaling (L3_L2n SETUP_FOR_FWD_R2) to be taken place, and has carried out a series of atomic function (af2, af3, af4, af5 and af1).The execution of these atomic function is respectively certain timeslice and creates a R2 receiving node, for the R2 decoding (for example adds a DSP channel, a dsp chip is as a tone receiver), send the subsidiary message (L2_L3n RCVR_ATTACHED) of the 2nd layer to the 3rd a layer receiver, a timer (timer1) is set, and it is normal condition 2 (NS2) 64 that next state is set then.Please note that the parameter relevant with atomic function af5 preferably is used for defining a needed timer ID and a pre-subscript of determining in the timer value array.The parameter relevant with atomic function function af1 preferably is used for illustrating the digital number of next state and the type of next state.
If next incident is timer 1 then (TIMER1_EXPIRATION), then carry out atomic function function af10 and af11, and this channel turns back to IDLE idle condition 62.But, if next incident is to receive a message by DSP, show and receive quiet (silenle) (DSP_L2nRCVED_SILENCE), carry out atomic function function af5 (timer 1 is set) and af1 (next state is set) so, agreement enters into normal condition 3 (NS3) 66 afterwards, waits for the R2 forward signal at this state.
If next incident is timer 1 then (TIMER1_EXPIRATION), then carry out atomic function function af10 and af11, this channel turns back to free time (IDLE) state 62.If next incident is to receive a message (L3_L2nXMIT_BWD_R2_SIG) that sends loopback R2 signal, then carry out atomic function function af12, this function in order to sending subsequently, turns back to N state S3 66 with the queuing of loopback R2 signal afterwards.If next incident is to show to receive the message of transmitting R2 signal (DSP_L2nRCVED_R2_FWD_SIG), then carry out atomic function function af7 (sending a R2 signal report) to layer 3, and atomic function function af8 (whether the R2 signal that detects loopback has lined up in order to sending) and af1 (next state is set), afterwards, agreement enters into internal state 4 (IS4) 68.
If next incident is the internal event true (L2_2NT_EVENT_1) that shows that loopback R2 signal has been lined up, then carry out atomic function function af9 (loopback sequences the R2 signal of team), carry out af5, af1 then, agreement turns back to state 64 afterwards.If next incident is to show the also not internal event vacation (L2_1NT_EVENT_0) of queuing of loopback R2 signal, then carry out atomic function function af5 (timer 1 is set), then carry out af1 (next state is set), agreement enters into normal condition 5 (NS5) 70 afterwards.When receiving the message of loopback R2 signal (L3_L2nXMIT_BWD_R2_SIG), just carry out atomic function function af9, af5 and af1, agreement turns back to state 64.
Please refer to Fig. 6 B now, it can be regarded as each atomic function sequence of function among Fig. 6 A all is defined as a kind of primitive (primitive 1-7).In fact, each primitive all provides a kind of simple and direct method to identify the atomic function sequence of function that certain need call.
Fig. 6 C is depicted as a primitive table, and it has listed the atomic function sequence of function of each primitive correspondence among Fig. 6 B with the form of tabulation, and Fig. 6 C also has a state/event table simultaneously, it defined each state among Fig. 6 B, incident, and primitive between relation.According to preferred implementation method of the present invention, if the client wishes to create the agreement shown in Fig. 6 A and 6B, he only needs definition each table shown in Fig. 6 C to get final product so.Then these tables are downloaded to switch 2 (as Fig. 1) by the method that is sent a series of message by main frame.
Fig. 7 A-7C is the example that the present invention is applied to adopt the agreement of the international network protocol layer 3 of forcing the initial phase that R2 signaling handles call setup.Agreement and correlated channels are in normal condition 1 (NS1) 72 beginnings, and this state is idle (IDLE) state.Once this incident of receiving lines signaling bit group 0011 (sending out the bit value of the signal that is hunted down) takes place, carry out a series of atomic function functions (af17, af19, af21 and af1).The execution of these former subfunctions, the current respectively command list that is hunted down is set to default swap table, and the present instruction pointer is set to 0, detects the current instruction that is hunted down, and then next state is changed to internal state 2 (ZS2) 74.
If next incident is layer 3 internal event 0 (L3_INT_EVENT_0), this shows that the current instruction that is hunted down is detected and is worth for empty (null), carries out former subfunction af22 so, and it is with this channel clear.But, if next incident is layer 3 internal event 7 (L3_INT_EVENT_7), this shows that the current instruction that is hunted down is to produce the affirmation that is hunted down, so just carry out former subfunction af30, it is checked and looks at the next one is hunted down to instruct whether want receiving step N numeral, carry out former subfunction af1 then, next state is set to internal state 3 (IS3).
If next incident is the L3_1NT_EVENT_0 or the vacation of saying so, show that the next one instruction that is hunted down is not to want receiving step N numeral, then agreement continue to be carried out former subfunction af2 (catching affirmation with 1,101 one of the transmission of bit group).If next incident is L3_1NT_EVENT_1 or says so very, then carry out former subfunction 31, set up a R2 and transmit digital received, carry out former subfunction af2 (affirmation is caught in transmission) then.Set up digital received and can relate to the distribution that DSP card 16 (Fig. 1) is gone up certain DSP resource usually.
Next carry out af5, it is provided with a timer (timer1) to set up a stand-by period of waiting for first expection numeral.Carry out former subfunction af1 then, next state is set to normal condition 4 (NS4), and this state shows to be hunted down and is identified and this channel is just waiting for that receiving a group 1 transmits the MFR2 signal.
Equally, shown in Fig. 7 B, each the atom sequence of function in Fig. 7 A can be defined by a kind of primitive (1-5).Fig. 7 C has then shown and the corresponding primitive table of Fig. 7 B and state/event table.
Fig. 8 A is another example that the present invention is applied to network protocol layer 3 agreements, and it is to adopt T1 E﹠amp; M flicker initiation (wink start) signaling protocol is handled the call setup starting stage.
This agreement is by normal condition (NS1) 80 beginnings.Once receive the generation of representing captive bit value 11 these incidents, carry out atomic function function af30, whether detection-phase 1 digit collection is instructed to.Carry out former subfunction af1 then, next state is changed to internal state (IS2) 82.
If next incident is that L3_1NT_EVENT_0 is in other words for false, this means that digit collection is not instructed to as yet, agreement is just carried out former subfunction af5 (for pre-flicker postpones to be provided with timer 1) so, carries out af1 then next state is changed to normal condition (NS3) 84.If next incident is L3_1NT_EVENT_1 is true in other words, this means that digit collection has been instructed to, then carry out former subfunction af31, set up the MFR1 digital received, carry out af5 and af1 then.
Once timer 1 (TIMER1-EXPIRATION) this incident generation then, to carry out atomic function af2 (flicker ON), carry out atomic function af5 (for flicker (wink) phase is provided with a timer) then, carry out af1 again, next state is set to normal condition (NS4) 86.According to timer 1 this incident then, will carry out af2 (flicker OFF) equally, carry out af5 (timer is set is used to wait for numeric string) then, and carry out the af1 NextState again and be set to normal condition (NS5) 88.
Fig. 8 B is depicted as the relation between the atomic function and primitive 1-5 among Fig. 8 A, and Fig. 8 C is depicted as corresponding primitive table and state/event table, and user or client can utilize it to come fixed own required agreement.
Fig. 9 A should be in an example of call treatment layer 4 for the present invention.In this example, the present invention is used to realize a kind of some agreements of going into to call out generation interactive voice response (IVR) ability that is.This agreement is by idle (IDLE) state (S1) 90 beginnings.Take place once receive this incident of a configuration messages (L3_SETUP_2NDICATION), will carry out atomic function af1, af2, af3, af4 and af5 in proper order.These functions are used separately as to network protocol layer 3 and send an alarm information, send a connection message (to respond this calling) to layer 3, send a message with thinking that interactive digital closed string collection distributes a DSP resource, a timer timer1 is set in order to waiting for the distribution of this DSP resource, and next state is set to normally (wait) state (NS2) 92.
If next incident is timer 1 then (TIMER1-EXPIRATION), then carries out atomic function af6 this channel is resetted.If next incident is to receive a message that shows that this DSP resource has been distributed, then carry out atomic function function af7, the calling party is connected to a desirable notice, carry out af4 then for the numeral wait is provided with timer 1, carry out the next state of af5 again and be set to normal condition (S3) 94 in order to wait for numeral.
If next incident be timer 1 then, agreement will be carried out atomic function 7 (playing notice again to the calling subscriber) once more.If next incident is to receive numeral by the DSP resource of being distributed, then carry out atomic function af8 (notice layer 5 numeral receive), carry out af4 (timer 1 being set) to wait for instruction from layer 5, and af5 (it is normal condition (S4) 96 that next state is set).
Equally, Fig. 9 B and 9C are the relations between state, incident, atomic function and the primitive, and they can be used for defining the IVR agreement of Fig. 9 A.
At last, Figure 10 A is the example that the present invention is applied to application layer 5.In this example, described one and be used for immigration (inbound) application, the professional agreement of free (toll free) (No. 800) of example.
This agreement is begun by normal condition (S1) IDLE98.Serve this incident with the digital massage request (L4_REQ_FOR_SERV_WITH_DIGITS) takes place once receive from the 4th layer, to carry out atomic function af1 (sending an acknowledge message) in proper order to layer 4, af2 (sending a message to layer 5 one route controls (process)) with a channel id and numeral, af4 (timer is set in order to the response of wait from the control of layer 5 route, and af5 (it is normal condition (S2) 100 that next state is set).
At state (S2) 100, if next incident be timer then, then produce the failure of channel and carry out atomic function af8.If next incident is the message from the control of layer 5 route, the channel of connection request service, then carry out atomic function af7 and send a message to connect this two channels to layer 4.Carry out af4 then, be provided with a timer timer1 in order to etc. the affirmation of finishing to be connected, then carry out af5 and next state is set is normal (wait) state (S4) 104.
At state (S4) 104, if next incident be timer 1 then, produced the failure of channel and carried out af8.Connect from the message confirmation of layer 4 and to finish (L4_L5nCONNECT_ACK) if next incident is one, then carry out atomic function af6 and make timer 1 invalid, carrying out af5 then, next state is set is normal condition (S5) 106.When a message that receives from layer 4 shows this channel of release, then carry out atomic function af3, be used for sending an affirmation to layer 4, it returns this channel to idle condition 98 to carry out af5 then.
Referring to state 100,, become a group again, then carry out atomic function af9, this caller is connected to the notice of a recording going into call queuing if next incident is the message from the control of layer 5 route.Carry out atomic function af4 then, timer 1 is set, then carry out the next state of af5 again and be set to normal condition (S3) 102 in order to wait for affirmation from layer 4.
At state (S3) 102, if next incident be timer 1 then, then produce the failure of channel and carry out atomic function af8.Finish if next incident is this connection of message authentication from layer 4, then carry out af6 and make timer 1 invalid, and execution af4 is provided with the notice of timer 2 in order to reset and to be recorded.Like this, if channel remains on the 102 sufficiently long times of state (S3) to timer 2 then, consultation re-executes af9 and plays this notice again.
If but be a message from layer 5 route control in state (S3) 102 next incidents, require the channel of connection request service, then carry out atomic function function af6 and make timer 2 invalid, carry out af7 then, send a message to connect this two channels to layer 4.Then carry out af4, be provided with a timer 1 in order to etc. the affirmation of finishing to be connected, and then carry out the af5 NextState and be set to normally (wait) state (S4) 104.
Figure 10 B and 10C are depicted as the relation between each state, incident, atomic function and the primitive among Figure 10 A, can be used to define the coin free service agreement shown in Figure 10 A.
Above narration is to be confined to a specific implementation method of the present invention.But clearly, on the basis of obtaining the part or all of advantage of the present invention, can also improve the present invention.Therefore, the purpose of accompanying Claim is exactly to cover all these classes with the spirit and scope of the present invention to change and change.

Claims (13)

1. method that is used to operate the programmatic telecommunication switch, above-mentioned switch comprises and is used for dynamically connecting or disconnects communication path between a plurality of channel different channels, with the controlled switch as the response of the message that main process equipment is produced, said method comprises the steps:
Define one or more communication protocols and be used for being processed into calling or go out calling, each of above-mentioned communication protocol is represented by a finite state machine;
Be each at least one above-mentioned agreement of above-mentioned channel original allocation, different agreements can be assigned to different channels; And
Go into to call out or go out to call out when initiating when detect one at one of above-mentioned channel, determine whether the current agreement that is assigned to above-mentioned channel has the above-mentioned ability of going into to call out or going out to call out of handling, and when the agreement of above-mentioned current appointment does not possess when handling the above-mentioned ability of going into to call out or going out to call out, possess the another kind of agreement of handling the above-mentioned ability of going into to call out or going out to call out in the above-mentioned agreement of Dynamic Selection, and use above-mentioned selected agreement to handle the above-mentioned calling of going into to call out or go out.
2. according to method described in the claim 1, wherein each above-mentioned finite state machine all connects same primitive table by a state/event table and represents, above-mentioned state/event table has defined a plurality of predefined logic states and a minimum scheduled event relevant with each this state, above-mentioned primitive table definition one or more primitive that comprise a series of predefined power functions, by the generation of one of above-mentioned predefined incident, a predefined primitive relevant with this generation incident will be called.
3. according to the method described in the claim 2, the all designated corresponding data block of each above-mentioned channel wherein, this data block has comprised the information of representing corresponding current logic state of this channel and Status Type, a pointer that points to the state/event table that activates, a pointer that points to the primitive table that activates, a pointer that points to appointed state/event table, and a pointer that points to appointed primitive table.
4. method according to claim 3, wherein above-mentioned finite state machine explained by a state machine instrument, and this state machine instrument is operated as the response in the storehouse that above-mentioned pointer and is comprised above-mentioned pre-defined function.
5. method according to claim 1, wherein one or more above-mentioned agreements can be stored in above-mentioned telecommunications switch inside for User Defined and download.
6. method according to claim 1, wherein one or more above-mentioned agreements are to reside in above-mentioned telecommunications switch inside.
7. method that is used to develop the communication protocol of using with a programmatic telecommunication switch, above-mentioned switch comprises and is used for dynamically connecting or disconnects communication path between a plurality of channel different channels with as the controlled switch to the response of the message that main process equipment was produced that said method comprises the steps:
Create one or more state/event tables, wherein each has all defined a plurality of predetermined logic states, have at least a scheduled event relevant, and have a kind of primitive relevant when above-mentioned dependent event takes place, to be called with each above-mentioned incident with each logic state;
Create one or more primitive tables, wherein each primitive table has all defined a series of intended function functions;
Create one or more communication protocols, wherein each agreement is all by the expression that combines of one of above-mentioned state/event table and one of above-mentioned primitive table;
Above-mentioned one or more above-mentioned communication protocols are stored in above-mentioned programmatic telecommunication switch inside; And
For each above-mentioned channel is all specified at least one above-mentioned communication protocol.
8. according to the method described in the claim 7, wherein go into to call out or go out to call out when initiating when detect one at one of above-mentioned channel, determine whether the current communication protocol that is assigned to above-mentioned channel possesses the above-mentioned ability of going into to call out or going out to call out of handling, and, possesses the another kind of agreement of handling the above-mentioned ability of going into to call out or going out to call out in the above-mentioned agreement of Dynamic Selection when the agreement of above-mentioned current appointment does not possess when handling the above-mentioned ability of going into to call out or going out to call out.
9. method according to claim 8, the all designated corresponding data block of each above-mentioned channel wherein, this data block has comprised the current logic state relevant with this channel and the information of Status Type represented, a pointer that points to the state/event table that activates, a pointer that points to the primitive table that activates, a pointer that points to appointed state/event table, and a pointer that points to appointed primitive table.
10. method according to claim 9, wherein above-mentioned finite state machine explained by a state machine instrument, and this state machine instrument is operated as the response in the storehouse that above-mentioned pointer and is comprised above-mentioned predefined function.
11. a programmatic telecommunication switch comprises:
Controlled-switch, be used for dynamically connecting or disconnect communication path between a plurality of channel different channels, with as response to the various message that main frame was produced, comprise a timeslice exchange, be used to exchange a plurality of timeslices corresponding with above-mentioned channel, and the device that is used to handle above-mentioned message;
With above-mentioned switch by one or more devices that correspondence connects together, be used for analog or digital circuit or backbone that above-mentioned channel is represented in terminating; And
Be used to store the device of one or more communication protocols, all designated above-mentioned communication protocol of each of above-mentioned channel;
A device is used for going into to call out or go out the initiation of calling in above-mentioned any one Channel Detection, and determines whether specified agreement possesses the ability of handling above-mentioned calling on the channel that above-mentioned calling takes place; And
A device in response to above-mentioned detection device, is used for when the agreement of above-mentioned appointment can not be handled this class and calls out, and dynamically selects the another kind of agreement that can handle above-mentioned calling from above-mentioned resident and user-defined agreement.
12. switch according to claim 11, wherein each of above-mentioned agreement is all represented by a finite state machine.
13. switch according to claim 12, wherein each of above-mentioned finite state machine all connects same primitive table by a state/event table and defines jointly, above-mentioned state/event table has defined a plurality of predetermined states of patrolling, and at least one scheduled event relevant with each this state, above-mentioned primitive table definition one or more primitive that comprise a series of predetermined function functions, by the generation of one of above-mentioned scheduled event, a predetermined primitive relevant with this generation incident will be called.
CN94194237A 1993-10-08 1994-10-05 Telecommunication switch having programmable network protocols and communications services Expired - Lifetime CN1104797C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US08/134,122 US5426694A (en) 1993-10-08 1993-10-08 Telecommunication switch having programmable network protocols and communications services
US08/134,122 1993-10-08

Publications (2)

Publication Number Publication Date
CN1142299A true CN1142299A (en) 1997-02-05
CN1104797C CN1104797C (en) 2003-04-02

Family

ID=22461861

Family Applications (1)

Application Number Title Priority Date Filing Date
CN94194237A Expired - Lifetime CN1104797C (en) 1993-10-08 1994-10-05 Telecommunication switch having programmable network protocols and communications services

Country Status (17)

Country Link
US (3) US5426694A (en)
EP (3) EP0946026A3 (en)
JP (1) JP3317405B2 (en)
CN (1) CN1104797C (en)
AT (1) ATE211338T1 (en)
AU (1) AU684318B2 (en)
BG (1) BG62989B1 (en)
BR (1) BR9407781A (en)
CA (1) CA2173247C (en)
DE (1) DE69429530T2 (en)
FI (1) FI961533A0 (en)
HU (1) HU219692B (en)
NO (1) NO961351D0 (en)
NZ (1) NZ274738A (en)
PL (2) PL176976B1 (en)
RU (2) RU2150791C1 (en)
WO (1) WO1995010912A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101141435B (en) * 2006-09-10 2010-04-21 华为技术有限公司 Scheduling system and message processing method

Families Citing this family (122)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5859981A (en) * 1995-07-12 1999-01-12 Super P.C., L.L.C. Method for deadlock-free message passing in MIMD systems using routers and buffers
US5802162A (en) * 1995-10-27 1998-09-01 Lucent Technologies Inc. Method for selectively changing the call handling capacity of a telecommunications switch
US6088749A (en) * 1995-11-30 2000-07-11 Excel Switching Corp. Universal API with generic call processing message having user-defined PPL event ID and generic response message for communications between telecommunications switch and host application
US5826030A (en) * 1995-11-30 1998-10-20 Excel Switching Corporation Telecommunication switch having a universal API with a single call processing message including user-definable data and response message each having a generic format
GB9603582D0 (en) 1996-02-20 1996-04-17 Hewlett Packard Co Method of accessing service resource items that are for use in a telecommunications system
US5740236A (en) * 1995-12-21 1998-04-14 Ericsson, Inc. System for providing feature services in a telecommunications system
US5787248A (en) * 1996-01-02 1998-07-28 Racal-Datacom, Inc. System for selecting network management protocol by setting protocol handler index based on newly selected protocol and selecting protocol handler address using protocol handler index
US6381239B1 (en) 1996-02-13 2002-04-30 Taqua Systems, Inc. Multiple application switching platform and method
US5875234A (en) 1996-02-14 1999-02-23 Netphone, Inc. Computer integrated PBX system
US5940487A (en) * 1996-04-10 1999-08-17 Alcatel Usa Sourcing, L.P. Programmable call processing system and method
US5991389A (en) * 1996-06-13 1999-11-23 Northern Telecom Limited Programmable service architecture for call control processing
US6028924A (en) * 1996-06-13 2000-02-22 Northern Telecom Limited Apparatus and method for controlling processing of a service call
US6038309A (en) * 1996-06-13 2000-03-14 Northern Telecom Limited Apparatus and method for externally controlling processing of a service call
US6243453B1 (en) 1996-07-17 2001-06-05 Alcatel Usa Sourcing, L.P. Programmable call processing system and method
US6487676B1 (en) 1996-07-19 2002-11-26 Telefonaktiebolaget Lm Ericsson (Publ) Validation of procedures
GB2315646B (en) * 1996-07-19 2001-02-14 Ericsson Telefon Ab L M Validation of procedures
US5778059A (en) * 1996-08-30 1998-07-07 Digital Technics, Inc. Distributed predictive and event-driven processing environment
USRE39501E1 (en) * 1996-10-31 2007-03-06 Nvidia Corporation Multiple network protocol encoder/decoder and data processor
US6034963A (en) * 1996-10-31 2000-03-07 Iready Corporation Multiple network protocol encoder/decoder and data processor
US5987035A (en) * 1996-11-20 1999-11-16 Excel Switching Corporation Process for signaling messages in a data switching network
SG101460A1 (en) 1997-02-14 2004-01-30 Canon Kk Data communication apparatus and method
DE69837356T2 (en) 1997-02-14 2007-11-29 Canon K.K. Apparatus, system and method for data transmission and apparatus for image processing
EP0859327B1 (en) 1997-02-14 2009-07-15 Canon Kabushiki Kaisha Data transmission apparatus, system and method, and image processing apparatus
EP0859324B1 (en) 1997-02-14 2007-01-03 Canon Kabushiki Kaisha Data transmission apparatus, system and method, and image processing apparatus
US6014440A (en) * 1997-07-21 2000-01-11 Northern Telecom Limited Inter-half call protocol negotiation techniques
US6111893A (en) * 1997-07-31 2000-08-29 Cisco Technology, Inc. Universal protocol conversion
US6151390A (en) * 1997-07-31 2000-11-21 Cisco Technology, Inc. Protocol conversion using channel associated signaling
US6967972B1 (en) 1997-07-31 2005-11-22 Cisco Technology, Inc. Universal protocol conversion
US6259781B1 (en) * 1997-08-06 2001-07-10 Siemens Information And Communication Networks, Inc. Generic distributed protocol converter
US6381328B1 (en) * 1997-08-29 2002-04-30 Lucent Technologies Inc. ETSI intelligent network capability set 1 intelligent network application protocol service switching point finite state machine
FI107842B (en) 1997-09-23 2001-10-15 Nokia Networks Oy Adaptive processor system
US6370592B1 (en) * 1997-11-04 2002-04-09 Hewlett-Packard Company Network interface device which allows peripherals to utilize network transport services
US6052455A (en) * 1997-11-13 2000-04-18 Northern Telecom Limited Universal data structure for use with a concurrent state machine space in a telecommunications network
US6122356A (en) * 1997-11-13 2000-09-19 Northern Telecom Limited Concurrent state machine space in a telecommunications network
US6389009B1 (en) 2000-12-28 2002-05-14 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communications using intelligently bridged TDM and packet buses
US6181694B1 (en) 1998-04-03 2001-01-30 Vertical Networks, Inc. Systems and methods for multiple mode voice and data communciations using intelligently bridged TDM and packet buses
US6526050B1 (en) * 1998-06-08 2003-02-25 Excel Switching Co. Programming call-processing application in a switching system
US6373849B1 (en) * 1998-06-08 2002-04-16 Excel Switching Corporation Resource interface unit for telecommunications switching node
US6587890B1 (en) 1998-06-12 2003-07-01 Mci Communications Corporation Switch controller application programmer interface
US6480597B1 (en) * 1998-06-12 2002-11-12 Mci Communications Corporation Switch controller for a telecommunications network
US7142650B1 (en) 1998-06-12 2006-11-28 Mci Communication Corporation System and method for resource management
US7929516B2 (en) 1998-06-12 2011-04-19 Mci Communications Corporation Intelligent services network using a switch controller
US6650632B1 (en) 1998-06-30 2003-11-18 Cisco Technology, Inc. Feature transparency in a telecommunications network
US6570869B1 (en) 1998-09-30 2003-05-27 Cisco Technology, Inc. Communicating voice over a packet-switching network
US7212522B1 (en) 1998-09-30 2007-05-01 Cisco Technology, Inc. Communicating voice over a packet-switching network
US6658022B1 (en) 1998-09-30 2003-12-02 Cisco Technology, Inc. Signaling protocol for controlling voice calls in a packet switching network
EP1125470B1 (en) * 1998-10-30 2008-12-31 Telogy Networks Inc. Dynamic dsp allocation for universal access to a packet network
US6240086B1 (en) 1999-10-15 2001-05-29 Texas Instruments Incorporated Dynamic DSP allocation for universal access to a packet network
US6463056B1 (en) * 1999-03-18 2002-10-08 Excel Switching Corp. Arrangement for providing network protocol data independence in an expandable telecommunications system
US6898199B1 (en) * 1999-03-18 2005-05-24 Excel Switching Corporation Architecture for providing flexible, programmable supplementary services in an expandable telecommunications system
US6594685B1 (en) 1999-04-14 2003-07-15 Excel Switching Corporation Universal application programming interface having generic message format
US7350202B2 (en) * 1999-05-18 2008-03-25 Welfeld Feliks J Method for re-programming a firmware state machine during execution
US6680952B1 (en) 1999-06-01 2004-01-20 Cisco Technology, Inc. Method and apparatus for backhaul of telecommunications signaling protocols over packet-switching networks
US6625198B1 (en) * 1999-08-13 2003-09-23 Qualcomm Incorporated Method and apparatus for concurrently processing multiple calls in a spread spectrum communications system
WO2001013583A2 (en) 1999-08-16 2001-02-22 Iready Corporation Internet jack
US20030179717A1 (en) * 1999-09-27 2003-09-25 Hobbs Christopher W. L. Methods and apparatus for controlling multi-layer communications networks
EP1447998A1 (en) * 1999-12-30 2004-08-18 Nortel Networks Limited Adaptively maintaining quality of service (Qos) in distributed PBX networks
US7990882B1 (en) 1999-12-30 2011-08-02 Avaya Inc. Adaptively maintaining quality of service (QoS) in distributed PBX networks
US7466741B2 (en) 2000-03-03 2008-12-16 Qualcomm Incorporated Method and apparatus for concurrently processing multiple calls in a spread spectrum communications system
US7039717B2 (en) * 2000-11-10 2006-05-02 Nvidia Corporation Internet modem streaming socket method
US6760772B2 (en) 2000-12-15 2004-07-06 Qualcomm, Inc. Generating and implementing a communication protocol and interface for high data rate signal transfer
US7379475B2 (en) * 2002-01-25 2008-05-27 Nvidia Corporation Communications processor
US8218555B2 (en) * 2001-04-24 2012-07-10 Nvidia Corporation Gigabit ethernet adapter
US6985968B1 (en) * 2001-05-11 2006-01-10 Alcatel State machine architecture partitionable into control and data planes
US6934302B2 (en) * 2001-05-11 2005-08-23 Alcatel Context switching system and method for implementing a high speed link (HSL) in a network element
US8812706B1 (en) 2001-09-06 2014-08-19 Qualcomm Incorporated Method and apparatus for compensating for mismatched delays in signals of a mobile display interface (MDDI) system
US7099453B2 (en) * 2001-09-26 2006-08-29 Sbc Properties, L.P. Method and apparatus for enhanced call routing in a telecommunication system
US7535913B2 (en) * 2002-03-06 2009-05-19 Nvidia Corporation Gigabit ethernet adapter supporting the iSCSI and IPSEC protocols
US20030217148A1 (en) * 2002-05-16 2003-11-20 Mullen Glen H. Method and apparatus for LAN authentication on switch
US7099438B2 (en) 2002-06-14 2006-08-29 Ixia Multi-protocol, multi-interface communications device testing system
US7548512B2 (en) * 2003-02-06 2009-06-16 General Electric Company Methods and systems for prioritizing data transferred on a Local Area Network
WO2004095824A1 (en) * 2003-04-21 2004-11-04 Radzh Fazilievich Kazmine System for remotely switching isdn telephone channels
ATE509459T1 (en) 2003-06-02 2011-05-15 Qualcomm Inc GENERATION AND IMPLEMENTATION OF A SIGNAL PROTOCOL AND INTERFACE FOR HIGHER DATA RATES
JP2007507918A (en) 2003-08-13 2007-03-29 クゥアルコム・インコーポレイテッド Signal interface for higher data rates
EP1665730B1 (en) 2003-09-10 2009-03-04 Qualcomm Incorporated High data rate interface
CA2542649A1 (en) 2003-10-15 2005-04-28 Qualcomm Incorporated High data rate interface
WO2005043862A1 (en) 2003-10-29 2005-05-12 Qualcomm Incorporated High data rate interface
EP2242231A1 (en) 2003-11-12 2010-10-20 Qualcomm Incorporated High data rate interface with improved link control
WO2005053272A1 (en) 2003-11-25 2005-06-09 Qualcomm Incorporated High data rate interface with improved link synchronization
WO2005057881A1 (en) 2003-12-08 2005-06-23 Qualcomm Incorporated High data rate interface with improved link synchronization
US8549170B2 (en) * 2003-12-19 2013-10-01 Nvidia Corporation Retransmission system and method for a transport offload engine
US7624198B1 (en) 2003-12-19 2009-11-24 Nvidia Corporation Sequence tagging system and method for transport offload engine data lists
US8176545B1 (en) 2003-12-19 2012-05-08 Nvidia Corporation Integrated policy checking system and method
US8065439B1 (en) 2003-12-19 2011-11-22 Nvidia Corporation System and method for using metadata in the context of a transport offload engine
US7899913B2 (en) * 2003-12-19 2011-03-01 Nvidia Corporation Connection management system and method for a transport offload engine
US7260631B1 (en) 2003-12-19 2007-08-21 Nvidia Corporation System and method for receiving iSCSI protocol data units
US7206872B2 (en) * 2004-02-20 2007-04-17 Nvidia Corporation System and method for insertion of markers into a data stream
US7249306B2 (en) * 2004-02-20 2007-07-24 Nvidia Corporation System and method for generating 128-bit cyclic redundancy check values with 32-bit granularity
CA2559234C (en) 2004-03-10 2012-07-10 Qualcomm Incorporated High data rate interface apparatus and method
BRPI0508923A (en) 2004-03-17 2007-08-14 Qualcomm Inc High data rate interface equipment and method
JP5032301B2 (en) 2004-03-24 2012-09-26 クゥアルコム・インコーポレイテッド High data rate interface apparatus and method
US7698413B1 (en) 2004-04-12 2010-04-13 Nvidia Corporation Method and apparatus for accessing and maintaining socket control information for high speed network connections
ATE518343T1 (en) 2004-06-04 2011-08-15 Qualcomm Inc INTERFACE DEVICE AND METHOD FOR HIGH DATA RATES
US8650304B2 (en) 2004-06-04 2014-02-11 Qualcomm Incorporated Determining a pre skew and post skew calibration data rate in a mobile display digital interface (MDDI) communication system
US7536468B2 (en) * 2004-06-24 2009-05-19 International Business Machines Corporation Interface method, system, and program product for facilitating layering of a data communications protocol over an active message layer protocol
US7397905B1 (en) * 2004-08-13 2008-07-08 Edify Corporation Interactive voice response (IVR) system providing dynamic resolution of data
US20060045242A1 (en) * 2004-09-01 2006-03-02 Sbc Knowledge Ventures, L.P. Deployment of announcements in local exchange switching platform
US7957379B2 (en) * 2004-10-19 2011-06-07 Nvidia Corporation System and method for processing RX packets in high speed network applications using an RX FIFO buffer
US7260191B1 (en) * 2004-10-26 2007-08-21 Sprint Communications Company L.P. System and method for interactive voice response call processing with external routing and application flow control
US8692838B2 (en) 2004-11-24 2014-04-08 Qualcomm Incorporated Methods and systems for updating a buffer
US8667363B2 (en) 2004-11-24 2014-03-04 Qualcomm Incorporated Systems and methods for implementing cyclic redundancy checks
US8699330B2 (en) 2004-11-24 2014-04-15 Qualcomm Incorporated Systems and methods for digital data transmission rate control
US8873584B2 (en) 2004-11-24 2014-10-28 Qualcomm Incorporated Digital data interface device
US8723705B2 (en) 2004-11-24 2014-05-13 Qualcomm Incorporated Low output skew double data rate serial encoder
US8539119B2 (en) 2004-11-24 2013-09-17 Qualcomm Incorporated Methods and apparatus for exchanging messages having a digital data interface device message format
GB2422507A (en) * 2005-01-21 2006-07-26 3Com Corp An intrusion detection system using a plurality of finite state machines
US8228926B2 (en) * 2005-04-12 2012-07-24 Genband Us Llc Dynamic loading for signaling variants
US20070081518A1 (en) * 2005-08-10 2007-04-12 Rajnish Jain Open programmable software protocol stack for use with an Internet telephony system
US8730069B2 (en) 2005-11-23 2014-05-20 Qualcomm Incorporated Double data rate serial encoder
US8692839B2 (en) 2005-11-23 2014-04-08 Qualcomm Incorporated Methods and systems for updating a buffer
US20070127652A1 (en) * 2005-12-01 2007-06-07 Divine Abha S Method and system for processing calls
EP1974579B1 (en) 2006-01-18 2015-04-15 Telefonaktiebolaget LM Ericsson (publ) Localized and distributed transmission
US20070206747A1 (en) * 2006-03-01 2007-09-06 Carol Gruchala System and method for performing call screening
WO2007121445A2 (en) * 2006-04-18 2007-10-25 Securaplane Technologies, Inc. Battery busing scheme
WO2007150070A2 (en) * 2006-06-23 2007-12-27 Securaplane Technologies, Inc. Wireless electromagnetic parasitic power transfer
US8238538B2 (en) 2009-05-28 2012-08-07 Comcast Cable Communications, Llc Stateful home phone service
US8589867B2 (en) 2010-06-18 2013-11-19 Microsoft Corporation Compiler-generated invocation stubs for data parallel programming model
US20110314256A1 (en) * 2010-06-18 2011-12-22 Microsoft Corporation Data Parallel Programming Model
CN103155450B (en) * 2010-10-13 2017-09-22 瑞典爱立信有限公司 Method and apparatus for determining the asymmetry in communication network
EP2502364B1 (en) * 2011-02-17 2018-11-21 Huawei Technologies Co., Ltd. Skew estimator, skew compensator and coherent receiver
US9491801B2 (en) 2012-09-25 2016-11-08 Parallel Wireless, Inc. Dynamic multi-access wireless network virtualization
US9600432B2 (en) * 2014-04-17 2017-03-21 International Business Machines Corporation Verifying runtime switch-over between multiple I/O protocols on shared I/O connection

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5014266A (en) * 1988-12-28 1991-05-07 At&T Bell Laboratories Circuit switching system for interconnecting logical links between packet switching networks
US5054054A (en) * 1989-02-07 1991-10-01 International Business Machines Corporation Voice applications generator
US5168515A (en) * 1989-11-27 1992-12-01 Unifi Communications Corporation Switchless automatic call distribution system
US5056086A (en) * 1989-12-21 1991-10-08 Bell Communications Research, Inc. Apparatus for providing telephonic mass announcement service and methods for use therein
CA2009034C (en) * 1990-01-31 1995-04-04 Michael J. Gertsman Telephone or data switching system with variable protocol inter-office communication
EP0464015A2 (en) * 1990-06-27 1992-01-02 Telefonaktiebolaget L M Ericsson Communications protocol for switching systems
US5260990A (en) * 1991-04-30 1993-11-09 Boston Technology, Inc. Multiple integrations unit for coupling different switching systems to a message storage system
US5826017A (en) * 1992-02-10 1998-10-20 Lucent Technologies Apparatus and method for communicating data between elements of a distributed system using a general protocol
US5384854A (en) * 1992-02-14 1995-01-24 Ericsson Ge Mobile Communications Inc. Co-processor controlled switching apparatus and method for dispatching console
US5329578A (en) * 1992-05-26 1994-07-12 Northern Telecom Limited Personal communication service with mobility manager
US5440620A (en) * 1992-08-28 1995-08-08 At&T Corp. Telecommunications system subscriber profile updating
US5442689A (en) * 1993-01-29 1995-08-15 At&T Corp. Apparatus and method for providing services prior to call completion in a telecommuncation system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101141435B (en) * 2006-09-10 2010-04-21 华为技术有限公司 Scheduling system and message processing method

Also Published As

Publication number Publication date
NO961351L (en) 1996-04-02
PL176976B1 (en) 1999-08-31
ATE211338T1 (en) 2002-01-15
CA2173247A1 (en) 1995-04-20
EP0724804B1 (en) 2001-12-19
EP0946026A3 (en) 2002-04-10
AU7929694A (en) 1995-05-04
EP1100240A3 (en) 2002-04-10
AU684318B2 (en) 1997-12-11
EP1100240A2 (en) 2001-05-16
US5546453A (en) 1996-08-13
BR9407781A (en) 1997-03-18
RU2150791C1 (en) 2000-06-10
BG100473A (en) 1996-09-30
EP0946026A2 (en) 1999-09-29
CN1104797C (en) 2003-04-02
NZ274738A (en) 1998-02-26
PL316494A1 (en) 1997-01-20
DE69429530D1 (en) 2002-01-31
RU99126118A (en) 2001-12-20
JPH09507972A (en) 1997-08-12
HU219692B (en) 2001-06-28
FI961533A (en) 1996-04-04
JP3317405B2 (en) 2002-08-26
HUT76216A (en) 1997-07-28
NO961351D0 (en) 1996-04-02
BG62989B1 (en) 2000-12-29
DE69429530T2 (en) 2002-08-01
WO1995010912A1 (en) 1995-04-20
FI961533A0 (en) 1996-04-04
HU9600806D0 (en) 1996-05-28
US5426694A (en) 1995-06-20
US6058181A (en) 2000-05-02
PL176468B1 (en) 1999-05-31
EP0724804A1 (en) 1996-08-07
CA2173247C (en) 1999-06-01

Similar Documents

Publication Publication Date Title
CN1104797C (en) Telecommunication switch having programmable network protocols and communications services
US4878240A (en) Multi-service telephone switching system
US5414762A (en) Telephony controller with functionality command converter
JP3007907B2 (en) A communication switching mechanism that provides programmable communication services
US6311238B1 (en) Telecommunication switch with layer-specific processor capable of attaching atomic function message buffer to internal representation of ppl event indication message upon occurrence of predetermined event
US5832240A (en) ISDN-based high speed communication system
US6088749A (en) Universal API with generic call processing message having user-defined PPL event ID and generic response message for communications between telecommunications switch and host application
CN1127859C (en) Method and device in telecommunications network
CN1158198A (en) An intelligent telecommunications network
CN1150278A (en) Method and system for archiving information on communication network
CN1162381A (en) System and method of providing enhanced subscriber services in multi-node telecommunication network
EP0852874B1 (en) System for incremental redistribution of telephony applications computing workload
US5555288A (en) Voice processing system with a configurable telephone line interface
CN1174640C (en) Telecommunications system and method relating to telecommunications services with number translation
CN1110927C (en) Device and method for configurating and updating services in telecommunication network
EP0873029A1 (en) An SCP interface
US20030012354A1 (en) Telephony control mechanism
CN1275019A (en) Method for mounting phone key for access network service
CN1477846A (en) Prepayment method and its prepayment system
CN1124055C (en) Switched connection system with access to its own resources via the internet
CN1813466A (en) Method , system and terminal for providing customized information during call setup process in telecommunication systems.
CN1428040A (en) Communications
WO1999035568A2 (en) Isolation of resources from application in a process control system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CX01 Expiry of patent term

Expiration termination date: 20141005

Granted publication date: 20030402