WO2012159537A1 - Système de messagerie instantanée et procédé permettant de partager des informations utilisateur - Google Patents

Système de messagerie instantanée et procédé permettant de partager des informations utilisateur Download PDF

Info

Publication number
WO2012159537A1
WO2012159537A1 PCT/CN2012/075527 CN2012075527W WO2012159537A1 WO 2012159537 A1 WO2012159537 A1 WO 2012159537A1 CN 2012075527 W CN2012075527 W CN 2012075527W WO 2012159537 A1 WO2012159537 A1 WO 2012159537A1
Authority
WO
WIPO (PCT)
Prior art keywords
query
server
user information
task
query server
Prior art date
Application number
PCT/CN2012/075527
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 WO2012159537A1 publication Critical patent/WO2012159537A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/02—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail using automatic reactions or user delegation, e.g. automatic replies or chatbot-generated messages

Definitions

  • the invention belongs to information processing technology, and in particular relates to an instant messaging system and method for sharing user information. Background technique
  • the invention provides an instant messaging system and method for sharing user information to solve the above problems.
  • the invention provides an instant messaging system for sharing user information, comprising a plurality of clients and at least one communication server.
  • the client connects to the communication server.
  • the above system also includes at least one global server and a query server.
  • the client is connected to the query server and the global server through the communication server, and the communication server is connected to the global server through the query server.
  • the client transmits and stores the user information to the global server through the communication server, and the global server synchronizes the user information to the query server.
  • the query server allocates a query task that exceeds the threshold according to the task processing priority and the task receiving policy.
  • the number of query servers is at least two.
  • the client passes The corresponding query server performs user information query, and the query server allocates the query task exceeding its threshold to other query servers according to the task processing priority and the task receiving policy.
  • the working efficiency of the query server and the global server can be improved, and the query efficiency of the user information can be improved.
  • it also effectively improves the throughput of the instant messaging system, and improves communication efficiency, making communication more immediate and smooth.
  • FIG. 1 is a schematic diagram of an instant messaging system for sharing user information according to a preferred embodiment of the present invention
  • FIG. 2 is a schematic diagram of a query server according to a preferred embodiment of the present invention
  • FIG. 3 is a flow chart showing a method for instant messaging of user information sharing according to a preferred embodiment of the present invention. detailed description
  • the instant messaging system for sharing user information provided by the preferred embodiment of the present invention includes a plurality of clients, at least one communication server, at least one global server, and at least two query servers. As shown in Figure 1, six client A10, Al l, A20, A2 A30, and A3 global servers, three communication servers B1 to B3, and three query servers C1 to C3 are used as an example. However, the present invention does not limit the number of clients, global servers, communication servers, and query servers.
  • the client A10 ⁇ A11 is connected to the communication server Bl
  • the client A20 ⁇ A21 is connected to the communication server B2
  • the client A30 ⁇ A31 is connected to the communication server B3.
  • the present invention also does not limit the number of clients to which each communication server is connected.
  • the client A10 ⁇ A11 is connected to the query server C1 and the global server through the communication server B1
  • the client A20 ⁇ A21 is connected to the query server C2 and the global server through the communication server B2
  • the client A30 ⁇ A31 are connected to the query server C3 and the global server through the communication server B3.
  • the communication servers Bl, B2, and B3 are connected to the global server through the query servers CI, C2, and C3, respectively.
  • the client in Shanghai is connected to the query server in Shanghai through the communication server in Shanghai.
  • the client in Suzhou is connected to the query server in Suzhou through the communication server in Suzhou.
  • the client in Beijing passes the communication server in Beijing and the query server in Beijing. Connected.
  • the number of query servers is the same as the number of communication servers.
  • the invention is not limited thereto.
  • the number of communication servers may be one, and the communication server may be connected to multiple query servers.
  • the clients A10 ⁇ A11, A20-A21, and A30 ⁇ A31 respectively transmit and store the user information to the global server through the communication servers B1 ⁇ B3, and the global server synchronizes the user information to the query servers C1 ⁇ C3.
  • the user information is not limited to the user login information, and may also include user modification information, user update information, and the like. Specifically, clients in different areas share the global server by connecting to different query servers through the communication server.
  • the corresponding query server can serve the client of the corresponding area, and execute the query task sent by the client (for example, querying the user information).
  • the query server in Shanghai can provide user information query service for Shanghai users
  • the query server in Suzhou can provide user information query service for Suzhou users.
  • the distributed query server is responsible for the query tasks of clients in different regions, which improves the query efficiency and makes the communication more immediate and smooth.
  • the query server when the number of query tasks received by the query server from the plurality of clients exceeds a threshold, the query server allocates a query task that exceeds the threshold according to the task processing priority and the task receiving policy.
  • the threshold value can be set, for example, according to the working efficiency of different query servers.
  • the query server sets the task processing priority based on the idle rate of the query server.
  • the query server may preset a comparison table of the idle rate and the task processing priority level.
  • the relationship between the idle rate and the task processing priority level is as follows:
  • the query server with an idle rate of 80% to 100% corresponds to the fourth level, and the idle rate is 60% to 80.
  • the query server of % corresponds to the third level
  • the query server with the idle rate of 40% to 60% corresponds to the second level
  • the query server with the idle rate of 0% to 40% corresponds to the first level.
  • the query server having a higher idle rate has a higher priority level.
  • the invention is not limited thereto.
  • the level of the above task processing priority and its correspondence with the idle rate can be set according to actual needs.
  • the three query servers C1 to C3 and the task processing priority level are set to level 4 as an example for specific description.
  • the clients A10 ⁇ A11, A20-A21, and A30-A31 send query tasks to the corresponding query servers C1 ⁇ C3 through the communication servers B1 ⁇ B3 respectively.
  • the query servers C1 ⁇ C3 monitor all query servers C1 ⁇ in real time. The working status of C3.
  • the query server C1 updates the rank of the task processing priorities according to the idle rates of the query servers C2 and C3.
  • the query server C1 can set the query server C2 to the fourth level according to the idle rate and the task processing priority level comparison table, and query the server.
  • C3 is the third level, that is, the priority level of the query server C2 is higher than that of the query server C3.
  • the task processing priority of the query server can be updated in real time.
  • query server C1 will assign its query task that exceeds the threshold to query server C2 (that is, the level 4 query server).
  • the query server C2 receives a corresponding number of query tasks according to the task receiving policy.
  • the task receiving policy is the difference between the threshold of the query server and the current task amount.
  • the query server C2 receives the query task assigned by the query server C1, the total number of query tasks processed by the query server C2 does not exceed Querying the threshold set by the server C2, the query server C2 is responsible for executing all the query tasks exceeding the threshold of the query server C1. If the total number of query tasks processed by the query server C2 exceeds the threshold set by the query server C2, the query server C1 reallocates the query task exceeding the threshold of the query server C2 to the query server C3 (ie, the query server of the third level).
  • the invention is not limited thereto.
  • the query server C2 may re-allocate the query task exceeding the threshold of the query server C2 to the query server C3 (ie, level 3). Query the server). Next, it is determined whether the total number of query tasks after the query server C3 receives the query task exceeds the threshold of the query server C3. If exceeded, the query server C1 or the query server C3 can invoke the query server of the next level in the priority sequence to execute the query task. When there is no next level of query server, the query tasks to be processed are queued for processing. In this case, the query server allocates the query task according to the combination of the idle rate and the priority, and fully utilizes the query server, thereby avoiding waste of resources and improving information query efficiency.
  • the query server includes a monitoring module 100, a control module 101, a storage module 102, and a receiving module 103.
  • the control module 101 is connected to the monitoring module 100, and the storage module 102 is connected to the receiving module 103.
  • the monitoring module 100 monitors the number of query tasks received by all of the query servers and transmits the monitored data to the control module 101.
  • the control module 101 updates the task processing priority according to the idle rate of the query server, and allocates a query task exceeding the threshold according to the task processing priority and the task receiving policy.
  • the receiving module 103 synchronously receives user information from the global server, and the storage module 102 stores user information.
  • the user logs in to the client, and the client transmits and stores the user information to the global server, and the global server synchronizes the user information to the query server.
  • the receiving module 103 of the query server receives the user information synchronously from the global server.
  • the query server receives the query task from the client through the communication server, and the monitoring module 100 of the query server monitors the number of query tasks received by all the query servers. At the same time, the monitoring module 100 transmits the number of query tasks received by the monitored query server to the control module 101.
  • the control module 101 can determine whether the data exceeds the set threshold and calculate the idle rate of the query server.
  • step 101 the user logs in to the client, and the client transmits and stores the user information to the global server, and the global server synchronizes the user information to the query server.
  • step 102 the query server receives the query task from the client through the communication server.
  • step 103 when the number of query tasks received by the query server from the client exceeds a threshold, the query server allocates a query task that exceeds the threshold according to the task processing priority of the query server and the task receiving policy.
  • the instant messaging system and method for sharing user information uses a distributed query server to be responsible for query tasks of clients in different regions, and the query server processes the query tasks exceeding their thresholds according to tasks.
  • Priority and task receiving policies are assigned to other query servers.
  • the working efficiency of the query server and the global server can be improved, and the query efficiency of the user information can be improved.
  • it also effectively improves the throughput of the instant messaging system, and improves communication efficiency, making communication more immediate and smooth.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)
  • Computer And Data Communications (AREA)

