WO2010145407A1 - Method, service node device and access node device for keep-alive processing - Google Patents

Method, service node device and access node device for keep-alive processing Download PDF

Info

Publication number
WO2010145407A1
WO2010145407A1 PCT/CN2010/073112 CN2010073112W WO2010145407A1 WO 2010145407 A1 WO2010145407 A1 WO 2010145407A1 CN 2010073112 W CN2010073112 W CN 2010073112W WO 2010145407 A1 WO2010145407 A1 WO 2010145407A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
city
users
information
node device
Prior art date
Application number
PCT/CN2010/073112
Other languages
French (fr)
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 WO2010145407A1 publication Critical patent/WO2010145407A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/20—Manipulation of established connections
    • H04W76/25—Maintenance of established connections
    • 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/50—Network services
    • H04L67/535—Tracking the activity of the user

Definitions

  • the users of the former S are mainly divided into the main and configuration (CP, yac os Co Eg ao Pooco) users and the same as the (PPPO, Po oo Pooco Ove Ehe e) users, PPPOE users but not limited to the second tunnel forest ( 2T , aye TwoT e gPooco ) users.
  • the CP user uses the address resolution (R, AddessReso o Pooco) or CP lease to detect the break, and the PPPOE user PPPOE's eepa v.
  • the means for users to take a break is to concentrate on the users of S S.
  • S stipulates that the user should detect and check, and S periodically detects whether the user is not active, and the user is not allowed to live. This forces the user to use each resource.
  • S is the same as S and A, and is the obstacle that A and the user are obstacles.
  • the S user picks up the user, and the A P mode of the CP is the broadcast mode. It has security problems and is easy to be fired by the user.
  • the purpose of this book is to provide a method for rest, each and every one of the cities, and to reduce the S.
  • Each user is connected to the market, and each user information is exchanged.
  • Each user is connected to the city, and each user receives the information from each user.
  • the user's control address is received, and the user information of each reverse user information is taken off by each user in each of the respective cities. Step by step, this is provided by each, each
  • the user information of Hugh Sheep and Yugen will be taken by the users of the city.
  • Step by step this near provides the city, each
  • each of the user's pick-ups is connected to each other, and receiving the user information that is not from each user.
  • the user information of each user information is returned to each user in each city.
  • the user's way of rest is the user's rest under S all A, and different users have different ways of rest, and S is connected to the user today, and the power of Easy S is relatively large. 5
  • This paper provides a method for distributing PPP E and CP users in different ways on the S, and distributes A in a way that does not work in S to reduce the rest of S. S only needs to interact with A.
  • Information can be made by the user. Among them, the user information user's Hugh Control (AC, eda Access Co o) address. Among them, the Hugh user ignores the user 10 (ie delete).
  • Step 202 S Which A users have users, periodically put the 15 information of the user A, and the A who can interact with the A, wherein the user information can interact with the AC address but is not limited to the special system (BF, Bd ec oa Fow dg) Eec o ) , BF , access control (A CP, Access ode Co o Pooco ) and/or each (VBAS, V a Boadba dAccess Seve).
  • BF special system
  • Bd ec oa Fow dg) Eec o BF
  • access control A CP, Access ode Co o Pooco
  • VBAS V a Boadba dAccess Seve
  • the interaction between S and A tells A the user's AC information, and the notification method can be incremental, that is, every segment of the same A, A, A, S, which users are added or which users are reduced. . If the user detects the S A user, then A stops the user. However, it is also possible for the sheep user to advertise the way of A.
  • step 204 is not available Special step 207
  • Step 204 A The received AC, whether the AAC of the A includes AAC, does not contain the user segment (the user does not live). A and S interaction will not live User's AC report S
  • step 205 S the information that the AC is inactive is received, and the S AC user does not live, and the S user does not work, that is, deletes.
  • Step 206 S A does not live User detection, A stops user.
  • Step 207 If A and S A of the S are A, whether the user traffic is normal, and whether the A fault or the A S is the same.
  • a and S interact with each other, whether S A can and whether all users under A have traffic is not A's interaction barrier, A can connect to user A.
  • the interface traffic is greater than a certain, is A's interaction.
  • Step 208 If the traffic of A can be greater than the country, then the user under A is not (ie). Otherwise, all users under A are not alive, and all users under the network are forced to be connected.
  • the S user can take the outside and the internal mode, and the internal rest refers to the user's rest. Among them, the user refers to the user interface of the user A.
  • the external user refers to not taking up the user's road break, as long as A and S can be used, among them, Hugh is a different way from S and A to the user.
  • the reason for being able to effectively work with the disabled is that the user is the same. A is often the same as the user, the same is the same. A user is not available, the barrier is the same as the user, A, the barrier may be the same.
  • Step A on the CP user Step A on the CP user.
  • Step B S and A have the same interaction, and all A on S are used by AC A.
  • Step C RG the user is not alive.
  • Step A Check your own AC. The AC does not exist in its own AC. A tells S AAC not to live.
  • Step EA checks its own AC, AAC does not exist in its own AC, and A tells S AAC not to live.
  • Step A2 PP OE and 2T "P Oe”.
  • Step B2 S and A have the same interaction, and all A on S are used by AC A.
  • Step C2 RG the user does not live.
  • Step 2 A Your own AC, AAC does not exist in your own AC, A tells S AAC not to live.
  • Step 2 A Your own AC, AAC does not exist in your own AC, A tells S AAC not to live. A every time the same AC with its own AC does not exist, S, to the fixed, S user does not live, force the nuclear user, delete the user user.
  • Step F2 S and A have the same interaction.
  • Step B3 The same interaction between S and A (example A CP BF VBAS, etc.) will be used under A on S and all AC A.
  • Step C3 A barrier, S to A interaction A.
  • Step 3 S and A interact with each other.
  • A S detects whether A is the same, SA is not the same, all users of SA are not alive, and all users under the nuclear barrier A are under.
  • PPP E user address, user, this A and S interaction (A often but with S interaction example A CP),
  • Step B4 S and A have the same interaction (example A CP BF VBAS, etc.), and all of them will be AC A on each of A on S.
  • Step C4 A interacts with S, and S interacts with A.
  • Step 4 S and A interact A Still, S probes whether A is the same, S A is the same, S is connected to A traffic, and S is connected to A.
  • the traffic is greater than a normal, S A user.
  • step, Hugh Sheep 303 can
  • Each receiving sheep 401 is connected to each other in the user's connection, and the user information that is not obtained from each user is received.
  • the user information of each user information is closed to each user in each city.

