WO2010142101A1 - Méthode d'identification d'un code d'exploitation et méthode d'interception d'un signal court de signalisation basée sur le code d'exploitation - Google Patents

Méthode d'identification d'un code d'exploitation et méthode d'interception d'un signal court de signalisation basée sur le code d'exploitation Download PDF

Info

Publication number
WO2010142101A1
WO2010142101A1 PCT/CN2009/074510 CN2009074510W WO2010142101A1 WO 2010142101 A1 WO2010142101 A1 WO 2010142101A1 CN 2009074510 W CN2009074510 W CN 2009074510W WO 2010142101 A1 WO2010142101 A1 WO 2010142101A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
message
pointer
sheep
signaling
Prior art date
Application number
PCT/CN2009/074510
Other languages
English (en)
Chinese (zh)
Inventor
刘振华
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2010142101A1 publication Critical patent/WO2010142101A1/fr

Links

Classifications

    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/0016—Arrangements providing connection between exchanges
    • H04Q3/0025—Provisions for signalling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12—Messaging; Mailboxes; Announcements
    • H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]

Definitions

  • the common ground P N
  • the messages each enable very small terminals to receive or receive text messages of limited length by means of , and so on, with the message content directly above.
  • the order of the message is up, and the component of the message (TP), the connection control part (SCC), the capability part (TCA), and the part (L) are mostly used.
  • the news is mainly divided into strengths and small and small. And each of the users in the system can have a message, but need to pass the message (S).
  • the messages are each composed of basic and separate messages (messages, -) and sheep, receiving messages (messages, S-) and each of the sheep and the news (in the news, -Ae) and the sheep.
  • the message and the message of each sheep are processed by the flow (R), that is, the routing address of the message to the location register (R) (that is, the address of C in each user's exchange), and then the message can be sent to C.
  • R the routing address of the message to the location register
  • each new demand is not raised. In the message and in each requirement, there is an order that needs to be sent to the message for some reason.
  • the method of operation and the operation-based message order method can be completed in the CCP part.
  • This provides a message order method for operation, including
  • the signalling connection control part receives the received message.
  • the signalling connection control part of each part uses the number of lines to solve the problem, and the operation of each piece of information and the operation of each piece of information, the operation of the operation, is the order.
  • the steps to be operated include the length and positioning of the information sheep.
  • the first pointer and the second pointer are pointed, the first pointer points to the user part, and the second pointer points to the tail of the user part.
  • the first pointer is the length and length of the information sheep, and locates the content of the information sheep.
  • the method includes the integration of the signaling globally by functions. At the beginning, according to different global message orders.
  • the step of dismantling the connection control part includes the pre-operation, which is configured on the special connection to the global in the message.
  • the signaling is specially connected to the message of the message.
  • the method of operation is provided, including
  • the signalling connection control part receives the received message.
  • the part of the signalling connection control is used to solve the problem. It is necessary to complete the operation of each part of the information and the operation of the information.
  • the steps to be operated include the length and positioning of the information sheep.
  • the instruction has a deciphering pointer and a second pointer, the first pointer points to the user part, and the second pointer points to the tail part of the user part.
  • the first pointer is the length and length of the information sheep, and locates the content of the information sheep.
  • the wood plan of this book goes up to the CCP,
  • the user part of the sheep teaching (T) is not complete, which improves the efficiency of understanding and reduces the system.
  • the message is no longer uplinked, and the TCA and signaling are alleviated, improving the efficiency of the system.
  • the proposed signaling method can be combined with the global (GT) function of SCCP, and it is more useful for different GT message commands.
  • FIG. 4 is a schematic diagram of the combination of the signaling GT functions of the present invention.
  • the signaling content contains the most information and the information of each interface is included in the information, and each information is contained in the component part of T.
  • the information is included in the CCP.
  • the TC is included in the CCP.
  • the sheep position teaches (T) the user, the CCP contains the signaling information (F) of the TP message sheep ( ).
  • the message order in the existing wood mainly includes the following steps, and the TP receives the message from the friends.
  • Step 120 the TP message is disassembled, and the message is obtained from the CCP CCP.
  • Step 140 T T disassemble, the component part information information obtained in the sheep step 15 , and each information line is solved to obtain phase information, and then each interface.
  • the general process of the message order is to make the message parsing up to
  • the signaling and interception process of this section mainly includes the following steps.
  • Step 210 the same step 0
  • Step 220 the same as step 120 Step 230, SCCP dismantling, sheep get T
  • T line solution get the information of the component part of the sheep and the operation of each information, whether the operation value of the operation is the expected operation in advance, if it is the ratio, if not, then T T , .
  • the message goes up to the CCP, and the CCP goes to the operation of the sheep (T). If it is a pre-operation (operation of the message), then the message, and .
  • 3 is a schematic diagram of the flow of the message and the method in the message. 3, mainly including the next steps
  • Step 310 receiving an external operation, which is a desired operation, is the operation of the message.
  • Step 320 in each of the TP friends, the user part of the CCP T sheep, the length of the user part, and the operation of the message order
  • Step 5330 the first pointer and the second pointer respectively point to the part and the tail of the user part, and refer to T, the first pointer of the pointing direction locates the length, the content and the content of each information sheep, and the second pointer to the tail is in the line Cross-border in solution
  • the message exists only in the (Beg) message or (o) message, and other types of T messages can be no, so the information can be sheep and the length is fast.
  • the part is ok (partial 0x6B), so if the message has a part, the first pointer needs
  • Step 340 the first pointer to the component part (0x6 of the component part), according to the voke component type, gradually shift the first pointer to the operation, and do not perform the operation.
  • step 350 the external operation of the operation is compared, and the result is obtained, that is, the request is not required.
  • step 320 is the operation of the order, and the rest of the content is not, so in the line like the existing wood, the group that only needs to follow, the pointer is quickly applied to the operation of the component part, so that the operation can be performed.
  • Part of the Vision CCP user can be incomplete.
  • the CCP user part in step 320 above is the encapsulation of T.
  • the study of T can be, the message of T is composed of information sheep, and the information is divided into three parts: the weight, the length (e h) and the content ( o e ). Therefore, the solution in step 320, the length and length of the information sheep can quickly locate each content.
  • Step analysis T can, T consists of mesons, namely each sub- and component. Each child "T user" is exchanged with the message containing the component, the component of the component, that is, the operation and the sheep.
  • Ingredients have components and parts. In the message-containing sheep teaching (T), most of them contain component parts, but they do not contain parts, and they operate.
  • T package is not fixed.
  • Information sheep is ok, some information sheep are not necessarily different, the length of the information sheep may also be indefinite, they are all in need of attention, so need Dange T And algorithm line solution.
  • CCP has a major function, which is to provide global (GT) routing functions, which can make the global interconnection of different orders directly. Since the proposed signaling operation and the function of the command are in the CCP, it is possible to integrate the function and the GT function, and to function according to different GT message commands.
  • GT global
  • the function is very high, and the function is larger than that of the sheep. Because in the demand, the user often does not want to pull all the signaling, but hopes that Signaling to the order. Therefore, in the case of God, we can integrate the functions proposed by the CCP with the GT functions of the CCP itself to meet the needs of users.
  • the message order is the GT function of the CCP will be sent to each message, if you need to send the order to the message, but not sent to other messages, this can be used in the GT of the message , the configuration of the operation, stronger.
  • FIG. 4 is a schematic diagram of the combination of the signaling GT functions of the present invention. 4, this mainly includes the following steps
  • Step 410 configuring the GT of the A in the message on the special connection (TP), and the operation of the same configuration (the operation refers to the operation)
  • Step 420 comparing each of the TP friends, in the CCP GT and the same, using the proposed operation method, comparing the pre-operations of the operations Whether the GT in the previous order is configured to route to the GT of the message A, to the operation of the previous operation,
  • the special step 43 is at least not satisfied, then the special step 44 step 43 is to make the match, the TP will be ordered, so it is not sent to the message A,
  • Step 44 If the order is not met, it means that it may not be ordered, or it may be caused by not the message, A, but other messages, so it is not necessary, TP often signaling.
  • the wood solution provided in this is the user part of the CCP CCP (ie, the package of T) is fast and incomplete, and the operation of the rapid positioning is enabled, and the message can be reduced.
  • the rabbit takes up more resources and improves the efficiency of the system.
  • the technical solution of the present invention can be combined with the GT function of the CCP, depending on the function of the different GT messages.
  • This wood scheme can be used in addition to other multi-issue processes in the order of the ordering process.
  • the wood scheme of this book goes up to the CCP, and the user part of the sheep teaching ⁇ J T) is incomplete, which improves the efficiency of understanding and reduces the system.
  • the technical solutions of the present invention can be combined with the CCP's GT functions, depending on the GT's message order function.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention porte sur une méthode d'identification d'un code d'exploitation et sur une méthode d'interception d'un signal court de signalisation basée sur le code d'exploitation, ladite méthode pouvant exécuter une opération d'identification et d'interception de code sur la couche SCCP (sous-système de commande de connexions de signalisation). La méthode d'interception comporte les étapes suivantes: émission par la couche MTP (sous-système de transport de messages) d'un paquet de données de la couche SCCP; désassemblage par la couche SCCP du paquet de données de la couche SCCP pour obtenir un paquet de données TCAP (sous-système application des capacités de transaction) de l'unité de données; décodage par la couche SCCP du paquet de données TCAP pour obtenir le champ de codes d'exploitation de l'information de service de l'unité d'information de la partie composants, et identifier si le code d'exploitation du champ de codes d'exploitation est le code d'exploitation cible préétabli à intercepter, la couche SCCP effectuant l'interception de la signalisation dans l'affirmative. L'invention améliore l'efficacité du décodage et réduit le temps système. De plus, ladite méthode utilisant le code d'exploitation de l'invention, peut être combinée à la fonction d'acheminement GT (titre global) de la couche SCCP pour permettre la fonction d'interception de messages courts de signalisation pour différents nombres de GT.
