TWI407812B - 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
- TWI407812B TWI407812B TW98138029A TW98138029A TWI407812B TW I407812 B TWI407812 B TW I407812B TW 98138029 A TW98138029 A TW 98138029A TW 98138029 A TW98138029 A TW 98138029A TW I407812 B TWI407812 B TW I407812B
- Authority
- TW
- Taiwan
- Prior art keywords
- node
- confidence value
- received
- service
- peer
- Prior art date
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
本發明係有關於一種同儕選擇與管理方法及系統,且特別有關於一種可以依據每一節點自我評估之評估資訊來選擇節點之方法及系統,及評估資訊之產生方法及系統。The present invention relates to a peer selection and management method and system, and in particular to a method and system for selecting a node based on evaluation information of each node self-assessment, and a method and system for generating information.
隨著電子裝置,如電腦與網路的普及,相關架構與應用也逐漸受重視。舉例來說,現今以同儕架構所設計的應用相當普遍。With the popularity of electronic devices, such as computers and networks, related architectures and applications have also received increasing attention. For example, today's applications designed with the same architecture are quite common.
在同儕架構中,通常會有一個以上的同儕節點可以擁有其他節點想要的資料。由於這些同儕節點的能力不一定相同,若選擇到能力不夠好的同儕節點來要求服務時,相應需要服務之節點的使用者便需要花費較多的等待時間來接收資料。因此,準確地選出可以提供所需服務的同儕節點是必要的。另外,若同儕選擇的方法需要花費許多處理資源與時間及訊息溝通,則節點的需求資源與等待時間也將隨之增加,造成節點的負擔與不便。因此,應該也要在不犧牲準確度的情況下,降低挑選的時間與訊息成本。In a peer-to-peer architecture, there are usually more than one peer node that can have the information that other nodes want. Since the capabilities of these peer nodes are not necessarily the same, if a peer node with insufficient capabilities is selected to request a service, the user of the node that needs the service needs to spend more waiting time to receive the data. Therefore, it is necessary to accurately select peer nodes that can provide the required services. In addition, if the method of peer selection requires a lot of processing resources to communicate with time and information, the demand resources and waiting time of the node will also increase, resulting in the burden and inconvenience of the node. Therefore, it should also reduce the time and cost of selection without sacrificing accuracy.
一般來說,同儕節點的選擇通常係依據一個或數個網路效能量尺,來代表一個資料提供者可能的服務能力。常見的網路效能量尺包括了跳躍數(Hop Count)、封包來回時間(Round Trip Time,RTT)、及可用頻寬(Available Bandwidth)等。需要服務之節點可以透過量測相應不同節點之網路效能量尺,從而選擇其中一者進行連結,以取得相關資料或服務。In general, the choice of peer nodes is usually based on one or several network energy measures to represent the possible service capabilities of a data provider. Common network energy scales include Hop Count, Round Trip Time (RTT), and Available Bandwidth. The nodes that need the service can select one of them to connect to obtain relevant information or services by measuring the network energy efficiency of the different nodes.
然而,必須提醒的是,在一些情況中,距離近的節點不一定可以提供較高頻寬或是較小延遲的服務。在一些情況中,延遲小並不一定表示其可用頻寬大。影響可用頻寬的因素尚有很多。舉例來說,網路硬體的最大傳輸速度、節點本身的負擔狀況等都可以影響可用頻寬。另外,在一些情況中,由於網路狀況和同儕節點的行為變化很快,量測或觀察的結果無法表示這些變化的趨勢。另一方面,如前所述,由於需要服務之節點需要量測不同之網路效能量尺,節點將會花費大量資源來進行上述量測。However, it must be reminded that in some cases, nodes that are close together may not be able to provide services with higher bandwidth or less delay. In some cases, a small delay does not necessarily mean that its available bandwidth is large. There are many factors that affect the available bandwidth. For example, the maximum transmission speed of the network hardware, the burden status of the node itself, etc. can affect the available bandwidth. In addition, in some cases, due to the rapid changes in network conditions and behavior of peer nodes, the results of measurements or observations do not indicate trends in these changes. On the other hand, as mentioned above, since the nodes that need services need to measure different network energy levels, the nodes will spend a lot of resources to perform the above measurements.
有鑑於此,本發明提供同儕選擇與管理方法及系統。In view of this, the present invention provides a peer selection and management method and system.
本發明實施例之一種同儕選擇方法可以適用於一電子裝置。首先,由至少一節點接收一評估資訊。其中,評估資訊至少包括一自信值。每一節點依據一既定時間範圍之內是否接收到至少一切換服務通知來維護自信值。之後,依據由每一節點所接收之自信值,選擇節點中之至少一第一特定節點者,以進行連結。A peer selection method of an embodiment of the present invention can be applied to an electronic device. First, an evaluation information is received by at least one node. Among them, the assessment information includes at least a confidence value. Each node maintains a confidence value based on whether at least one handover service notification is received within a predetermined time range. Then, according to the confidence value received by each node, at least one first specific node in the node is selected to perform the connection.
本發明實施例之一種同儕選擇系統可以適用於一電子裝置,其包括一接收單元與一處理單元。接收單元由至少一節點接收一評估資訊。其中,評估資訊至少包括一自信值。每一節點依據一既定時間範圍之內是否接收到至少一切換服務通知來維護自信值。處理單元依據由每一節點所接收之自信值,選擇節點中之至少一第一特定節點,以進行連結。A peer selection system in accordance with an embodiment of the present invention may be applied to an electronic device including a receiving unit and a processing unit. The receiving unit receives an evaluation information from at least one node. Among them, the assessment information includes at least a confidence value. Each node maintains a confidence value based on whether at least one handover service notification is received within a predetermined time range. The processing unit selects at least one first specific node in the node to perform the connection according to the confidence value received by each node.
在一些實施例中,相應第一特定節點之連結之一服務品質可以被監測。當服務品質低於一既定品質時,傳送切換服務通知至第一特定節點。在一些實施例中,服務品質可以包括電子裝置與第一特定節點間之頻寬、傳輸延遲、頻寬之變異度、或傳輸延遲之變異度。In some embodiments, one of the links of the respective first particular nodes may be monitored for quality of service. When the quality of service is lower than a predetermined quality, the handover service notification is transmitted to the first specific node. In some embodiments, the quality of service may include a bandwidth, a transmission delay, a variability in bandwidth, or a variability in transmission delay between the electronic device and the first particular node.
本發明實施例之一種同儕管理方法。首先,提供至少一節點進行連結。接著,判斷是否由節點接收至少一切換服務通知。當並未接收到切換服務通知時,將一自信值增加。當接收到切換服務通知時,將自信值減少。A peer management method of an embodiment of the present invention. First, at least one node is provided for linking. Next, it is determined whether at least one handover service notification is received by the node. When the handover service notification is not received, a confidence value is increased. When the notification of the switching service is received, the confidence value is reduced.
本發明實施例之一種同儕管理系統至少包括一處理單元。處理單元提供至少一節點進行連結,且判斷是否由節點接收至少一切換服務通知。當並未接收到切換服務通知時,處理單元將一自信值增加。當接收到切換服務通知時,處理單元將自信值減少。A peer management system of an embodiment of the present invention includes at least one processing unit. The processing unit provides at least one node to connect, and determines whether the node receives at least one handover service notification. When the handover service notification is not received, the processing unit increments a confidence value. When receiving the handover service notification, the processing unit reduces the confidence value.
在一些實施例中,每一節點係依據一加法遞增倍數遞減(Additive Increase Multiplicative Decrease)演算法來維護自信值。當並未接收到切換服務通知時將自信值進行加法遞增,且當接收到切換服務通知時將自信值進行倍數遞減。In some embodiments, each node maintains a confidence value in accordance with an Additive Increase Multiplicative Decrease algorithm. The confidence value is incremented when the handover service notification is not received, and the confidence value is multiplied when the handover service notification is received.
本發明上述方法可以透過程式碼方式存在。當程式碼被機器載入且執行時,機器變成用以實行本發明之裝置。The above method of the present invention can exist in a coded manner. When the code is loaded and executed by the machine, the machine becomes the means for practicing the invention.
為使本發明之上述目的、特徵和優點能更明顯易懂,下文特舉實施例,並配合所附圖示,詳細說明如下。The above described objects, features, and advantages of the invention will be apparent from the description and appended claims appended claims
第1圖顯示依據本發明實施例之同儕選擇系統。依據本發明實施例之同儕選擇系統可以包括複數節點(110、120、130、140)。每一節點可以有線或無線地透過一網路150相互耦接,以取得相關資訊,並判斷是否進行連結,以取得相關資料與服務。Figure 1 shows a peer selection system in accordance with an embodiment of the present invention. A peer selection system in accordance with an embodiment of the present invention may include a plurality of nodes (110, 120, 130, 140). Each node can be coupled to each other through a network 150 by wire or wirelessly to obtain relevant information and determine whether to connect to obtain related information and services.
第2圖顯示依據本發明實施例之節點。依據本發明實施例之節點110可以係以處理器為基礎之電子裝置,如電腦系統、與可攜式裝置等。節點110可以至少包括一接收單元111、一儲存單元112、與一處理單元113。接收單元111可以係一網路接取單元,用以透過網路由不同節點接收資料。儲存單元112可以包括自己與/或由其他節點所接收之評估資訊112a。在一些實施例中,評估資訊112a可以包括一自信值與/或一負載狀況。負載狀況可以係節點110目前正在服務的節點數目。評估資訊112a的維護與使用方式將於後進行說明。處理單元113係用以執行本案之同儕選擇與管理方法,其細節將於後進行說明。Figure 2 shows a node in accordance with an embodiment of the present invention. The node 110 according to an embodiment of the present invention may be a processor-based electronic device such as a computer system, a portable device, or the like. The node 110 can include at least a receiving unit 111, a storage unit 112, and a processing unit 113. The receiving unit 111 can be a network access unit for routing data to different nodes through the network. The storage unit 112 may include evaluation information 112a that is received by itself and/or by other nodes. In some embodiments, the assessment information 112a can include a confidence value and/or a load condition. The load condition can be the number of nodes that node 110 is currently serving. The maintenance and use of the evaluation information 112a will be described later. The processing unit 113 is configured to perform the peer selection and management method of the present invention, the details of which will be described later.
第3圖顯示依據本發明實施例之同儕管理方法。依據本發明實施例之同儕管理方法可以適用於處理器為基礎之電子裝置,如電腦系統、與可攜式裝置。在此實施例中,評估資訊將進行維護。Figure 3 shows a peer management method in accordance with an embodiment of the present invention. The peer management 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, the evaluation information will be maintained.
如步驟S302,此電子裝置提供至少一節點進行連結,以提供這些節點相關資料與服務。如步驟S304,判斷是否由這些節點接收到切換服務通知。當並未接收到切換服務通知時(步驟S304的否),如步驟S306,將評估資訊中之自信值增加。當接收到切換服務通知時(步驟S304的是),如步驟S308,將評估資訊中之自信值減少。值得注意的是,在一些實施例中,自信值係依據一加法遞增倍數遞減(Additive Increase Multiplicative Decrease)演算法來進行維護。其中,當並未接收到切換服務通知時,將自信值進行加法遞增,而當接收到切換服務通知時將自信值進行倍數遞減。之後,如步驟S310,判斷是否由其他節點接收到一探測請求。若並未接收到探測請求(步驟S310的否),流程回到步驟S304,繼續判斷是否接收到切換服務通知。若接收到探測請求(步驟S310的是),如步驟S312,相應於探測請求之接收,將包括自信值與/或負載狀態之評估資訊傳送至傳送此探測請求之節點。之後,流程回到步驟S304,繼續判斷是否接收到切換服務通知。In step S302, the electronic device provides at least one node to connect to provide the node related materials and services. In step S304, it is determined whether a handover service notification is received by the nodes. When the switching service notification is not received (NO in step S304), as in step S306, the confidence value in the evaluation information is increased. When the switching service notification is received (YES in step S304), as in step S308, the confidence value in the evaluation information is decreased. It is worth noting that in some embodiments, the confidence value is maintained in accordance with an Additive Increase Multiplicative Decrease algorithm. Wherein, when the handover service notification is not received, the confidence value is incremented, and the confidence value is multiplied when the handover service notification is received. Thereafter, in step S310, it is determined whether a probe request is received by another node. If the probe request has not been received (NO in step S310), the flow returns to step S304 to continue to judge whether or not the handover service notification is received. If the probe request is received (YES in step S310), in step S312, corresponding to the receipt of the probe request, the evaluation information including the confidence value and/or the load status is transmitted to the node transmitting the probe request. Thereafter, the flow returns to step S304 to continue to judge whether or not the handover service notification is received.
提醒的是,前述實施例係當接收到切換服務通知時立即對於自信值進行調整。然而,在一些實施例中,接收到切換服務通知之時間可以先進行記錄,且當接收到探測請求之後,再擷取於最近一既定時間範圍內所接收之切換服務通知,以維護自信值。另一方面,前述實施例係相應於探測請求之接收,再傳送評估資訊至傳送探測請求之節點。然而,在一些實施例中,節點可以主動將評估資訊進行網路廣播。It is to be noted that the foregoing embodiment adjusts the confidence value immediately upon receiving the notification of the switching service. However, in some embodiments, the time at which the handover service notification is received may be recorded first, and after receiving the probe request, the handover service notification received within the most recent predetermined time range is retrieved to maintain the confidence value. On the other hand, the foregoing embodiment transmits the evaluation information to the node transmitting the probe request in response to the reception of the probe request. However, in some embodiments, the node may actively broadcast the assessment information to the web.
第5圖顯示自信值的調整之例子。在此例子中,假設自信值的調整方式係增加時加1,且減少時除以2。首先,當節點在Now時間點收到探測請求時,他檢視了[Now-Tpast ,Now]這段期間內收到切換服務通知的頻繁情況,其中,在T1和T2這兩個時間點,候補同儕節點各收到一次切換通知。假設在Now-Tpast 時間點的自信值為0。然後,在[Now-Tpast ,T1],其自信值呈線性成長。到了T1時間點,自信值掉為原本的一半。隨後[T1,T2]這段期間,自信又呈線性成長。T2時間點,自信值變為原本的一半。最後[T2,Now]這段期間,自信也是呈線性成長。Figure 5 shows an example of the adjustment of the confidence value. In this example, it is assumed that the adjustment of the confidence value is increased by 1 when it is increased, and divided by 2 when it is decreased. First, when the node receives the probe request at the Now time, he checks the frequent occurrence of the handover service notification during the period [Now-T past , Now], where, at the two points T1 and T2, Each of the alternate peer nodes receives a handover notification. Assume that the confidence value at the Now-T past time is 0. Then, in [Now-T past , T1], the confidence value grows linearly. At the time of T1, the confidence value fell to half of the original. During the period [T1, T2], confidence increased linearly. At the time of T2, the confidence value becomes half of the original. During the final [T2, Now] period, confidence also grew linearly.
值得注意的是,在一些實施例中,可以利用時間序列分析的方式來預測自信值的成長趨勢。舉例來說,以簡單線性回歸模型(Simple Linear Regression Model)來分析自信值,以得到相應之趨勢線。趨勢線之斜率可以表示其自信值的可能性。處理後之自信值可以包含至評估資訊中傳送至傳送探測請求之節點。It is worth noting that in some embodiments, time series analysis can be utilized to predict the growth trend of confidence values. For example, the Simple Linear Regression 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 transmitting the probe request.
第4圖顯示依據本發明實施例之同儕選擇方法。依據本發明實施例之同儕選擇方法可以適用於處理器為基礎之電子裝置,如電腦系統、與可攜式裝置。在此實施例中,至少一同儕節點將會被選擇。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.
如步驟S402,由至少一節點接收一評估資訊。如前所述,評估資訊可以包括一自信值與/或一負載狀況。其中,負載狀況可以係傳送評估資訊之節點目前正在服務的節點數目。值得注意的是,在一些實施例中,電子裝置可以先取得前述節點之一網路位址,再依據每一節點之網路位址傳送一探測請求至每一節點。當節點接收到探測請求之後,便會將相應之評估資訊傳送至電子裝置。如步驟S404,依據由每一節點所接收之評估資訊中之自信值,選擇至少一特定節點,以進行連結。提醒的是,在一些實施例中,當收到最先回傳回來的一既定數目之評估資訊後,便可以進行相關判斷與挑選。注意的是,在一些實施例中,具有最高或較高之自信值的至少一節點將被選擇為特定節點。當選定之特定節點大於一個時,則可以由選定之特定節點中選擇相應之負載狀況最輕者,以進行連結。提醒的是,在一些實施例中,當特定節點選定之後,電子裝置可以發出一加入請求至選定之特定節點。當特定節點接收到加入請求之後便可將電子裝置加入,以提供相關資料與服務。In step S402, an evaluation information is received by at least one node. As previously mentioned, the assessment information can 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 transmits the corresponding evaluation information to the electronic device. In step S404, at least one specific node is selected for linking according to the confidence value in the evaluation information received by each node. It is reminded that in some embodiments, when a predetermined number of evaluation information returned first is received, relevant judgments and selections can be made. Note that in some embodiments, at least one node having the highest or higher confidence value will be selected as the particular node. When the specific node selected is greater than one, the corresponding least load condition can be selected from the selected specific nodes for linking. It is noted that in some embodiments, after a particular node is selected, the electronic device can issue a join request to the particular node selected. When a specific node receives the join request, the electronic device can be added to provide related information and services.
之後,如步驟S406,電子裝置監測相應特定節點之連結之服務品質。在一些實施例中,服務品質可以包括電子裝置與特定節點間之頻寬、傳輸延遲、頻寬之變異度、與/或傳輸延遲之變異度等。當服務品質並未低於一既定品質時(步驟S408的否),流程回到步驟S406,繼續監測連結之服務品質。當服務品質低於既定品質時(步驟S408的是),如步驟S410,傳送一切換服務通知至特定節點。值得注意的是,在一些實施例中,當服務品質低於既定品質時,電子裝置可以重新由節點接收評估資訊,且依據接收之評估資訊重新選擇特定節點,以進行連結。Thereafter, in step S406, the electronic device monitors the quality of service of the link of the corresponding specific node. In some embodiments, the quality of service may include the bandwidth between the electronic device and the particular node, the transmission delay, the variability of the bandwidth, and/or the variability of the transmission delay, and the like. When the service quality is not lower than a predetermined quality (NO in step S408), the flow returns to step S406 to continue monitoring the quality of service of the link. When the quality of service is lower than the predetermined quality (YES in step S408), in step S410, a handover service notification is transmitted to the specific node. It should be noted that, in some embodiments, when the quality of service is lower than the predetermined quality, the electronic device may re-acquire the evaluation information by the node, and reselect the specific node according to the received evaluation information to perform the connection.
因此,透過本案之同儕選擇與管理方法及系統,每一節點可以依據是否接收到其他節點所傳送之切換服務通知來維護其評估資訊,與/或可以依據每一節點自我評估之評估資訊來進行節點選擇。Therefore, through the peer selection and management method and system of the present case, each node can maintain its evaluation information according to whether or not the handover service notification transmitted by other nodes is received, and/or can be performed according to the evaluation information of each node self-assessment. Node selection.
本發明之方法,或特定型態或其部份,可以以程式碼的型態存在。程式碼可以包含於實體媒體,如軟碟、光碟片、硬碟、或是任何其他機器可讀取(如電腦可讀取)儲存媒體,亦或不限於外在形式之電腦程式產品,其中,當程式碼被機器,如電腦載入且執行時,此機器變成用以參與本發明之裝置。程式碼也可以透過一些傳送媒體,如電線或電纜、光纖、或是任何傳輸型態進行傳送,其中,當程式碼被機器,如電腦接收、載入且執行時,此機器變成用以參與本發明之裝置。當在一般用途處理單元實作時,程式碼結合處理單元提供一操作類似於應用特定邏輯電路之獨特裝置。The method of the invention, or a particular type or portion thereof, may exist in the form of a code. The code may be included in a physical medium such as a floppy disk, a CD, a hard disk, or any other machine readable (such as computer readable) storage medium, or is not limited to an external 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 via some transmission medium, such as a wire or cable, fiber optics, or any transmission type, where the machine becomes part of the program when it is received, loaded, and executed by a machine, such as a computer. Invented device. When implemented in a general purpose processing unit, the code combination processing unit provides a unique means of operation similar to application specific logic.
雖然本發明已以較佳實施例揭露如上,然其並非用以限定本發明,任何熟悉此項技藝者,在不脫離本發明之精神和範圍內,當可做些許更動與潤飾,因此本發明之保護範圍當視後附之申請專利範圍所界定者為準。While the present invention has been described in its preferred embodiments, the present invention is not intended to limit the invention, and the present invention may be modified and modified without departing from the spirit and scope of the invention. The scope of protection is subject to the definition of the scope of the patent application.
110、120、130、140...節點110, 120, 130, 140. . . node
150...網路150. . . network
111...接收單元111. . . Receiving unit
112...儲存單元112. . . Storage unit
112a...評估資訊112a. . . Evaluation information
113...處理單元113. . . Processing unit
S302、S304、...、S312...步驟S302, S304, ..., S312. . . step
S402、S404、...、S410...步驟S402, S404, ..., S410. . . step
Now-Tpast 、T1、T2、Now...時間點Now-T past , T1, T2, Now. . . Time point
第1圖為一示意圖係顯示依據本發明實施例之同儕選擇系統。Figure 1 is a schematic diagram showing a peer selection system in accordance with an embodiment of the present invention.
第2圖為一示意圖係顯示依據本發明實施例之節點。Figure 2 is a schematic diagram showing nodes in accordance with an embodiment of the present invention.
第3圖為一流程圖係顯示依據本發明實施例之同儕管理方法。Figure 3 is a flow chart showing a peer management method in accordance with an embodiment of the present invention.
第4圖為一流程圖係顯示依據本發明實施例之同儕選擇方法。Figure 4 is a flow chart showing a peer selection method in accordance with an embodiment of the present invention.
第5圖顯示自信值的調整之例子。Figure 5 shows an example of the adjustment of the confidence value.
S402、S404、...、S410...步驟S402, S404, ..., S410. . . step
Claims (30)
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 TW201117625A (en) | 2011-05-16 |
TWI407812B true 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) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TW200726115A (en) * | 2005-12-27 | 2007-07-01 | Inventec Corp | Wireless data transmission system |
US20090097483A1 (en) * | 2007-10-15 | 2009-04-16 | Canon Kabushiki Kaisha | Method and device for transmitting data |
-
2009
- 2009-11-10 TW TW98138029A patent/TWI407812B/en active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TW200726115A (en) * | 2005-12-27 | 2007-07-01 | Inventec Corp | Wireless data transmission system |
US20090097483A1 (en) * | 2007-10-15 | 2009-04-16 | Canon Kabushiki Kaisha | Method and device for transmitting data |
Also Published As
Publication number | Publication date |
---|---|
TW201117625A (en) | 2011-05-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10097379B2 (en) | Managing communication congestion for internet of things devices | |
US10057150B2 (en) | Managing communication congestion for internet of things devices | |
US9923821B2 (en) | Managing communication congestion for internet of things devices | |
US8849251B2 (en) | System and method for optimizing network communication in response to network conditions | |
US6965575B2 (en) | Selection of routing paths based upon path quality of a wireless mesh network | |
US7706285B2 (en) | Method and apparatus for monitoring and displaying routing metrics of a network | |
US8266316B2 (en) | Client apparatus and method of streaming content, and computer readable recording medium storing program for performing the method | |
US8667126B2 (en) | Dynamic rate heartbeating for inter-node status updating | |
US7809357B2 (en) | System and method for optimizing network communication in response to network conditions | |
US20080253286A1 (en) | Available bandwidth estimation | |
Charles et al. | A reliable link quality-based RPL routing for Internet of Things | |
KR20100041765A (en) | Method for determining a group of pairs located close to another pair and associated server and analysis device | |
US20220182444A1 (en) | Peer-managed content distribution network | |
WO2022164732A1 (en) | System and method for network and computation performance probing for edge computing | |
TWI407812B (en) | Node selection and management methods and systems, and computer program products thereof | |
US20150026258A1 (en) | Method and apparatus for determining participant discovery message period | |
TWI441541B (en) | Feedback-based peer selection method and apparatus in peer-to-peer networks | |
CN114501650B (en) | Time slot resource allocation method, equipment and storage medium | |
CN111756798B (en) | Service scheduling method, device, equipment and storage medium based on gateway cascade | |
Cetinkaya et al. | Segment‐aware dynamic routing for DASH flows over software‐defined networks | |
Bhooanusas et al. | Measurement-based IoT server selection for mobile edge computing | |
JP2011048504A (en) | Method, apparatus, and program for load distribution between authentication servers | |
KR101627796B1 (en) | Device Indicator Data Transmitting Method for Network based AV System | |
JP2007329776A (en) | Network quality analysis apparatus, quality class determining apparatus, network quality analysis method, quality class determining method, and program | |
KR102329140B1 (en) | Apparatus and method for reducing transaction guarantee time considering geographical distance |