Abstract

L'invention porte sur un système de messagerie instantanée et sur un procédé permettant de partager des informations utilisateur. Le système comprend de multiples clients et un serveur de messagerie, les clients étant reliés au serveur de messagerie. Le système comprend en outre un serveur global et des serveurs d'interrogation. Les clients sont reliés respectivement aux serveurs d'interrogation et au serveur global via le serveur de messagerie, et le serveur de messagerie est relié au serveur global via les serveurs d'interrogation. Les clients transmettent des informations utilisateur au serveur global via le serveur de messagerie, les informations utilisateur sont stockées dans le serveur global et le serveur global synchronise les informations utilisateur envoyées aux serveurs d'interrogation. Lorsque le nombre de tâches d'interrogation reçues par les serveurs d'interrogation en provenance des clients dépasse un seuil, les serveurs d'interrogation attribuent les tâches qui dépassent le seuil conformément à une priorité de traitement des tâches et à une politique de réception des tâches. Le nombre de serveurs d'interrogation est supérieur ou égal à deux.
PCT/CN2012/075527 2011-05-24 2012-05-15 Système de messagerie instantanée et procédé permettant de partager des informations utilisateur WO2012159537A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN 201110135445 CN102209050B (zh) 2011-05-24 2011-05-24 一种用户信息共享的即时通讯系统及方法
CN201110135445.7 2011-05-24