PCT/CN2009/074510 2009-06-12 2009-10-19 Méthode d'identification d'un code d'exploitation et méthode d'interception d'un signal court de signalisation basée sur le code d'exploitation WO2010142101A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2009102037739A CN101583106B (zh) 2009-06-12 2009-06-12 一种操作码识别方法及基于操作码的短消息信令拦截方法
CN200910203773.9 2009-06-12

Publications (1)

Publication Number Publication Date
WO2010142101A1 true WO2010142101A1 (fr) 2010-12-16

Family

ID=41365008

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/074510 WO2010142101A1 (fr) 2009-06-12 2009-10-19 Méthode d'identification d'un code d'exploitation et méthode d'interception d'un signal court de signalisation basée sur le code d'exploitation

Country Status (2)

Country Link
CN (1) CN101583106B (fr)
WO (1) WO2010142101A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103236903B (zh) * 2013-04-19 2015-11-18 中国科学院自动化研究所 一种改变数据序列顺序的装置
US10862866B2 (en) * 2018-06-26 2020-12-08 Oracle International Corporation Methods, systems, and computer readable media for multiple transaction capabilities application part (TCAP) operation code (opcode) screening

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1266603A (zh) * 1997-08-08 2000-09-13 艾利森电话股份有限公司 网路控制系统
CN1516490A (zh) * 2003-01-03 2004-07-28 ��Ϊ�������޹�˾ 限制非法国际短消息业务的方法
CN1633123A (zh) * 2004-12-03 2005-06-29 北京北方烽火科技有限公司 基于map层协议的短消息单向提取方法
US20050238048A1 (en) * 2004-04-14 2005-10-27 Tekelec Methods, systems, and computer program products for providing triggerless mobile services

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100394740B1 (ko) * 1999-10-28 2003-08-14 엘지전자 주식회사 넘버.7 신호망에서 스크린 메시지 전송 방지 방법
EP1266528B1 (fr) * 2000-03-07 2008-07-30 Tekelec Procedes et systemes de selection dans sous-systeme application mobile (ssam)
CN100352246C (zh) * 2001-12-19 2007-11-28 中兴通讯股份有限公司 一种短消息监管的方法及设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1266603A (zh) * 1997-08-08 2000-09-13 艾利森电话股份有限公司 网路控制系统
CN1516490A (zh) * 2003-01-03 2004-07-28 ��Ϊ�������޹�˾ 限制非法国际短消息业务的方法
US20050238048A1 (en) * 2004-04-14 2005-10-27 Tekelec Methods, systems, and computer program products for providing triggerless mobile services
CN1633123A (zh) * 2004-12-03 2005-06-29 北京北方烽火科技有限公司 基于map层协议的短消息单向提取方法