Abstract

The present invention provides a method, a service node device and an access node device for keep-alive processing, wherein the method includes: after users access a service node device through an access node device, the service node device sends the access node device the key information of the users whose online statuses change; the service node device receives the information of the offline-user, which is fed back by the access node device by checking a media access control address table; according to the information of the offline-user, the service node device performs keep-alive processing on the users getting access through the access node device. By applying the method, the service node device and the access node device of the present invention, the pressure of the keep-alive processing on the service node device is reduced.

Description

于 理的方法、 各 各和接 市 各 木領域  Method of treatment, each and every city
本 涉及接 木， 尤其涉及 于休 理的方法、 各 各和接 市 各。 背景 木 This relates to picking up wood, especially to methods of rest, each and every one. Background
1，現有的 接 同 的基本 同 用戶主和 接 市 (A , Access ode) 各接 各 (S , SevCe ode) 各， 在S 各 地址和 分配的用戶策略。在用戶上 的同 S 各 建立相 的用戶 ， 不同的方式 用戶 休 ， 以 及 刪除 下 占用 各 統資源的用戶。  1, the existing basic connection with the user and the access (A, Access ode) each (S, SevCe ode) each, in the S address and assigned user policy. Users on the user who are in the same phase as S, users in different ways, and users who occupy various resources.
前S 接 的用戶 主要分力 主和配置 ( CP, y a c os Co Eg a o Pooco ) 用戶和以太同上的 (PPPO , Po o o Pooco Ove Ehe e ) 用戶, PPPOE用戶 但不限于第二 隧道林 ( 2T , aye TwoT e gPooco )用戶。 于 CP用戶 般 用地址解析 ( R , AddessReso o Pooco )或 CP 租 期的方式探測休 ， 于 PPPOE用戶 PPPOE的休 ( eepa v ) 休 。  The users of the former S are mainly divided into the main and configuration (CP, yac os Co Eg ao Pooco) users and the same as the (PPPO, Po oo Pooco Ove Ehe e) users, PPPOE users but not limited to the second tunnel forest ( 2T , aye TwoT e gPooco ) users. The CP user uses the address resolution (R, AddessReso o Pooco) or CP lease to detect the break, and the PPPOE user PPPOE's eepa v.
目前 于用戶休活的 手段是在S 各 S 接 的用戶集中 休 。 S 規定用戶休 探測 和同 ， S 定期 探測 是否 ， 定探測 和 同內用戶 相 ， 則 用戶已 不活 ， 此 強制用戶下 以 各資源。  At present, the means for users to take a break is to concentrate on the users of S S. S stipulates that the user should detect and check, and S periodically detects whether the user is not active, and the user is not allowed to live. This forces the user to use each resource.
統的休活方式存在以下問題  The following methods of rest have the following problems
1、 看S 接 用戶的能力增強， S 接 的A 下可以接 的用戶 越未越多， 此 大量用戶的休 ， S 各的 很大。 1. See the ability of the S to connect to the user, and the user who can connect to the S. The more the more, the large number of users, the S is very large.
2、 S 各 用戶的保 ， 不管用戶是否 ， 都需要 用戶的休 ， 需要占用很多不必要的 統資源。  2. The security of each user of S, regardless of whether the user or not, requires the user's rest, and needs to occupy a lot of unnecessary resources.
3、 占用戶休 失敗 ， S 是S 和A 同 ， 近是A 和用戶 同 障， 做出 的 障 。  3, accounted for the failure of the user, S is the same as S and A, and is the obstacle that A and the user are obstacles.
4、 S 用戶接 用戶休 ， 占用 ， 同 CP的A P 方式由于是 播方式， 存在看安全問題， 也容易被用戶的防火 。  4. The S user picks up the user, and the A P mode of the CP is the broadcast mode. It has security problems and is easy to be fired by the user.
5、 S 各 PPP E和 CP用戶 不同的休活方式， 增 了 S 各 理的 程度。 內容  5. S PPP E and CP users have different ways of rest, which increases the degree of S. Content
本 的目的在于提供 于休 理的方法、 各 各和接 市 各， 降低S 的休 。  The purpose of this book is to provide a method for rest, each and every one of the cities, and to reduce the S.
本 提供 于休 理的方法， 方法  The method, method provided by the method
占用戶 接 市 各接 各 各 ， 各 各將 在 化的用戶 信息 接 市 各  Each user is connected to the market, and each user information is exchanged.
各 各接收 接 市 各 休 控制地址 反 的 的用戶信息  User information of each control address opposite to each receiving and receiving
的用戶信息， 各 各 接 市 各下 的用戶 休 。  User information, each user of each city is closed.
步的， 本 近提供 于休 理的方法， 方法  Step-by-step method
占用戶 接 市 各接 各 各 ， 接 市 各接 收未自 各 各的在 化的用戶 信息  Each user is connected to the city, and each user receives the information from each user.
接 市 各 休 控制地址 ， 向 各 各反 的用戶信息， 的用戶信息 于 各 各 接 市 各下 的用戶 休 。 步的， 本 近提供 各 各， 各 The user's control address is received, and the user information of each reverse user information is taken off by each user in each of the respective cities. Step by step, this is provided by each, each
羊 ， 于占用戶 接 市 各接 ， 將在 化的 用戶 信息 接 市 各  Sheep, Yuzhan users pick up the city, the user information will be connected to the city
接收羊 ， 于接收 接 市 各 休 控制地址 反 的 的用戶信息  Receiving the sheep, receiving the user information of the control address reversed
休 羊 ， 于根 的用戶信息， 接 市 各下 的用戶 休 。  The user information of Hugh Sheep and Yugen will be taken by the users of the city.
步的， 本 近提供接 市 各， 各  Step by step, this near provides the city, each
接收羊 ， 于占用戶 接 市 各接 各 各 ， 接收 未自 各 各的在 化的用戶 信息  Receiving the sheep, each of the user's pick-ups is connected to each other, and receiving the user information that is not from each user.
羊 ， 于 休 控制地址  Sheep, Yu Xiu Control Address
反 羊 ， 于向 各 各反 的用戶信息， 的用戶信息 于 各 各 接 市 各下 的用戶 休 。  In the anti-goat, the user information of each user information is returned to each user in each city.
用本 提供的 于休 理的方法、 各 各和接 市 各， 將S 探測用戶的 力分散到不同的A ， 降低了 S 用戶休活的 ， 兔了大量的休活在S S 于繁忙， 可能造成的 問題， 休 了同 的穩定性。 說明 Using the methods provided by the present, each and every one of the cities, the force of the S-detecting user is dispersed to a different A, which reduces the S-user's rest, and the rabbits are largely alive in the SS, which may cause The problem, the same stability. Description
1 現有 木中的同 示意 1 existing in the same wood
2力本 于休 理的方法的流程示意 2 flow diagram of the method of restoring
3力本 各 各的 示意 3 force each
4力本 接 市 各的 示意 。 休 方式 4 Forces to pick up the city's various indications. Hugh way
下面結合 本 的 休 方式 。 統的用戶休活 方式是S 全部A 下 的用戶休 ，而 不同用戶 不同的休活方 式， 在S 接 用戶 著提升的今天， 而易 S 的 力比較大。 5 本 提供了在S 各上 不同的PPP E和 CP用戶 同 休 活方式分布 休活方法， 通 把 未在S 各集中休活的方式分布 A 以降低S 的休 ， S 只需和A 交互用戶 信息即可做出 用戶是否 。其中，用戶 信息 用戶的 休 控制( AC, eda Access Co o )地址。 其中， 休 用戶在 不 理和用戶 10 (即刪除)。 The following is a combination of this way of rest. The user's way of rest is the user's rest under S all A, and different users have different ways of rest, and S is connected to the user today, and the power of Easy S is relatively large. 5 This paper provides a method for distributing PPP E and CP users in different ways on the S, and distributes A in a way that does not work in S to reduce the rest of S. S only needs to interact with A. Information can be made by the user. Among them, the user information user's Hugh Control (AC, eda Access Co o) address. Among them, the Hugh user ignores the user 10 (ie delete).
2力本 于休 理的方法的流程示意囤。 2， 方法 以下步驟  2 The flow of the method of the method of rest is shown. 2, method The following steps
步驟201 A 下 的用戶接  User connection under step 201 A
步驟202 S 哪些A 有哪些用戶， 定期把 A 下 用戶的 15 信息， 通 可以和A 交互的 告 A ， 其中， 用戶 信息可以 AC 地址 交互 但不限于 向特 和制 (BF , Bd ec o a Fow d g eec o ) 、 BF 、接 市 控制(A CP,Access ode Co o Pooco ) 和/或 接 各 (VBAS, V a Boadba dAccess Seve ) 等。  Step 202 S Which A users have users, periodically put the 15 information of the user A, and the A who can interact with the A, wherein the user information can interact with the AC address but is not limited to the special system (BF, Bd ec oa Fow dg) Eec o ) , BF , access control (A CP, Access ode Co o Pooco ) and/or each (VBAS, V a Boadba dAccess Seve).
20 其中， S 和 和 A 同的交互 告 A 需要 的用戶的 AC信息， 告 方式可以是 增量告 ， 即每隔 段 同告 A , A 接 S 的用戶增 了哪些用戶或者下 減少了哪些用戶。 果 用戶下 ， S A 用戶 探測， 則A 停止 用戶 。 然， 也可 羊 用戶上下 S 通告A 的方式 20, the interaction between S and A tells A the user's AC information, and the notification method can be incremental, that is, every segment of the same A, A, A, S, which users are added or which users are reduced. . If the user detects the S A user, then A stops the user. However, it is also possible for the sheep user to advertise the way of A.
25 203 S A 是否有 ， 果有， 則特 步驟204 果沒有則 特 步驟207 25 203 SA Is there, if there is, then step 204 is not available Special step 207
步驟204 A 接收到的 AC， 本A 的 AC 中是否 包含 AAC， 果不包含表示 用戶 段 同內沒有任何 文特 ， 用戶 (即不活 )。A 和S 交互的 將 不活 用戶的 AC 告 S  Step 204 A The received AC, whether the AAC of the A includes AAC, does not contain the user segment (the user does not live). A and S interaction will not live User's AC report S
步驟205 S 收到A 告 的 AC不活 的信息 定 ， S AC 用戶不活 ， S 用戶 行不休 ， 即刪除 。  In step 205 S, the information that the AC is inactive is received, and the S AC user does not live, and the S user does not work, that is, deletes.
步驟206 S A 不活 用戶 探測， A 停止 用戶 。  Step 206 S A does not live User detection, A stops user.
步驟207、 果S 的 A ， S A 是否可 A 下 用戶流量是否 常， 而 是否A 障或A S 同 障。 Step 207: If A and S A of the S are A, whether the user traffic is normal, and whether the A fault or the A S is the same.
A 和S 同交互 ， S A 是否可 以及A 下所有用戶是否有流量未 是A 的交互 障， A 可 接 A 下 用戶的接口流量大于某 ， 是A 的交互  A and S interact with each other, whether S A can and whether all users under A have traffic is not A's interaction barrier, A can connect to user A. The interface traffic is greater than a certain, is A's interaction.
障。 barrier.
步驟208、 果A 可 接 A 的流量大于國 ， 則 A 下用 戶未 (即 ) 否則， A 下所有用戶不活 ， 強制接 市 各下所有用戶下 。  Step 208: If the traffic of A can be greater than the country, then the user under A is not (ie). Otherwise, all users under A are not alive, and all users under the network are forced to be connected.
S 用戶可以 外和 內 方式休 ， 內休 是指占用用戶 休 ， 其中， 用戶 是指接 A 的接 用戶子接口 外休 是指不占用用戶 路休 ， 只要A 和S 可 即可， 其中， 外休 是 S 和A 同 和用戶接 不同的 路休 。  The S user can take the outside and the internal mode, and the internal rest refers to the user's rest. Among them, the user refers to the user interface of the user A. The external user refers to not taking up the user's road break, as long as A and S can be used, among them, Hugh is a different way from S and A to the user.
用本 的 木 ，將S 的大量探測用戶 力分散到不同的A , S 只要 A 上 的 不活 用戶， 所有 常和 常用戶都休 ，有效降低了 S 的 ， 兔了大量的休活在S S 于繁忙， 可能造成的 問題， 同 的 常 。 Use this wood to spread the large amount of detection user power of S to different A. S As long as the inactive users on A, all the regular and regular users are off, effectively reducing the S, the rabbits have a lot of rest in the SS busy, possible problems, the same as usual.
步的， 統 了不同的用戶接 方式， CP PPP E和 2TP 的 休 ，不管是何 矣型的用戶只要 有流量在A 上 AC 都有 Steps, unified different user access methods, CP PPP E and 2TP Hugh, no matter what type of user, as long as there is traffic on A, AC has
AC的存在，使得S 不必再 不同的用戶 不同的休活方法。 步的， 由于 休 只在S 和A 同交互， 因此休 只在A 和S 同 ， 不舍下行到用戶主和， 而 兔休 下 行到用戶主和而戶生局 同用戶 的安全問題。  The presence of AC makes S no longer different for different users. Step, because Hugh only interacts with S and A, so Hugh is only in A and S, and does not go down to the user and the user, and the rabbit is down to the user and the user and the user.
步的， 可以有效 同 障戶生的原因是在用戶同 近是 同 。 A 下往往是用戶同 ， 上是 同 。 A 用戶不 可 ， 障 在用戶同 ， A ， 障可能 在 同 。  The reason for being able to effectively work with the disabled is that the user is the same. A is often the same as the user, the same is the same. A user is not available, the barrier is the same as the user, A, the barrier may be the same.
、 CP用戶上 地址， ， 此 用戶同 (RG) 致用戶不活 。  , CP user address, , this user (RG) to the user does not live.
步驟A CP用戶上 。  Step A on the CP user.
步驟B S 和A 同的交互 ， 將在S 上上 的 A 所有用 AC A 各。  Step B S and A have the same interaction, and all A on S are used by AC A.
步驟C RG ， 用戶 不活 。  Step C RG , the user is not alive.
步驟 A 檢查自己的 AC ， AC在自己的 AC 內不存在， A 告 S AAC不活 。  Step A Check your own AC. The AC does not exist in its own AC. A tells S AAC not to live.
步驟E A 檢查自己的 AC ， AAC在自己的 AC 內不存在， A 告 S AAC不活 。 A 每隔 段 同檢查自己 的 AC 都 AAC不存在 告 S ， 到 定的檢查 ，S 用戶不活 ， 強制核用戶下 ， 刪除 用戶用戶 。 步驟F S 和A 同的交互 告 A 用戶 探測， A 停止 查核 AC是否 。 Step EA checks its own AC, AAC does not exist in its own AC, and A tells S AAC not to live. A. Checking your own AC every other time. AAC does not exist. S is checked. The S user is not alive, and the user is forced to delete the user. The same interaction between step FS and A tells A user to detect, A stops checking whether AC is.
二、 E和 2T 用戶上 地址， 用戶 于 ， 此 用戶 G 致用戶不活 。  Second, the address of the E and 2T users, the user, the user G does not live.
步驟A2 PP OE和 2T 「 P Oe 上 。  Step A2 PP OE and 2T "P Oe".
步驟B2 S 和A 同的交互 ， 將在S 上上 的 A 所有用 AC A 各。  Step B2 S and A have the same interaction, and all A on S are used by AC A.
步驟C2 RG ， 用戶 不活 。  Step C2 RG, the user does not live.
步驟 2 A 自己的 AC ， AAC在自己的 AC 內不存在， A 告 S AAC不活 。  Step 2 A Your own AC, AAC does not exist in your own AC, A tells S AAC not to live.
步驟 2 A 自己的 AC ， AAC在自己的 AC 內不存在， A 告 S AAC不活 。 A 每隔 段 同 自己 的 AC 都 AC不存在 告 S ， 到 定的 ， S 用戶不活 ， 強制核用戶下 ， 刪除 用戶用戶 。  Step 2 A Your own AC, AAC does not exist in your own AC, A tells S AAC not to live. A every time the same AC with its own AC does not exist, S, to the fixed, S user does not live, force the nuclear user, delete the user user.
步驟F2 S 和A 同的交互 告 A 用戶 探測， A 停止 查核 AC是否 。  Step F2 S and A have the same interaction. A user detects, A stops checking whether AC is.
三、 OE用戶上 地址， 用戶 于 ， 此 A ， A 下接所有用戶不活 。  Third, the OE user address, the user, this A, A, all users are not alive.
步驟A3、 「 P Oe 上 。  Step A3, "P Oe.
步驟B3 S 和A 同的交互 (例 A CP BF VBAS 等)， 將在S 上上 的 A 下 所有用 AC A 各。  Step B3 The same interaction between S and A (example A CP BF VBAS, etc.) will be used under A on S and all AC A.
步驟C3 A 障 ， S 向A 的交互 A 。 步驟 3 S 和A 交互 A 仍然 ， S 探測A 是否 同 可 ， S A 同 不可 ， S A 所有用戶不活 ， 制核 障A 下所有用戶下 。 、 PPP E用戶上 地址， 用戶 于 ， 此 A 和 S 交互 (A 常但是和S 交互 例 A CP)， Step C3 A barrier, S to A interaction A. Step 3 S and A interact with each other. A, S detects whether A is the same, SA is not the same, all users of SA are not alive, and all users under the nuclear barrier A are under. , PPP E user address, user, this A and S interaction (A often but with S interaction example A CP),
S 和A 交互。 S and A interact.
步驟A4、 PPPOE 上 。  Step A4, PPPOE.
步驟B4 S 和A 同的交互 (例 A CP BF VBAS 等)， 將在S 上上 的 A 下 所有用 AC A 各。  Step B4 S and A have the same interaction (example A CP BF VBAS, etc.), and all of them will be AC A on each of A on S.
步驟C4 A 和 S 交互 ， S 向 A 的交互 A 。  Step C4 A interacts with S, and S interacts with A.
步驟 4 S 和A 交互 A 仍然 ， S 探測A 是否 同 可 ， S A 同 可 ， S 接 A 的 流量， S 接 A 的流量大于某 常 ， S A 下用戶 。 Step 4 S and A interact A Still, S probes whether A is the same, S A is the same, S is connected to A traffic, and S is connected to A. The traffic is greater than a normal, S A user.
3力本 各 各的 示意囤。 3， 各  3 The power of each of the instructions. 3, each
羊 301， 于占用戶 接 市 各接 ， 接 市 各 交互， 將在 化的用戶 信息 接 市 各。  Yang 301, in the user's pick-up and pick-up, and the city's interaction, the user information will be connected to the city.
接收羊 302， 于接收接 市 各 休 控制地址 反 的 的用戶信息。  Receiving the sheep 302, receiving the user information of the control address reversed.
休 羊 303， 于根 的用戶信息， 接 市 各下 的用戶 休 。  Hugh Sheep 303, Yugen's user information, and the users of the city are closed.
步的， 休 羊 303可以  Step, Hugh Sheep 303 can
子羊 ， 于 用戶是否 到預定 。  Ziyang, whether the user is scheduled or not.
控制子羊 ， 于 于 到預定 的 用戶， 強制其下 。  Control the child, forcing the intended user, forcing it.
或者， 步的， 休 羊 303可以  Or, step, Hugh Sheep 303 can
探測子羊 ， 于在預定的交互 中， 未收到接 市 各的反 ， 則探測接 市 各是否可 。  The detection of the sheep, in the predetermined interaction, did not receive the opposite of the market, then detect whether the market can be.
控制子羊 ， 于 果可 接 接 市 各的流量大于國 ， 則 接 市 各下用戶 否則， 接 市 各下所有用戶不活 ， 強制接 市 各下所有用戶下 。Controlling the sheep, if the traffic of the fruit can be connected to the city is greater than the country, then If you pick up all the users in the city, all the users in the city will not live, and you will be forced to pick up all the users.
4力本 接 市 各的 示意 。 4， 各 接收羊 401， 于占用戶 接 市 各接 各 各 ，接 未自 各 的在 化的用戶 信息。  4 Forces to pick up the city's various indications. 4. Each receiving sheep 401 is connected to each other in the user's connection, and the user information that is not obtained from each user is received.
羊 402， 于 休 控制地址 。  Sheep 402, Yu Xiu control address.
反 羊 403， 于向 各 各反 的用戶信息， 的用戶 信息 于 各 各 接 市 各下 的用戶 休 。  In the case of the anti-goat 403, the user information of each user information is closed to each user in each city.
以上 是本 的 休 方式， 指出， 于本 木領域的 普通 木 未說， 在不 本 原理的前提下， 近可以做出若干 和 ， 和 也 視力本 的休 。  The above is the way of rest, pointing out that the ordinary wood in the field of wood has not been said, under the premise of not using this principle, it is possible to make a number of and , and also the rest of the vision.

