Source: http://www.google.com/patents/US20070263620?dq=%E2%80%9Cconfiguration+using+structure+and+rules+to+provide+a+user+interface.%E2%80%9D&ei=ANUpTrT8BsTm0QHVpJX-Cg
Timestamp: 2015-03-07 01:06:32
Document Index: 13876031

Matched Legal Cases: ['art 40', 'art 40', 'art 40', 'art 40', 'art 50', 'art 50', 'art 60', 'art 60']

Patent US20070263620 - Method and Network Device for Fast Look-up in a Connection-oriented ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA method for fast look-up in a connection-oriented communication includes generating a connection associated information according to peer information of a first peer and a second peer, storing the connection associated information into the first peer and the second peer, and building a connection between...http://www.google.com/patents/US20070263620?utm_source=gb-gplus-sharePatent US20070263620 - Method and Network Device for Fast Look-up in a Connection-oriented CommunicationAdvanced Patent SearchPublication numberUS20070263620 A1Publication typeApplicationApplication numberUS 11/383,221Publication dateNov 15, 2007Filing dateMay 15, 2006Priority dateMay 15, 2006Also published asUS7684402Publication number11383221, 383221, US 2007/0263620 A1, US 2007/263620 A1, US 20070263620 A1, US 20070263620A1, US 2007263620 A1, US 2007263620A1, US-A1-20070263620, US-A1-2007263620, US2007/0263620A1, US2007/263620A1, US20070263620 A1, US20070263620A1, US2007263620 A1, US2007263620A1InventorsChih-Feng Chien, Chung-Yu WeiOriginal AssigneeChih-Feng Chien, Chung-Yu WeiExport CitationBiBTeX, EndNote, RefManClassifications (14), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetMethod and Network Device for Fast Look-up in a Connection-oriented Communication
US 20070263620 A1Abstract
A method for fast look-up in a connection-oriented communication includes generating a connection associated information according to peer information of a first peer and a second peer, storing the connection associated information into the first peer and the second peer, and building a connection between the first peer and the second peer according to the connection associated information. Generating the connection associated information includes generating an index and a way. Images(8) Claims(8)
DETAILED DESCRIPTION Please refer to FIG. 3. FIG. 3 is a diagram of a look-up mechanism according to the present invention. As shown in FIG. 3, when the first peer A wants to send a packet 32 to the second peer B, the first peer A places the connection information in the header 34 of the packet 32. The packet 32 includes the header 34 and a payload 36. The header 34 includes two fields to store an index ID and a way WAY which are connection associated information generated according to the peer information of the first peer A and the second peer B. The second peer B includes a connection table 38 for storing a plurality of indexes and ways. For example, if the size of the connection table 38 is 1024�64, 10 bits are used to store the plurality of indexes ID0-ID1023 and 6 bits are used to store the plurality of ways WAY0-WAY63. When the second peer B receives the packet 32, the second peer B must check the index ID and the way WAY. The second peer B uses the index ID to point out the entrance of the connection table 38 and uses the way WAY to locate an agreeable way WAY0. The way WAY0 includes a plurality of fields to store indexes, source IP, destination IP, source port, and destination port. The field storing the index ID0 is the same as the index ID, and the way WAY0 is the same as the way WAY. Please refer to FIG. 4, which is a flow chart 40 building a connection according to the present invention. Flow chart 40 includes the following steps: Step 402: The first peer A wants to build a connection with the second peer B. Step 404: The first peer A sends a SYN packet to the second peer B. Step 406: The second peer B is idle. Step 408: The second peer B receives the SYN packet. The second peer B sends a SYN-ACK packet to the first peer A. Step 410: The first peer A receives the SYN-ACK packet. The first peer A sends an ACK packet to the second peer B. Step 412: The first peer A and the second peer B build a connection. Step 414: The first peer A sends the first index IA and the first way WA to the second peer B. Step 416: The second peer B sends the second index IB and the second way WB to the first peer A. Step 418: The first peer A associates (IA,WA) with (IB,WB). Step 420: The second peer B associates (IB,WB) with (IA,WA). As shown in FIG. 4, the left half part of the flow chart 40 is the process of the first peer A, and the right half part of the flow chart 40 is the process of the second peer B. In step 418 and step 420, when the first peer A builds a connection with the second peer B, they associate (IA,WA) with (IB,WB) as the connection association information for future entrances to the connection table. Please refer to FIG. 5, which is a flow chart 50 illustrating the process of the first peer A in FIG. 4. Flow chart 50 includes the following steps: Step 502: The first peer A wants to send a packet to the second peer B. Step 504: The first peer A finds out (IB,WB). Step 506: The first peer A appends (IB,WB) to the header of the packet and sends the packet to the second peer B. When the connection between the first peer A and the second peer B was previously built, the first peer A and the second peer B store the connection associated information (IA,WA) and (IB,WB). When the first peer A wants to send a packet to the second peer B, the first peer A obtains the stored (IB,WB) and sends the packet to the second peer B. Please refer to FIG. 6, which is a flow chart 60 illustrating the process of the second peer B in FIG. 4. Flow chart 60 includes the following steps: Step 602: The second peer B receives the packet. Step 604: The second peer B uses (IB,WB) of the packet to find out the entrance of the connection table. Step 606: The second peer B gets connection information. The connection between the first peer A and the second peer B was already built and the connection associated information (IA,WA) and (IB,WB) were stored. Thus, when the second peer B receives the packet, the second peer B obtains the stored (IB,WB) to find out an agreeable index and way in the connection table. Please refer to FIG. 7. FIG. 7 is a network device 70 for fast look-up according to the present invention. The network device 70 includes a central processing unit 71, a chipset 72, a network interface circuit 73, and a storage device 76. The central processing unit 71 is used for executing commands. The chipset 72 is coupled to the central processing unit 71 for coordinating data exchange. The network interface circuit 73 is coupled to the chipset 72 for accessing network resources. The network interface circuit 73 includes a medium access control circuit 74 for managing access to a network medium and a transceiver circuit 75 for transferring and receiving network information. The storage device 76 is coupled to the chipset 72. The storage device 76 comprises a connection table 78 that is connection associated information between the network device and another network device. The connection table 78 includes an index ID and a way WAY. The network device 70 is a member of a network system or a computer system. The above-mentioned embodiments illustrate but do not limit the present invention. The size of the connection table 38 is not limited to 1024�64. The number of bits for storing the index and the way are not limited to 10 bits and 6 bits as they depend on a user's demand. In conclusion, the present invention provides a method for fast look-up in a connection-oriented communication. The method reduces searching and comparing time by a wide margin. Storing the index and the way into the header of the packet only takes some bits which costs no extra money. The present invention performs well especially for the system with larger amounts clients. Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims. Classifications U.S. Classification370/389, 370/395.1, 711/216International ClassificationH04L12/56, H04L12/28, G06F12/00Cooperative ClassificationH04L69/22, H04L45/54, H04L49/90, H04L45/742European ClassificationH04L45/742, H04L45/54, H04L49/90, H04L29/06NLegal EventsDateCodeEventDescriptionSep 5, 2013FPAYFee paymentYear of fee payment: 4May 15, 2006ASAssignmentOwner name: FARADAY TECHNOLOGY CORP., TAIWANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHIEN, CHIH-FENG;WEI, CHUNG-YU;REEL/FRAME:017613/0175Effective date: 20060410Owner name: FARADAY TECHNOLOGY CORP.,TAIWANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHIEN, CHIH-FENG;WEI, CHUNG-YU;US-ASSIGNMENT DATABASE UPDATED:20100323;REEL/FRAME:17613/175RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services