Also Published As

Publication number Publication date
CN101583106A (zh) 2009-11-18
CN101583106B (zh) 2012-05-23

Similar Documents

Publication Publication Date Title
JP4728193B2 (ja) セッション開始プロトコルでシステムメッセージ転送方法
US20080125123A1 (en) Method and system for to enable communication for a wireless device having a plurality of identifiers
EP1860841B1 (fr) Procédé et système pour remplacer la diffusion multimédia dans un procédé de communication d'un terminal
CN101631388B (zh) 一种基于无线网络的多方视频共享方法及系统
JP2008527784A (ja) 仮想移動通信番号提供方法および装置
CN104244197B (zh) 用于群体通讯的移动终端、移动即时通讯方法及系统
EP3471387A1 (fr) Procédé, dispositif et système permettant de communiquer avec un centre d'appels
CN103533103A (zh) 基于网络地址转换的通信方法和装置
CN106102033B (zh) 一种基于Android平台的设备通信方法和装置
EP3160172A1 (fr) Procédé et dispositif d'intercommunication pour service de messages courts
WO2009086249A2 (fr) Service de messagerie sms interactif
CN101433050A (zh) 注册多联系装置的方法
CN102724322A (zh) 一种实现远程操控的方法及装置
CN102474502A (zh) 用于针对本地网络中的设备实现多媒体服务的方法和装置
WO2018146356A1 (fr) Procédé et système de communication entre dispositifs via un langage naturel en utilisant des applications de messagerie instantanée et des identifiants publics interopérants
CN101268661A (zh) 用于基于sip的移动性管理的方法和系统
WO2010142101A1 (fr) Méthode d'identification d'un code d'exploitation et méthode d'interception d'un signal court de signalisation basée sur le code d'exploitation
KR100814252B1 (ko) 네비게이션을 이용한 이동통신 단말기의 도착 예상 시간알림 방법
US9009269B2 (en) Mediation server, control method therefor, communication device, control method therefor, account provisioning server, and control method therefor
CN101902708A (zh) 移动通信终端获取天气预报的方法
WO2013182079A1 (fr) Procédé et dispositif de transcodage de message court
CN106211104B (zh) 一种传输短信的终端、系统及方法
US20040264456A1 (en) Interoperability of presence services with wireless village and IP multimedia subsystem standards
CN102262533B (zh) 终端、触发方法和终端间应用程序通讯方法
KR20060094377A (ko) 멀티미디어 메시지 서비스 센터를 이용한 단문 메시지 읽음확인 서비스 제공 방법 및 장치

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09845710

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09845710

Country of ref document: EP

Kind code of ref document: A1