Publications (1)

Publication Number Publication Date
WO2012159537A1 true WO2012159537A1 (fr) 2012-11-29

Family

ID=44697719

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/075527 WO2012159537A1 (fr) 2011-05-24 2012-05-15 Système de messagerie instantanée et procédé permettant de partager des informations utilisateur

Country Status (2)

Country Link
CN (1) CN102209050B (fr)
WO (1) WO2012159537A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102209050B (zh) * 2011-05-24 2012-07-18 苏州阔地网络科技有限公司 一种用户信息共享的即时通讯系统及方法
CN102209049B (zh) * 2011-05-24 2012-07-18 苏州阔地网络科技有限公司 一种用户信息处理的即时通讯系统及方法
CN102209048B (zh) * 2011-05-24 2012-05-23 苏州阔地网络科技有限公司 一种用于实现用户信息共享的即时通讯系统及方法
CN102209051B (zh) * 2011-05-24 2012-07-04 苏州阔地网络科技有限公司 一种实现用户信息共享的即时通讯系统及方法
CN107786621B (zh) * 2016-08-31 2020-10-16 阿里巴巴集团控股有限公司 一种用户信息管理方法、访问处理方法及装置和系统

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101022395A (zh) * 2007-03-16 2007-08-22 钱晓东 一种基于即时通讯平台的用户信息分享及管理的方法
CN101072166A (zh) * 2007-04-28 2007-11-14 腾讯科技（深圳）有限公司 一种实现网络预订存储的系统和方法
CN101715003A (zh) * 2009-11-12 2010-05-26 北京交通大学 互操作平台的负载控制优化方法
CN102209048A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种用于实现用户信息共享的即时通讯系统及方法
CN102209047A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种信息共享的即时通讯系统及方法
CN102209051A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种实现用户信息共享的即时通讯系统及方法
CN102209049A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种用户信息处理的即时通讯系统及方法
CN102209050A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种用户信息共享的即时通讯系统及方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101090371B (zh) * 2006-06-14 2011-02-02 阿里巴巴集团控股有限公司 一种即时通讯系统中用户信息管理的方法及系统
CN101577685B (zh) * 2008-05-09 2012-05-23 中国电信股份有限公司 信息查询方法及系统
CN101969468B (zh) * 2010-10-14 2013-09-18 广州从兴电子开发有限公司 查询服务器集群系统及查询方法

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101022395A (zh) * 2007-03-16 2007-08-22 钱晓东 一种基于即时通讯平台的用户信息分享及管理的方法
CN101072166A (zh) * 2007-04-28 2007-11-14 腾讯科技（深圳）有限公司 一种实现网络预订存储的系统和方法
CN101715003A (zh) * 2009-11-12 2010-05-26 北京交通大学 互操作平台的负载控制优化方法
CN102209048A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种用于实现用户信息共享的即时通讯系统及方法
CN102209047A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种信息共享的即时通讯系统及方法
CN102209051A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种实现用户信息共享的即时通讯系统及方法
CN102209049A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种用户信息处理的即时通讯系统及方法
CN102209050A (zh) * 2011-05-24 2011-10-05 苏州阔地网络科技有限公司 一种用户信息共享的即时通讯系统及方法