Claims

要求 Claim
1、 于休 理的方法， 其特 在于， 方法  1. The method of rest, which is characterized by
占用戶 接 市 各接 各 各 ， 各 各將 在 化的用戶 信息 接 市 各  Each user is connected to the market, and each user information is exchanged.
各 各接收 接 市 各 休 控制地址 反 的 的用戶信息  User information of each control address opposite to each receiving and receiving
的用戶信息， 各 各 接 市 各下 的用戶 休 。  User information, each user of each city is closed.
2、 要求 1 的方法， 其特 在于， 將在 化的 用戶 信息 接 市 各  2. The method of request 1 is characterized in that the user information of the user is connected to the market.
各 各定期將 接 市 各新上 、 或者新下 的用戶 信息 接 市 各  Each time, each user will receive new or new user information from the city.
或者， 接 市 各接 上 或者下 用戶 ， 各 各 將上 、 或者下 的用戶 信息 接 市 各。 Or, pick up the user or the next user, and each user information will be connected to the city or the next.
3、 要求 1 的方法， 其特 在于， 用戶 信息 用戶的 休 控制地址。  3. The method of claim 1, which is characterized by the user control user's control address.
4、 要求3 的方法， 其特 在于， 的用 戶信息， 各 各 接 市 各下 的用戶 休 于 到預定 的 用戶， 各 各強制所 到預定 的 用戶下  4. The method of claim 3, which is characterized in that the user information of each user in each city is taken to the predetermined user, and each of the mandatory users is placed under the predetermined user.
或者， 在預定的交互 各 各未收到 接 市 各的反 ， 探測 接 市 各是否可 果可 接 接 市 各的流量大于國 ， 則 接 市 各下 的 前用戶未 否則， 接 市 各下 的所有用戶 ， 強制所 接 各下 的所有用戶下 。 Or, in the scheduled interactions, each of the different exchanges has not received the counter, and whether the traffic in the city can be connected to the city is greater than the country, then the former users of the city are not otherwise, and the market is connected to each other. All users, forced to connect Under all the users under each.
5、 要求4 的方法， 其特 在于， 方法近  5. The method of claim 4, which is characterized by
于已下 或者 強制下 的用戶， 各 各告 所 接 市 各停止 。 For users who have been or are forced to do so, each of the conferences will be stopped.
6、 要求 1 的方法， 其特 在于， 方法近  6. The method of claim 1, which is characterized by
在 休 ， 各 各 接 市 各交互 的信息占用 用戶 的 或者， 在 休 ， 各 各 接 市 各交互的信息不占用 用戶 的 。  In Hugh, the information exchanged by each of the cities takes up the user's or the information exchanged at each of the cities does not occupy the user's.
7、 要求 1至6任 項 的方法， 其特 在于， 各 各 接 市 各 接 市 控制 、 向特 和制 、 展 向特 和制 、 接 各 中的至少  7. The method of claim 1 to 6 is characterized in that each of the cities is connected to the city, the special control system, the special exhibition system, and at least
交互。 Interaction.
8、 要求 1至6任 項 的方法， 其特 在于， 用戶 主和配置 用戶、 和/或以太同上的 用戶。 8. A method of claim 1 to 6, which is characterized in that the user master and the configuration user, and/or the user of the Ethernet.
9、 于休 理的方法， 其特 在于， 方法  9. The method of rest, which is characterized by
占用戶 接 市 各接 各 各 ， 接 市 各接 收未自 各 各的在 化的用戶 信息  Each user is connected to the city, and each user receives the information from each user.
接 市 各 休 控制地址 ， 向 各 各反 的用戶信息， 的用戶信息 于 各 各 接 市 各下 的用戶 休 。  The user's control address is exchanged, and the user information of each reverse user information is taken off by each user in each city.
10、 各 各， 其特 在于， 各  10, each, its characteristics, each
羊 ， 于占用戶 接 市 各接 ， 將在 化的 用戶 信息 接 市 各  Sheep, Yuzhan users pick up the city, the user information will be connected to the city
接收羊 ， 于接收 接 市 各 休 控制地址 反 的 的用戶信息 休 羊 ， 于根 的用戶信息， 接 市 各下 的用戶 休 。 Receiving the sheep, receiving the user information of the respective control addresses reversed Hugh Sheep, Yu Gen's user information, and the users of the city are closed.
11、 要求 10 的 各， 其特 在于， 休 羊  11, the requirements of each of the 10, its special, rest
子羊 ， 于 用戶是否 到預定  Child, whether the user is going to book
控制子羊 ， 于 于 到預定 的 用戶， 強制所 到預定 的 用戶下 。  Control the child, for the intended user, forcing the scheduled user.
12、 要求 10 的 各， 其特 在于， 休 羊  12, the requirements of each of 10, its special, rest
探測子羊 ， 于在預定的交互 中， 未收到 接 市 各的 反 ， 探測 接 市 各是否可  Detecting the sheep, in the predetermined interaction, did not receive the counters of the city, and the detection of the city can be
控制子羊 ， 于 果可 接 接 市 各的流量大于國 ， 則 接 市 各下 的 前用戶 否則， 接 市 各下 的所有用戶不活 ， 強制所 接 市 各下所有用戶下 。  Control the child, if the traffic of the city can be connected to the city, then the former users will be connected to the city. Otherwise, all the users under the city will not live, and all users under the city will be forced to go.
13、 接 市 各， 其特 在于， 各  13, pick up the city, its special features, each
接收羊 ， 于占用戶 接 市 各接 各 各 ， 接收 未自 各 各的在 化的用戶 信息  Receiving the sheep, each of the user's pick-ups is connected to each other, and receiving the user information that is not from each user.
羊 ， 于 休 控制地址  Sheep, Yu Xiu Control Address
反 羊 ， 于向 各 各反 的用戶信息，  Anti-goat, in the opposite direction to the user information,
的用戶信息 于 各 各 接 市 各下 的用戶 休 。 The user information is available to all users in each city.
PCT/CN2010/073112 2009-10-12 2010-05-24 Method, service node device and access node device for keep-alive processing WO2010145407A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910110755.6 2009-10-12
CN200910110755.6A CN101674669B (en) 2009-10-12 2009-10-12 Method, service node equipment and access node equipment for keep-alive processing

