Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/02—Details
  • H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/02—Details
  • H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
  • H04L12/1453—Methods or systems for payment or settlement of the charges for data transmission involving significant interaction with the data transmission network
  • H04L12/1464—Methods or systems for payment or settlement of the charges for data transmission involving significant interaction with the data transmission network using a card, such as credit card, prepay card or SIM
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/02—Details
  • H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
  • H04L12/1485—Tariff-related aspects
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/02—Details
  • H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
  • H04L12/1485—Tariff-related aspects
  • H04L12/1492—Tariff-related aspects negotiation of tariff
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/14—Session management
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
  • H04L69/24—Negotiation of communication capabilities
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/43—Billing software details
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/46—Real-time negotiation between users and providers or operators
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/49—Connection to several service providers
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/51—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP for resellers, retailers or service providers
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/70—Administration or customization aspects; Counter-checking correct charges
  • H04M15/745—Customizing according to wishes of subscriber, e.g. friends or family
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/80—Rating or billing plans; Tariff determination aspects
  • H04M15/8016—Rating or billing plans; Tariff determination aspects based on quality of service [QoS]
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/80—Rating or billing plans; Tariff determination aspects
  • H04M15/8044—Least cost routing
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
  • H04M15/80—Rating or billing plans; Tariff determination aspects
  • H04M15/8044—Least cost routing
  • H04M15/805—Bidding
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M3/00—Automatic or semi-automatic exchanges
  • H04M3/38—Graded-service arrangements, i.e. some subscribers prevented from establishing certain connections
  • H04M3/382—Graded-service arrangements, i.e. some subscribers prevented from establishing certain connections using authorisation codes or passwords
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M3/00—Automatic or semi-automatic exchanges
  • H04M3/42—Systems providing special services or facilities to subscribers
  • H04M3/42136—Administration or customisation of services
  • H04M3/42153—Administration or customisation of services by subscriber
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M3/00—Automatic or semi-automatic exchanges
  • H04M3/42—Systems providing special services or facilities to subscribers
  • H04M3/4228—Systems providing special services or facilities to subscribers in networks
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M7/00—Arrangements for interconnection between switching centres
  • H04M7/12—Arrangements for interconnection between switching centres for working between exchanges having different types of switching equipment, e.g. power-driven and step by step or decimal and non-decimal
  • H04M7/1205—Arrangements for interconnection between switching centres for working between exchanges having different types of switching equipment, e.g. power-driven and step by step or decimal and non-decimal where the types of switching equipement comprises PSTN/ISDN equipment and switching equipment of networks other than PSTN/ISDN, e.g. Internet Protocol networks
  • H04M7/1225—Details of core network interconnection arrangements
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q3/00—Selecting arrangements
  • H04Q3/0016—Arrangements providing connection between exchanges
  • H04Q3/0029—Provisions for intelligent networking
  • H04Q3/0045—Provisions for intelligent networking involving hybrid, i.e. a mixture of public and private, or multi-vendor systems
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q3/00—Selecting arrangements
  • H04Q3/0016—Arrangements providing connection between exchanges
  • H04Q3/0029—Provisions for intelligent networking
  • H04Q3/0054—Service creation techniques
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q3/00—Selecting arrangements
  • H04Q3/64—Distributing or queueing
  • H04Q3/66—Traffic distributors
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2201/00—Electronic components, circuits, software, systems or apparatus used in telephone systems
  • H04M2201/14—Delay circuits; Timers
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2201/00—Electronic components, circuits, software, systems or apparatus used in telephone systems
  • H04M2201/22—Synchronisation circuits
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2201/00—Electronic components, circuits, software, systems or apparatus used in telephone systems
  • H04M2201/40—Electronic components, circuits, software, systems or apparatus used in telephone systems using speech recognition
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2201/00—Electronic components, circuits, software, systems or apparatus used in telephone systems
  • H04M2201/60—Medium conversion
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2203/00—Aspects of automatic or semi-automatic exchanges
  • H04M2203/20—Aspects of automatic or semi-automatic exchanges related to features of supplementary services
  • H04M2203/205—Broadcasting
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/01—Details of billing arrangements
  • H04M2215/0108—Customization according to wishes of subscriber, e.g. customer preferences, friends and family, selecting services or billing options, Personal Communication Systems [PCS]
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/01—Details of billing arrangements
  • H04M2215/0168—On line or real-time flexible customization or negotiation according to wishes of subscriber
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/01—Details of billing arrangements
  • H04M2215/0176—Billing arrangements using internet
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/01—Details of billing arrangements
  • H04M2215/018—On-line real-time billing, able to see billing information while in communication, e.g. via the internet
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/22—Bandwidth or usage-sensitve billing
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/42—Least cost routing, i.e. provision for selecting the lowest cost tariff
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/46—Connection to several service providers
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/54—Resellers-retail or service providers billing, e.g. agreements with telephone service operator, activation, charging/recharging of accounts
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/56—On line or real-time flexible agreements between service providers and telecoms operators
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/74—Rating aspects, e.g. rating parameters or tariff determination apects
  • H04M2215/7414—QoS
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/74—Rating aspects, e.g. rating parameters or tariff determination apects
  • H04M2215/745—Least cost routing, e.g. Automatic or manual, call by call or by preselection
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M2215/00—Metering arrangements; Time controlling arrangements; Time indicating arrangements
  • H04M2215/74—Rating aspects, e.g. rating parameters or tariff determination apects
  • H04M2215/745—Least cost routing, e.g. Automatic or manual, call by call or by preselection
  • H04M2215/7457—Biding
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M3/00—Automatic or semi-automatic exchanges
  • H04M3/42—Systems providing special services or facilities to subscribers
  • H04M3/42221—Conversation recording systems
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M3/00—Automatic or semi-automatic exchanges
  • H04M3/42—Systems providing special services or facilities to subscribers
  • H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
  • H04M3/53—Centralised arrangements for recording incoming messages, i.e. mailbox systems
  • H04M3/533—Voice mail systems
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04M—TELEPHONIC COMMUNICATION
  • H04M3/00—Automatic or semi-automatic exchanges
  • H04M3/42—Systems providing special services or facilities to subscribers
  • H04M3/56—Arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q1/00—Details of selecting apparatus or arrangements
  • H04Q1/18—Electrical details
  • H04Q1/30—Signalling arrangements; Manipulation of signalling currents
  • H04Q1/44—Signalling arrangements; Manipulation of signalling currents using alternate current
  • H04Q1/444—Signalling arrangements; Manipulation of signalling currents using alternate current with voice-band signalling frequencies
  • H04Q1/45—Signalling arrangements; Manipulation of signalling currents using alternate current with voice-band signalling frequencies using multi-frequency signalling
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13003—Constructional details of switching devices
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13031—Pulse code modulation, PCM
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13034—A/D conversion, code compression/expansion
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1305—Software aspects
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13056—Routines, finite state machines
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1307—Call setup
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13093—Personal computer, PC
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13097—Numbering, addressing
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13098—Mobile subscriber
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13102—Common translator
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13103—Memory
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13106—Microprocessor, CPU
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13138—Least cost routing, LCR
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13166—Fault prevention
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13174—Data transmission, file transfer
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13175—Graphical user interface [GUI], WWW interface, visual indication
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13176—Common channel signaling, CCS7
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1319—Amplifier, attenuation circuit, echo suppressor
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13204—Protocols
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13215—Code checking, CRC
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1322—PBX
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1324—Conference call
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1325—Priority service
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13282—Call forward, follow-me, call diversion
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1329—Asynchronous transfer mode, ATM
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/1332—Logic circuits
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13337—Picturephone, videotelephony
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13339—Ciphering, encryption, security
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13345—Intelligent networks, SCP
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13348—Channel/line reservation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13349—Network management
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13387—Call gapping
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13389—LAN, internet
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13396—Signaling in general, in-band signalling
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04Q—SELECTING
  • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
  • H04Q2213/13405—Dual frequency signaling, DTMF

