US 7,558,266 B2Grant
System and method for restricting network access using forwarding databases
Issue Date:2009-07-07
•20 Claims
•6 Drawing Sheets
Abstract
This specification describes a system that can offer, among other advantages, dynamically allowing or rejecting non-DHCP packets entering a switch. In addition, a FDB is commonly used by a bridge or switch to store an incoming packet's source MAC address and its port number, then later on if the destination MAC address of another incoming packet matching any entry in FDB will be forwarded to its associated port. Using the techniques described herein, not only this will be completely transparent to user, the techniques can also result in an increase in switch performance by blocking unwanted traffic at an earlier stage of forwarding process and freeing up other processing units at a later stage, like switch fabric or packet processing stages.
Metadata
Assignee
- Trapeze Networks, Inc.
Inventor
- Tyng Jar Albert Hu
Application Information
Application Number:US 11/417,993
Filing Date:2006-05-03
Priority Date:2006-05-03
Art Unit:2419
Classifications
IPC:
H04L12/28H04L12/56H04J3/16H04J3/22
Patent Drawings (6 sheets)
Description
Background
[0001] A computer network such as a local area network (LAN), a wide area network (WAN), or the Internet facilitates communication among devices (e.g., clients). These devices may include workstations, servers, personal computers, cell phones, PDAs, wireless access points, laptops, and other electronic devices.
[0002] Before a client can communicate over or with a network, the client must obtain an Internet Protocol (IP) address. A client may acquire an IP address through, for example, a client-server networking protocol such as, by way of example but not limitation, Bootstrap Protocol (BOOTP) which is a User Datagram Protocol (UDP), Dynamic Host Configuration Protocol (DHCP), that can be used to assign dynamic IP addresses to clients, Point-to-Point Protocol over Ethernet (PPPoE), or some other known or convenient networking protocol.
[0003] A network may filter communication to and from a client that has not yet been assigned an IP address. For example, a network may be configured so that one or more Access Control Lists (ACLs) indicate whether to forward or discard a packet or a class of packets. The ACL may be used, by way of example but not limitation, to direct network routers to drop all packets originating from and directed to a client that has not been assigned an IP address.
[0004] Filtering mechanisms of the variety described above, however, may consume significant network resources while processing data to and from clients without IP addresses because the packets are not discarded until the routing phase. Moreover, networks using schemes such as ACL configuration to filter packets may unnecessarily complicate decision-making for users and raise additional security issues.
Summary
[0005] The following embodiments and aspects thereof are described and illustrated in conjunction with systems, tools, and methods that are meant to be exemplary and illustrative, not limiting in scope. In various embodiments, one or more of the above-described problems have been reduced or eliminated, while other embodiments are directed to other improvements.
[0006] A technique for restricting network access involves determining whether a data unit, such as a packet or a frame, has a layer 3 address assignment, such as an IP address assignment. A method according to the technique may include receiving a data unit including layer 2 client-identification data and determining whether the data unit includes layer 3 address data. If the data unit does not include any layer 3 address data, in this example, the method may proceed in determining whether the layer 2 client-identification data has been recorded. If the layer 2 client-identification data has not been recorded, in this example, the method may proceed in recording the layer 2 client-identification data and enabling a layer 3 address assignment status restriction attribute. If, on the other hand, the layer 2 client-identification data has been recorded, unless the address assignment status restriction attribute is enabled, in this example, the method may proceed with forwarding the data unit.
[0007] A system according to the technique may include an address restriction engine, coupled to a memory and a switching device, for executing packet forwarding and data traffic filtering functions. The address restriction engine may include an address status restriction module having control logic for manipulating said layer 3 address assignment status restriction attribute and a packet forwarding module having logic for monitoring data traffic and for notifying the address status restriction module that it has received data with layer 3 address assignment data. The address status restriction module may determine whether to disable the layer 3 address assignment status restriction attribute based on data it receives from the packet forwarding module.
[0008] The proposed system can offer, among other advantages, to, for example, dynamically allow or reject non-DHCP packets entering a switch. In addition, a FDB is commonly used by a bridge or switch to store an incoming packet's source MAC address and its port number, then later on if the destination MAC address of another incoming packet matching any entry in FDB will be forwarded to its associated port. Using the techniques described herein, not only this will be completely transparent to user, it can also increase switch performance by blocking unwanted traffic at an earlier stage of the packet forwarding process and freeing up other processing units at a later stage, like switch fabric or packet processing stages.
Brief Description of the Drawings
[0009] Embodiments of the present invention are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the invention.
[0010] FIG. 1 depicts a flowchart of an example of a method for managing an address assignment status restriction attribute in a forwarding database (FDB).
[0011] FIG. 2 depicts a flowchart of an example of a method for data filtering.
[0012] FIG. 3 is a block diagram illustrating an example of a network system including a forwarding database (FDB) for filtering network traffic based on IP address assignment status.
[0013] FIG. 4 is a schematic illustration of an example of a forwarding database entry.
[0014] FIG. 5 is a block diagram illustrating an example of a network system including an address restriction engine for filtering data traffic.
[0015] FIG. 6 depicts a flowchart 600 of an example of a method for restrictive data forwarding.
[0016] The foregoing examples of the related art and limitations related therewith are intended to be illustrative and not exclusive. Other limitations of the related art will become apparent to those of skill in the art upon a reading of the specification and a study of the drawings.
Detailed Description
[0017] In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention may be practiced without one or more of these specific details or in combination with other components or process steps. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.
[0018] FIG. 1 depicts a flowchart 100 of an example of a method for managing an address assignment status restriction attribute in a forwarding database (FDB). This method and other methods are depicted as serially arranged modules. However, modules of the methods may be reordered, or arranged for parallel execution as appropriate.
[0019] In the example of FIG. 1 , the flowchart 100 starts at module 102 where a data packet is received from a client. The client may include, by way of example but not limitation, a cell phone, PDA, personal computer, laptop, notebook computer, workstation, or some other known or convenient wired or wireless device. The client may send to a network a data packet with information including, by way of example but not limitation, source address, destination address, and message data.
[0020] The network may include a wired network, a wireless network, a LAN, a WAN, or a network such as the Internet. The term “Internet” as used herein refers to a network of networks which uses certain protocols, such as the TCP/IP protocol, and possibly other protocols such as the hypertext transfer protocol (HTTP) for hypertext markup language (HTML) documents that make up the World Wide Web (the web). The physical connections of the Internet and the protocols and communication procedures of the Internet are well-known to those of skill in the art.
[0021] In the Open Systems Interconnection (OSI) communications model, a switch performs a layer 2 or Data-Link layer function. That is, the switch looks at each packet or data unit and determines from a physical address (the “MAC address”) which device a data unit is intended for and switches it out toward that device. However, in wide area networks such as the Internet, the destination address requires a look-up in a routing table by a device known as a router. Some switches also perform routing functions (layer 3 or the Network layer functions in OSI and layer 4 or the Transport layer functions) and are sometimes called IP switches. As used herein, a switching device may be any layer 2, layer 3, or layer 4 device.
[0022] The time a switch takes to determine where to forward a data unit is called its latency. The price paid for having the flexibility that switches provide in a network is this latency. Switches are found at the backbone and gateway levels of a network where one network connects with another and at the sub-network level where data is being forwarded close to its destination or origin. The former are often known as core switches and the latter as desktop switches.
[0023] In packet-switching, a message is divided into packets, which are units of a certain number of bytes. The network addresses of the sender and of the destination are added to the packet. Each network point looks at the packet to see where to send it next. Packets in the same message may travel different routes and may not arrive in the same order that they were sent. At the destination, the packets in a message are collected and reassembled into the original message.
[0024] Referring once again to the example of FIG. 1 , the flowchart 100 continues to module 104 where the packet is preprocessed for classification according to, for example, the source of the packet. A packet may originate from one of numerous sources including but not limited to an access point, a network port, or a central processing unit (CPU). Moreover, depending on criteria such as the source of the packet and the configuration of the network, the preprocessing functions may be executed by devices such as, by way of example but not limitation, a network processor, a general processor, or pre-processing software tailored for the task.
[0025] In the example of FIG. 1 , the flowchart 100 continues to module 106 where additional packet source information is learned. In an embodiment, a network switch receives the packet and learns information associated with the packet. The network switch may include, for example, a switching fabric coupled to a forwarding database (FDB) having a forwarding memory. In an embodiment, the forwarding memory stores a number of entries comprising information including but not limited to address data, port identification (ID), and entry age. The entry age can be used to, for example, facilitate the removal of old entries so that the database is not cluttered with outdated entries. The FDB may store entries according to the client's media access control (MAC) addresses, network addresses, both the MAC and network addresses, or in some other known or convenient manner.
[0026] In an embodiment, a network switch performs a look-up in the FDB upon receipt of a packet. If an entry associated with the client's identification information is found in the FDB, no action is required. On the other hand, if the FDB does not include an entry associated with the client's identification information, a new entry is added to the FDB comprising information including but not limited to the client's MAC address, port ID, and a number of other attributes associated with the client. In an embodiment, a processing unit associated with the switch updates the FDB with a new entry. In an alternative embodiment, a CPU coupled to a number of network switches is responsible for learning data traffic passing through these switches and updating a central FDB. Additionally, the processor may be implemented with a number of devices including but not limited to, a specialized network processor or a general processor.
[0027] In the example of FIG. 1 , the flowchart 100 continues to decision point 107 where a destination of the packet is determined from the information available in the packet. If the destination is from the client, then the flowchart 100 continues to module 108 where an attempt is made to authenticate the client. For example, a CPU associated with the network switch may attempt to authenticate the client using a known or convenient authentication scheme. The CPU may authenticate the client using a cryptographic protocol such as, by way of example but not limitation, the Otway-Rees or the Wide-Mouth Frog protocol. Moreover, the CPU may be configured in a number of ways. In one embodiment, the CPU may be a local processor associated with one network switch and responsible for authenticating data traffic that pass through the network switch. In an alternative embodiment, the CPU may be coupled to a number of network switches and responsible for authenticating data traffic passing through these switches. Additionally, the CPU may be implemented with a number of devices including but not limited to, a specialized network processor or a general processor.
[0028] Returning once again to the decision point 107, if the destination of the packet is to the client, or after an attempt to authenticate the client is made at module 108 (if the destination is from the client), then the flowchart continues to decision point 109. It may be noted that if the destination is not determined to be to or from the client (else), the flowchart 100 continues to module 114, which is described later.
[0029] In the example of FIG. 1 , the flowchart 100 continues from module 108 to decision point 109, where it is determined whether the client is authenticated. If the client is not authenticated (109—NO), the packet is dropped and the client cannot communicate over or with the network. If the client is authenticated (109—YES), the flowchart 100 continues at module 110 where the CPU identifies the client according to information contained in the packet and extracts a service profile associated with the client. The service profile may include information specific to the client, such as a set of minimum requirements. The set of minimum requirements may include, by way of example but not limitation, level of security or Quality of Service (QoS). In an embodiment, the service profile also includes information indicating whether communication with the client is restricted according to IP address assignment status. In an alternative embodiment, the service profile may not include such information, or the information may not be acted upon (e.g., at modules 112, 114). The packet information may include, by way of example but not limitation, the destination address and port ID.
[0030] In the example of FIG. 1 , the flowchart 100 continues to decision point 112 where it is determined whether IP address assignment restriction is required. In an embodiment, the CPU may make this determination based on the service profile. If the service profile specifies that communication with the client need not be filtered according to IP address assignment status (112—NO), the flowchart 100 continues to module 114 where the network switch proceeds to forward the packet according to packet information (and, for illustrative purposes, the flowchart 100 ends although it should be noted that the packets may continue to be forwarded practically indefinitely). If the service profile indicates that communication with the client is restricted according to IP address assignment status (112—YES), the flowchart 100 continues to module 116 where the packet is dropped and an IP address assignment restriction status attribute associated with the client is enable. In an embodiment, the CPU may enable the IP address assignment restriction status attribute in the FDB.
[0031] In the example of FIG. 1 , the flowchart 100 continues to decision point 118 where it is determined whether an assignment has been received. A packet that includes an assignment is of particular note because packets cannot be forwarded until, for example, an IP assignment has been made. If it is determined that an assignment has not been received (118—NO), the flowchart 100 continues to decision point 119 where it is determined whether there is an assignment request. If it is determined that there is an assignment request (119—Yes), then the flowchart 100 continues to module 114, which was described previously. If, on the other hand, it is determined that there is no assignment request (119—No), then the flowchart 100 continues to module 120 where the packet is dropped, to module 122 where traffic continues to be monitored (e.g., filtered according to the IP address assignment status associated with data the network switch receives), and back to decision point 118. Advantageously, only packets with, for example, a DHCP protocol are allowed to enter the network switch. This may improve the performance of the switch. If, on the other hand, it is determined that an assignment has been received (118—YES), the flowchart 100 continues to module 124 where verification of the address assignment is attempted. The verification may be by any known or convenient means.
[0032] In the example of FIG. 1 , the flowchart 100 continues to decision point 126 where it is determined whether the assignment is verified. If it is determined that the assignment is not verified (126—NO), the flowchart 100 continues to module 120 where the packet is dropped, and continues from module 120 as described previously. If, on the other hand, it is determined that the assignment is verified (126—YES), the flowchart 100 continues to module 128 where the IP address assignment restriction status attribute is disabled. The flowchart 100 ends at module 114 where packets are forwarded normally, as previously described. Advantageously, since the IP address assignment restriction status attribute is disabled until after IP address assignment, which prevents the forwarding of potentially many packets to the network switch, the network switch can operate more efficiently.
[0033] FIG. 2 depicts a flowchart 200 of an example of a method for data filtering. Data filtering may be used in conjunction with, for example, the method of FIG. 1 . In the example of FIG. 2 , the flowchart 200 begins at module 202 where switching functions are executed. For example, a forwarding processor associated with a network switch may execute switching functions including, by way of example and not limitation, looking up a FDB, checking FDB entry fields including an IP address assignment status restriction attribute, and forwarding packets to a specified destination. In an embodiment, a CPU or other processor may function as the forwarding processor. In another embodiment, the forwarding processor is an independent processor configured to manage switching tasks. In this alternative embodiment, the CPU does not process data to or from the client while the client has yet to obtain an IP address. The forwarding processor may be implemented, by way of example but not limitation, in a general processor, in the CPU as a sub-processor, or in a specialized network processor.
[0034] In the example in FIG. 2 , the flowchart 200 continues to decision point 204 where it is determined whether a packet includes address assignment information. For example, each time a forwarding processor receives a packet, the forwarding processor may make a determination as to whether the packet includes IP address assignment information. If the packet does not include IP address assignment information (204—NO), the flowchart continues to module 206 where a look-up is performed, and the client's IP address is allowed to be forwarded. For example, the forwarding processor may perform a look-up function in the FDB associated with the network switch. The packet information the forwarding processor uses for the look-up function may include, by way of example and not limitation, the MAC address or the network address of the packet sender.
[0035] In the example of FIG. 2 , the flowchart 200 continues to the decision point 208 where it is determined whether the IP address assignment status restriction attribute is enabled. If the attribute is enabled (208—YES), the flowchart 200 proceeds to module 210 where the packet is dropped, from packets originating from or destined for the client, and the flowchart 200 returns to module 202. If the attribute is disabled (208—NO), the flowchart 200 continues to module 212 where the packet is forwarded and the flowchart 200 returns to module 202. For example, the forwarding processor may allow the network switch to forward the packet according to packet information. The packet information may include, by way of example but not limitation, the destination address and port ID.
[0036] Returning now to the flowchart 200 at decision point 204. If it is determined that the packet includes address assignment information, then the flowchart 200 continues to module 214 where packet verification is attempted. For example, the forwarding processor may determine that the packet includes IP address assignment information, and send the packet to the CPU for verification.
[0037] In the example of FIG. 2 , the flowchart 200 continues to decision point 216 where it is determined whether the IP address assignment information can be verified. For example, the CPU may attempt to verify that the packet includes IP address assignment information. If the CPU cannot verify the IP address assignment information (216—NO), the flowchart 200 continues to module 218 where the packet is dropped. If the CPU verifies that the data packet includes IP address assignment information (216—YES), the flowchart 200 continues to decision point 220 where it is determined whether confirmation that an IP address has been assigned has been received. For example, the CPU may determine whether the packet includes confirmation that an IP address has been assigned. The methods for determining whether an IP address assignment has been confirmed may vary and include, by way of example and not limitation, receipt of a packet containing an IP address assignment for the destination device, receipt of a packet acknowledging the receipt of an IP address assignment, or the receipt of both an address assignment and an acknowledgment.
[0038] In the example of FIG. 2 , if, for example, the CPU determines that the IP address assignment information in the packet does not confirm an address assignment (220—NO), the flowchart 200 loops back to module 218 where the packet is dropped, as described previously. It may be noted that there could be some type of delay or waiting period before dropping the packet depending upon the implementation. It may also be noted that switching functions for other packets may be executing concurrently during the delay. If the CPU determines that the IP address assignment information in the packet confirms an address assignment (220—YES), the flowchart 200 proceeds to module 222 where the IP assignment status restriction is disabled. For example, the CPU may disable the IP assignment status restriction attribute in the FDB entry associated with the device whose address assignment has been confirmed. The flowchart 200 continues to module 224 where the packet is forwarded. For example, the network switch may forward the packet according to packet information. The packet information may include, by way of example but not limitation, the destination address and port ID.
[0039] FIGS. 1 and 2 serve to illustrate methods by way of example. Fewer or more modules may be used to promote additional features and alternative embodiments. For example, in one implementation, the CPU may apply address status restrictions on all clients without e.g., checking service profiles. In another implementation, the CPU does not verify a packet identified as having IP address assignment information and proceeds directly to module 118 from module 126. Moreover, terms and examples described serve illustrative purposes only and are not intended to be limiting. For example, although the term “packet” or “data packet” is used to describe a unit of information in the processing and switching operations above, one skilled in the art would appreciate that information may be transmitted in other data unit forms including, by way of example and not limitation, a data packet or a frame. Some instances above describe information filtering for data originating from a source that has not yet obtained an IP address assignment, one skilled in the art would readily perceive that data can be filtered either to or from such a source.
[0040] FIG. 3 is a block diagram illustrating an example of a network system 300 including a forwarding database for filtering network traffic based on IP address assignment status. In the example of FIG. 3 , the network system 300 includes a FDB 302, a processor 304, a switching device 306, wireless access points (APs) 308-1 to 308-N (referred to hereinafter collectively as APs 308), and clients 310-1 to 310-N (referred to hereinafter collectively as clients 310). It may be noted that in alternative embodiments, two or more of the FDB 302, processor 304, switching device 306, and APs 308 may be located locally with respect to one another.
[0041] In the example of FIG. 3 , the network system 300 includes a wireless network for illustrative purposes. However, at least some of the techniques described herein could be used in both a wireless and a wired network.
[0042] The FDB 302 may be implemented with a forwarding memory (not shown). The forwarding memory stores a table containing entries having identification information extracted from data traffic that the switching device 306 receives and may include, by way of example and not limitation, MAC address, port ID, and virtual LAN (VLAN) ID. Additionally, the entries may include numerous attributes including, by way of example and not limitation, the age of the entry, and the IP address assignment status associated with the identification information. In an alternative embodiment, the FDB 302 may be implemented with a forwarding memory (not shown) for storing entries having information extracted from data traffic and a distinct associated memory (not shown) for storing attribute data associated with each entry in the forwarding memory. The data entries stored in the FDB 302 are used to identify the destination information and forwarding attributes associated with a data packet so that the packet may be forwarded to its specified destination. Entries in the FDB 302 are described in more detail later with reference to FIG. 4 . For the purpose of example only, the system 300 could be configured such that the address to be restricted is one that originates from a wireless client, such as one of the wireless clients 310.
[0043] In the example of FIG. 3 , the processor 304 is coupled to the FDB 302 and the switching device 306. In an embodiment, the processor 304 may execute switching functions using the FDB 302 and the switching device 306. In an embodiment, the processor 304 may be implemented as a CPU that processes data traffic that the switching device 306 receives and accesses the FDB 302 to update the entries therein. The CPU may, by way of example and not limitation, learn an address in a data packet, read associated data corresponding to a data packet, age the entries in the FDB 302, invalidate outdated entries in the FDB 302, replace entries in the FDB 302, access search keys in the FDB 302, and update attributes in the entries of the FDB 302. In one embodiment, the CPU may be configured to monitor and filter the data traffic that the switching device 306 receives with a method such as that described in FIG. 2 . In an alternative embodiment, a forwarding processor (not shown) monitors the forwarding data traffic and alerts the CPU with information necessary to update the entries in the FDB 302. In one embodiment, the forwarding processor (not shown) is implemented independently of the CPU with, by way of example and not limitation, a general processor or a network processor. In another embodiment, the forwarding processor (not shown) is implemented as a sub-processor in the CPU.
[0044] The switching device 306 may, in an embodiment, have a switching fabric (not shown) including, by way of example and not limitation, one or more switching Application Specific Integrated Circuits (ASICs). Furthermore, the switching ASICs may, for example, be configured to perform level 2 switching functions, level 3 switching functions, level 3 routing functions, level 4 switching functions, and level 4 routing functions. In an alternative embodiment, the switching fabric may implement the level 2 to 4 switching and routing functions by using software or by using hardware not dependents on ASICs. The switching device 306 may channel incoming data from input ports (not shown) to a specific output port that will take data toward an intended destination. On, for example, an Ethernet local area network (LAN), a switching device determines from the physical device (Media Access Control or MAC) address in each incoming message frame which output port to forward it to and out of. In, for example, a wide area packet-switched network such as the Internet, a switching device determines from the IP address in each packet which output port to use for the next part of its trip to the intended destination. In, for example, a circuit-switched network, one or more switching devices are used to set up a dedicated though temporary connection between two or more parties.
[0045] In the example of FIG. 3 , data from the clients 310 are forwarded through the APs 308 to the switching device 306. In an embodiment where the IP addresses assignment status of clients 310 are restricted, packets sent to and from the clients 310 are discarded, at least until the restriction attribute is disabled in the FDB entries associated with the client 310, as was described previously with reference to FIG. 1 and FIG. 2 .
[0046] FIG. 4 is a schematic illustration of a FDB entry 400. In the example of FIG. 4 , the FDB entry 400 includes a port ID field 402, a MAC address field 404, a VLAN ID field 406, an age field 408, an address status restriction field 410, and possibly other fields. The port ID field 402 identifies the port on which an associated message was received. The MAC address field 404 identifies the physical address of the device from which the message originated. A VLAN allows devices located on different physical LAN segments to communication as though they are on the same physical LAN segments. In so doing, a VLAN promotes efficiency based on traffic pattern rather than proximity. The VLAN ID enables devices grouped in a VLAN to identify each other within the VLAN. The FDB entry shown in FIG. 4 includes both identification data (e.g. MAC address, VLAN address, port ID) and attributes (e.g. age, IP address assignment status). In another embodiment, the FDB includes a forwarding memory (not shown) for storing entries having identification data and a separate associated memory (not shown) for storing attributes associated with the entries in the forwarding memory. In yet another embodiment, filtering based on IP address assignment status is implemented in hardware.
[0047] FIG. 5 is a block diagram illustrating an example of a network system 500 including an address restriction engine for filtering data traffic. In the example of FIG. 5 , the network system includes a FDB 502, an address restriction engine 510, and a switching device 512. The address restriction engine 510 further includes an address status restriction module 504 and a packet forwarding module 506.
[0048] In an embodiment, the FDB 502 may include a forwarding memory (not shown). The forwarding memory stores a table containing entries having information extracted from data traffic that the switching device 512 receives and may include, by way of example and not limitation, MAC address, port ID, and virtual LAN (VLAN) ID. Additionally, the entries may include numerous attributes including, by way of example and not limitation, the age of the entry, and the IP address assignment status associated with the identification information. In an alternative embodiment, the FDB 502 includes a forwarding memory (not shown) for storing entries having information extracted from data traffic and a distinct associated memory (not shown) for storing attribute data associated with each entry in the forwarding memory. The data entries stored in the FDB 502 are used to identify the destination information and forwarding attributes associated with a data packet so that the packet may be forwarded to its specified destination. For the purpose of example only, the system 500 could be configured such that the address to be restricted is one that originates from a wireless client, such as one of the wireless clients 310.
[0049] In the example of FIG. 5 , the address restriction engine 510 is coupled to the FDB 502 and the switching device 512. In an embodiment, the engine 510 may execute switching functions using the FDB 502 and the switching device 512. In another embodiment, the engine 510 monitors the data traffic that the switching device 512 receives and filters the traffic in addition to executing switching functions. In an embodiment, the engine 510 filters the data traffic passing through the switching device 512 by delegating separate monitoring and switching functions between the address status restriction module 504 and the packet forwarding module 506. In an embodiment, the address status restriction module 504 accesses the FDB 502 to manipulate an entry attribute based on the IP address assignment status of the device associated with the entry. The packet forwarding module 506 monitors the data traffic that the switching device 512 receives for packets that may change the IP address assignment status of a device and notifies the address status restriction module 504 of potential change in address assignments. The address status restriction module 504, in turn, verifies whether an IP address has been assigned based on the information it receives from the packet forwarding module 506. The address restriction engine 510 may be implemented, by way of example and not limitation, with a CPU, a network processor, or a general processor. In one embodiment, the engine 510 is a processor that includes a first sub-processor having the restriction module 504 and a second sub-processor having the forwarding module 506. In an alternative embodiment, the engine 510 includes a first processor (e.g. CPU, general processor, network processor) having the restriction module 504 and a second processor (e.g. CPU, general processor, network processor) having the forwarding module 506.
[0050] In an embodiment, the switching device 512 may have a switching fabric (not shown) including, by way of example and not limitation, one or more switching Application Specific Integrated Circuits (ASICs). Furthermore, the switching ASICs may, for example, be configured to perform level 2 switching functions, level 3 switching functions, level 3 routing functions, level 4 switching functions, and level 4 routing functions. In an alternative embodiment, the switching fabric may implement the level 2 to 4 switching and routing functions by using software or by using hardware not dependents on ASICs. The switching device 512 may channel incoming data from input ports (not shown) to a specific output port that will take data toward an intended destination. On, for example, an Ethernet local area network (LAN), a switching device determines from the physical device (Media Access Control or MAC) address in each incoming message frame which output port to forward it to and out of. In, for example, a wide area packet-switched network such as the Internet, a switching device determines from the IP address in each packet which output port to use for the next part of its trip to the intended destination. In, for example, a circuit-switched network, one or more switching devices are used to set up a dedicated though temporary connection between two or more parties.
[0051] FIG. 6 depicts a flowchart 600 of an example of a method for restrictive data forwarding. In the example of FIG. 6 , the flowchart 600 starts at module 602 with receiving a data unity include layer 2 client-identification data. The flowchart 600 continues to module 604 with determining whether the data unit includes layer 3 address data. If, at decision point 608, it is determined that the data unit does not include layer 3 address data, then the flowchart 600 continues to module 608 with determining whether layer 2 client-identification data has been recorded. If it is determined at decision point 610 that layer 2 data has not been recorded, then the flowchart continues to module 612 with recording the layer 2 data and to module 614 with enabling a layer 3 address assignment status restriction attribute, then the flowchart 600 ends. If, on the other hand, it is determined at decision point 610 that layer 2 data has been recorded, then the flowchart ends at module 616 with forwarding the data unity unless the address assignment status restriction attribute is enabled.
[0052] Returning once again to decision point 606 of FIG. 6 , if it is determined that the data unit includes layer 3 data (606—Yes), then the flowchart 600 continues to module 618 with determining whether layer 3 address data confirms a layer 3 address assignment. If, at decision point 620, it is determined that the layer 3 address assignment is not confirmed, then the flowchart 600 continues to module 622 with disabling the layer 3 address assignment status restriction attribute, to module 624 with forwarding the data unit, and the flowchart 600 ends. If, on the other hand, it is determined that the layer 3 address assignment is confirmed, then the flowchart 600 ends at module 626 with forwarding the data unit if the layer 3 address data does not confirm a layer 3 address assignment. Where a data unit is not forwarded, it may or may not be dropped, depending upon the implementation.
[0053] Terms and examples described above serve illustrative purposes only and are not intended to be limiting. For example, although the term “packet” or “data packet” is used to describe a unit of information in the processing and switching operations above, one skilled in the art would appreciate that information may be transmitted in other data unit forms including, by way of example and not limitation, a data packet or a frame. Some instances above describe information filtering for data originating from a source that has not yet obtained an IP address assignment, one skilled in the art would readily perceive that data can be filtered either to or from such a source.
[0054] As used herein, the term “embodiment” means an embodiment that serves to illustrate by way of example but not limitation. It may be noted that, in an embodiment, timestamps can be observed to measure roaming time.
[0055] It will be appreciated to those skilled in the art that the preceding examples and embodiments are exemplary and not limiting to the scope of the present invention. It is intended that all permutations, enhancements, equivalents, and improvements thereto that are apparent to those skilled in the art upon a reading of the specification and a study of the drawings are included within the true spirit and scope of the present invention. It is therefore intended that the following appended claims include all such modifications, permutations and equivalents as fall within the true spirit and scope of the present invention.
Claims
What is claimed is:
1. A method comprising:
receiving a data unit including layer 2 client-identification data;
determining whether the data unit includes layer 3 address data;
if the data unit does not include any layer 3 address data:
determining whether the layer 2 client-identification data has been recorded;
if the layer 2 client-identification data has not been recorded:
recording the layer 2 client-identification data;
enabling a layer 3 address assignment status restriction attribute;
if the layer 2 client-identification data has been recorded, unless the address assignment status restriction attribute is enabled, forwarding the data unit;
if the data unit includes layer 3 address data, determining whether the layer 3 address data confirms a layer 3 address assignment;
if the layer 3 address data confirms a layer 3 address assignment:
disabling the layer 3 address assignment status restriction attribute;
forwarding the data unit.
2. The method claim 1, further comprising:
if the layer 3 address data does not confirm a layer 3 address assignment, forwarding the data unit.
3. The method of claim 1, further comprising: if the layer 3 address assignment restriction attribute is enabled, discarding the data unit.
4. The method of claim 1 further comprising: if the layer 2 client-identification data has been recorded, determining whether the layer 3 address assignment restriction attribute is enabled.
5. The method of claim 1, wherein the data unit is a packet, further comprising preprocessing the packet.
6. The method of claim 1, further comprising executing switching functions with respect to the data unit.
7. A system comprising:
a switching device capable of performing layer 2 functions;
a memory coupled to the switching device, the memory having a forwarding database including an entry having an associated layer 2 address and a layer 3 address assignment status restriction attribute;
a processor, coupled to the memory and the switching device, for executing memory access and packet forwarding functions wherein, in operation, when the processor enables the layer 3 address assignment status restriction attribute, data units that include the associated layer 2 address, other than data units having layer 3 address assignment data, are not forwarded by the switching device;
wherein, in operation, if a data unit of the data units includes layer 3 address data, the processor determines whether the layer 3 address data confirms a layer 3 address assignment;
wherein, in operation, if the layer 3 address data confirms a layer 3 address assignment;
the processor disables the layer 3 address assignment status restriction attribute;
the switching device forwards the data unit.
8. The system of claim 7, further comprising: a plurality of wireless access points coupled to the switching device.
9. The system of claim 7, further comprising: a plurality of clients coupled to the switching device through one or more wireless access points.
10. The system of claim 7, wherein the layer 2 address is a MAC address.
11. The system of claim 7, wherein the layer 3 address is an IP address.
12. The system of claim 7, wherein the data units are packets.
13. The system of claim 7, wherein the data units are frames.
14. The system of claim 7, wherein the entry of the forwarding database includes a port ID and a VLAN ID.
15. The system of claim 7, wherein the entry of the forwarding database includes an age parameter.
16. A system comprising:
a switching device capable of performing layer 2 functions;
a memory coupled to the switching device, the memory having a forwarding database including an entry wherein said entry having an associated layer 2 address and a layer 3 address assignment status restriction attribute;
an address restriction engine, coupled to the memory and the switching device, for executing packet forwarding and data traffic filtering functions, said engine having:
an address status restriction module having control logic for manipulating said layer 3 address assignment status restriction attribute,
a packet forwarding module having logic for monitoring data traffic and for notifying the address status restriction module that it has received data with layer 3 address assignment data;
wherein the address status restriction module determines whether to disable the layer 3 address assignment status restriction attribute based on data it receives from the packet forwarding module;
wherein, in operation, if a data unit of the data includes layer 3 address data, the processor determines whether the layer 3 address data confirms the layer 3 address assignment;
wherein, in operation, if the layer 3 address data confirms the layer 3 address assignment;
the address restriction engine disables the layer 3 address assignment status restriction attribute;
the switching device forwards the data unit.
17. The system of claim 16, wherein the layer 2 address is a MAC address.
18. The system of claim 16, wherein the layer 3 address is an IP address.
19. The system of claim 16, wherein the switching device is capable of performing layer 3 functions.
20. The method claim 7, wherein, in operation, if the layer 3 address data does not confirm a layer 3 address assignment, the switch forwards the data unit.
Patent Citations (186)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3641433(A) | 1972-02-01 | Mifflin et al. | Applicant |
| US4168400(A) | 1979-09-01 | De Couasnon et al. | Applicant |
| US4176316(A) | 1979-11-01 | DeRoas et al. | Applicant |
| US4247908(A) | 1981-01-01 | Lockart et al. | Applicant |
| US4291401(A) | 1981-09-01 | Bachmann | Applicant |
| US4291409(A) | 1981-09-01 | Weinberg et al. | Applicant |
| US4409470(A) | 1983-10-01 | Shepard et al. | Applicant |
| US4460120(A) | 1984-07-01 | Shepard et al. | Applicant |
| US4475208(A) | 1984-10-01 | Ricketts | Applicant |
| US4494238(A) | 1985-01-01 | Groth | Applicant |
| US4500987(A) | 1985-02-01 | Hasegawa | Applicant |
| US4503533(A) | 1985-03-01 | Tobagi et al. | Applicant |
| US4550414(A) | 1985-10-01 | Guinon et al. | Applicant |
| US4562415(A) | 1985-12-01 | McBiles | Applicant |
| US4630264(A) | 1986-12-01 | Wah | Applicant |
| US4635221(A) | 1987-01-01 | Kerr | Applicant |
| US4639914(A) | 1987-01-01 | Winters | Applicant |
| US4644523(A) | 1987-02-01 | Horwitz | Applicant |
| US4672658(A) | 1987-06-01 | Kavehrad | Applicant |
| US4673805(A) | 1987-06-01 | Shepard et al. | Applicant |
| US4707839(A) | 1987-11-01 | Andren et al. | Applicant |
| US4730340(A) | 1988-03-01 | Frazier | Applicant |
| US4736095(A) | 1988-04-01 | Shepard et al. | Applicant |
| US4740792(A) | 1988-04-01 | Sagey et al. | Applicant |
| US4758717(A) | 1988-07-01 | Shepard et al. | Applicant |
| US4760586(A) | 1988-07-01 | Takeda | Applicant |
| US4789983(A) | 1988-12-01 | Acampora et al. | Applicant |
| US4829540(A) | 1989-05-01 | Waggener et al. | Applicant |
| US4850009(A) | 1989-07-01 | Zook et al. | Applicant |
| US4872182(A) | 1989-10-01 | Mcrae et al. | Applicant |
| US4894842(A) | 1990-01-01 | Brockhoven et al. | Applicant |
| US4901307(A) | 1990-02-01 | Gilhousen et al. | Applicant |
| US4933952(A) | 1990-06-01 | Albrieux et al. | Applicant |
| US4933953(A) | 1990-06-01 | Yagi | Applicant |
| US4995053(A) | 1991-02-01 | Simpson et al. | Applicant |
| US5008899(A) | 1991-04-01 | Yamamoto | Applicant |
| US5029183(A) | 1991-07-01 | Tymes | Applicant |
| US5103459(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5103461(A) | 1992-04-01 | Tymes | Applicant |
| US5109390(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5142550(A) | 1992-08-01 | Tymes | Applicant |
| US5151919(A) | 1992-09-01 | Dent | Applicant |
| US5157687(A) | 1992-10-01 | Tymes | Applicant |
| US5187675(A) | 1993-02-01 | Dent et al. | Applicant |
| US5231633(A) | 1993-07-01 | Hluchyj et al. | Applicant |
| US5280498(A) | 1994-01-01 | Tymes et al. | Applicant |
| US5285494(A) | 1994-02-01 | Sprecher et al. | Applicant |
| US5329531(A) | 1994-07-01 | Diepstraten | Applicant |
| US5418812(A) | 1995-05-01 | Reyes et al. | Applicant |
| US5448569(A) | 1995-09-01 | Huang et al. | Applicant |
| US5450615(A) | 1995-09-01 | Fortune et al. | Applicant |
| US5465401(A) | 1995-11-01 | Thompson | Applicant |
| US5479441(A) | 1995-12-01 | Tymes et al. | Applicant |
| US5483676(A) | 1996-01-01 | Mahany et al. | Applicant |
| US5491644(A) | 1996-02-01 | Pickering et al. | Applicant |
| US5517495(A) | 1996-05-01 | Lund | Applicant |
| US5519762(A) | 1996-05-01 | Bartlett | Applicant |
| US5528621(A) | 1996-06-01 | Heiman et al. | Applicant |
| US5561841(A) | 1996-10-01 | Markus | Applicant |
| US5568513(A) | 1996-10-01 | Croft et al. | Applicant |
| US5570366(A) | 1996-10-01 | Baker et al. | Examiner |
| US5584048(A) | 1996-12-01 | Wieczorek | Applicant |
| US5598532(A) | 1997-01-01 | Liron | Applicant |
| US5630207(A) | 1997-05-01 | Gitlin et al. | Applicant |
| US5640414(A) | 1997-06-01 | Blakeney et al. | Applicant |
| US5649289(A) | 1997-07-01 | Wang et al. | Applicant |
| US5668803(A) | 1997-09-01 | Tymes et al. | Applicant |
| US5793303(A) | 1998-08-01 | Koga | Applicant |
| US5794128(A) | 1998-08-01 | Brocket et al. | Applicant |
| US5812589(A) | 1998-09-01 | Sealander et al. | Applicant |
| US5815811(A) | 1998-09-01 | Pinard et al. | Applicant |
| US5828960(A) | 1998-10-01 | Tang et al. | Applicant |
| US5838907(A) | 1998-11-01 | Hansen | Applicant |
| US5844900(A) | 1998-12-01 | Hong et al. | Applicant |
| US5872968(A) | 1999-02-01 | Knox et al. | Applicant |
| US5875179(A) | 1999-02-01 | Tikalsky | Applicant |
| US5896561(A) | 1999-04-01 | Schrader et al. | Applicant |
| US5909686(A) | 1999-06-01 | Muller et al. | Examiner |
| US5915214(A) | 1999-06-01 | Reece et al. | Applicant |
| US5920821(A) | 1999-07-01 | Seazholtz et al. | Applicant |
| US5933607(A) | 1999-08-01 | Tate et al. | Applicant |
| US5949988(A) | 1999-09-01 | Feisullin et al. | Applicant |
| US5953669(A) | 1999-09-01 | Stratis et al. | Applicant |
| US5960335(A) | 1999-09-01 | Umemoto et al. | Applicant |
| US5982779(A) | 1999-11-01 | Krishnakumar et al. | Applicant |
| US5987062(A) | 1999-11-01 | Engwer et al. | Applicant |
| US5987328(A) | 1999-11-01 | Ephremides et al. | Applicant |
| US6005853(A) | 1999-12-01 | Wang et al. | Applicant |
| US6011784(A) | 2000-01-01 | Brown | Applicant |
| US6078568(A) | 2000-06-01 | Wright | Applicant |
| US6088591(A) | 2000-07-01 | Trompower | Applicant |
| US6119009(A) | 2000-09-01 | Baranger et al. | Applicant |
| US6144638(A) | 2000-11-01 | Obenhuber et al. | Examiner |
| US6160804(A) | 2000-12-01 | Ahmed et al. | Applicant |
| US6188694(B1) | 2001-02-01 | Fine et al. | Applicant |
| US6199032(B1) | 2001-03-01 | Anderson | Applicant |
| US6208629(B1) | 2001-03-01 | Jaszewski et al. | Applicant |
| US6208841(B1) | 2001-03-01 | Wallace et al. | Applicant |
| US6218930(B1) | 2001-04-01 | Katzenberg et al. | Applicant |
| US6240078(B1) | 2001-05-01 | Kuhnel et al. | Applicant |
| US6240083(B1) | 2001-05-01 | Wright | Applicant |
| US6256300(B1) | 2001-07-01 | Ahmed et al. | Applicant |
| US6256334(B1) | 2001-07-01 | Adachi | Applicant |
| US6285662(B1) | 2001-09-01 | Watannabe | Applicant |
| US6317599(B1) | 2001-11-01 | Rappaport et al. | Applicant |
| US6336035(B1) | 2002-01-01 | Somoza et al. | Applicant |
| US6336152(B1) | 2002-01-01 | Richman et al. | Applicant |
| US6347091(B1) | 2002-02-01 | Wallentin et al. | Applicant |
| US6356758(B1) | 2002-03-01 | Almeida et al. | Applicant |
| US6393290(B1) | 2002-05-01 | Ufongene | Applicant |
| US6404772(B1) | 2002-06-01 | Beach et al. | Applicant |
| US6473449(B1) | 2002-10-01 | Cafarella et al. | Applicant |
| US6493679(B1) | 2002-12-01 | Rappaport et al. | Applicant |
| US6496290(B1) | 2002-12-01 | Lee | Applicant |
| US6512916(B1) | 2003-01-01 | Forbes, Jr. | Applicant |
| US6574240(B1) | 2003-06-01 | Tzeng | Examiner |
| US6580700(B1) | 2003-06-01 | Pinard et al. | Applicant |
| US6587680(B1) | 2003-07-01 | Ata-Laurila et al. | Applicant |
| US6614787(B1) | 2003-09-01 | Jain et al. | Applicant |
| US6625454(B1) | 2003-09-01 | Rappaport et al. | Applicant |
| US6631267(B1) | 2003-10-01 | Clarkson et al. | Applicant |
| US6659947(B1) | 2003-12-01 | Carter et al. | Applicant |
| US6687498(B2) | 2004-02-01 | McKenna et al. | Applicant |
| US6725260(B1) | 2004-04-01 | Philyaw | Applicant |
| US6747961(B1) | 2004-06-01 | Ahmed et al. | Applicant |
| US6839338(B1) | 2005-01-01 | Amara et al. | Applicant |
| US6879812(B2) | 2005-04-01 | Agrawal et al. | Applicant |
| US6934260(B1) | 2005-08-01 | Kanuri | Examiner |
| US6973622(B1) | 2005-12-01 | Rappaport et al. | Applicant |
| US6978301(B2) | 2005-12-01 | Tindal | Applicant |
| US7020773(B1) | 2006-03-01 | Otway et al. | Applicant |
| US7079537(B1) | 2006-07-01 | Kanuri et al. | Examiner |
| US7110756(B2) | 2006-09-01 | Diener | Applicant |
| US7134012(B2) | 2006-11-01 | Doyle et al. | Examiner |
| US7320070(B2) | 2008-01-01 | Baum | Examiner |
| US7417953(B2) | 2008-08-01 | Hicks et al. | Examiner |
| US2002/0052205(A1) | 2002-05-01 | Belostofsky et al. | Applicant |
| US2002/0069278(A1) | 2002-06-01 | Forslow | Applicant |
| US2002/0095486(A1) | 2002-07-01 | Bahl | Applicant |
| US2002/0101868(A1) | 2002-08-01 | Clear et al. | Applicant |
| US2002/0191572(A1) | 2002-12-01 | Weinstein et al. | Applicant |
| US2003/0014646(A1) | 2003-01-01 | Buddhikot et al. | Applicant |
| US2003/0018889(A1) | 2003-01-01 | Burnett et al. | Applicant |
| US2003/0107590(A1) | 2003-06-01 | Levillain et al. | Applicant |
| US2003/0133450(A1) | 2003-07-01 | Baum | Examiner |
| US2003/0174706(A1) | 2003-09-01 | Shankar et al. | Applicant |
| US2004/0025044(A1) | 2004-02-01 | Day | Applicant |
| US2004/0047320(A1) | 2004-03-01 | Eglin | Applicant |
| US2004/0054926(A1) | 2004-03-01 | Ocepek et al. | Examiner |
| US2004/0064560(A1) | 2004-04-01 | Zhang et al. | Applicant |
| US2004/0095914(A1) | 2004-05-01 | Katsube et al. | Applicant |
| US2004/0095932(A1) | 2004-05-01 | Astarabadi et al. | Applicant |
| US2004/0111640(A1) | 2004-06-01 | Baum | Examiner |
| US2004/0120370(A1) | 2004-06-01 | Lupo | Applicant |
| US2004/0143428(A1) | 2004-07-01 | Rappaport et al. | Applicant |
| US2004/0230370(A1) | 2004-11-01 | Tzamaloukas | Applicant |
| US2004/0259555(A1) | 2004-12-01 | Rappaport et al. | Applicant |
| US2005/0030929(A1) | 2005-02-01 | Swier et al. | Applicant |
| US2005/0058132(A1) | 2005-03-01 | Okano et al. | Applicant |
| US2005/0059405(A1) | 2005-03-01 | Thomson et al. | Applicant |
| US2005/0059406(A1) | 2005-03-01 | Thomson et al. | Applicant |
| US2005/0064873(A1) | 2005-03-01 | Karaoguz et al. | Applicant |
| US2005/0068925(A1) | 2005-03-01 | Palm et al. | Applicant |
| US2005/0073980(A1) | 2005-04-01 | Thomson et al. | Applicant |
| US2005/0128989(A1) | 2005-06-01 | Bhagwat et al. | Applicant |
| US2005/0157730(A1) | 2005-07-01 | Grant et al. | Applicant |
| US2005/0180358(A1) | 2005-08-01 | Kolar et al. | Applicant |
| US2005/0181805(A1) | 2005-08-01 | Gallagher | Applicant |
| US2005/0193103(A1) | 2005-09-01 | Drabik | Applicant |
| US2005/0223111(A1) | 2005-10-01 | Bhandaru et al. | Applicant |
| US2005/0240665(A1) | 2005-10-01 | Gu et al. | Applicant |
| US2005/0259597(A1) | 2005-11-01 | Benedetotto et al. | Applicant |
| US2005/0270992(A1) | 2005-12-01 | Sanzgiri et al. | Examiner |
| US2005/0273442(A1) | 2005-12-01 | Bennett | Applicant |
| US2005/0276218(A1) | 2005-12-01 | Ooghe et al. | Applicant |
| US2006/0045050(A1) | 2006-03-01 | Floros et al. | Applicant |
| US2006/0114872(A1) | 2006-06-01 | Hamada | Examiner |
| US2006/0182118(A1) | 2006-08-01 | Lam et al. | Examiner |
| US2006/0200862(A1) | 2006-09-01 | Olson et al. | Applicant |
| US2006/0248229(A1) | 2006-11-01 | Saunderson et al. | Examiner |
| US2007/0195793(A1) | 2007-08-01 | Grosser et al. | Examiner |
| WO94/03986 | 1994-02-01 | Applicant | |
| WO99/11003 | 1999-03-01 | Applicant | |
| WO3/085544(A1) | 2003-10-01 | Applicant | |
| WO2004/095192(A2) | 2004-11-01 | Applicant | |
| WO2004/095800(A1) | 2004-11-01 | Applicant |
Non-Patent Literature (47)
- Acampora and Winters, IEEE Communications Magazine, 25(8):11-20 (1987).Applicant
- Acampora and Winters, IEEE Journal on selected Areas in Communications. SAC-5:796-804 (1987).Applicant
- Bing and Subramanian, IEEE, 1318-1322 (1997).Applicant
- Durgin, et al., “Measurements and Models for Radio Path Loss and Penetration Loss in and Around Homes and Trees at 5.85 GHz”, IEEE Transactions on Communications, vol. 46, No. 11, Nov. 1998.Applicant
- Freret et al., Applications of Spread-Spectrum Radio to Wireless Terminal Communications, Conf. Record, Nat'l Telecom. Conf., Nov. 30-Dec. 4, 1980.Applicant
- Fortune et al., IEEE Computational Science and Engineering, “Wise Design of Indoor Wireless Systems: Practical Computation and Optimization”, p. 58-68 (1995).Applicant
- Geier, Jim, Wireless Lans Implementing Interoperable Networks, Chapter 3 (pp. 89-125) Chapter 4 (pp. 129-157) Chapter 5 (pp. 159-189) and Chapter 6 (pp. 193-234), 1999, United States.Applicant
- Ho et al., “Antenna Effects on Indoor Obstructed Wireless Channels and a Deterministic Image-Based Wide-Based Propagation Model for In-Building Personal Communications Systems”, International Journal of Wireless Information Networks, vol. 1, No. 1, 1994.Applicant
- Kim et al., “Radio Propagation Measurements and Prediction Using Three-Dimensional Ray Tracing in Urban Environments at 908 MHz and 1.9 GHz”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- Kleinrock and Scholl, Conference record 1977 ICC vol. 2 of 3, Jun. 12-15 Chicago Illinois “Packet Switching in radio Channels: New Conflict-Free Multiple Access Schemes for a Small Number of data Useres”, (1977).Applicant
- LAN/MAN Standars Committee of the IEEE Computer Society, Part 11:Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications:Higher Speed Physical Layer Extension in the 2.4 GHz Band, IEEE Std. 802.11b (1999).Applicant
- Okamoto and Xu, IEEE, Proceeding so of the 13th Annual Hawaii International Conference on System Sciences, pp. 54-63 (1997).Applicant
- Panjwani et al., “Interactive Computation of Coverage Regions for Wireless Communication in Multifloored Indoor Environments”, IEEE Journal on Selected Areas in Communications, vol. 14, No. 3, Apr. 1996.Applicant
- Perram and Martinez, “Technology Developments for Low-Cost Residential Alarm Systems”, Proceedings 1977 Carnahan Conference on Crime Countermeasures, Apr. 6-8, pp. 45-50 (1977).Applicant
- Piazzi et al., “Achievable Accuracy of Site-Specific Path-Loss Predictions in Residential Environments”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- Seidel et al., “Site-Specific Propagation Prediction for Wireless In-Building Personal Communications System Design”, IEEE Transactions on Vehicular Technology, vol. 43, No. 4, Nov. 1994.Applicant
- Skidmore et al., “Interactive Coverage Region and System Design Simulation for Wireless Communication Systems in Multi-floored Indoor Environments, SMT Plus” IEEE ICUPC '96 Proceedings (1996).Applicant
- Ullmo et al., “Wireless Propagation in Buildings: A Statistic Scattering Approach”, IEEE Transactions on Vehicular Technology, vol. 48, No. 3, May 1999.Applicant
- U.S. Appl. No. 11/326,966, filed Jan. 5, 2006, Taylor.Applicant
- U.S. Appl. No. 11/330,877, filed Jan. 11, 2006, Matta.Applicant
- U.S. Appl. No. 11/331,789, filed Jan. 14, 2006, Matta, et al.Applicant
- U.S. Appl. No. 11/351,104, filed Feb. 8, 2006, Tiwari.Applicant
- U.S. Appl. No. 11/377,859, filed Mar. 15, 2006, Harkins.Applicant
- U.S. Appl. No. 11/400,165, filed Apr. 5, 2006, Tiwari.Applicant
- U.S. Appl. No. 11/445,750, filed May 3, 2006, Matta.Applicant
- U.S. Appl. No. 11/417,830, filed May 30, 2006, Morain.Applicant
- U.S. Appl. No. 11/437,537, filed May 19, 2006, Freund et al.Applicant
- U.S. Appl. No. 11/437,538, filed May 19, 2006, Zeldin.Applicant
- U.S. Appl. No. 11/437,387, filed May 19, 2006, Zeldin et al.Applicant
- U.S. Appl. No. 11/437,582, filed May 19, 2006, Bugwadia et al.Applicant
- U.S. Appl. No. 11/451,704, filed Jun. 12, 2006, Riley.Applicant
- U.S. Appl. No. 11/487,722, filed Jul. 2006, Simons et al.Applicant
- U.S. Appl. No. 11/592,891, filed Nov. 2006, Murphy.Applicant
- U.S. Appl. No. 11/595,119, filed Nov. 2006, Murphy.Applicant
- U.S. Appl. No. 11/604,075, filed Nov. 2006, Murphy et al.Applicant
- U.S. Appl. No. 11/643,329, filed Dec. 2006, Towari.Applicant
- U.S. Appl. No. 11/648,359, filed Dec. 2006, Gast et al.Applicant
- U.S. Appl. No. 11/690,654, filed Mar. 2007, Keenly et al.Applicant
- U.S. Appl. No. 11/801,964, filed May 2007, Simone et al.Applicant
- U.S. Appl. No. 11/845,029, filed Aug. 2007, Gast.Applicant
- U.S. Appl. No. 11/852,234, filed Sep. 2007, Gast et al.Applicant
- U.S. Appl. No. 11/944,346, filed Nov. 2007, Gast.Applicant
- U.S. Appl. No. 11/966,912, filed Dec. 2007, Chesnutt et al.Applicant
- U.S. Appl. No. 11/970,484, filed Jan. 2008, Gast.Applicant
- U.S. Appl. No. 11/975,134, filed Oct. 2007, Aragon et al.Applicant
- U.S. Appl. No. 12/077,051, filed Mar. 2008, Gast.Applicant
- Puttini, R., Percher, J., Me, L., and de Sousa, R. 2004. A fully distributed IDS for Manet. In Proceedings of the Ninth international Symposium on Computers and Communications 2004 vol. 2 (Iscc″04 )—vol. 02 (Jun. 28-Jul. 1, 2004). ISCC. IEEE Computer Society, Washington, DC, 331-338.Applicant