Publications (1)

Publication Number Publication Date
WO2010145407A1 true WO2010145407A1 (en) 2010-12-23

Family

ID=42021583

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/073112 WO2010145407A1 (en) 2009-10-12 2010-05-24 Method, service node device and access node device for keep-alive processing

Country Status (2)

Country Link
CN (1) CN101674669B (en)
WO (1) WO2010145407A1 (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101674669B (en) * 2009-10-12 2014-11-05 中兴通讯股份有限公司 Method, service node equipment and access node equipment for keep-alive processing
CN102857399B (en) * 2012-08-20 2015-06-17 华为技术有限公司 MAC address deleting method, device and system of VPLS dual homing network
CN103297689A (en) * 2013-04-28 2013-09-11 温州市凯能电子科技有限公司 Controllable video recycling and releasing network camera
CN103401729A (en) * 2013-07-30 2013-11-20 上海斐讯数据通信技术有限公司 Method for detecting abnormal offline of authenticate user
CN103414778B (en) * 2013-08-16 2016-05-25 成都广达新网科技股份有限公司 A kind of cluster Network Management Equipment method of keep-alive step by step
CN104021033B (en) * 2014-06-23 2018-06-08 中国银行股份有限公司 A kind of ashing technique and system of busy processing node
CN107666419B (en) * 2016-07-28 2020-12-11 中兴通讯股份有限公司 Virtual broadband access method, controller and system
CN107566213B (en) * 2017-08-28 2020-09-25 新华三技术有限公司 Keep-alive detection method and device
CN112333248B (en) * 2020-10-26 2023-09-01 金蝶软件（中国）有限公司 Login failure verification method and related device

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1917432A (en) * 2005-08-16 2007-02-21 上海贝尔阿尔卡特股份有限公司 Media gateway controller / media gateway, and method for synchronizing connection status after disconnection
CN101453447A (en) * 2007-12-03 2009-06-10 华为技术有限公司 Customer aging method for dynamic host configuration protocol DHCP and access equipment
US7577725B1 (en) * 2000-02-25 2009-08-18 Cisco Technology, Inc. IP address allocation in a network environment
CN101674669A (en) * 2009-10-12 2010-03-17 中兴通讯股份有限公司 Method, service node equipment and access node equipment for keep-alive processing

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101442502B (en) * 2007-11-20 2013-10-09 华为技术有限公司 Method, apparatus and system for monitoring session based on multicast technology

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7577725B1 (en) * 2000-02-25 2009-08-18 Cisco Technology, Inc. IP address allocation in a network environment
CN1917432A (en) * 2005-08-16 2007-02-21 上海贝尔阿尔卡特股份有限公司 Media gateway controller / media gateway, and method for synchronizing connection status after disconnection
CN101453447A (en) * 2007-12-03 2009-06-10 华为技术有限公司 Customer aging method for dynamic host configuration protocol DHCP and access equipment
CN101674669A (en) * 2009-10-12 2010-03-17 中兴通讯股份有限公司 Method, service node equipment and access node equipment for keep-alive processing

Also Published As

Publication number Publication date
CN101674669B (en) 2014-11-05
CN101674669A (en) 2010-03-17

Similar Documents

Publication Publication Date Title
WO2010145407A1 (en) Method, service node device and access node device for keep-alive processing
Bailis et al. The network is reliable: An informal survey of real-world communications failures
US7526549B2 (en) Cluster data port services for clustered computer system
US8345540B2 (en) Virtual snooping bridge in computer networks
CN100433730C (en) Method and system of multicast and video-on-demand
CN101442502B (en) Method, apparatus and system for monitoring session based on multicast technology
WO2017050254A1 (en) Hot backup method, device and system
CN105553682B (en) Event notification method and the system notified for event
CN101299689B (en) On-line detection method as well as mail server
WO2010148892A1 (en) Method, video access unit and system for implementing load balance for media transcoding network
CN103037023B (en) A kind of operation method of dummy machine system and dummy machine system
WO2010142171A1 (en) Computer telephony integration device and resource management method and incoming call control method
CN101674199A (en) Method for realizing switching during network fault and finders
CN103716230B (en) Message sending method, device and server
CN102055605B (en) Disaster tolerance system and method applied to AAA (authentication, authorization and accounting) server
CN102281263B (en) Method for establishing Internet small computer system interface (iSCSI) session and iSCSI initiator
WO2011035496A1 (en) Protection method for subscriber access network and equipment thereof
CN111010459A (en) Method for solving IP address conflict when SLB is used as SNAT
CN102170364B (en) Multicast communication method and device for broadband remote access server
WO2009087885A1 (en) Server system and method for transmitting event message of the server system, client terminal and method and program for connecting the client terminal, and recording medium
CN107277043A (en) Network admittance control system based on cluster service
CN101022399A (en) Automatic discovering server method, system and apparatus thereof
CN101621526A (en) iSCSI method and apparatus for preventing useless connection from occupying system resources
CN102255716B (en) A kind of method and system of the backup between equipment to protocol status
CN101483560A (en) Method, apparatus and system for implementing tunnel detection

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

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

Country of ref document: EP

Kind code of ref document: A1