Also Published As

Publication number Publication date
CN102209050A (zh) 2011-10-05
CN102209050B (zh) 2012-07-18

Similar Documents

Publication Publication Date Title
WO2012159538A1 (fr) Système de messagerie instantanée et procédé permettant de partager des informations
Habib et al. The past, present, and future of transport-layer multipath
US20170070457A1 (en) Multiplexed demand signaled distributed messaging
CN1622549A (zh) 用于使用对等网络协议共享应用程序的方法和设备
WO2009097300A2 (fr) Equilibrage de charge de multidiffusion en fonction de la bande passante sur un hôte à interfaces multiples
US9729347B2 (en) System and method for selection of a conference bridge master server
WO2012159537A1 (fr) Système de messagerie instantanée et procédé permettant de partager des informations utilisateur
WO2010081401A1 (fr) Système de service vidéo
Kliazovich et al. CA-DAG: Communication-aware directed acyclic graphs for modeling cloud computing applications
WO2012059052A1 (fr) Procédé et appareil permettant de mettre en oeuvre une conférence multimédia
US9596063B2 (en) Dynamically allocating network resources for communication session
KR20020010913A (ko) 통신 네트워크에서의 방법 및 장치
WO2012159539A1 (fr) Système de messagerie instantanée et procédé permettant de traiter des informations utilisateur
CN102638582A (zh) 数据通信方法及通信端
WO2012159535A1 (fr) Système et procédé de messagerie instantanée pour partager des informations d'utilisateur
US8385533B2 (en) Bidding work assignment on conference/subscribe RTP clearing house
CN103763206B (zh) 一种网络调度方法及网关
WO2012159493A1 (fr) Système et procédé de messagerie instantanée pour partager des informations d'utilisateur
US7984158B2 (en) Web service for coordinating actions of clients
JP5154313B2 (ja) Ｓｉｐメッセージ振分方法およびｓｉｐメッセージ振分装置
EP3257197B1 (fr) Distribution de largeur de bande dans un réseau
JP2011203810A (ja) サーバ、計算機システム及び仮想計算機管理方法
WO2020082839A1 (fr) Procédé de traitement de message, dispositif associé et support de stockage informatique
Xing et al. Geographic-based service request scheduling model for mobile cloud computing
WO2015069378A1 (fr) Distribution hiérarchique d'informations de commande dans un serveur de réseau extrêmement évolutif

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: 12789620

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: 12789620

Country of ref document: EP

Kind code of ref document: A1