Definitions

• the present invention relates generally to telecommunications, and more specifically, to a method and system of providing telecommunication services that is flexible and efficient.
• Telecommunications systems need to process the data flowing through them in complex ways, often with processing occurring on computer systems separated both geographically and administratively. Many communications paths are simultaneously active, and the processing applied to the various flows of data changes frequently and in a wide variety of ways.
• the software needed to control these computer systems is generally large, complex and difficult to change.
• voice such as in a modern digital telephone network
• special processing must be applied to implement such features as three-way or multi-way calling, voice-mail, voice recognition and authentication, call waiting, encryption, voice coding and dual-tone multi-frequency (DTMF) detection.
• security functions such as firewalls and encryption as well as datastream functions such as traffic shaping, error handling, prioritization, caching, format translation and multicast.
• Telephony systems as currently implemented comprise "switches" controlled by large computer programs and interconnected by a variety of means, such as optical fibre and coaxial cables
• These systems also include computing means to implement such features as conference calling and voice mail
• Telephony features such as voice mail and call forwarding
• the features available to particular users are defined in databases accessed by the switch software, and adding a new type of feature may involve changing these databases together with all of the switch software that uses them, and may also involve purchasing and installing new types of hardware in the network
• Specialized software is also used to check the consistency of the features assigned to a particular user, for example, call-waiting and call-forward-on-busy features define different behaviours for the same event, a busy receiver
• TAPI Telephony applications programming interface
• PBX private branch exchange
• API application programming interface
• a program can open windows, files, and message boxes, as well as perform more complicated tasks, by executing a single instruction Windows has several classes of APIs that deal with telephony messaging, and other issues
• the TAPI consists of a large collection of specialized subroutine calls that allow a user to set up and tear down circuits connecting particular physical devices, including telephone sets and servers for functions such as voice-mail It also allows the user to define how the system should respond to events such as hangups
• Parlay A system known as Parlay and developed by a consortium of companies implements a telephony API that can be used to control the central office telephone switches owned by large telephone companies This is similar in concept to the use of a telephony API to control a PBX, but security concerns are of prime concern because of the number of telephone users who would be inconvenienced by a failure
• Parlay TAPI, J-TAPI and similar systems permit third parties a degree of control over how telephone switches interconnect end users and specialized equipment such as voice-conferencing servers but do not allow third parties to add new features such as encryption or voice coding They are also unable to describe the handling of Internet traffic, and so it is necessary for a distinct system to be used to handle such functions as routing Internet browsing data through computers acting as security firewalls
• Socket mechanisms are widely used to describe connections between applications programs running on operating systems such as UNIX and Windows It can be used to set up connections between applications programs running on different computers, such that packets of data are passed between them across such networks as an Ethernet or the Internet
• the programmer defines one side of a communication but must rely on the administrators of the other computer to have set up the other side
• the port number is used by convention to describe the functionality of the program expected
• One aspect of the invention is broadly defined as a method of implementing a communication over a telecommunications network comprising the steps of composing the communication in terms of a graph of software building blocks, and dynamically instantiating the graph of software building blocks at run time
• Another aspect of the invention is defined as a method of implementing an application programming interface (API) for graph-based implementation of telecommunications comprising the steps of receiving input instructions and responding to the input instructions by generating a graph describing the desired functionalhty of the communication
• API application programming interface
• Another aspect of the invention is defined as a method of implementing a communication over a telecommunications network, the communication being defined in terms of a graph of software building blocks, the method comprising the steps of dynamically instantiating the graph of software building blocks at run time
• An additional aspect of the invention is defined as a computer data signal embodied in a carrier wave, the computer data signal comprising a set of machine executable code being executable by a computer to perform the steps of any one of the above methods of the invention
• a further aspect of the invention is defined as a computer readable storage medium storing a set of machine executable code, said set of machine executable code being executable by a computer server to perform the steps of any one of the above methods of the invention
• Figure 1 presents an exemplary schematic diagram of communication over a telecommunications network in a broad embodiment of the invention
• Figure 2 presents a physical layout of an exemplary telecommunications network in a broad embodiment of the invention
• Figure 3 presents a schematic diagram of a filter node and its components in a preferred embodiment of the invention
• Figure 4 presents a schematic diagram of an API describing graph creation in an embodiment of the invention
• Figure 5 presents the organization of filter nodes in an exemplary implementation of end to end encryption in an embodiment of the invention
• Figure 6 presents the organization of filter nodes in an exemplary implementation of voice communication in an embodiment of the invention
• Figure 7 presents the organization of filter nodes in an exemplary implementation of wireless IP communication in a preferred embodiment of the invention
• Figure 8 presents the organization of filter nodes in an exemplary implementation of separate state and traffic side-paths in a preferred embodiment of the invention
• the invention which improves upon the problems described above is a method of implementing a communication over a telecommunications network by composing the communication in terms of a graph of software building blocks, and then dynamically instantiating the graph of software building blocks at run time
• This software structure allows the flexible and efficient processing of signals or data streams in communications systems, computer systems and computer networks
• the schematic diagram of Figure 1 presents a simple example of an implementation of the invention
• the user agent 10 which desires the communication, generates a data structure 12 which identifies the software building blocks and if necessary, configuration data that it requires to perform the communication
• This data structure 12 is transmitted to the network 14, which uses this data structure 12 to assemble the software building blocks in the necessary order and to interconnect them as required If the software building blocks have been given specification configuration details, then the network 14 assigns those configuration details prior to execution of the software building blocks
• This system is very bandwidth efficient, in that large blocks of software code to perform desired functionality are not transmitted around the network 14, but comparatively small graph data structures 12 that identify the software building blocks to be executed
• the software building blocks may be stored in any accessible location, such as locally, at a local cache or server cache, or at a third party location
• Third party locations may, for example, be identified using an Internet universal resource locator (URL) address This allows third parties to generate new software building blocks and make them available
• the concept of a software graph refers to functional routines, or filter nodes, being the software building blocks and the graph structure 12 itself describing how to link those building blocks together Therefore, a call is defined in terms of function flow rather than data flow and the graph data structure 12 may be as simple as a table of pointers, as long as all of the participants know what the contents mean
• the graph data structure 12 could be handled by the network 14 as one or more packets
• the invention is embodied as an application programming interface (API) which allows the user to identify desired communication features and parameters and to generate corresponding graphs
• API allows the user to select functions at a high level while the API generates the corresponding low-level software code
• the network 14 has complementary operability which allows it to receive a graph of software building blocks and to dynamically instantiates the graph of software building blocks at run time As will be described with respect to the preferred embodiment, the network 14 is also able to identify and correct certain inconsistencies in the graph it receives
• the invention provides for a standard API that provides lntercompatibihty between users, service providers and third parties designing new applications Third parties may make these new application freely available or may obtain financial compensation for their use via known electronic commerce techniques
• the invention accommodates new technology and changing market demands and allows for the continuous addition of new services, simply by addition of new filter nodes Because filter nodes are defined in terms of their properties, coordination and intercompatibilty of filter nodes may be easily administered
• the openness and flexibility of the invention also overcomes the limitations of existing socket and API design, provides flexibility to change from one transport medium to another, and allows routers and switches to perform load management that was not available in the past
• the accessibility of this system to all interested parties allows the quick progress of new features, exploitation of niche markets that would not have been addressed by telecommunications companies in the past, and does so in a reliable and efficient manner
• the expectation is that the invention will commoditize telephony software in a manner similar to how the personal computer commoditized software that had previously been dominated by mainframe computer providers Rather than requiring man years for telephone companies to develop proprietary software, the invention allows a single user to spend a few hours creating a new filter to the benefit of thousands of users world wide
• the invention also provides such freelance software developers to obtain financial compensation for their efforts using existing electronic commerce and imilli-commerce techniques
• the invention includes a first step of creating a graph composing a communication in terms of a set of software building blocks or filter nodes, and a second step of instantiating that graph at run time
• the invention will be applied to a generalized telecommunications network 14 as presented in Figure 2
• the telecommunications network 14 is presented as including both a public switched telephone network (PSTN) 16 and Internet 18 Part of the Internet network 18 is shown to comprise an asynchronous transfer mode (ATM) network 20, but other telecommunication networks are also compatible with the invention including synchronous transfer, integrated services digital network (ISDN), asynchronous digital subscriber line (ADSL), local area networks (LANs), and wide area networks (WANs) Users may connect to this network 14 by use of hard wired telephones 22 or wireless telephones 24 which connect to the network 14 through base stations 26 of service provider BS-A Note that these base stations 26 are interconnected via a backbone which may comprise hard wired interconnections IP or ATM routers as shown, or other similar means
• computers 28 could access either by wireless, through a base station 26 as shown, or be hard wired to the network 14
• Wireless connections of telephones and computers to the network 14 are by means of patchpoints (PP) 29 Redundant illumination, as shown with respect to computer 28 is preferred where possible
• telephones may have both wireless and hard wire access as shown with respect to location 30
• each filter node 32 may be described as shown in Figure 3
• the function body 34 contains the executable software code
• the list of function properties 36 describes the role of the filter node 32 and does not contain executable code
• This list of function properties 36 is used by users to identify the filter nodes 32 they desire, and to derive an understanding of how to apply them
• Each input and output, to or from, a filter node 32 is described as a port
• Each port in the port list 38 for a given node 32 will have an associated port name 40 and list of port properties 42
• all filter nodes 32 use a standard set of input and output ports 40 so that there is theoretical interconnectability between filter nodes 32 This simplifies the interconnection between ports 40 at run time, speeding up execution Ports which are not pertinent to the function of a filter node 32 may still have to be processed, possibly to coordinate the timing of the outputs For example, a given filter node 32 may only be operating on data coming in on half of the ports 40, but the data simply passing through the filter node 32 may have be delayed to maintain the timing integrity of the system
• This arrangement also allows new filter nodes 32 to be designed, which are not backward compatible, by incorporating new ports 40
• filter nodes 32 may be accessed by all parties Some parties will have administrative authority, while others will have special access packages, and others, basic packages For example, service providers may have a set of filters which they allow their subscribers to access As well, service providers may have a set of filters to access long distance providers with which they have special business relationships As well, the distinction should be made between subgraphs which represent the interests of the end user, which is typically concerned primarily with the logical structure and only indirectly, through its effects on cost and performance, with the mapping onto hardware, and software that represents the interests of the service provider which is concerned with sharing hardware resources efficiently among a large number of users This is a server/client relationship
• filters nodes 32 are listed hereinafter but may include
• Handshaking or back pressure signals may be associated with a data stream
• Ports usually have a direction to them (input or output), although they may have components that go in the opposite direction, as for example (again) when a handshake is involved
• port types can be rationalized from the list of filter nodes 32 hereinafter, but include generally
• sampled representations of audio signals such as linear, A-law, ADPCM, samples of pre-emphasized signals
• Ports of these types are also parametrized by sample rate, number of bits, and the characteristics of pre-emphasis filters
• coded representations of signals such as codebook-excited LPC (linear prediction coder) These can usually be parameterized, for example, by filter length and frame and sample rate, • alerts, which signal the occurrence of an event such as a hang-up or detection of DTMF, and reset ports
• parameter ports allow call-setup software to adjust such things as sample rates, or to read them
• state input/output ports synchronize complementary pairs of coders and decoders
• IP streams • IP streams, and compressed versions such as RTP (real time protocol) streams
• Ports 40 should preferably be "strongly typed" to avoid the setup of meaningless connections between filter nodes 32 For example, a voice coder that expects integer samples of a voice signal will do nothing useful if driven by the output of an FEC coder This may also require a library of ports 40 to maintain the generalized intercompatibility between filter nodes 32 In a Java implementation, this library of ports 40 could be implemented as different interfaces
• the filter nodes 32 in the logical graph can represent complex computing functions, such as voice coders, only certain interconnections are valid These nodes have properties such as latency and CPU load, for example, of interest when wiring them up Because the edges carry different types of information, the nodes are best thought of as having typed "ports", such as, in the voice coder case, those for linearly digitized signals and for CELP-coded (codebook excited linear predictive) voice encoding As an alternative to strong typing, rules of composition which specify what kinds of networks make sense, could be enforced at the Java level, or enforced by the objects themselves
• the Signal Processing Object software is that software that receives the graph data structure 12, instantiates the graph and executes it In the preferred embodiment, it will be operable to perform the functions of
• analogue modulated data may be transmitted over an analogue voice channel, but not a digital voice channel as the digitization will destroy the modulated data,
• the signal processing object will also insert default filter nodes 32 as necessary 3 continuous or periodic monitoring and evaluating the services and resources available,
• privileged and trusted filter nodes 32 are required for billing, OAM&P (Operations, Analysis,
• the signal processing object should ensure that such facilities are run on trusted hardware 7 implement the system provider's pricing algorithm, generally sensitive to availability and loading of resources, and
• the Signal processing object will be written in either C++ or Java, but clearly is not limited to either
• API software In the preferred embodiment, the creation of the graph data structure 12 will be implemented using a standard application programming interface (API) which is known by all parties, so that callers may design their requests, and so that third parties may design new products
• API application programming interface
• an API converts a series of comparatively simple and high level functions into corresponding lower level instructions necessary to execute those functions
• the API will be operable to a create new filter nodes 32 or modify existing ones using duplication, addition and deletion of filter nodes 32, property lists 42 and ports 40, b obtain and analyse existing filter nodes 32 and their properties 42 Editing of nodes will provide the capacity to duplicate and delete
• the property lists 42 may be manipulated, new properties 42 created, or new ports 40 enumerated, c assemble filter nodes 32 into graph data structures 12, d traverse the hierarchy of a graph data structure 12, editing as necessary, and enumerating the graph below a given filter node 32, c modifying or inserting new filter nodes 32, d simulate filter nodes 32 and graph data structures 12, and e store default graphs or groups of filter nodes 32
• the API will be written in C++ or Java, but is not limited to those languages
• the preferred language is Java which is a popular computer language enhanced by features that facilitate loading programs across the Internet and which can enforce strict rules that guard against software viruses that could interfere with the operation of the system to which they are downloaded Java is also widely used for programming advanced graphical user interfaces (GUIs) such as those used on some Web pages, and it is preferred that the API of the invention be written on a web-based GUI This GUI will allow the user to inspect, modify and possibly simulate the parameters of the desired communication simply by identifying and executing icons on his operating screen This GUI is presented to the User as a web page which may be edited using a standard browser
• the GUI provides a graphical representation on a computer screen of a collection of signal processing and input/output objects These graphical objects corresponded directly with computer programs resident on a collection of computers specialized for digital signal processing, operating to implement the operations described by the graphical representations
• the graphical representations could be interconnected by drawing lines between "ports" on them, which are labelled with names representing their functions such as "encryption” or "error correction"
• Figure 4 presents the functionality of an API in the preferred embodiment of the invention
• the user agent 44 allows the user to input high-level instructions to the API 46 via a GUI These high level instructions will be received by the API 46 and processed to create and transmit graph data structures 12
• the processing will generally include the identification of filter nodes 32 which may employ library access functions 48 to obtain filter node data from remote libraries 50, but commonly used filter node data 32 will be stored at the API 46
• the initial API 46 will be supplied to the user with standard filter nodes for basic and commonly used communications modes If the user has frequent need for more obscure filter nodes, those may be stored on his computer or at a nearby location
• the API 46 also has access to node handling routines 52 and port manipulation and connection routines 54 which allow the assembly of graphs, and editing of filter nodes 32 as described above
• Figure 5 presents an implementation of end-to-end encryption without regard for the details of transport over the rest of the network 14 and of the processing required to get low-rate data suitable for encryption
• the caller 82 assembles a graph which describes the assembly of filter nodes 32 shown in Figure 5, by advising the API of the called party 84 and the desire for the communication to have a certain level of security and reliability
• the API creates the graph to identify both the caller 82 and called party 84, as well as encryption node 86 and the complementary encryption node 88 at the receiving end of the transmission From the user's request for a certain level of reliability, the API selects an error correction strategy and inserts nodes 89 and 90 into the graph data structure 12
• this graph data structure 12 may be prepared without regard for the constraints these filter nodes 32 will put on the available transmission means over the network 14, leaving these issues to be resolved by the Signal Processing Object
• the Signal Processing Object modifies the graph data structure 12 by inserting filter nodes 32 to route the graph data structure 12 over the desired service providers on the network 14
• This example may be described as a two level hierarchy naturally describing the mapping from physical (less detail) to logical (more detail, because there are several computing task per computer and several logical links per T1 ) networks
• Hiding the internals of the network 14 as in Figure 5 is preferred most of the time, but not always For example, a user may want to be sure that his data is never carried on a certain type of link, one belonging to a competitor, for example, or one for which availability is only statistically estimated or that it travels by two totally independent paths through the network 14 for reliability
• Audible communication with the user is performed with the microphone and speaker combination 96 which is usually provided in the form of a combination handset in the case of traditional telephony, or a microphone and speaker set in the case of a personal computer
• the audio signals are processed by an acoustic echo canceller 98 which attempts to filter and reject audible reverberations
• the signal input by the user is then coded by a voice coder 100 which digitizes the analogue voice signal coming from the acoustic echo canceller 98
• the voice coder 100 also performs a complementary operation of converts the digital signal received from the encryption node 102, into an analogue signal which is passed on to the acoustic echo canceller 98
• the voice coder 100 also has a bi-direction communication with the encryption node 102 which encrypts the signal originated by the user, and de-crypts the incoming signal from the forward error correction encoder 104
• Forward error correction FEC is well known in the art, and is commonly applied in wireless communication Briefly, it consists of adding codes to a transmitted signal to allow the recipient to detect and correct erroneous data, but at the expense of bandwidth
• the final interface is the modem (modulator/demodulator) driver 106, which modulates the signal onto a carrier frequency for transmission by radio channel, or similar device
• Adaptive filters tune their coefficients to the particular call in progress
• the best-known case in telephony is the echo canceller such as the echo canceller 98 of Figure 6 of which variants are designed to cancel acoustic echoes resulting from an acoustic path from the handset's loudspeaker to its microphone, and electrical echoes resulting from system components, particularly the "hybrid” that converts from 2-w ⁇ re to 4-w ⁇ re
• An echo canceller is typically a transversal filter with a few hundred taps multiply-adds, supervised by code that tries to determine the appropriate order and to turn it off when it appears to be unwanted or diverging
• Echo cancellers that attempt to deal with acoustic echo from a speaker phone in an office environment need thousands of taps and sophisticated update algorithms, and are still evolving There are two types of state in an adaptive filter current coefficient values and signals Coefficients could be check pointed from time to time, but it is more expensive with signals because they vary more rapidly
• Instantaneous companders work on a sample-by-sample basis
• the common A-law case is covered under "coders" below Echo suppressors cause trouble for modems, so such filters follow the convention of identifying a 2100Hz tone at the beginning of a call as an instruction from a modem to disable echo suppression
• a 3-way combiner receives three input voice signals and produces three outputs
• user C receives voice signal A + B
• user B receives voice signal A + C
• user A receives voice signal B + C
• N-way combining Companding may also be used to improve sub
• stereo speakers are available at a user's location, which is the current trend for personal computer sound (PC)
• multiple party calls may be processed in stereo at the PC so that each party is given a different physical location in the stereo sound output This allows the various voices to be more easily distinguished
• This filter would be located at the end-user's PC, but would also require that the received packets arrive in a timely fashion and be in a decodable form
• Voice coders such as the voice coder 100 of Figure 6, are used to reduce the bandwidth requirements for voice signals There are many types but broadly they can act on the waveform, minimizing some mathematical measure like error power They can model the source or they can model what the ear will notice Coding for compression is an active research area, and the invention allows for a steady stream of new coders to appear
• “Telephony classic” uses waveform coding in the form of 8kHz A-law (or ⁇ - law) Sampling is done at 8kHz on a signal filtered to pass the range from 300Hz to 3300Hz The passband was defined to get good subjective scores on speech quality and intelligibility, and the sample rate is designed with a 33% margin over the Nyquist minimum in a trade-off between network and pre-filter costs
• A-law and ⁇ -law are specialized 8-b ⁇ t floating-point representations, chosen as a way to get roughly constant signal-to-noise over a wide range of signal levels
• compact disk (CD) sound is stereo 16-b ⁇ t fixed-point sampled at 44 1 kHz, requiring roughly 24 times the bandwidth which requires a T1 level connection Because speech varies slowly from sample to sample, the same quality can be had for roughly half the bandwidth with adaptive delta pulse code modulation (ADPCM) which, roughly speaking, digitizes the derivative instead
• ADPCM adaptive delta pulse code modulation
• Source coders typically try to detect silence, and avoiding the transmission of silence typically saves about 50% of bandwidth on average At the decoding side it is conventional to replace silence with "comfort noise" so that the listeners know the connection is still live
• Source coding is hard to use for music, because it would be necessary to model a large number of different instruments alone and in combination, so early digital audio such as CD and DAT, just used waveform coding with enough bandwidth and dynamic range to satisfy the human ear Minidisc and digital compact cassettes brought in coding that reduced CD bandwidth by a factor of about 10 by using psychoacoustics In particular, masking effects where loud tones mask nearby ones for normal ears, and bandwidth can be saved by not transmitting the inaudible components
• This type of technique can also be rate-adapted, as applied to RealAudio, and is a good candidate for high-quality speech in networks of the invention
• N-way combining can take advantage of silence to do companding at no cost to bandwidth, and only needs to decode and recode while two or more parties are talking simultaneously
• MPEG Motion Picture Experts Group
• perceptual coders do for music Components of a video stream at high spatial frequencies are digitized at low resolution, using 8*8 discrete cosine transforms to do the filtering, and "motion estimation" is used so that components of an image that can be derived from adjacent frames are not retransmitted Actual MPEG processing will be performed at the end-user's PC, because it is very demanding and because specialized hardware exists for it However, it is desirable that the invention is able to handle its traffic properties
• Voice-mail and its video and text equivalents are usually thought of as pure data, but should be seen as objects with methods for reading and writing, or as filters that persist after calls complete
• Generalizing allows different types of coders, including encryption and fax data, to be used in a flexible manner with voice-mail
• g Reading voice-mail can be thought of as accepting a call, though a time-shifted one Voice-mails are all pending requests to the called party's proxy, and display the graph of the call that set them up even though it has long since been torn down, so that the accepting party can see data type, coding and encryption needs, source of call, check who is paying, and other parameters
• a single-use proxy stays alive and attached to the mail, into which a user may also call to retrieve mail This permits group messaging or retrieval by password, situations in which the voice-mail does not know who to contact In this sense reading voice-mail can be thought of as originating a call
• FEC Forward Error Correction
• TCP transmission control protocol
• Interleaving involves distributing the bits that are protected by one FEC word over several packets, so that even if one packet is badly corrupted, referred to as a "burst error", no single FEC word will suffer more errors than it can correct
• the compromise fr voice is that interleaving adds substantially to latency
• Encryption is the subject of a lot of research and growing commercial interest, so the invention may accommodate a steady stream of new software
• the computational loads of some of the more exotic encryption systems are fairly heavy, though triple data encryption standard (DES), standard in the banking industry, is not too unmanageable, requiring a couple of dozen bit-shuffles and 0(100) 4-b ⁇ t table lookups
• DES triple data encryption standard
• Internet traffic will best be encoded in the user's PC rather than at patch points 29, to minimize the amount of cleartext running around Still, if the invention is being used to implement a virtual private network the users may be transmitting cleartext around their Ethernets and using the invention to bridge remote Ethernets, in which case encryption should be performed at the patch points to provide a secure solution It is also preferred to use good encryption, including signature techniques, on wireless control links
• users are intended to have a data connection to the network 14, though they may also have a PSTN RJ-1 1 connection
• PSTN RJ-1 1 connection For Internet use, the data (Ethernet) connection would be faster, though for fax use, the implementation might be simplified by use of the PSTN RJ-11 connection
• a PSTN landhne could be simulated over the data network 14 to accommodate a fax connection, perhaps using adaptive delta pulse code modulation (ADPCM), or even straight pulse code modulation (PCM), but a voice coder would have to avoided as it would destroy the data
• the preferred solution is to detect that the data source is a fax, and implement a fax modem in software at the patch point 29 and at the gateway closest to the receiver so that only the raw fax data need be transmitted This can be used to economize on latency as well as on bandwidth, but requires that the fax at the receiving end can be spoofed by the local modem
• An exemplary modem application is presented in Figure 6 by means of modem filter 106
• IP fax is seen in the industry as a desirable feature, because the volume of fax traffic currently rivals that of voice traffic
• Network load can be reduced by leaving calls coded as for the wireless link, and by accepting long latencies for coded packets, for example, using best-effort service This also allows the encrypted voice data to be left encrypted in transit and storage Disk space may be used wherever it is available, though it is best to move it in advance close to the most likely place from which it will be read because latency is less tolerated when listening to voice-mail
• DTMF Dual tone multi-frequency
• Pulse dialling detection involves counting strings of open-circuits on the telephone line at about 10Hz
• the "flash” or “link” buttons often used to signal the desire to set up a 3-way call, basically dial "1"
• Both the pulse dialling and DTMF filters described above provide inputs to call processing software from the signal path That path does not have tight latency requirements, unless the user wishes to suppress the DTMF signal in the path to a called party
• Voice recognition can be used to replace dialling and to offer more sophisticated call control from a conventional telephone, or to do authentication
• Computational loads can be quite large, larger than voice coding, for example, which is typically a component of voice recognition, and the area is still subject to active research
• Computational loads can also vary widely as a function of the input data
• voice-operated services can be speaker-independent, but systems that can handle large vocabularies generally have to be trained for the speaker
• voice authentication systems require training of the receiving filter
• the need for speaker-dependent state suggests that these algorithms will need access to a library, which they may also want to update if they are capable of continual retraining
• the optimal voice coder for voice recognition is not necessarily the optimal or standard one for wireless, so choosing to use voice recognition somewhere in a call graph may constrain the type of voice coder used elsewhere
• the call setup agent could just ship both kinds of data, but that would be an expensive use of the wireless resource
• IP filtering is set up by default
• IP classifiers assign different types of traffic different priorities taking a single input, unclassified IP, and producing multiple output streams Packets should be classified before they are transmitted over the expensive wireless link so as to implement the user's own policies on what to pay premium rates for
• a default classifier may, for example assign a lower priority to Web traffic than to IP telephony or give one particular Ethernet source higher priority than others Classifiers belong at the network input and perhaps also at both ends of the wireless link
• IP classifiers can also manage traffic in the other direction regulating flows onto the Ethernet from the patch point 29
• Traffic shaping typically uses a leaky bucket strategy to force traffic statistics to match the profile promised in a quality of service (QoS) negotiation
• a "leaky bucket” is a technique used in ATM and RSVP to specify average bandwidth Traffic is modelled in terms of the average output rate and the size of the input buffer needed to smooth bursts out to that rate A long burst will overflow the bucket, and packets that overflow the bucket are typically marked as candidates for deletion if the network overloads
• QoS Negotiation refers to a technique described in greater detail in the co- pending patent application under the Patent Cooperation Treaty Serial No , titled “Method and System for Negotiating Telecommunication Resources” Briefly, a calling party creates a graph including a desired QoS and proposed pricing, and transmits it to the service provider for consideration The service provider may accept the proposal, issue a counter proposal or abandon the negotiation
• the call-manager software hands a "schematic" of the desired call to the RFQ (request for quote) server, which looks at the "traffic cops” and similar blocks to determine a price, then sets parameters in "teller” blocks that feed money into key components The modified graph is then returned to the call-manager for approval
• the calling graph For use as part of the RFQ process, the calling graph needs to be able to express anything of interest to the user or the network, including latency, frame error rate, and nature of warranties These things are expressed by including policing blocks in the call graph that enforce or test for compliance The policing blocks are trusted, by use of certification or similar techniques
• Traffic policing uses a similar rationale to traffic shaping, when done by trusted code at the input to a network
• a standard "traffic cop" filter may be installed as part of any IP path to advise parties when a negotiated QoS has not been met
• IP flows can be very bursty, new radio channels/slots may be needed when a queue starts to build up, then released when the queue empties In the absence of traffic, when its queue has been empty for a length of time comparable to a channel setup delay, for example, a stream may be assigned to a collision-detect radio channel
• the channels are radio resources, and management policies are needed to share them efficiently among data flows, including flows among unrelated but nearby base stations 26 and patch points 29
• RTP Real time protocol
• circuit switching can be regarded as an extreme case of header compression, where source and destination addresses are known at channel setup
• Compression techniques are particularly sensitive to state, if the decompression filter at the other end of the link crashes and restarts with old state traffic may be permanently misdirected
• FIG. 7 presents an example of wireless IP communication graph applying the filter nodes 32 described above
• the Ethernet driver 108 will receive the data signal arriving on the Ethernet port and pass a corresponding data stream to the IP classifier 110 As described above, the IP classifier 110 assigns the incoming data to different priorities appropriate to the incoming data
• the graph is shown to utilize two ATM transport media UBR
• UBR (unspecified bit rate) and ABR (available bit rate) UBR is basically best-effort and models the current Internet service, while ABR specifies a minimum cell rate (MCR) as well as a peak rate, and the network uses back-pressure to control the flow Therefore UBR may be acceptable for Internet browsing, while ABR would be preferred for voice telephony, though users would expect to pay a higher rate for use of the ABR service
• the IP classifier 110 passes the data to the appropriate header compression node 112, 114 which operates as described above
• Separate filter nodes 32 are shown for the UBR and ABR data paths, though a single filter could be used to implement both As explained above, this would increase the level of complexity in the filter node 32 design, and is not generally desirable
• the graph then describes the addition of traffic cops 116, 118 to monitor the flow of data during the transmission, and to ensure that the user is obtaining the data transfer rates he has been promised during his negotiation
• Separate radio resource clients 120, 122 are then attached to the graph data structure 12 to coordinate access to the wireless resources with the global radio resource manager 124 When access is available, data is passed to the coder and modem driver 126 for transmission to the base station 26
• a graph design is presented which employs separate paths for state data and traffic data
• the header of incoming data received from an IP source 128 is compressed by the header compression node 130, which transmits the state and traffic separately
• the more critical state data is transmitted via a high reliability coder 132, while the less critical traffic data may pass through a traffic and resource manager 134 and low latency coder 136
• Both forms of data may then be handled by the same modem driver 138 and transmitted over a wireless channel to a receiving station 140 of some form, which may be a base station 26 or similar network entity
• the transmitted data will be decoded by a header decompression node 142 which handles the dual paths originally transmitted
• This arrangement allows a small amount of traffic data to be lost in favour of maintaining low latency, without losing state data
• Such an arrangement would be desirable, for example, for voice communication
• Firewalls implement security policies that control information flows between the inside and outside worlds, for example by forbidding telnet sessions and allowing only authorized logins from outside Other firewalls may performing logging and auditing functions, providing summaries to the administrator about what kinds and amount of traffic passed through it and how many attempts there were to break into it
• e Gateways convert IP traffic to and from other forms, for example to PSTN voice traffic
• Base stations 26 with PSTN interface cards can serve as gateways, or third-party gateways may be used by adapting to their protocols
• ISP Internet service provider
• a cache shares information between users, without having to communicate back to the original data source, so its use does not necessarily show up directly in a user's call-graph It logically fits as part of a gateway to the Internet backbone
• H 323 is widely used to describe connections between applications programs running on operating systems such as UNIX and Windows It can be used to set up connections between applications programs running on different computers such that packets of data are passed between them across such networks as an Ethernet or the Internet
• Socket (www wireless-sys com", 8888) returns an object that represents a connection to "port 8888" on a computer on the Internet whose name is “www wireless-sys com” This object can be used with other Java methods to send data to, and receive data from this computer
• the "port number” is used by convention to define the type of data expected
• the port number is used by convention to describe the functionality of the program expected Sockets typically use the Internet Protocol (IP) and can further be set up to use either the ' unreliable datagram protocol" UDP which sends packets without checking to see if they have been received or the Transport Control Protocol (check) TCP which will retry until it receives a confirmation of receipt
• IP Internet Protocol
• TCP Transport Control Protocol
• Telephony applications typically use UDP because data that does not arrive on time is of no use, while file transfer programs typically use TCP so that accurate delivery is assured
• the user is generally required to choose between these two mechanisms to specify handling of error conditions in packet delivery or to write a completely new mechanism Just as for telephony, it is difficult to add encryption or signal processing features to the handling of an IP stream
• a service provider In order to manage the telecommunications network, a service provider will use the facilities of an operations, analysis, maintenance and provisioning (OAM&P) system Such systems exchange information with network elements using the simple network management protocol (SNMP)
• OAM&P operations, analysis, maintenance and provisioning
• SNMP simple network management protocol
• various filter nodes 32 in a graph interact with OAM&P systems using SNMP so that the service provider is able to monitor the performance of the network and manage network resources
• Filter nodes monitor the quality of service delivered to a user by tracking events such as packet queue overflow and packet loss Filter nodes would maintain statistics on the occurrence of such events and would report said statistics to the OAM&P system using SNMP
• Filter nodes that perform signal processing algorithms such as compression and voice coding may fail to perform as required, for example, due to the presence of background noise Such failures would be reported to the OAM&P system using SNMP
• Resources such as CPU time, memory, and link bandwidth, are generally resolved when the filter graph is mapped onto the hardware
• resources shortages can still manifest after mapping
• a user can exhaust the available recording capacity of a voice-mail system by depositing a very long message
• Such resource shortages would be reported to the OAM&P system using SNMP
• PSTN and other transmission service including long distance providers, wireless,
• connections between the filter nodes 32 in a graph can be described in terms of links containing the name of a source node, and of a port of the source node, and of a destination node, and of a port of the destination node
• the list of link properties describes the characteristics of the connection between the filters
• Links usually have a direction to them (from source to destination), although they may also provide for bi-directional information flows, as for example when a handshake is involved
• Examples of the characteristics of links can be rationalized from the port types of filter nodes 32, but may include
• a link may represent a physical connection in a generalized telecommunications network Similarly, the connection between a wireless base-station and wireless telephones or computers are physical connections Alternatively, a link may represent a logical connection between filters Said logical connection may be realized using different physical connections available in the telecommunications network Furthermore the properties of virtual links are changed to reflect the properties of the physical links in a telecommunications when the graph is mapped onto hardware 2 A link may reflect the characteristics of the service provided by the telecommunications service provider These characteristics may include available network bandwidth and quality of service parameters such as delay reliability, error rate, or packet loss probability A link may reflect the characteristics of the service desired by the user
• a link may reflect the characteristics of the service to which that the proxies for the user and the service provider have agreed These characteristics may include allocated network bandwidth and quality of service parameters such as delay, error rate, or packet loss probability
• a link may reflect the physical delay in the signaling medium (e g , wire, fibre, wireless) It may additionally reflect the queueing delay experienced by a packet that has been routed through the link
• a link may include costing parameters or a costing formula by which the service provider can obtain a quote for the total cost associated with the filter graph 7
• a link may be annotated with parameters that specify the billing mechanisms to be used 8
• a link may be annotated with information necessary to interact with an
• the method steps of the invention may be embodiment in sets of executable machine code stored in a variety of formats such as object code or source code Such code is described genencally herein as programming code, or a computer program for simplification Clearly, the executable machine code may be integrated with the code of other programs, implemented as subroutines, by external program calls or toy other techniques as known in the art
• the embodiments of the invention may be executed by a computer processor or similar device programmed in the manner of method steps, or may be executed by an electronic system which is provided with means for executing these steps Similarly, an electronic memory medium such a computer diskette, CD-Rom, Random Access Memory (RAM), Read Only Memory (ROM) or similar computer software storage media as known in the art, may be programmed to execute such method steps Further, electronic signals representing these method steps may also be transmitted via a communication network such as the Internet

Applications Claiming Priority (5)

Publications (1)

Family

ID=25680839

Family Applications (5)

Family Applications Before (3)

Family Applications After (1)

Country Status (8)

Cited By (1)

Families Citing this family (62)

Family Cites Families (21)

• 1999
  • 1999-09-24 WO PCT/CA1999/000876 patent/WO2000019677A2/fr active Application Filing
  • 1999-09-24 AU AU57248/99A patent/AU5724899A/en not_active Abandoned
  • 1999-09-24 MX MXPA01004103A patent/MXPA01004103A/es active IP Right Grant
  • 1999-09-24 WO PCT/CA1999/000875 patent/WO2000019693A1/fr not_active Application Discontinuation
  • 1999-09-24 MX MXPA01004101A patent/MXPA01004101A/es unknown
  • 1999-09-24 CN CN99813633.6A patent/CN1232129C/zh not_active Expired - Fee Related
  • 1999-09-24 MX MXPA01004102A patent/MXPA01004102A/es not_active IP Right Cessation
  • 1999-09-24 JP JP2000573105A patent/JP2002527001A/ja active Pending
  • 1999-09-24 AU AU57247/99A patent/AU5724799A/en not_active Abandoned
  • 1999-09-24 CN CN99813632.8A patent/CN1328749A/zh active Pending
  • 1999-09-24 EP EP99945790A patent/EP1116388A1/fr not_active Withdrawn
  • 1999-09-24 WO PCT/CA1999/000872 patent/WO2000019663A1/fr not_active Application Discontinuation
  • 1999-09-24 AT AT99944207T patent/ATE235774T1/de not_active IP Right Cessation
  • 1999-09-24 EP EP99944208A patent/EP1112639A1/fr not_active Withdrawn
  • 1999-09-24 WO PCT/CA1999/000873 patent/WO2000019735A1/fr not_active Application Discontinuation
  • 1999-09-24 EP EP99944210A patent/EP1116376A1/fr not_active Withdrawn
  • 1999-09-24 JP JP2000573106A patent/JP2002527002A/ja active Pending
  • 1999-09-24 WO PCT/CA1999/000871 patent/WO2000019691A1/fr active IP Right Grant
  • 1999-09-24 JP JP2000573042A patent/JP2002526978A/ja active Pending
  • 1999-09-24 EP EP99944209A patent/EP1116387A1/fr not_active Withdrawn
  • 1999-09-24 AU AU57249/99A patent/AU5724999A/en not_active Abandoned
  • 1999-09-24 AU AU57246/99A patent/AU767960B2/en not_active Ceased
  • 1999-09-24 WO PCT/CA1999/000874 patent/WO2000019736A1/fr active Application Filing
  • 1999-09-24 AU AU57250/99A patent/AU5725099A/en not_active Abandoned
  • 1999-09-24 DE DE69906333T patent/DE69906333T2/de not_active Expired - Fee Related
  • 1999-09-24 CN CNB998113506A patent/CN1135789C/zh not_active Expired - Fee Related
  • 1999-09-24 EP EP99944207A patent/EP1116374B1/fr not_active Expired - Lifetime
  • 1999-09-24 AU AU58432/99A patent/AU5843299A/en not_active Abandoned

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events