Source: http://www.google.com/patents/US20070076730?dq=4484186
Timestamp: 2017-05-23 06:48:38
Document Index: 527462878

Matched Legal Cases: ['§119', 'art 600', 'art 600', 'art 600', 'art 600', 'art 600', 'art 600', 'art 600', 'art 700', 'art 700', 'art 700', 'art 700', 'art 700']

Patent US20070076730 - Internetworking support between a LAN and a wireless mesh network - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsIn one embodiment, two portals lie between a wireless mesh network and a LAN. Each portal provides a communication path between the mesh network and the LAN. The second portal is configured to forward data frames with unknown destinations to the first portal across an intramesh path between the two ...http://www.google.com/patents/US20070076730?utm_source=gb-gplus-sharePatent US20070076730 - Internetworking support between a LAN and a wireless mesh networkAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS20070076730 A1Publication typeApplicationApplication numberUS 11/518,332Publication dateApr 5, 2007Filing dateSep 7, 2006Priority dateSep 20, 2005Also published asUS7660318Publication number11518332, 518332, US 2007/0076730 A1, US 2007/076730 A1, US 20070076730 A1, US 20070076730A1, US 2007076730 A1, US 2007076730A1, US-A1-20070076730, US-A1-2007076730, US2007/0076730A1, US2007/076730A1, US20070076730 A1, US20070076730A1, US2007076730 A1, US2007076730A1InventorsShahriar Rahman, Johannes Kruys, Robert O'Hara, Robert MeierOriginal AssigneeShahriar Rahman, Kruys Johannes P, O'hara Robert B Jr, Meier Robert CExport CitationBiBTeX, EndNote, RefManPatent Citations (99), Referenced by (11), Classifications (5), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetInternetworking support between a LAN and a wireless mesh network
US 20070076730 A1Abstract
In one embodiment, two portals lie between a wireless mesh network and a LAN. Each portal provides a communication path between the mesh network and the LAN. The second portal is configured to forward data frames with unknown destinations to the first portal across an intramesh path between the two portals. Images(8) Claims(20)
RELATED APPLICATIONS [0001] This Application claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Patent Application Ser. No. 60/719,046 by Rahman et al., filed on Sep. 20, 2005, entitled “EFFICIENT INTERNETWORKING SUPPORT IN WIRELESS MESH NETWORKS,” with Attorney Docket No. CSCO-12661, assigned to the assignee of the present invention, and hereby incorporated by reference in its entirety. [0002] This Application is related to U.S. Utility patent application Ser. No. 11/364,020 by Rahman et al., filed on Feb. 27, 2006, entitled “A HYBRID DISTANCE VECTOR PROTOCOL FOR WIRELESS MESH NETWORKS,” with Attorney Docket No. CSCO-12318, assigned to the assignee of the present invention, and hereby incorporated by reference in its entirety.
TECHNICAL FIELD [0003] This disclosure relates generally to wireless networks. BACKGROUND [0004] A wireless mesh network may have multiple entry/exit points, or portals, to a LAN. In some cases, a wireless mesh network may have multiple portals connecting to a single local area network (LAN) segment, or to several segments bridged together. Such a situation creates a networking problem. For example, the mesh network should appear as a single loop-free segment, to an 802.1D Spanning Tree Protocol (STP). If multiple portals connect back to the same LAN, and traffic is allowed to flow across them, a loop is created within the network. Traffic could leave the mesh network by one portal, cross the LAN, and reenter the mesh at the other portal. Traffic could also leave the LAN by one portal, cross the mesh network, and reenter the LAN at the other portal. [0005] A common approach to a mesh network with multiple portals is to elect one of those portals, e.g., using some measure of bridge port priority, and to disable the others. This approach creates problems of its own. For example, if the single active portal loses its connection to the LAN, is powered down, or is blocked for any reason, the entire mesh loses its connection to the LAN until another portal is enabled. Also, using a single portal, in a configuration where multiple portals exist, creates an artificial bottleneck in traffic flow. BRIEF DESCRIPTION OF THE DRAWINGS [0006] The accompanying drawings, which are incorporated in and form a part of this specification, illustrate particular embodiments of the invention and, together with the description, serve to explain the principles of the invention: [0007] FIG. 1 illustrates an example computer system. [0008] FIG. 2 illustrates an example wireless mesh network node. [0009] FIG. 3 illustrates an example network. [0010] FIG. 4 illustrates an example expanded network. [0011] FIG. 5 illustrates example forwarding rules. [0012] FIG. 6 illustrates an example method of handling downstream traffic. [0013] FIG. 7 illustrates an example method for handling upstream traffic. DESCRIPTION OF EXAMPLE EMBODIMENTS [0014] Reference will now be made in detail to several particular embodiments of the invention. While the invention will be described in conjunction with the alternative embodiment(s), it will be understood that they are not intended to limit the invention to these particular embodiments. On the contrary, the invention is intended to cover alternative, modifications, and equivalents, which may be included within the spirit and scope of the invention as defined by the appended claims. [0015] Furthermore, in the following description of example embodiments of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be recognized by one skilled in the art that the present invention may be practiced without these specific details or with equivalents thereof. In other instances, well-known methods, procedures, components, and circuits have not been described in detail as not to unnecessarily obscure aspects of the present invention. [0016] Portions of the description that follows are presented and discussed in terms of a method. Although steps and sequencing thereof are disclosed in a figure herein (e.g., FIG. 6) describing the operations of this method, such steps and sequencing are intended as an example. Embodiments of the present invention are well suited to performing various other steps or variations of the steps recited in the flowchart of the figure herein, and in a sequence other than that depicted and described herein. [0017] Some portions of the descriptions which follow, are presented in terms of procedures, steps, logic blocks, processing, and other symbolic representations of operations on data bits that can be performed on computer memory. These descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. A procedure, computer-executed step, logic block, process, etc., is here, and generally, conceived to be a self-consistent sequence of steps or instructions leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a computer system. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. [0018] It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present invention, discussions utilizing terms such as “accessing,” “writing,” “including,” “testing,” “using,” “traversing,” “associating,” “identifying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices. [0019] Computing devices typically include at least some form of computer readable media. Computer readable media can be any available media that can be accessed by a computing device. By way of example, and not limitation, computer readable medium may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile discs (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computing device. Communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signals such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared, and other wireless media. Combinations of any of the above should also be included within the scope of computer readable media. [0020] Referring first to FIG. 1, an illustration of example computer system 112 is shown. It is appreciated that computer system 112 described herein illustrates an example configuration of an operational platform upon which particular embodiments of the present invention can be implemented. Nevertheless, other computer systems with differing configurations can also be used in place of computer system 112 within the scope of the present invention. That is, computer system 112 can include elements other than those described in conjunction with FIG. 1. [0021] Computer system 112 includes an address/data bus 100 for communicating information, a central processor 101 coupled with bus 100 for processing information and instructions; a volatile memory unit 102 (e.g., random access memory [RAM], static RAM, dynamic RAM, etc.) coupled with bus 100 for storing information and instructions for central processor 101; and a non-volatile memory unit 103 (e.g., read only memory [ROM], programmable ROM, flash memory, etc.) coupled with bus 100 for storing static information and instructions for processor 101. Computer system 112 may also contain an optional display device 105 coupled to bus 100 for displaying information to the computer user. Moreover, computer system 112 also includes a data storage device 104 (e.g., disk drive) for storing information and instructions. [0022] Also included in computer system 112 is an optional alphanumeric input device 106. Device 106 can communicate information and command selections to central processor 101. Computer system 112 also includes an optional cursor control or directing device 107 coupled to bus 100 for communicating user input information and command selections to central processor 101. Computer system 112 also includes signal communication interface (input/output device) 108, which is also coupled to bus 100, and can be a serial port. Communication interface 108 may also include wireless communication mechanisms. Using communication interface 108, computer system 112 can be communicatively coupled to other computer systems over a communication network such as the Internet, intranet (e.g., a local area network), wireless network, or wireless mesh network. [0023] With reference now to FIG. 2, an illustration of an example wireless network mesh node 200 is depicted, in accordance with one particular embodiment of the present invention. In particular embodiments, mesh node 200 is configured to send and receive data wirelessly, e.g., using a wireless networking standard, such as 802.11. In some particular embodiments, mesh node 200 is connected to other mesh nodes or other networks using a physical connection. In some particular embodiments, both approaches are utilized. [0024] Mesh node 200, in particular embodiments, is intended to be utilized as part of a wireless mesh network, such as that described below, with reference to FIG. 3. In such embodiments, mesh node 200 can communicate with other mesh nodes or wireless devices, e.g. system 112, when those mesh nodes or wireless devices are within broadcast range of mesh node 200, as shown by circle 201. [0025] In particular embodiments, mesh node 200 is configured to allow a wireless device to connect to it, and through it to a mesh network. Mesh node 200 receives data from the wireless device, or from another mesh node, and forwards it, either to the intended destination, or to another mesh node in the mesh network. [0026] With reference now to FIG. 3, an illustration of an example network 300 is depicted, in accordance with one particular embodiment of the present invention. Network 300 shows a simplified wireless network connected to a bridged LAN through multiple portals. Specifically, mesh network 390 connects to bridged LAN 301 at portal 310, which connects to LAN segment 303, and also at portal 320, which connects to LAN segment 305. LAN 303 and LAN 305 are interconnected, or bridged, by bridge 307. [0027] Mesh network 390 is also shown as including a number of mesh points, namely mesh points 335, 340, 345, and 350. [0028] Particular embodiments of the present invention seek to address several issues. First, particular embodiments serve to make multiple mesh portals available. Second, particular embodiments allow for load balancing between multiple portals. Further, particular embodiments allow for efficient bridging between disconnected LAN segments. [0029] When faced with a situation like network 300, two approaches were common in the prior art. In the absence of a topology tree, e.g., an IEEE 802.11s Hybrid Wireless Mesh Protocol (HWMP) topology tree, all unicast frames directed at the mesh network would be flooded to all portals. Additionally, all broadcast or multicast frames are also flooded to all active portals. This results in duplicative transmissions throughout the mesh network, and the consumption of valuable wireless bandwidth. If a topology tree is present, the prior art approach involves blocking all but one portal into the mesh network. While this helps to contain flooding issues, in that only the one root, or primary, portal will forward unicast or broadcast frames throughout the mesh network, it introduces a different problem. Specifically, even if it is possible to reach a particular destination outside the mesh through more than one portal, this approach limits connections to passing through the root portal. Even if connecting to the destination through one of the other portals would be faster, or would help to reduce the strain on the root portal, only the root portal path is available and used. [0030] Particular embodiments of the present invention serve to resolve both issues present in the prior art. In some particular embodiments, a root portal is used to reduce flooding a wireless network, while secondary portals remain available for more efficient communication paths and for load balancing. [0031] For example, if a broadcast frame is sent out across LAN 301, it will be received at portal 310 and portal 320. In one particular embodiment, portal 310 is selected as the root portal for mesh network 390. In this embodiment, only the root portal will broadcast the received broadcast frame throughout mesh network 390. [0032] Additionally, if mesh point 345, within mesh network 390, needs to communicate with destination 395, attached to LAN segment 305, the most direct path between the source and the intended destination may pass through portal 320. Rather than having to route traffic through the root portal, portal 310, the more direct and/or faster path through portal 320 can be utilized. These particular embodiments are described in greater detail, below. [0033] With reference now to FIG. 4, an illustration of an example expanded network 400 is depicted, in accordance with one particular embodiment of the present invention. Expanded network 400 shows LAN 401 and LAN 431 interconnected by mesh network 490. LAN 401 is made up of LAN segment 403 and LAN segment 405, interconnected by bridge 407. LAN 401 is connected to mesh network 490 by portal 410, connected to LAN segment 403, and portals 415 and 420, both connected to LAN segment 405. LAN 431 is connected to mesh network 490×2 portals, portal 430 and portal 435. Mesh network 490 is shown as being made up of a collection of interconnected mesh points, such as mesh points 450 and 452. [0034] It is understood that while expanded network 400 is shown as including specific, enumerated components, embodiments of the present invention are well suited for use across a wide variety of applications and technologies. Moreover, while expanded network 400 is shown as including a single mesh network and two disjoint LANs, it is understood that additional networks, both wired and wireless, could be incorporated into the expanded network. [0035] In some particular embodiments, portals can take on a variety of roles. In one such embodiment, a single portal for the entire mesh network takes on the role of the primary, or root, portal. Many possible approaches for selecting a root portal are available; in different embodiments, different approaches are used. In one particular embodiment, for example, static role assignment is used, such that a specific portal is externally designated as the root portal. In another particular embodiment, for example, a dynamic role allocation approaches used, e.g., where the portal with the most preferred operating costs takes on the role of root portal. [0036] After a root portal has been selected, the remaining portals attached to the mesh network take on different roles. These remaining portals fall within two broad categories. Some portals are connected to the same LAN as the root portal, or to LANs which are connected to or bridged to the same LAN as the root portal, outside of the mesh network. These portals take on the role of backup-to-root; they can reach the same destinations as the root portal, which allows them to be used for load balancing across the LAN, and to reach destinations on the LAN more efficiently. [0037] The remaining portals are connected to disconnected LANs or LAN segments. If multiple portals reach the same disconnected LAN, one of those portals is assigned the role of disconnected portal; any other portals that reached that same LAN serve as backup-to-disconnected portals. [0038] A number of methods and approaches are available for organizing a mesh network, such as mesh network 490. Different embodiments of the present invention are well suited for use with any method of organizing a mesh network. For example, one particular embodiment is well suited for use with the HWMP path selection protocol. [0039] Further, particular embodiments of the present invention are well suited for use with many different types of LANs. For example, in one particular, a LAN attached to the mesh network uses the 802.1 Spanning Tree Protocol (STP); in such an embodiment, bridge protocol data units (BPDUs) are exchanged across the LAN, and received at the portals to the mesh network. These BPDUs are used to help identify portals, and further to help in assigning roles to the detected portals. In some particular embodiments, BPDUs are filtered by “source address filtering” on all connected portals, in order to keep all portals available for forwarding mesh traffic. In one such particular embodiment, this also serves to prevent selecting a mesh portal as the designated bridge for a LAN segment while creating a mesh bridged LAN between disconnected portals. In other embodiments, other methods are used. [0040] In some particular embodiments, unicast data frames originating from outside the mesh are directed to the root portal. The root portal attempts to find the destination within the mesh; if it does not, it will forward the unicast frame to any disconnected portals. With reference to FIG. 4, for example, if portal 410 is the root portal and portal 430 is a disconnected portal, then portals 415 and 420 are backup-to-root portals, and portal 435 is a backup-to-disconnected portal. A unicast data frame received at portal 415 would be tunneled across mesh network 490 to portal 410. If portal 410 could not identify the destination as being within mesh network 490, it would forward the unicast data frame to any disconnected portals, namely portal 430. [0041] In some particular embodiments, multicast or broadcast data frames originating from outside the mesh are forwarded to the root portal, if they are received at a disconnected portal. Multicast data frames received at a backup-to-root portal, in these embodiments, can be assumed to have been received at the root portal as well; as such, it is not necessary to forward those frames. Similar logic applies to backup-to-disconnected portals. In some particular embodiments, and including several in which the HWMP path selection protocol is used, the root portal may optionally share the registered addresses within the mesh with disconnected portals; this may aid in more efficient forwarding the frames originating from or destined to a disconnected LAN segment. [0042] In some particular embodiments, when a mesh point sends a frame to an unknown destination via the root portal, and a reply comes back from behind a disconnected portal, the disconnected portal forwards the frame to the root portal, as the mesh point is unknown to the disconnected portal. A shorter route can be established back to the source mesh point for future forwarding between the disconnected portal and that mesh point. In some such particular embodiments, where a backup-to-disconnected portal is available as well, a shorter route may pass through the backup-to-disconnected portal instead. For example, if mesh point 450 sends a frame to destination 437, which is on LAN 431, the frame is first routed to the root portal, portal 410. Portal 410, in one particular embodiment, will send the frame out to LAN 401, and also forward it to disconnected portal 430. When disconnected portal 430 passes the frame to destination 437, and receives a response to return to mesh point 450, the response will be routed to portal 410, and then back to mesh point 450. Now that the location of destination 437 is known, a shorter route, passing through backup-to-disconnected portal 435 can be established. [0043] In some particular embodiments, portal announcements are made across the mesh network. In such embodiments, portal announcements inform mesh points of non-root portals and their roles. In some particular embodiments, a mesh point can direct traffic to a backup-to-root portal, rather than the root portal. This can help to effectuate load-balancing between the root portal and any backup-to-root portals. In some particular embodiments, this is accomplished by using a mesh encapsulation technique, where the encapsulated frame can be directed to the backup-to-root portal, instead of the root portal. For example, mesh point 450 may direct packets to backup-to-root portal 415, rather than root portal 410. In several such particular embodiments, such direction is performed on a per-source basis, to effectuate the backward learning of STP running on wired LAN. [0044] In some particular embodiments, portals connected to the mesh network share, age, and expire addresses learned from their attached LAN segments. This aids in supporting different types of nodes mobility between the mesh and other LAN segments, particularly in larger LANs using portal update messages. [0045] With reference now to FIG. 5, example forwarding rules for traffic between portals are listed, in accordance with one particular embodiment. [0046] In this particular embodiment, as illustrated by rule 510, portals tunnel unicast frames with unknown destinations to the root portal. [0047] In this embodiment, as illustrated by rule 520, frames received from disconnected portals are passed to the external network by the root portal. [0048] In this embodiment, as illustrated by rule 530, the root portal forwards frames received from backup-to-root portals to disconnected portals. [0049] In this embodiment, as illustrated by rule 540, frames received by the root portal from the external network are forwarded to disconnected portals. [0050] The combination of these rules, in some particular embodiments, helps ensure certain desirable aspects. First, no looping can occur between the larger LAN network. Rule 510 ensures that unicast frames entering the mesh network from the external network via a backup-to-root portal are passed to the root portal. Rule 530 then ensures that the unicast frames are not returned to the external network, but are forwarded to any disconnected portals connected to the mesh network. Rule 540 prevents unicast frames received from the external network from being passed to the backup-to-root portals, which prevents them from looping back into the external network. [0051] Additionally, the attached LAN or LANs are prevented from using a mesh network as a bridged link, if there is a LAN path that could be used. Rules 510 and 530 combine to prevent frames from entering the mesh at a backup-to-root portal and exiting at the root portal. Rule 540 prevents frames from entering at the root portal and exiting at a backup-to-root portal. Essentially, in some particular embodiments, data cannot enter from and exit to the same LAN. However, nothing in these rules prevents the mesh from serving as a bridge between two disconnected LANs. [0052] In some particular embodiments, because the default forwarding scheme between a mesh node and a destination is via the root portal, the data path may be suboptimal. In several such embodiments, when a reply to a frame comes from a destination, the reply is forwarded to the root portal. The root portal may then establish a better route back to the source mesh node, e.g., using the path selection protocol in use in the mesh network. When a better route is established between the destination and the mesh node, and this path is used for all frame forwarding from the mesh node to the destination, and for all frame forwarding from the destination to the mesh node. In some particular embodiments, the mesh point may also be able to use a backup portal to reach the destination, e.g., for load-balancing purposes. [0053] For example, with reference to FIG. 4, if mesh node 450 sends a frame for destination 437, the frame is first routed to root portal 410. Root portal 410 sends the frame to disconnected portal 430, which forwards the frame to destination 437. When a reply comes back from destination 437, it enters mesh network 490 via disconnected portal 430. The reply is sent back to root portal 410. Root portal 410 identifies a more optimal route for data to pass from node 450 to disconnected portal 430, and hence to destination 437. In some particular embodiments, a path can be established between node 450 and backup-to-disconnected portal 435 instead. [0054] Load balancing allows data traffic to be evenly distributed in a network over multiple paths. Load-balancing can occur, in some particular embodiments, based on source, destination, or a combination of source and destination information. Further, in some particular embodiments, load-balancing can operate on a per destination, per frame basis. In other embodiments, per frame load-balancing is not performed; per frame load-balancing may cause too many changes in bridge tables, resulting in an unacceptable overhead cost. [0055] Load-balancing, applied to traffic flowing between a mesh and an external network, in some particular embodiments serves to reduce the possibility of overloading the root portal. By default, in some particular embodiments, traffic entering or leaving the mesh passes through the root portal. If one or more backup-to-root portals are available, every backup-to-root portal can reach the same destinations as the root portal, e.g., the same destination on the external network. [0056] A mesh point, using the portal roles, can elect to set up a better route between the mesh point and destination, e.g., using the path selection protocol and theme backup-to-root portals. The mesh point can load balance traffic on a per destination basis, such that traffic intended for one destination may be passed to the root portal, while traffic intended for another destination is passed to a backup-to-root portal. Further, in some particular embodiments, a mesh point may also choose to send unknown frames to a backup-to-root portal, rather than to the root portal, if the mesh point already has excessive numbers of frames to send to the root portal. [0057] In some particular embodiments, mesh encapsulation techniques are used to efficiently enable coming of frames between to mesh notes, as described above. [0058] The above-described technique for load-balancing the root portal is equally applicable to a disconnected portal with available backup-to-disconnected portals. [0059] In some particular embodiments, the technique described above for load-balancing can be utilized to increase available bandwidth between the mesh network and an attached LAN. In some such particular embodiments, the connection between a portal and a mesh network has a fixed amount of available bandwidth. If multiple portals are available, with multiple separate connections to the mesh network, it is possible to spread the load across these multiple connections, effectively increasing the bandwidth between the external network and the mesh. [0060] In some particular embodiments, where a disconnected portal and one or more backup-to-disconnected portals are also available, this approach allows for a bridge to exist between two disjoint networks across the mesh network, with increased available bandwidth. [0061] For example, with reference to FIG. 4, the bandwidth available to root portal 410 is limited. As such, data transfer from LAN 401 to mesh network 490 through root portal 410 is limited to the bandwidth available via that connection. However, backup-to-root portals 415 and 420 also connect LAN 401 to mesh network 490. If these connections are also utilized to transfer data between LAN 401 and mesh network 490, then the available bandwidth is increased. [0062] If data is to be passed from LAN 401 to LAN 431 via mesh network 490, then the available bandwidth for such a transmission would be increased, if both disconnected portal 430 and backup-to-disconnected portal 435 are available. In one particular embodiment, data could enter from LAN 401 through root portal 410 and be passed through mesh network 490 to disconnected portal 430. Meanwhile, data could enter through backup-to-root portal 415 and be passed to backup-to-disconnected portal 435. In the depicted embodiment, the paths described through mesh network 490 happen to avoid overlap. In other particular embodiments, overlap of these routes may occur. In other particular embodiments, routes may be selected to avoid overlap. [0063] With reference now to FIG. 6, a flowchart 600 of an example method of handling downstream traffic is depicted, in accordance with one particular embodiment. Although specific steps are disclosed in flowchart 600, such steps are intended as an example. That is, particular embodiments of the present invention are well suited to performing various other (additional) steps or variations of the steps recited in flowchart 600. It is appreciated that the steps in flowchart 600 may be performed in an order different than presented, and that not all of the steps in flowchart 600 may be performed. [0064] For purposes of the following discussion, “downstream” traffic is viewed as network traffic or activity that originates outside of the mesh network, and enters the mesh through the external LAN attached to the root portal. Downstream traffic flows into, or through, the mesh network from the root portal. Similarly, “upstream” traffic is traffic which originates from within the mesh network, or enters the match through a disconnected or backup-to-disconnected portal. Upstream traffic then flows up the mesh network towards the root portal. [0065] With reference now to step 610, a frame or data packet enters a mesh network through a portal attached to a LAN. If the frame or data packet enters the network through the root or primary portal, the method proceeds to step 620. If the frame or data packet enters the network through a backup-to-root portal, the method proceeds step 630. [0066] With reference now to step 620, the frame or data packet is received at the root portal. [0067] With reference now to step 625, the frame or data packet is examined to determine if the intended destination lies within the mesh network. If the destination is not within the mesh, the method proceeds to step 640. If the destination is within the mesh, the method proceeds to step 650. [0068] With reference now to step 630, the frame or data packet is received at a backup-to-root portal. [0069] With reference now to step 635, the frame or data packet is examined at the backup-to-root portal, to determine whether a path is known between the backup-to-root portal and the intended destination of the frame or packet. If such a path is known, the method proceeds to step 650. If a path is not known, the frame or packet is forwarded to the root portal, and the method reverts to step 620. [0070] With reference now to step 640, the root portal forwards the frame or data packet to one or more disconnected portals attached to the mesh network. [0071] With reference now to step 650, the frame or data packet is routed to the mesh destination inside the mesh network. [0072] In some particular embodiments, the method described in flowchart 600 can be adapted for traffic received at disconnected or backup-to-disconnected portals. In some such embodiments, all disconnected portals are treated similarly to a backup-to-root portal. If a known path to a destination within the mesh network is available, a frame received at a disconnected portal can be routed along it. Otherwise, frames received at a disconnected portal are routed to the root portal. If the destination is outside of the mesh network, the root portal will forward the frame or packet to any other disconnected portals, as well as to the external LAN attached to the root portal. [0073] In some particular embodiments, the method described by flowchart 600 is used to “bridge” to disconnected LANs together across the mesh network. Data received by the root portal from the external LAN, with a destination outside of the mesh network, will be routed through the mesh to a disconnected portal, and hence to a disconnected LAN attached to the disconnected portal. Similarly, data received at the disconnected portal, a destination outside of the mesh network, will be routed through the mesh to the root portal, and hence to the external LAN. [0074] With reference now to FIG. 7, a flowchart 700 of an example method of handling upstream traffic is depicted, in accordance with one particular embodiment of the present invention. Although specific steps are disclosed in flowchart 700, such steps are intended as an example. That is, particular embodiments of the present invention are well suited to performing various other (additional) steps or variations of the steps recited in flowchart 700. It is appreciated that the steps in flowchart 700 may be performed in an order different than presented, and that not all of the steps in flowchart 700 may be performed. [0075] With reference to step 710, a frame is generated at a mesh point. In some particular embodiments, the frame has a destination that lies outside of the mesh network. [0076] With reference now to step 715, the generating mesh point determines whether a route is known between the mesh point and the destination. If a route is known, the method progresses to step 720. If no such route is known, the method progresses to step 730. [0077] With reference now to step 720, the frame is forwarded through the mesh network, along the known route. In some particular embodiments, this route may pass through a disconnected portal. In other particular embodiments, this route may pass through a backup-to-root portal, or through a backup-to-disconnected portal. [0078] With reference now to step 730, the frame is forwarded it to the root portal. [0079] With reference to step 740, the root portal forwards the frame to the attached external LAN. In some particular embodiments, the root portal also forwards the frame to one or more disconnected portals attached to the mesh network, for forwarding to disconnected LANs reachable through these disconnected portals. [0080] With reference to step 750, if a reply is received at a disconnected portal, backup-to-root portal, or backup-to-disconnected portal, the root portal may attempt to establish an alternative, more efficient route between the mesh point and the destination. [0081] Particular embodiments of the present invention are thus described. While the present invention has been described in particular embodiments, it should be appreciated that the present invention should not be construed as limited by such particular embodiments, but rather construed according to the following claims. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4939728 *Dec 19, 1988Jul 3, 1990Echelon Systems Corp.Network and intelligent cell for providing sensing bidirectional communications and controlUS5136580 *May 16, 1990Aug 4, 1992Microcom Systems, Inc.Apparatus and method for learning and filtering destination and source addresses in a local area network systemUS5138615 *Jun 22, 1989Aug 11, 1992Digital Equipment CorporationReconfiguration system and method for high-speed mesh connected local area networkUS5150464 *Jun 6, 1990Sep 22, 1992Apple Computer, Inc.Local area network device startup processUS5224099 *May 17, 1991Jun 29, 1993Stratacom, Inc.Circuitry and method for fair queuing and servicing cell traffic using hopcounts and traffic classesUS5251205 *Sep 4, 1990Oct 5, 1993Digital Equipment CorporationMultiple protocol routingUS5282270 *Jun 6, 1990Jan 25, 1994Apple Computer, Inc.Network device location using multicastUS5295154 *May 3, 1993Mar 15, 1994Norand CorporationRadio frequency local area networkUS5309433 *Jun 18, 1992May 3, 1994International Business Machines Corp.Methods and apparatus for routing packets in packet transmission networksUS5345446 *Nov 6, 1992Sep 6, 1994At&T Bell LaboratoriesEstablishing telecommunications call paths in broadband communication networksUS5361256 *May 27, 1993Nov 1, 1994International Business Machines CorporationInter-domain multicast routingUS5365524 *Nov 6, 1992Nov 15, 1994At&T Bell LaboratoriesEstablishing telecommunications call paths between clustered switching entitiesUS5367635 *Aug 29, 1991Nov 22, 1994Hewlett-Packard CompanyNetwork management agent with user created objects providing additional functionalityUS5383179 *Jul 12, 1993Jan 17, 1995Laboratoire Europeen De Recherches Electroniques AvanceesMessage routing method in a system having several different transmission channelsUS5388213 *Oct 29, 1993Feb 7, 1995Apple Computer, Inc.Method and apparatus for determining whether an alias is available to uniquely identify an entity in a communications systemUS5394436 *Jun 8, 1994Feb 28, 1995Norand CorporationRadio frequency local area networkUS5428636 *May 7, 1993Jun 27, 1995Norand CorporationRadio frequency local area networkUS5502725 *Apr 14, 1994Mar 26, 1996Nokia Telecommunications OyMethod and system for sending shorter service number in place of all but first packet, in place of longer destination address, for increasing user data content of packet data transferUS5504746 *Mar 27, 1995Apr 2, 1996Norand CorporationRadio frequency local area networkUS5515376 *Jul 19, 1993May 7, 1996Alantec, Inc.Communication apparatus and methodsUS5561669 *Oct 26, 1994Oct 1, 1996Cisco Systems, Inc.Computer network switching system with expandable number of portsUS5570360 *Mar 20, 1995Oct 29, 1996Stratacom, Inc.Method and apparatus for implementing communication service contract using cell arrival informationUS5610905 *Dec 13, 1994Mar 11, 1997Alantec CorporationCommunication apparatus and methodsUS5673031 *Jul 5, 1994Sep 30, 1997Norand CorporationRedundant radio frequency network having a roaming terminal communication protocolUS5678006 *Feb 1, 1996Oct 14, 1997Cisco Systems, Inc.Network switch having network management agent functions distributed among multiple trunk and service modulesUS5712981 *Jun 20, 1996Jan 27, 1998Hewlett-Packard CompanyNetwork anaysis method for identifying global and local node servers and for determining a reconfigured network to provide improved traffic patternsUS5734654 *Aug 2, 1994Mar 31, 1998Fujitsu LimitedFrame relay switching apparatus and routerUS5740171 *Mar 28, 1996Apr 14, 1998Cisco Systems, Inc.Address translation mechanism for a high-performance network switchUS5748619 *Dec 26, 1996May 5, 1998Meier; Robert C.Communication network providing wireless and hard-wired dynamic routingUS5751710 *Jun 11, 1996May 12, 1998Cisco Technology, Inc.Technique for connecting cards of a distributed network switchUS5790536 *Jun 7, 1995Aug 4, 1998Norand CorporationHierarchical communication system providing intelligent data, program and processing migrationUS5796732 *Mar 28, 1996Aug 18, 1998Cisco Technology, Inc.Architecture for an expandable transaction-based switching busUS5802042 *Jun 28, 1996Sep 1, 1998Cisco Systems, Inc.Autosensing LMI protocols in frame relay networksUS5802047 *May 31, 1996Sep 1, 1998Nec CorporationInter-LAN connecting device with combination of routing and switching functionsUS5802054 *Aug 15, 1996Sep 1, 19983Com CorporationAtomic network switch with integrated circuit switch nodesUS5835720 *May 17, 1996Nov 10, 1998Sun Microsystems, Inc.IP discovery apparatus and methodUS5867666 *Aug 5, 1997Feb 2, 1999Cisco Systems, Inc.Virtual interfaces with dynamic bindingUS5870386 *Dec 30, 1991Feb 9, 1999Digital Equipment CorporationMethod and apparatus for transparently bridging traffic across wide area networksUS5872783 *Jul 24, 1996Feb 16, 1999Cisco Systems, Inc.Arrangement for rendering forwarding decisions for packets transferred among network switchesUS5918016 *Jun 10, 1997Jun 29, 1999Texas Instruments IncorporatedSystem with program for automating protocol assignments when newly connected to varing computer network configurationsUS5926101 *Nov 16, 1995Jul 20, 1999Philips Electronics North America CorporationMethod and apparatus for routing messages in a network of nodes with minimal resourcesUS5949786 *Oct 2, 1996Sep 7, 19993Com CorporationStochastic circuit identification in a multi-protocol network switchUS5959990 *Mar 12, 1996Sep 28, 1999Bay Networks, Inc.VLAN frame formatUS5964841 *Mar 3, 1997Oct 12, 1999Cisco Technology, Inc.Technique for handling forwarding transients with link state routing protocolUS5991810 *Aug 1, 1997Nov 23, 1999Novell, Inc.User name authentication for gateway clients accessing a proxy cache serverUS6018770 *Oct 13, 1997Jan 25, 2000Research In Motion LimitedSystem and method for managing packet-switched connectionsUS6047376 *Mar 19, 1997Apr 4, 2000Toshiba Information Systems (Japan) CorporationClient-server system, server access authentication method, memory medium stores server-access authentication programs, and issuance device which issues the memory medium contentsUS6055236 *Mar 17, 1999Apr 25, 20003Com CorporationMethod and system for locating network services with distributed network address translationUS6055561 *Sep 30, 1997Apr 25, 2000International Business Machines CorporationMapping of routing traffic to switching networksUS6092196 *Nov 25, 1997Jul 18, 2000Nortel Networks LimitedHTTP distributed remote user authentication systemUS6111858 *Feb 18, 1997Aug 29, 2000Virata LimitedProxy-controlled ATM subnetworkUS6256306 *Jun 3, 1998Jul 3, 20013Com CorporationAtomic network switch with integrated circuit switch nodesUS6377987 *Apr 30, 1999Apr 23, 2002Cisco Technology, Inc.Mechanism for determining actual physical topology of network based on gathered configuration information representing true neighboring devicesUS6389024 *Jun 8, 1998May 14, 2002Excel Switching CorporationFlexible call routing systemUS6407991 *May 5, 1998Jun 18, 2002Intermec Ip Corp.Communication network providing wireless and hard-wired dynamic routingUS6445710 *Feb 9, 1999Sep 3, 2002Enterasys Networks, Inc.Method and apparatus for transparently bridging traffic across wide area networksUS6452910 *Jul 20, 2000Sep 17, 2002Cadence Design Systems, Inc.Bridging apparatus for interconnecting a wireless PAN and a wireless LANUS6456597 *Jan 11, 1999Sep 24, 2002Hewlett Packard Co.Discovery of unknown MAC addresses using load balancing switch protocolsUS6459700 *May 14, 1998Oct 1, 2002Compaq Computer CorporationMultiple segment network device configured for a stacked arrangementUS6480508 *May 12, 1999Nov 12, 2002Westell, Inc.Router-based domain name system proxy agent using address translationUS6545982 *Sep 12, 1996Apr 8, 2003Marconi Communications Technology, Inc.Communication apparatus and methodsUS6549786 *May 22, 1998Apr 15, 2003International Business Machines CorporationMethod and apparatus for connecting a wireless LAN to a wired LANUS6570875 *Oct 13, 1998May 27, 2003Intel CorporationAutomatic filtering and creation of virtual LANs among a plurality of switch portsUS6628620 *Apr 29, 2002Sep 30, 2003Harris CorporationHierarchical modile ad-hoc network and methods for route error recovery thereinUS6701361 *Oct 30, 1998Mar 2, 2004Intermec Ip Corp.Enhanced mobility and address resolution in a wireless premises based networkUS6744771 *Jun 9, 1999Jun 1, 2004Amx CorporationMethod and system for master to master communication in control systemsUS6772219 *Sep 17, 1999Aug 3, 2004Kabushiki Kaisha ToshibaMessage relaying scheme based on switching in units of flowsUS6917985 *Mar 9, 2001Jul 12, 2005The Regents Of The University Of CaliforniaCore assisted mesh protocol for multicast routing in ad-hoc NetworksUS6952421 *Oct 7, 1999Oct 4, 2005Cisco Technology, Inc.Switched Ethernet path detectionUS7173934 *Apr 18, 2002Feb 6, 2007Nortel Networks LimitedSystem, device, and method for improving communication network reliability using trunk splittingUS20020013856 *Sep 21, 2001Jan 31, 2002Garcia-Luna-Aceves J. JoaquinUnified routing scheme for ad-hoc InternetworkingUS20020049561 *Sep 21, 2001Apr 25, 2002Garcia-Luna-Aceves J. JoaquinUnified routing scheme for ad-hoc internetworkingUS20020069278 *Dec 5, 2000Jun 6, 2002Forsloew JanNetwork-based mobile workgroup systemUS20030020992 *Jul 19, 2001Jan 30, 2003Joseph ChildFree space optical communication network and stations thereofUS20030037167 *Sep 25, 2002Feb 20, 2003Nokia Wireless Routers Inc.Unified routing scheme for ad-hoc internetworkingUS20030058804 *Jan 15, 1999Mar 27, 2003Ali SalehMethod of reducing traffic during path restorationUS20030112810 *Dec 6, 2002Jun 19, 2003Sumie NakabayashiMethod for forwarding packets by connecting network segments through a wireless channel and wireless bridging apparatus using the sameUS20040121042 *Apr 25, 2001Jun 24, 2004Kabushiki Kaisha Yakult HonshaFermented foods and process for producing the sameUS20040156321 *Jan 31, 2003Aug 12, 2004Michael Walker Anthony PaulMethod of determining a mesh in a computer networkUS20040184450 *Mar 19, 2003Sep 23, 2004Abdu H. OmranMethod and system for transport and routing of packets over frame-based networksUS20040205245 *Aug 11, 2003Oct 14, 2004Jean-Francois Le PennecData transmission system with a mechanism enabling any application to run transparently over a network address translation deviceUS20050036486 *Aug 12, 2003Feb 17, 2005Zafer SahinogluRoute discovery in ad-hoc networks with data packetsUS20050088997 *Jan 24, 2003Apr 28, 2005Diego MelpignanoWireless communication arrangements with a discovery procedureUS20050105524 *Feb 24, 2004May 19, 2005Hughes Electronics CorporationSystem and method for provisioning of route information in a meshed communications networkUS20050136972 *Dec 8, 2004Jun 23, 2005Smith Derek M.Plug-in network applianceUS20050157661 *Jan 20, 2005Jul 21, 2005Lg Electronics Inc.Mobile ad hoc network system and operating method thereofUS20050213547 *Mar 24, 2004Sep 29, 2005Meier Robert CSystem and method for aggregating multiple radio interfaces into a single logical bridge interfaceUS20050220054 *May 4, 2005Oct 6, 2005Robert MeierWireless local area network context control protocolUS20050223111 *Nov 4, 2004Oct 6, 2005Nehru BhandaruSecure, standards-based communications across a wide-area networkUS20060013225 *Sep 21, 2005Jan 19, 2006Christopher HaywoodDedicated bandwidth data communication switch backplaneUS20060056457 *Aug 12, 2005Mar 16, 2006Interdigital Technology CorporationMethod for sending an acknowledgement to an ingress mesh point in a mesh network and a medium access control frame formatUS20060146846 *Jan 5, 2005Jul 6, 2006Intel CorporationMethods and apparatus for providing a transparent bridge associated with a wireless mesh networkUS20060265480 *May 18, 2006Nov 23, 2006Samsung Electronics Co., Ltd.Method of transmitting and receiving data in network environment with wired and wireless networks bridged using relay portalUS20070060141 *Aug 29, 2006Mar 15, 2007Texas Instruments IncorporatedMesh Deterministic AccessUS20070110024 *Nov 14, 2005May 17, 2007Cisco Technology, Inc.System and method for spanning tree cross routesUS20070121529 *Oct 24, 2006May 31, 2007Broadcom CorporationCommunication network providing wireless and hard-wired dynamic routingUS20080025277 *Feb 9, 2007Jan 31, 2008Sunao TakatoriWireless LAN system and control method and control program of wireless LAN systemUS20080101578 *Nov 1, 2006May 1, 2008Motorola, Inc.Method and system for guardian approval of communicationsUS20080159358 *Jan 2, 2007Jul 3, 2008David RuizUnknown Destination Traffic Repetition* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7869434 *Oct 3, 2006Jan 11, 2011Samsung Electronics Co., Ltd.Apparatus, method and system for routing a broadcast data frame in a mesh network with multiple mesh portalsUS8498292 *Sep 21, 2010Jul 30, 2013Huawei Technologies Co., Ltd.Network node and method for establishing network path and sending dataUS9060322Oct 25, 2011Jun 16, 2015Aruba Networks, Inc.Method and system for preventing loops in mesh networksUS9408249Dec 3, 2013Aug 2, 2016Cisco Technology, Inc.Wireless mesh network including resilient backhaul links and WLAN traffic local switchingUS9596169Jun 30, 2015Mar 14, 2017Juniper Networks, Inc.Dynamic control channel establishment for software-defined networks having centralized controlUS9634928 *Sep 29, 2014Apr 25, 2017Juniper Networks, Inc.Mesh network of simple nodes with centralized controlUS20070081482 *Oct 3, 2006Apr 12, 2007Samsung Electronics Co., Ltd.Apparatus, method and system for routing a broadcast data frame in a mesh network with multiple mesh portalsUS20110013509 *Sep 21, 2010Jan 20, 2011Yuan ZhouNetwork node and method for establishing network path and sending dataUS20150146726 *May 30, 2012May 28, 2015Qualcomm IncorporatedHybrid data plane forwardingUS20160094398 *Sep 29, 2014Mar 31, 2016Juniper Networks, Inc.Mesh network of simple nodes with centralized controlEP2587863A3 *Oct 23, 2012Oct 2, 2013Aruba Networks, Inc.Method and system for preventing loops in mesh networks* Cited by examinerClassifications U.S. Classification370/406International ClassificationH04L12/56Cooperative ClassificationH04W84/18, H04W92/02European ClassificationH04W92/02Legal EventsDateCodeEventDescriptionSep 7, 2006ASAssignmentOwner name: CISCO TECHNOLOGY, INC., CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:RAHMAN, SHAHRIAR;KRUYS, JOHANNES PETRUS;O HARA, ROBERT BERNARD, JR.;AND OTHERS;REEL/FRAME:018308/0894;SIGNING DATES FROM 20060824 TO 20060907Owner name: CISCO TECHNOLOGY, INC.,CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:RAHMAN, SHAHRIAR;KRUYS, JOHANNES PETRUS;O HARA, ROBERT BERNARD, JR.;AND OTHERS;SIGNING DATES FROM 20060824 TO 20060907;REEL/FRAME:018308/0894Dec 28, 2010CCCertificate of correctionAug 9, 2013FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services