TW201117625A - Node selection and management methods and systems, and computer program products thereof - Google Patents
Node selection and management methods and systems, and computer program products thereof Download PDFInfo
- Publication number
- TW201117625A TW201117625A TW98138029A TW98138029A TW201117625A TW 201117625 A TW201117625 A TW 201117625A TW 98138029 A TW98138029 A TW 98138029A TW 98138029 A TW98138029 A TW 98138029A TW 201117625 A TW201117625 A TW 201117625A
- Authority
- TW
- Taiwan
- Prior art keywords
- node
- service
- received
- confidence value
- notification
- Prior art date
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
201117625 六、發明說明: 【發明所屬之技術領域】 本發明係有關於一種同儕選擇與管理方法及系統,且 特別有關於一種可以依據每一節點自我評估之評估資訊 選擇節點之方法及系統,及評估資訊之產生方法及=統^ 【先前技術】 隨著電子裝置,如電腦與網路的普及, 重視。舉例來說,現今以同傅架構所設計二 在同儕架構中,通常會有一個以上的同 有其他節點想要的資料。由於這些同傅節點的能力不 不夠好的同倩節點來要求服務時,相 應而要服務之㈣的使用者便需要花費較多的等待時間來 接,資料。因此,準確地選出可以提供所需服務的同傅節 =是必要的。另外’若同儕選擇的方法需要花費許多處理 身源與時間及訊息溝通,則節點的需求資源與等待時間也 將ik之增加,造成節點的負擔與不便。因此,應該也要在 不犧牲準確度的情況下,降低挑選的時間與訊息成本。 般來°兑同儕節點的選擇通常係依據一個或數個網 路效能量尺’來代表一個資料提供者可能的服務能力。常 見的網路效能量尺包括了跳躍數(Hop Count)、封包來回時 間(Round Trip Time,RTT)、及可用頻寬(Available201117625 VI. Description of the Invention: [Technical Field] The present invention relates to a peer selection and management method and system, and more particularly to a method and system for selecting a node based on evaluation information of each node self-assessment, and Method for generating evaluation information and = system ^ [Prior technology] With the popularity of electronic devices, such as computers and networks, attention is paid. For example, today's design is based on the same architecture. In the same architecture, there will usually be more than one data that other nodes want. Since these Tongqiao nodes are not good enough to request services, the users who need to serve (4) need to spend more waiting time to access the data. Therefore, it is necessary to accurately select the same section that can provide the required service. In addition, if the method of peer selection requires a lot of processing of source and time and message communication, the demand resources and waiting time of the node will also increase ik, causing the burden and inconvenience of the node. Therefore, it should also reduce the time and cost of selection without sacrificing accuracy. The choice of a peer node is usually based on one or several network efficiency meters' to represent a data provider's possible service capabilities. Commonly used network energy measures include Hop Count, Round Trip Time (RTT), and available bandwidth (Available).
Bandwidth)等。需要服務之節點可以透過量測相應不同節 點之網路效能量尺,從而選擇其中一者進行連結’以取得 201117625 相關資料或服務。 ,而,必須提醒的是,在—些情況中,距離近的節點 不-疋可以提供較高頻寬或是較小延遲的服務。在— 況中’延遲小並不-定表示其可用頻寬大。影響可用頻^ 的因素尚有很多。舉例來說,網路硬體的最大 、、’ 節點本身的負擔狀況等都可以影響可㈣寬。另外,、=一 些情況中,由於網路狀況和同儕節點的行為變化报快,旦 測或觀察的結果無法表示這些變化的趨勢。另一方面= 前所述,由於需要服務之節點需要量測不 能 尺’節點將會花費大量資源來進行上述量测。“里 【發明内容】 有鑑於此,本發明提供同傅選擇與管理方法及系统。 本發明實關之-種同儕選擇方法可以勒於一電子 ^置。首先’由至少-節點接收—評估資訊。其中,評估Bandwidth) and so on. The nodes that need the service can select one of them to connect to the website to obtain 201117625 related information or services. However, it must be reminded that in some cases, nodes that are close to each other can provide services with higher bandwidth or less delay. In the case of 'the delay is small, it does not mean that its available bandwidth is large. There are many factors that affect the available frequency ^. For example, the maximum of the network hardware, the burden of the node itself, etc. can affect the (four) width. In addition, in some cases, due to network conditions and changes in the behavior of peer nodes, the results of measurements or observations do not indicate trends in these changes. On the other hand = as mentioned earlier, since the node that needs service needs to measure the inability, the node will spend a lot of resources to perform the above measurement. [Invention] In view of the above, the present invention provides a method and system for selecting and managing the same. The method for selecting the same method of the present invention can be implemented by an electronic device. Firstly, the information is received by at least the node. Among them, evaluation
資訊至少包括一自信值。每一節 母即點依據一既定時間範圍之 内疋否接收到至少-切換服務通知來維護自信值。之後, 依據由每-節點所接收之自信值,選擇節點中之至 一特定節點者’以進行連結。 本發明實施例之-種同傅選擇系統可以適用於一電子 裝,’其包括―接收單元與―處理單元。接收單元由至少 ^點接收-評估資訊。其中,評估資訊至少包括一自信 值。母1點依據-既定日㈣範圍之岐否純到至少一 切換服務通知來維護自信值。處理單元依據由每—節點所The information includes at least a confidence value. Each parent point maintains a confidence value based on whether or not at least a service notification is received within a predetermined time frame. Thereafter, based on the confidence value received by each node, a node to a specific node is selected to perform the connection. The same selection system of the embodiment of the present invention can be applied to an electronic device, which includes a "receiving unit" and a "processing unit." The receiving unit receives and evaluates information by at least ^ points. Among them, the assessment information includes at least a confidence value. The mother 1 point is based on the established date (four) range, whether it is pure to at least one switching service notification to maintain the confidence value. Processing unit based on each node
ί SI 5 201117625 以進 行連結節點中之至少1〜特定節點, 口在些實施例中,相應第一特定節點 σσ、可以破監測。當服務品質低於一定二之S服務 換服務通知至第一特定節點。在一 4;二時’傳送切 可,括電子袭置與第—特定節點2務品質 頻見之變異度、或傳輸延遲之變異度。、見 别延遲、 本發明實施例之一種同傅管理方 -節點進行連結。接著,判斷是否由節點至少 服務通知。當駐接收勒酿 切換 加。^收到切換服務通知時,將自信二r自信值增 一。,發,貫施例之一種同傅管理系統至少包括 口。 70理早70提供至少—節點進行連結 ^早 點接收至少—切換服務通知 ―疋否由節 時,處理單元將一自信值增加。當接未切換服務通知 處理單元將自信值減少。切換服務通知時, 在一些實施例中,每一節點係依據—加法遞辦 ^Additive Increase Multiplicative Decrease)^#^ 自仏值。當並未接收到切換服務通知時將自信 ^ 遞增’且當接收到切換服務通知時將自信 ^去 被機益載人且執灯時,機器變成用以實行本發明之裝置。 為使本發明之上述目的、特徵和優點能更明顯易憧, 下文特舉實施例’並配合所附圖示’詳細說明如下。 201117625 【實施方式】 本發據本發明實施例之同儕選擇系統。依據 本發明貝鈀例之同儕選擇系統可 120、130、140)。备一〜、丄 攸歡即...,占(U0 ISO mu 即,.、可以有線或無線地透過一網路 耦接,Μ取得相關資訊, 以取得相關資料與服務。 連結’ 第2圖顯示依據本發明實施例 施例之節點110可以係 1 1本發明貫 腦系統、與可攜式裝置等Γ節:f】f礎之電子裝置’如電 單元η卜一儲存單元以至少包括一接收 ^' 處理早元113。接收星分ί SI 5 201117625 to perform at least 1 to a specific node in the linking node, in some embodiments, the corresponding first specific node σσ can be broken. When the service quality is lower than the certain two S service, the service notification is sent to the first specific node. In a 4; 2 o' transmission, including the electronic morphing and the specific traits of the specific node 2, or the variability of the transmission delay. And seeing the delay, a node of the embodiment of the present invention is connected with the node. Next, it is judged whether or not the node is at least the service notification. When the reception is triggered, the switch is added. ^ When you receive the notification of the switch service, you will increase the confidence level by one. A hair management system that includes at least one mouth. 70 早早70 provides at least - the node is connected ^ early reception at least - switching service notification - 疋 No by the node, the processing unit increases a confidence value. When the service is not switched, the processing unit reduces the confidence value. When switching service notifications, in some embodiments, each node is based on -Additive Increase Multiplicative Decrease)^#^. When the handover service notification is not received, the confidence is incremented' and when the handover service notification is received, the machine will be self-confident and the light is turned on, and the machine becomes the device for implementing the present invention. The above described objects, features and advantages of the present invention will become more apparent from the following detailed description. 201117625 [Embodiment] A peer selection system according to an embodiment of the present invention is provided. According to the invention, the homogenous selection system of the palladium can be used 120, 130, 140).备一~,丄攸欢即..., 占(U0 ISO mu ie,., can be connected by wire or wirelessly through a network, and obtain relevant information to obtain relevant information and services. Link 'Figure 2 The node 110 according to the embodiment of the present invention may be a system of the present invention, and a portable device, such as an electronic device, such as an electrical unit, including at least one storage unit. Receive ^' processing early element 113. Receive star
111可以係一網路接取單 接收早7G 資料。綠在加- 用乂透過網路由不同節點接收 ::估4:可以包括自己與/或由其他節點所接收 一些實施例中,評估資訊心可以包 前正在服務的節點數目。評估資兄Ρ㈣點110目 將於後進行說明。處理單元113:==與使用方式 擇與管理方法,其細節將於後進執行本案之同傅選 第3圖顯示依據本發明實施例之同傅 實施例之同儕管理方法可以適用於處㈣為( 評估資訊料、了^裝置。在此實施例中, 如步驟S302,此電子裝置提供 一 以提供這些節點相關資料與服務。如步驟^進行連 由這些節點接收到切換服務通去,判斷是否 田並未接收到切換服務 201117625 通知時(步驟S304的否),如步驟S3〇6,將評估資 信值增加。當接收到切換服務通知時(步驟S3(m^之自 步驟㈣8,將評估資訊中之自信值減少。 心’如 在一些實施例中,自信值係依據—加法遞#H, (Adduive increase Multiplicative Decrease).^^ 漠”中,虽並未接收到切換服務通知時丁維 t法遞增,而當接收到切換服務通知時將自_值=值進行 遞減。之後,如步驟S31G,判斷是否由 ^订倍數 探测請求。若並未測請求(步驟㈣B卩的吹到- 收至l青求(步驟S310的是),如 ^右接 凊求之接收,將包括自信值與/或 相應於探測 至傳送此探測請求之節點 、、之評估資訊傳送 續判斷是否接收到切換服務通^。㈣回到步驟咖4,繼 即對==施::當:收到切換服務通知時立 ^奐服務通知之時間可以^實,例中,接收到 求之後,再擷取於最近一既定時^円且當接收到探測請 務通知, 以維護自信值。另:::乾圍内所接收之切換服 探測請求之接收,再# ’前述實施例係相應於 點。然而,在一此實施制+ *貝现至傳送探測請求之節 行網路廣播。一、',即點可以主動將評估 資訊進 第5圖顯示自信值的調整 自信值的調整方式係增加時加子。在此例子中’假設 當節點在Now R主叩L 且減少時除以2。 w時間點㈣探測請求時,他檢視了 [N( 201117625111 can receive a network access order to receive early 7G data. Green is in addition - it is used to route different nodes through the network. :: Estimate 4: Can include itself and/or be received by other nodes. In some embodiments, the number of nodes that the information heart can be served before is evaluated. The evaluation of the capital brother (four) point 110 will be explained later. The processing unit 113: == and the usage mode selection and management method, the details of which will be performed in the same manner as the fourth embodiment of the present invention. The same management method according to the embodiment of the present invention can be applied to (4) ( In this embodiment, in step S302, the electronic device provides a data to provide related information and services of the nodes. If the step is performed, the switching service is received by the nodes to determine whether the field is connected. When the handover service 201117625 notification is not received (NO in step S304), the evaluation credit value is incremented as in step S3〇6. When the handover service notification is received (step S3 (m^ from step (4) 8), the evaluation information is The confidence value is reduced. As in some embodiments, the confidence value is based on Additional Multiplicative Decrease. In the case of "Adduive increase Multiplicative Decrease."^^, the Ding Wei method is incremented when the notification of the switching service is not received. And when the notification of the switching service is received, the value of the value is decremented. After that, as in step S31G, it is determined whether the request is detected by the multiple. If the request is not detected (step (4) B Blowing to - receiving the request (in step S310), such as ^ right to request the receipt, will include the confidence value and / or corresponding to the node that detects the transmission of the probe request, the evaluation information transmission continues to judge Whether to receive the switching service pass ^. (4) Return to the step coffee 4, and then to == Shi:: When: receiving the switching service notification, the time of the service notification can be true, in the example, after receiving the request, Then take the latest timing and receive the notification request to maintain the confidence value. Another::: receiving the receiving service detection request received within the trunk, then # 'The foregoing embodiment corresponds to However, in this case, the implementation of the system + * is now to the transmission of the probe request for the webcast. First, ', that is, the point can actively put the evaluation information into Figure 5 to show the adjustment of the confidence value of the self-confidence value adjustment method Adding a sub-addition. In this example, 'Assume that the node is divided by 2 when the Now R main 叩L and decreases. w When the time point (4) probes the request, he examines [N( 201117625)
Nowh㈣时到切換料 T1和T2這兩個時間點,候況,其中,在Nowh (four) to the two points of time to switch materials T1 and T2, in which, in
:〜時間點的自信值為卜然W 自刚二二其自信值呈線性成長。到了τι時間點, ㈣^ 半。隨後[τι,Τ2]這段期間,自信又呈 N Τ2時間點’自信值變為原本的—半。最後[Τ2, 〇w 14又期間,自信也是呈線性成長。: ~ The confidence value of the time point is that Bu Ran has grown linearly since his 22nd confidence value. At the time of τι, (four) ^ half. Then during [τι, Τ 2], confidence again showed N Τ 2 time point 'confidence value changed to the original - half. Finally [Τ2, 〇w 14 during the period, confidence also grows linearly.
值待/主思的疋,在一些實施例中,可以利用時間序列 分析的方式來預測自信值的成長趨勢。舉例來說,以簡單 線I*生回知模型(Simple Linear Regressi〇I1 Model)來分析自信 值’以得到相應之趨勢線。趨勢線之斜率可以表示其自信 值的可能性。處理後之自信值可以包含至評估資訊中傳送 至傳送探測請求之節點。 第4圖顯示依據本發明實施例之同儕選擇方法。依據 本發明實施例之同儕選擇方法可以適用於處理 器為基礎之 電子裝置’如電腦系統、與可攜式裝置。在此實施例中, 至少一同儕節點將會被選擇。 如步驟S402,由至少一節點接收一評估資訊。如前所 述’評估資訊可以包括一自信值與/或一負载狀況。其中, 負載狀況可以係傳送評估資訊之節點目前正在服務的節點 數目。值得注意的是,在一些實施例中,電子裝置可以先 取得前述節點之一網路位址,再依據每一節點之網路位址 傳送一探測請求至每一節點。當節點接收到探測請求之 後’便會將相應之評估資訊傳送至電子裝置。如步驟S4〇4, 依據由每一節點所接收之評估資訊中之自信值,選擇至少 201117625 =!點’以進行連結。提醒的是,“ 當收到最先回傳回來的一既定數=-些實施例中, 進行相_斷_選。注作資訊後,便可以 最高或較高之自信值的至少;點:些實施例中,具有 當選定之特定節點大於—個時,貞擇為特定節點。 中選擇相應之輯狀況最輕者,以=選定之特定節點 在-些實施例中’當狀節點敎^結。提醒的是, 出一加入請求至選定之特定節點。洛;^電子裝置可以發 請求之後便謂電子裝置加人,以^ (㈣接收到加入 之後’如步驟S侧,電子裝置監服務。 ',服務品質。在-些實施例中,服務品;可 裝置與特定節點間之頻寬、傳輸延遲、頻寬之變異度、盥/ 或傳輸延遲之變異度等。當服務品質並未低於-既定品質 時(步驟S408的否)’流程回到步驟s4〇6,繼續監測連姓之 服務品質。當服務品質低於既定品質時(步驟s侧的是。 如^驟S41〇 ’傳送-切換服務通知至特定節點。值得注音 =置二一些實施例中’當服務品質低於既定品質時; 貧祝重新選擇駄節點,以峰連結。 文之抑 因此’透過本案之同儕選擇 節點可以依據是否接收献g以及线’母一 來維護其評估資訊,與/可即點所傳运之切換服務通知 估資訊來進行節點選擇^M依據每一節點自我評估之評 本發明之方法,或特定 的魏存在K瑪可或其抽’可以以程式碼 矛式碼1以包含於實體媒體,如軟碟、光碟 201117625 片、硬碟、或是任何其他機器可讀取(如電腦可讀取)儲存 媒體,亦或不限於外在形式之電腦程式產品,其中,當程 式碼被機器’如電腦载入且執行時’此機器變成用以參與 本發明之褒置。程式碼也可以透過一些傳送媒體,如電線 或電纜、光纖、或是任何傳輸型態進行傳送,其中,當程 式碼被機器,如電腦接收、載入且執行時,此機器變成用 以參與本發明之裝置。當在一般用途處理單元實作時,程 式碼結合處理單元提供一操作類似於應用特定邏輯 • 獨特裝置。 雖然本發明已以較佳實施例揭露如上,麸盆 限定轉明,任何熟悉此項技藝者,在不脫離;發:月: 神和乾圍内’當可做些許更動與潤飾,因此本發明之保 範圍當視後附之申請專利範圍所界定者為準。 201117625 【圖式簡單說明】 第1圖為一示意圖係顯示依據本發明實施例之同儕選 擇系統。 第2圖為一示意圖係顯示依據本發明實施例之節點。 第3圖為一流程圖係顯示依據本發明實施例之同儕管 理方法。 第4圖為一流程圖係顯示依據本發明實施例之同儕選 擇方法。 第5圖顯示自信值的調整之例子。 【主要元件符號說明】 110、120、130、140〜節點; 150〜網路; 111〜接收單元; 112〜儲存單元; 112a〜評估資訊; 113〜處理單元; S302、S304、...、S312〜步驟; S402、S404、...、S410〜步驟; Now-Tpast、ΤΙ、T2、Now〜時間點。In some embodiments, time series analysis can be used to predict the growth trend of confidence values. For example, the Simple Linear Regressi (I1 Model) is used to analyze the confidence value to get the corresponding trend line. The slope of the trend line can indicate the likelihood of its confidence value. The processed confidence value can be included in the evaluation information sent to the node that transmitted the probe request. Figure 4 shows a peer selection method in accordance with an embodiment of the present invention. The peer selection method according to an embodiment of the present invention can be applied to a processor-based electronic device such as a computer system and a portable device. In this embodiment, at least one of the peer nodes will be selected. In step S402, an evaluation information is received by at least one node. As previously mentioned, the assessment information may include a confidence value and/or a load condition. The load status may be the number of nodes that the node transmitting the evaluation information is currently serving. It should be noted that in some embodiments, the electronic device may first obtain a network address of one of the foregoing nodes, and then transmit a probe request to each node according to the network address of each node. When the node receives the probe request, it will transmit the corresponding evaluation information to the electronic device. In step S4〇4, according to the confidence value in the evaluation information received by each node, at least 201117625 =! point ' is selected for the connection. The reminder is, "When you receive the first number returned by the first return = some embodiments, the phase_break_select. After the information, you can at least the highest or higher confidence value; point: In some embodiments, when the selected specific node is greater than one, the selection is a specific node. The selected one of the lowest condition is selected, and the selected specific node is in the embodiment - the node is 当The reminder is that a request to join the selected specific node. Luo; ^ electronic device can send a request after the electronic device is added, to ^ ((4) after receiving the join, as in step S side, the electronic device monitoring service. ', service quality. In some embodiments, the service; the bandwidth between the device and the specific node, the transmission delay, the variability of the bandwidth, the variability of 盥 / or transmission delay, etc. When the quality of service is not low At the time of the predetermined quality (No in step S408), the flow returns to the step s4〇6 to continue monitoring the service quality of the surname. When the service quality is lower than the predetermined quality (the step s side is. If the step S41〇' transmits - Switch service notifications to specific nodes. Worth In the case of some embodiments, when the service quality is lower than the established quality; poor and re-selecting the 駄 node, the peak is connected. Therefore, the reason for selecting the node through the peer of the case can be based on whether to receive the g and the line. The parent first maintains the evaluation information, and/or can transfer the notification service notification information to the node selection. The method of the invention is based on the self-assessment of each node, or the specific Wei existence K Ma Ke or It can be encoded in a physical medium such as a floppy disk, a disc 201117625, a hard disk, or any other machine readable (such as computer readable) storage medium, or not limited to An external form of computer program product, wherein when the code is loaded and executed by a machine such as a computer, the machine becomes a device for participating in the present invention. The code can also be transmitted through some transmission medium such as a wire or cable. Optical fiber, or any transmission type, wherein when the code is received, loaded, and executed by a machine, such as a computer, the machine becomes a device for participating in the present invention. When the general purpose processing unit is implemented, the code combination processing unit provides an operation similar to the application specific logic. Unique device. Although the invention has been disclosed in the preferred embodiment as above, the bran basin defines the transition, any one skilled in the art, In the absence of detachment; hair: month: God and the squad, 'when there can be some changes and refinements, the scope of the invention is subject to the scope of the patent application. 201117625 [Simple description] 1 is a schematic diagram showing a peer selection system in accordance with an embodiment of the present invention. Fig. 2 is a schematic diagram showing a node in accordance with an embodiment of the present invention. Fig. 3 is a flow chart showing peer management in accordance with an embodiment of the present invention. Method Fig. 4 is a flow chart showing a method of selecting a peer according to an embodiment of the present invention. Fig. 5 shows an example of adjustment of a confidence value. [Description of main component symbols] 110, 120, 130, 140~ node; 150~ network; 111~ receiving unit; 112~ storage unit; 112a~ evaluation information; 113~ processing unit; S302, S304, ..., S312 Steps S402, S404, ..., S410~; Now-Tpast, ΤΙ, T2, Now~ time points.
Claims (1)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW98138029A TWI407812B (en) | 2009-11-10 | 2009-11-10 | Node selection and management methods and systems, and computer program products thereof |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW98138029A TWI407812B (en) | 2009-11-10 | 2009-11-10 | Node selection and management methods and systems, and computer program products thereof |
Publications (2)
Publication Number | Publication Date |
---|---|
TW201117625A true TW201117625A (en) | 2011-05-16 |
TWI407812B TWI407812B (en) | 2013-09-01 |
Family
ID=44935297
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
TW98138029A TWI407812B (en) | 2009-11-10 | 2009-11-10 | Node selection and management methods and systems, and computer program products thereof |
Country Status (1)
Country | Link |
---|---|
TW (1) | TWI407812B (en) |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TW200726115A (en) * | 2005-12-27 | 2007-07-01 | Inventec Corp | Wireless data transmission system |
FR2922391B1 (en) * | 2007-10-15 | 2009-12-04 | Canon Kk | METHOD AND DEVICE FOR DATA TRANSMISSION |
-
2009
- 2009-11-10 TW TW98138029A patent/TWI407812B/en active
Also Published As
Publication number | Publication date |
---|---|
TWI407812B (en) | 2013-09-01 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20200304382A1 (en) | Activity-and dependency-based service quality monitoring | |
AU2017259252B2 (en) | System and method for latency-based queuing | |
CN103326913B (en) | Definitiveness back-off method and device for peer-to-peer communications | |
Zhuo et al. | Win-Coupon: An incentive framework for 3G traffic offloading | |
EP1931084B1 (en) | A method for getting the link estimating parameters | |
JP4806216B2 (en) | System and method for optimizing network communications in response to network conditions | |
WO2017107577A1 (en) | Node probing method and device, path selection method and device, and network system | |
US20100146108A1 (en) | Rate-controllable peer-to-peer data stream routing | |
CN105208125B (en) | message transmission method, device and system | |
US20040008663A1 (en) | Selection of routing paths based upon path quality of a wireless mesh network | |
JP5021630B2 (en) | System and method for optimizing network communications in response to network conditions | |
US20060020697A1 (en) | System and method for presenting chat QoS indication to user | |
US20170331696A1 (en) | System and method for determining a master device in a neighborhood aware network | |
TW201732694A (en) | Task allocation method, system and device | |
TW201132083A (en) | Group owner selection with crossing requests | |
CA2570569A1 (en) | System and method for optimizing inter-domain event services | |
TW201108811A (en) | Methods and apparatus for identifying and/or selecting a connection identifier | |
CN102185801A (en) | Information processing method in instant messaging and instant messaging tool | |
CN115552867A (en) | Method and apparatus for selecting a target edge application server in an edge computing environment | |
WO2021068839A1 (en) | Object monitoring method, apparatus, electronic device, and computer-readable storage medium | |
WO2019019897A1 (en) | Data processing system, method and apparatus | |
CN112333249A (en) | Business service system and method | |
CN110572420B (en) | Method, device and storage medium for distributing, forwarding and processing task information | |
CN110012051A (en) | Notify method for pushing, device, terminal device, server and system | |
WO2009142059A1 (en) | Electronic data transmission/reception system |