New! View global litigation for patent families

US20110158122A1 - Wireless routing selection system and method - Google Patents

Wireless routing selection system and method Download PDF

Info

Publication number
US20110158122A1
US20110158122A1 US13042080 US201113042080A US2011158122A1 US 20110158122 A1 US20110158122 A1 US 20110158122A1 US 13042080 US13042080 US 13042080 US 201113042080 A US201113042080 A US 201113042080A US 2011158122 A1 US2011158122 A1 US 2011158122A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
node
ett
wireless
ettp
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US13042080
Inventor
James Murphy
Gary Morain
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Trapeze Networks Inc
Original Assignee
Trapeze Networks Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATIONS NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/121Minimizing delay

Abstract

A technique involves untethered access points (UAPs) that can broadcast estimated transmission time (ETT) that represents an estimated time it would take for a packet to be transmitted from the first UAP to an AP that is wire coupled to a network. The proposed system can offer, among other advantages, accurate ETT values for use by UAPs of a wireless network.

Description

    CROSS REFERENCE TO RELATED APPLICATIONS
  • [0001]
    This application is a continuation of U.S. application Ser. No. 11/604,075, entitled “Wireless Routing Selection System And Method,” filed Nov. 22, 2006, which claims priority to and the benefit of Provisional Patent Application Ser. No. 60/812,403 entitled “Wireless Routing Selection System And Method,” filed Jun. 9, 2006, both of which are incorporated herein by reference in their entireties.
  • BACKGROUND
  • [0002]
    Next hop selection in a wireless protocol is made by selecting a least cost hop. Historically, cost has been determined by hop count, signal strength, error rate, utilization, and other factors. One technique for wireless routing selection involves defining cost based on expected transmission time (ETT) for some link (ETT1).
  • [0003]
    For example, link cost may be determined by measuring the transmission time to send a 1 Mbps stream of packets across the link and measuring its transmission time for some number of bytes. An algorithm may measure for each available bandwidth across the link, and the transmission time is defined as the time from when the packet is scheduled (specifically, sent to the radio) and the time that an acknowledgement is received.
  • [0004]
    The improvement of algorithms for next hop selection are the subject of research. Any improvements may have significant repercussions on the relevant technologies. Accordingly, any improvement in next hop selection would be advantageous.
  • [0005]
    These are but a subset of the problems and issues associated with wireless routing selection, and are intended to characterize weaknesses in the prior art by way of example. 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.
  • SUMMARY
  • [0006]
    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.
  • [0007]
    A wireless network system is typically coupled to a wired network at some point. Such a point is sometimes referred to as an access point (AP). A plurality of untethered APs (UAPs) may be coupled to one another, and eventually to the AP, to allow a wireless network to grow to practically any size. However, as the network grows in size using UAPs, it becomes more difficult to figure out a best path from a mobile station, through the UAPs to the AP in an optimal fashion.
  • [0008]
    Advantageously, UAPs can broadcast estimated transmission time (ETT) that represents an estimated time it would take for a packet to be transmitted from the first UAP to the AP. Thus, a UAP that is right next to the AP should be able to give a low ETT to the AP. As the advertised ETTs percolate through the wireless network, UAPs can eventually settle on optimal paths to the AP. The better the estimate, the more likely the optimally chosen paths are actually optimal.
  • [0009]
    The proposed system can offer, among other advantages, accurate ETT values for use by UAPs of a wireless network. This and other advantages of the techniques described herein will become apparent to those skilled in the art upon a reading of the following descriptions and a study of the several figures of the drawings.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0010]
    Embodiments of the invention are illustrated in the figures. However, the embodiments and figures are illustrative rather than limiting; they provide examples of the invention.
  • [0011]
    FIG. 1 depicts an example of a rate aware wireless system.
  • [0012]
    FIG. 2 depicts an example of a weighted graph of source, next hop, and destination nodes.
  • [0013]
    FIG. 3 depicts an example of a system in which an ETTp calculation includes time spent on an output queue.
  • [0014]
    FIG. 4 depicts a graph that provides a conceptual depiction of queue latency.
  • [0015]
    FIG. 5 depicts an example of a wireless network system that includes a plurality of untethered APs (UAPs).
  • [0016]
    FIG. 6 depicts a flowchart of an example of a method for selecting a next hop.
  • [0017]
    FIG. 7 depicts a flowchart of an example of a method for measuring ETT1 to a node.
  • [0018]
    FIG. 8 depicts a flowchart of an example of a method for advertising an ETTp.
  • [0019]
    FIG. 9 depicts a flowchart of an example of a method for calculating NTT.
  • DETAILED DESCRIPTION
  • [0020]
    In the following description, several specific details are presented to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or in combination with other components, etc. In other instances, well-known implementations or operations are not shown or described in detail to avoid obscuring aspects of various embodiments, of the invention.
  • [0021]
    FIG. 1 depicts an example of a rate aware wireless system 100. In the example of FIG. 1, the system 100 includes a node 110, a node 120, and a node 130. For illustrative purposes, the node 110 and the node 130 are currently linked via active link 112, while the node 120 and the node 130 are not currently linked, as represented by the candidate link 122. In an embodiment, the candidate link 122 is periodically measured to determine if it is a better route than the active link 112. Optionally, if the node 130 is a next hop from a source node to a destination node, the node 130 may be linked to another node (not shown) through a next hop link 132.
  • [0022]
    In the example of FIG. 1, the node 110 advertises an estimated transmission time (ETT) for the path (ETTp) to a destination. ETTp 114 is the sum of ETT for each link (ETT1) from the source (e.g., the node 110) to the destination (not shown). ETTp 124 is the sum of ETT1 from the source (e.g., the node 120) to the destination (not shown). Optionally, the node 130 advertises an ETTp 134 that is the ETTp from the node 130 to the destination (passing through either the node 110 or the node 120). ETTp 134 is optional because it will only exist if the node 130 is a next hop node.
  • [0023]
    FIG. 2 depicts an example of a weighted graph 200 of source, next hop, and destination nodes. The weights of the edges in the graph 200 are ETT1 between two nodes of the graph 200. ETTp is the sum of ETT1 from a source node 202 to a destination node 206. Typically, there are multiple next hop nodes 204-1 to 204-N (referred to collectively as nodes 204) between the source node 202 and the destination node 206, though it is possible to have none. As is shown in FIG. 2, the ETT1 from the source node 202 to the node 204-1 has an ETT1 0. In general each of the nodes 204 has an ETT1 x to the next hop, where x=the ordinal position of the current node. For example, the ETT1 1 is the ETT1 from the node 204-1 to the node 204-2. As another example, the ETT1 N is the ETT1 from the node 204-N to the destination node 206.
  • [0024]
    In some embodiments, the ETTp calculation is for the time a packet is sent from a radio until the time an acknowledgement is received. This, however, does not include time spent on a queue waiting for the radio to become available. Advantageously, by including the time spent on the queue, the ETTp calculation can take into consideration the real time it takes to transmit a packet based on load and utilization.
  • [0025]
    FIG. 3 depicts an example of a system 300 in which an ETTp calculation includes time spent on an output queue. In the example of FIG. 3, the system 300 includes a wireless device 302, an access point (AP) 304, and an AP 306, a wireless switch 308, and a wired network 310. It may be noted that the AP 304 is depicted as an untethered AP. In an embodiment, any number of untethered APs could be coupled together to reach the tethered AP 306.
  • [0026]
    In the example of FIG. 3, the wireless device 302 includes a queue 312, with packets 314-1 to 314-N enqueued thereon. The packet 314-1 is presumably a first packet of a stream of packets than the wireless device 302 is trying to send to the AP 304. However, the AP 304 may not be available, which results in the packet being enqueued in the queue 312, as shown. The packet 314-N is the last packet to be enqueued prior to the packet 314-1 finally being sent to the AP 304. Thus, the example of FIG. 3 illustrates the queue 312 just before the packet 314-1 is sent to the AP 304 (and dequeued). The time spent waiting may be referred to as radio availability latency because it measures the time it takes for a radio (at the AP 304, in this case) to become available.
  • [0027]
    The AP 304 has a comparable queue 316, which is coupled to an ETT engine 318. The wireless device 302 may or may not have an ETT engine to determine how long a packet is enqueued on the queue 312, but in the example of FIG. 1, no such engine is present at the wireless device 302. The queue 316 functions in a manner quite similar to that described with reference to the queue 312. At the AP 304, however, the ETT engine 318 actually measures the amount of time a packet is enqueued. This radio availability latency can be added to an advertised ETTp, as described later with reference to FIG. 1, to give a more accurate measure of ETT for a packet.
  • [0028]
    Advantageously, ETT can be used by a next hop selector to decide upon an optimal next hop. In an embodiment, each AP includes a next hop selector.
  • [0029]
    FIG. 4 depicts a graph 400 that provides a conceptual depiction of queue latency. In the example of FIG. 4, the graph 400 includes (for illustrative purposes) a flat, or static, link rate 402 and a data rate 404 that increases over time. Where the link rate 402 is greater than the data rate 404, the link is under-utilized, as shown by the shaded link underutilization portion 406 of the graph 400. The link saturation point 408 is at a time where the link rate 402 and the data rate 404 are the same. At the link saturation point 408, the link is fully utilized. Where the link rate 402 is less than the data rate 404, the link is congested, as shown by the shaded link congestion portion 410 of the graph 410. When the link is congested, packets will arrive at an output queue, such as the queue 316 (FIG. 3) at a rate that is greater than the rate at which the packets are dequeued (and transmitted). Thus, the time spent waiting on the queue will grow as the link grows more congested. Advantageously, an ETT engine, such as the ETT engine 318 (FIG. 3) can measure this time spent waiting and incorporate the measurement into an ETT calculation.
  • [0030]
    From “A Radio Aware Routing Protocol for Wireless Mesh Networks” by Kulkarni et al. defines cost based on ETT1, and how ETT1 can be aggregated to determine ETTp. However, the algorithm used by Kulkarni et al. can be improved in some specific cases. For example, the choice of 1 Mbps load rate for link cost calculation is arbitrary and may be significantly off. In an embodiment, expected load rate (ELR) is used instead. ELR is the load that a link would be subject to if it was selected as a next-hop.
  • [0031]
    Referring once again to the example of FIG. 1, an ELR 10-30 136 and an ELR 30-10 138 are associated with the active link 112. The ELR 10-30 136 is intended to illustrate ELR from the node 110 to the node 130 and the ELR 30-10 138 is intended to illustrate ELR from the node 130 to the node 110. In an embodiment, the ETT of a link will vary greatly depending on how much traffic is inserted into it. The more traffic you insert into a link, the higher the probability for collisions on the link. Accordingly, the ELR 10-30 136 is calculated dynamically based on current load conditions of the active link 112 from the node 110 to the node 130, and the ELR 30-10 138 is calculated dynamically based on current load conditions of the active link 112 from the node 130 to the node 110. The calculated ELR may be averaged in an exponentially decaying fashion to allow route selection stabilization.
  • [0032]
    In the example of FIG. 1, conceptually, the node 130 is trying to select the least cost link to some destination reachable through both the node 110 and the node 120. As shown in the system 100, the active link 112 has an ELR 10-30 136 and an ELR 30-10 138. The ELR 10-30 136 and the ELR 30-10 138 can be used to respectively calculate an effective data rate (EDR) 10-30 116 and an EDR 30-10 118.
  • [0033]
    EDR is the rate determined by a rate selection algorithm. In general, the rate selection algorithm should meet the following goals: 1) To the extent possible, the selected rate should produce optimal throughput of packets transmitted to a client. This is not necessarily the same thing as minimizing retries. For instance, retransmitting one time a large packet at 54 Mbps may result in better throughput than transmitting the same large packet at a 1 Mbps with no retries. 2) To the extent possible, the algorithm should be computationally light. That is, it should not consume a lot of CPU time to determine a rate to use.
  • [0034]
    An example of a rate selection algorithm is as follows (though any applicable known or convenient rate selection algorithm could be used): The rate selection algorithm seeks to minimize retransmissions. For each client it maintains a ‘best rate’ value. The rate selection algorithm is a control system that lowers the best rate when the rate of retransmissions exceeds 50% and raises the best rate when the rate of retransmissions is less than 50%. For each transmitted packet, there are one of three possible outcomes. 1) The packet is successfully transmitted with no retransmissions, 2) the packet is successfully transmitted with one or more retransmissions, 3) the packet transmission is unsuccessful after all retransmission attempts.
  • [0035]
    For each client, a counter is maintained. When a packet is successfully transmitted with no retransmissions, this counter is incremented by 3. When a packet is successfully transmitted but with retransmissions, the counter is decremented by 6. When a packet is not successfully transmitted, the counter is not changed. When the counter reached a value of −50, then the next lower rate is made the best rate. When the counter reaches a value of 100, the next higher rate is used as the best rate; however, the best rate is not increased if it has been increased in the past 60 seconds. This prevents the best rate from increasing too fast.
  • [0036]
    For each packet, transmissions are attempted using up to four rates.
      • The best rate is tried 1 time. This is the initial transmission attempt, not a retransmission.
      • The next best rate is tried for configured number of retransmissions minus 2. For example, the default value for the retry count is 5, and so by default the next best rate is tried 3 times.
      • The next lower rate is tried 1 time.
      • The lowest rate supported by the radio is tried 1 time.
  • [0041]
    This rate fall back schedule has the following properties. 1) If the best rate is successful, then there are no retries and the client's counter is increased. 2) If the best rate fails, then the next lower rate is used multiple times. The range of the next best rate is better than the best rate, and so the next best rate has a higher probability of success. The client's counter will be decremented in this case to reflect that the best rate was unsuccessful. 3) The radio's lowest rate has the best range, and so if it fails, then the client is not reachable or the failure is due to factors not related to distance. In this case, the client's counter is unchanged because the failure is not related to rate.
  • [0042]
    If the EDR is actually determined ELR, the algorithm further reduces the bandwidth required to compute ETT1, since the EDR need not be calculated through synthesized load. Notably, as shown in FIG. 1, the EDR 20-30 126 uses the ELR 10-30 136, and the EDR 30-20 128 uses the ELR 30-10 138. Accordingly, for the candidate link 122 as well, a synthesized load is not used. Advantageously, in both cases, ELR is calculated based on existing traffic.
  • [0043]
    It should be noted that sensing all data rates is less efficient than using the techniques described herein. Advantageously, by using EDR, all possible rates need not be tested, making this technique more efficient. Moreover, selected rates may not be the rate actually selected by a radio transmission module. For example, if data rate selection does not yield an answer that matches an algorithm such as Kulkarni's, the actual ETT1 will be different than the expected ETT1 and the algorithm will make suboptimal decisions. So using EDR can lead to performance improvements as well.
  • [0044]
    In an embodiment, the ETTp calculation can be improved by considering the amount of time a packet spends being processed in intermediate nodes. This is the time it takes to receive a packet on some interface and queue it on its egress interface. This time is referred to as node transit time (NTT). Therefore, in a non-limiting embodiment, ETTp=ETT1+ETTp_nh+NTT, where ETT1 is the link between a node and a next hop node, ETTp_nh is the ETTp advertised by the next hop node (e.g., the best advertised ETTp of potential next hop nodes), and NTT is the time a packet spends transiting a node. As was previously described, the ETT calculations include the time a packet spends in a queue waiting for a radio to become available. Conceptually, the NTT is the time a packet spends in a node waiting to be enqueued.
  • [0045]
    The techniques described herein work best when there are relatively few interesting destinations. Advantageously, this is exactly the case in most IP network environments. Most hosts are trying to communicate to their next hop IP router, which is typically eventually accessed over a wired network. Hence, the techniques described herein help answer the question “how do I get to the wired network?” Only a single destination need be evaluated and only a single value to ELR needs to be maintained.
  • [0046]
    FIG. 5 depicts an example of a wireless network system 500 that includes a plurality of untethered APs (UAPs). In the example of FIG. 5, the system 500 includes a UAP 502, a UAP 504, a plurality of UAPs 506-1 to 506-N (referred to collectively as UAPs 506), and an AP 508. For illustrative purposes only, a path for wireless traffic from a station 510 to the AP 508 is depicted as a dashed line. Potential paths for wireless traffic from the station 510 to the AP 508 are depicted as dotted lines.
  • [0047]
    In the example of FIG. 5, wireless traffic from the station 510 is directed to an AP with which the station 510 has associated. Typically, though not always, the AP with which the station associates is the one that is closest to the station 510 (or the one that detects the highest RSSI from the station 510). In the example of FIG. 5, the closest station is presumed to be the UAP 502.
  • [0048]
    In the example of FIG. 5, presumably, at some stage it was determined that the best path from the station 510 to the AP 508 was from the USP 502 to the UAP 504 and finally to the AP 508. However, the system 500 continuously or occasionally measures ETT for various nodes, as was described above. Thus, it may be determined that a different path (through one of the UAPs 506) is better. It should be noted that, depending upon the implementation and/or embodiment, a tethered AP could be rejected as a next hop in favor of a UAP, followed by an eventual hop to some other AP. This would be the case if ETTp from the UAP was better than the ETTp directly to the tethered AP. Presumably, this would be unusual, but not impossible.
  • [0049]
    At the UAP 502, the goal is to send traffic to the least expensive AP that is wired to a network. By least expensive, what is intended is that a weighted graph with edges that are ETT between nodes, would yield the smallest result possible (or practical). This AP may or may not be the AP closest to the UAP 502. The UAP 502, for illustrative purposes, is illustrated as a large circle with various components. However, the UAP 504, the UAPs 506, and/or the AP 508 may have similar components (not shown).
  • [0050]
    In the example of FIG. 5, the UAP 502 includes an ingress interface 512, an ETTp engine 514, a next hop selector 516, and an egress interface 518. The ETTp engine 514 includes an ETTp_nh module 520, an NTT module 522, and an ETT1 module 524. In operation, in a non-limiting embodiment, the UAP 504 and the UAPs 506 have broadcast advertised ETTp values that are associated with the path from the respective nodes to a destination, such as the wired network. The ETTp_nh module 520 receives each of the advertised ETTps.
  • [0051]
    Some time later (or concurrently) the station 510 sends packets to the UAP 502, which are received at the ingress interface 512. The NTT module 522 receives an indication, such as a first timestamp, that a first packet has been received. As much as is practical, it would probably be valuable to have the timestamp represent the exact time the first packet was received at the ingress queue 512, though an estimate may be used. At this point, the ETTp engine 514 knows only ETTp values for the UAP 504 and UAPs 506, but has no link information. It should be noted that in practice there will typically be link information as described later. Nevertheless, assuming for a moment that no link information is available, the ETTp engine 514 can provide the advertised ETTp values to the next hop selector 516, which picks an appropriate optimal path to the destination based on the advertised ETTp values. Specifically, the next hop selector 516 chooses the shortest (e.g., lowest weight) path to the destination.
  • [0052]
    The first packet is enqueued at the egress interface 518, as appropriate. It may be noted that the first packet may or may not need to be enqueued in a case where the relevant link is underutilized (or saturated but not congested). In any case, when the first packet is received at the egress interface 518, the NTT module 522 receives an indication, such as a second timestamp, that the first packet has been received at the egress interface 518. At this point, the NTT module 522, by comparing, for example, a first timestamp and a second timestamp, can calculate the amount of time that the first packet spent at the UAP 502. This information is useful for purposes that are described below.
  • [0053]
    The first packet is sent from the egress interface 518 to the UAP 504. For illustrative purposes, it is assumed that the UAP 504 is the next hop in an optimal path. In a non-limiting embodiment, the UAP 504 sends an acknowledgement, as soon as the first packet is received, that the first packet was received. The acknowledgement is received at an acknowledgement interface 526. It should be noted that the acknowledgement interface 526 may be part of a radio interface that includes the ingress interface 512 (or even the egress interface 518). In any case, the acknowledgement interface 526 provides the ETT1 module 524 with an indication, such as a timestamp, that an acknowledgement was received from the next hop node. The ETT1 module 524 uses the indication (e.g., second timestamp) that was generated when the first packet was enqueued on the egress interface 518 and the indication (e.g., third timestamp) that was generated upon receipt of the acknowledgement to provide an ETT1 value.
  • [0054]
    At this point, the ETTp engine 514 has enough information to know ETTp from the UAP 502 to the destination. Specifically, ETT1+NTT+ETTp_nh=ETTp from the UAP 502 to the destination. This ETTp value can be provided to an ETTp broadcast engine 528. In the example of FIG. 5, the broadcast engine 528 is not providing any value to the station 510 (unless the station 510 includes a means for making use of the broadcast ETTp). However, the UAP 504, for example, may have a broadcast engine that functions similarly. Such an engine could be used to provide the advertised ETTp to the ETTp_nh module 520, as described previously.
  • [0055]
    FIG. 6 depicts a flowchart 600 of an example of a method for selecting a next hop. In the example of FIG. 6, the flowchart 600 starts at module 602 where ETTp is received from nodes that are within range. In an embodiment, the node at which a next hop is being selected listens for any node within range. In an alternative, the potential next hop nodes may be restricted in some manner.
  • [0056]
    In the example of FIG. 6, the flowchart 600 continues to module 604 where ETT1 is measured to each node within range. Since the ETT1 is an actual measurement (rather than a guess), the ETT1 is a relatively accurate representation of actual link characteristics. Any applicable known or convenient technique may be used to measure ETT1. An example of a method for measuring ETT1 to a node is described later with reference to FIG. 7.
  • [0057]
    In the example of FIG. 6, the flowchart 600 continues to module 606 where ETT1 is added to ETTp from each node to arrive at a node-specific path metric, and to module 608 where a next hop is selected that is associated with a minimum of the node-specific path metrics. Notably, the lowest ETTp plus a corresponding ETT1 is not necessarily lower than some other ETTp plus a corresponding ETT1.
  • [0058]
    FIG. 7 depicts a flowchart 700 of an example of a method for measuring ETT1 to a node. In the example of FIG. 7, the flowchart 700 starts at module 702 where a packet is placed on an egress queue. Packets are placed on egress queues when they are ready to be transmitted to a next hop or destination.
  • [0059]
    In the example of FIG. 7, the flowchart 700 continues to modules 704 where a first timestamp is taken. The first timestamp represents the approximate time at which the packet was placed on the egress queue. The packets may be left on an egress queue for a relatively long time if they are enqueued at a faster rate than they are dequeued (and transmitted). Typically, if a packet remains in the egress queue for a relatively long period of time, a link between the current queue and the next hop or destination is congested.
  • [0060]
    In the example of FIG. 7, the flowchart 700 continues to module 706 where an acknowledgement is received that the packet was transmitted. The acknowledgement may be in the form of, by way of example but not limitation, an 802.11 ack. Other protocols may have other techniques or terminologies, but any applicable known or convenient means for acknowledging that the packet was received may be used, depending upon the implementation and/or embodiment.
  • [0061]
    In the example of FIG. 7, the flowchart 700 continues to module 708 where a second timestamp is taken. The second timestamp represents the approximate time at which the packet that was placed on the egress queue, plus the time to reach the next hop, plus the time to receive the acknowledgement (which is normally sent immediately upon receipt of the packet). Alternatively, the second timestamp could be placed in the acknowledgement such that the time to receive the acknowledgement is omitted.
  • [0062]
    In the example of FIG. 7, the flowchart 700 continues to module 710 where a difference between the first timestamp and the second timestamp is found. In a non-limiting embodiment, this entails calculating an exponentially decaying average of the difference. In any case, the value found may be used as an ETT1.
  • [0063]
    FIG. 8 depicts a flowchart 800 of an example of a method for advertising an ETTp. In the example of FIG. 8, the flowchart 800 starts at module 802 where an advertised ETTp is calculated. ETTp is calculated by selecting an advertised ETTp from some other node and adding local NTT. NTT may be, by way of example but not limitation, an exponentially weighted average of the time it takes to transmit a packet from an ingress to an egress queue in a node. An example of a method for calculating NTT is described later with reference to FIG. 9.
  • [0064]
    In the example of FIG. 8, the flowchart 800 continues to module 804 where the advertised ETTp is broadcast. In an alternative embodiment, the ETTp may be multicast to a subset of nodes within broadcast range. Any nodes within range may use the advertised ETTp when selecting a next hop, if applicable.
  • [0065]
    FIG. 9 depicts a flowchart 900 of an example of a method for calculating NTT. In the example of FIG. 9, the flowchart 900 starts at module 902 with receiving a packet on an ingress interface. The packet may be received from a wireless station, such as a mobile device or UAP.
  • [0066]
    In the example of FIG. 9, the flowchart 900 continues to module 904 where a first timestamp is taken. The first timestamp represents the point in time when the packet is first received at the node.
  • [0067]
    In the example of FIG. 9, the flowchart 900 continues to module 906 where the packet is forwarded to an appropriate egress interface. Techniques for forwarding packets to egress interfaces are well known in the relevant art, and are not described herein. It is assumed that some applicable known or convenient technique is used.
  • [0068]
    In the example of FIG. 9, the flowchart 900 continues to module 908 where a second timestamp is taken. The second timestamp represents the point in time when the packet has been enqueued for sending to a next hop or destination.
  • [0069]
    In the example of FIG. 9, the flowchart 900 continues to module 910 where a difference between the first timestamp and the second timestamp is found. In a non-limiting embodiment, an exponentially decaying average is used. In an y case, the derived value may be used as the local NTT.
  • [0070]
    As used herein, access point (AP) refers to receiving points for any known or convenient wireless access technology. Specifically, the term AP is not intended to be limited to 802.11 APs.
  • [0071]
    Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic 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. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations 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. 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.
  • [0072]
    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 discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” 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.
  • [0073]
    The algorithms and techniques described herein also relate to apparatus for pertaining the algorithms and techniques. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
  • [0074]
    As used herein, the term “embodiment” means an embodiment that serves to illustrate by way of example but not limitation.
  • [0075]
    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 (20)

  1. 1. A method comprising:
    receiving, at a first wireless node, an estimated transmission time (ETT) from each wireless node from a plurality of wireless nodes that are within a range of the first wireless node, the ETT for each wireless node from the plurality of wireless nodes is a next-hop-to-destination-path ETT (ETTp) associated with one remaining wireless node from the plurality of wireless nodes;
    at the first wireless node, adding for each wireless node from the plurality of wireless nodes a link ETT (ETT1) to a corresponding ETTp to determine a node-specific path metric for that wireless node; and
    at the first wireless node, selecting a next hop based on the determined node-specific path metrics.
  2. 2. The method of claim 1, wherein each ETTp is a function of an ETT1, another ETTp, and a node transmission time of a second wireless node from the plurality of wireless nodes.
  3. 3. The method of claim 1, further including, at the first wireless node, calculating an advertised ETTp for the first wireless node, the advertised ETTp based on at least one ETT1, the ETTp of the first wireless node, and a node transmission time of the first wireless node.
  4. 4. The method of claim 1, further including broadcasting an advertised ETTp from the first wireless node to a second wireless node from the plurality of wireless nodes.
  5. 5. The method of claim 1, further including measuring an ETT1 from the first wireless node to each wireless node from the plurality of wireless nodes.
  6. 6. The method of claim 1, further including:
    placing a packet on an egress queue of the first wireless node at a first time;
    receiving an acknowledgement that the packet was received by a second wireless node from the plurality of wireless nodes at a second time; and
    measuring an ETT1 between the first wireless node and the second wireless node based on the first time and the second time.
  7. 7. The method of claim 1, further including:
    receiving a packet on an ingress interface of a wireless node from the plurality of wireless nodes at a first time;
    placing the packet on an egress interface of that wireless node at a second time; and
    calculating the ETTp of that wireless node based on the first time and the second time.
  8. 8. An apparatus comprising:
    a first access point configured to be wirelessly coupled to a second access point;
    the first access point is configured to broadcast an estimated transmission time (ETT) for a packet to be transmitted from the first access point to the second access point, the ETT including an estimated node transition time (NTT) at the first access point and an ETT over a link to the next hop that is based on current load.
  9. 9. The apparatus of claim 8, the first access point configured to transmit the packet to a network via a station.
  10. 10. The apparatus of claim 8, the first access point is configured to compare a next-hop-to-destination-path ETT (ETTp) of the second access point to an ETTp advertised by a third access point, and to send the first packet to the third access point when the advertised ETTp of the third access point is lower than the ETT of the second access point.
  11. 11. The apparatus of claim 8, the first access point is configured to calculate an ETT between the first access point and the second access point by queuing the first packet to be sent to the second access point and by measuring the amount of time the first packet is queued.
  12. 12. The apparatus of claims 8, the first access point is configured to calculate the ETT between the first access point and the second access point by sending the first packet to the second access point, receiving an acknowledgment of receipt from the second access point, and measuring the amount of time between sending the packet and receiving the acknowledgment.
  13. 13. The apparatus of claim 8, wherein the first access point is untethered.
  14. 14. The apparatus of claim 8, wherein the first access point is untethered and the second access point is tethered.
  15. 15. An apparatus, comprising:
    an estimated transmission time (ETT) engine configured to receive an estimated path transmission time (ETTp) advertised for each wireless node from a plurality of wireless nodes linked to an access point (AP), the ETTp for each wireless node from the plurality of wireless nodes being a function of a link ETT (ETT1), the ETTp for a remaining wireless node from the plurality of wireless nodes, and a node transition time (NTT) of that wireless node;
    the ETT engine configured to measure, for each wireless node from the plurality of wireless nodes, the ETT1 between the AP and that wireless node; and
    the ETT engine configured to determine a node-specific path metric for each wireless node from the plurality of wireless nodes, based on the measured ETT1 and the ETTp for that wireless node; and
    a next hop selector coupled to the ETT engine and configured to select a transmission path for a message received at the AP, based on the node-specific path metrics.
  16. 16. The apparatus of claim 15, wherein the ETT engine is configured to calculate an advertised ETTp for the AP, based on the measured ETT1s and the received advertised ETTps.
  17. 17. The apparatus of claim 15, wherein the ETT engine is configured toe to calculate the advertised ETTp for the AP as a function of one of (1) the measured ETT1's, (2) a received advertised ETTps or (3) a computed NTT of the AP.
  18. 18. The apparatus of claim 15, wherein the AP computes an NTT as a function of an amount of time to be enqueue the message within the AP for transmission to another node.
  19. 19. The apparatus of claim 15, wherein the ETT engine is configured to calculate each ETT1 as an indication of an amount of time between a packet being enqueued at an egress interface of the AP and an acknowledgement of the packet being received by the AP.
  20. 20. The apparatus of claim 15, further including:
    an ETTp broadcast engine coupled to the ETT engine and configured to broadcast the advertised ETTp for the access point, from the access point to a wireless node from the plurality of wireless nodes.
US13042080 2006-06-09 2011-03-07 Wireless routing selection system and method Abandoned US20110158122A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US81240306 true 2006-06-09 2006-06-09
US11604075 US7912982B2 (en) 2006-06-09 2006-11-22 Wireless routing selection system and method
US13042080 US20110158122A1 (en) 2006-06-09 2011-03-07 Wireless routing selection system and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US13042080 US20110158122A1 (en) 2006-06-09 2011-03-07 Wireless routing selection system and method

Publications (1)

Publication Number Publication Date
US20110158122A1 true true US20110158122A1 (en) 2011-06-30

Family

ID=39416825

Family Applications (2)

Application Number Title Priority Date Filing Date
US11604075 Active 2029-12-08 US7912982B2 (en) 2006-06-09 2006-11-22 Wireless routing selection system and method
US13042080 Abandoned US20110158122A1 (en) 2006-06-09 2011-03-07 Wireless routing selection system and method

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US11604075 Active 2029-12-08 US7912982B2 (en) 2006-06-09 2006-11-22 Wireless routing selection system and method

Country Status (1)

Country Link
US (2) US7912982B2 (en)

Cited By (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8116275B2 (en) 2005-10-13 2012-02-14 Trapeze Networks, Inc. System and network for wireless network monitoring
US8150357B2 (en) 2008-03-28 2012-04-03 Trapeze Networks, Inc. Smoothing filter for irregular update intervals
US8161278B2 (en) 2005-03-15 2012-04-17 Trapeze Networks, Inc. System and method for distributing keys in a wireless network
US8218449B2 (en) 2005-10-13 2012-07-10 Trapeze Networks, Inc. System and method for remote monitoring in a wireless network
US8238298B2 (en) 2008-08-29 2012-08-07 Trapeze Networks, Inc. Picking an optimal channel for an access point in a wireless network
US8238942B2 (en) 2007-11-21 2012-08-07 Trapeze Networks, Inc. Wireless station location detection
US8340110B2 (en) 2006-09-15 2012-12-25 Trapeze Networks, Inc. Quality of service provisioning for wireless networks
US8457031B2 (en) 2005-10-13 2013-06-04 Trapeze Networks, Inc. System and method for reliable multicast
US8638762B2 (en) 2005-10-13 2014-01-28 Trapeze Networks, Inc. System and method for network integrity
US8670383B2 (en) 2006-12-28 2014-03-11 Trapeze Networks, Inc. System and method for aggregation and queuing in a wireless network
US8818322B2 (en) 2006-06-09 2014-08-26 Trapeze Networks, Inc. Untethered access point mesh system and method
US8902904B2 (en) 2007-09-07 2014-12-02 Trapeze Networks, Inc. Network assignment based on priority
US8966018B2 (en) 2006-05-19 2015-02-24 Trapeze Networks, Inc. Automated network device configuration and network deployment
US8964747B2 (en) 2006-05-03 2015-02-24 Trapeze Networks, Inc. System and method for restricting network access using forwarding databases
US8978105B2 (en) 2008-07-25 2015-03-10 Trapeze Networks, Inc. Affirming network relationships and resource access via related networks
US20150208316A1 (en) * 2014-01-22 2015-07-23 Palo Alto Research Center Incorporated Gateways and routing in software-defined manets
US9191799B2 (en) 2006-06-09 2015-11-17 Juniper Networks, Inc. Sharing data between wireless switches system and method
US9258702B2 (en) 2006-06-09 2016-02-09 Trapeze Networks, Inc. AP-local dynamic switching
US9473576B2 (en) 2014-04-07 2016-10-18 Palo Alto Research Center Incorporated Service discovery using collection synchronization with exact names
US9590887B2 (en) 2014-07-18 2017-03-07 Cisco Systems, Inc. Method and system for keeping interest alive in a content centric network
US9590948B2 (en) 2014-12-15 2017-03-07 Cisco Systems, Inc. CCN routing using hardware-assisted hash tables
US9609014B2 (en) 2014-05-22 2017-03-28 Cisco Systems, Inc. Method and apparatus for preventing insertion of malicious content at a named data network router
US9621354B2 (en) 2014-07-17 2017-04-11 Cisco Systems, Inc. Reconstructable content objects
US9626413B2 (en) 2014-03-10 2017-04-18 Cisco Systems, Inc. System and method for ranking content popularity in a content-centric network
US9660825B2 (en) 2014-12-24 2017-05-23 Cisco Technology, Inc. System and method for multi-source multicasting in content-centric networks
US9686194B2 (en) 2009-10-21 2017-06-20 Cisco Technology, Inc. Adaptive multi-interface use for content networking
US9699198B2 (en) 2014-07-07 2017-07-04 Cisco Technology, Inc. System and method for parallel secure content bootstrapping in content-centric networks
US9716622B2 (en) 2014-04-01 2017-07-25 Cisco Technology, Inc. System and method for dynamic name configuration in content-centric networks
US9729662B2 (en) 2014-08-11 2017-08-08 Cisco Technology, Inc. Probabilistic lazy-forwarding technique without validation in a content centric network
US9729616B2 (en) 2014-07-18 2017-08-08 Cisco Technology, Inc. Reputation-based strategy for forwarding and responding to interests over a content centric network
US9794238B2 (en) 2015-10-29 2017-10-17 Cisco Technology, Inc. System for key exchange in a content centric network
US9800637B2 (en) 2014-08-19 2017-10-24 Cisco Technology, Inc. System and method for all-in-one content stream in content-centric networks
US9807205B2 (en) 2015-11-02 2017-10-31 Cisco Technology, Inc. Header compression for CCN messages using dictionary
US9832123B2 (en) 2015-09-11 2017-11-28 Cisco Technology, Inc. Network named fragments in a content centric network
US9832116B2 (en) 2016-03-14 2017-11-28 Cisco Technology, Inc. Adjusting entries in a forwarding information base in a content centric network
US9832291B2 (en) 2015-01-12 2017-11-28 Cisco Technology, Inc. Auto-configurable transport stack
US9836540B2 (en) 2014-03-04 2017-12-05 Cisco Technology, Inc. System and method for direct storage access in a content-centric network
US9882964B2 (en) 2014-08-08 2018-01-30 Cisco Technology, Inc. Explicit strategy feedback in name-based forwarding
US9912776B2 (en) 2015-12-02 2018-03-06 Cisco Technology, Inc. Explicit content deletion commands in a content centric network
US9916457B2 (en) 2015-01-12 2018-03-13 Cisco Technology, Inc. Decoupled name security binding for CCN objects
US9930146B2 (en) 2016-04-04 2018-03-27 Cisco Technology, Inc. System and method for compressing content centric networking messages

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7551619B2 (en) 2005-10-13 2009-06-23 Trapeze Networks, Inc. Identity-based networking
US7577453B2 (en) 2006-06-01 2009-08-18 Trapeze Networks, Inc. Wireless load balancing across bands
US7912982B2 (en) 2006-06-09 2011-03-22 Trapeze Networks, Inc. Wireless routing selection system and method
US7724704B2 (en) * 2006-07-17 2010-05-25 Beiden Inc. Wireless VLAN system and method
US8072952B2 (en) 2006-10-16 2011-12-06 Juniper Networks, Inc. Load balancing
US7974235B2 (en) * 2006-11-13 2011-07-05 Telecommunication Systems, Inc. Secure location session manager
US7865713B2 (en) 2006-12-28 2011-01-04 Trapeze Networks, Inc. Application-aware wireless network system and method
US8332196B2 (en) * 2007-11-30 2012-12-11 Motorola Mobility Llc Method and apparatus for enhancing the accuracy and speed of a ray launching simulation tool
US20090167756A1 (en) * 2007-12-31 2009-07-02 Motorola, Inc. Method and apparatus for computation of wireless signal diffraction in a three-dimensional space
US8474023B2 (en) 2008-05-30 2013-06-25 Juniper Networks, Inc. Proactive credential caching
CN102821438B (en) * 2012-09-13 2016-04-20 苏州大学 A wireless Mesh networking opportunities routing method and router
US9667536B2 (en) * 2012-10-16 2017-05-30 Cisco Technology, Inc. Network traffic shaping for Low power and Lossy Networks
CN103888981B (en) * 2014-03-25 2017-12-29 电信科学技术研究院 A method and apparatus for determining a communication path

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6545979B1 (en) * 1998-11-27 2003-04-08 Alcatel Canada Inc. Round trip delay measurement
US20050286426A1 (en) * 2004-06-23 2005-12-29 Microsoft Corporation System and method for link quality routing using a weighted cumulative expected transmission time metric
US20070140114A1 (en) * 2005-12-20 2007-06-21 Mosko Marc E Method and apparatus for multi-path load balancing using multiple metrics
US20080153458A1 (en) * 2005-05-31 2008-06-26 Noldus Rogier August Caspar Jo Method and System for Delivering Advice of Charge in a Communications System

Family Cites Families (258)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4176316A (en) 1953-03-30 1979-11-27 International Telephone & Telegraph Corp. Secure single sideband communication system using modulated noise subcarrier
US3641433A (en) * 1969-06-09 1972-02-08 Us Air Force Transmitted reference synchronization system
FR2386211B1 (en) 1977-03-31 1982-04-16 Europ Teletransmission
US4291409A (en) 1978-06-20 1981-09-22 The Mitre Corporation Spread spectrum communications method and apparatus
JPS6041310B2 (en) 1978-11-30 1985-09-14 Ebauchesfabrik Eta Ag
US4247908A (en) * 1978-12-08 1981-01-27 Motorola, Inc. Re-linked portable data terminal controller system
US4730340A (en) * 1980-10-31 1988-03-08 Harris Corp. Programmable time invariant coherent spread symbol correlator
US4503533A (en) * 1981-08-20 1985-03-05 Stanford University Local area communication network utilizing a round robin access scheme with improved channel utilization
US4500987A (en) * 1981-11-24 1985-02-19 Nippon Electric Co., Ltd. Loop transmission system
US4475208A (en) 1982-01-18 1984-10-02 Ricketts James A Wired spread spectrum data communication system
US4736095A (en) * 1982-01-25 1988-04-05 Symbol Technologies, Inc. Narrow-bodied, single- and twin-windowed portable laser scanning head for reading bar code symbols
US4758717A (en) 1982-01-25 1988-07-19 Symbol Technologies, Inc. Narrow-bodied, single-and twin-windowed portable laser scanning head for reading bar code symbols
US4409470A (en) 1982-01-25 1983-10-11 Symbol Technologies, Inc. Narrow-bodied, single-and twin-windowed portable laser scanning head for reading bar code symbols
US4673805A (en) 1982-01-25 1987-06-16 Symbol Technologies, Inc. Narrow-bodied, single- and twin-windowed portable scanning head for reading bar code symbols
US4460120A (en) 1982-01-25 1984-07-17 Symbol Technologies, Inc. Narrow bodied, single- and twin-windowed portable laser scanning head for reading bar code symbols
US4494238A (en) * 1982-06-30 1985-01-15 Motorola, Inc. Multiple channel data link system
US4550414A (en) 1983-04-12 1985-10-29 Charles Stark Draper Laboratory, Inc. Spread spectrum adaptive code tracker
US4707839A (en) 1983-09-26 1987-11-17 Harris Corporation Spread spectrum correlator for recovering CCSK data from a PN spread MSK waveform
US4644523A (en) * 1984-03-23 1987-02-17 Sangamo Weston, Inc. System for improving signal-to-noise ratio in a direct sequence spread spectrum signal receiver
US4562415A (en) 1984-06-22 1985-12-31 Motorola, Inc. Universal ultra-precision PSK modulator with time multiplexed modes of varying modulation types
US4630264A (en) 1984-09-21 1986-12-16 Wah Benjamin W Efficient contention-resolution protocol for local multiaccess networks
US4639914A (en) * 1984-12-06 1987-01-27 At&T Bell Laboratories Wireless PBX/LAN system with optimum combining
JPH0693670B2 (en) 1984-12-29 1994-11-16 京セラ株式会社 Spread spectrum communication system
US4635221A (en) * 1985-01-18 1987-01-06 Allied Corporation Frequency multiplexed convolver communication system
US4672658A (en) 1985-10-16 1987-06-09 At&T Company And At&T Bell Laboratories Spread spectrum wireless PBX
US4850009A (en) 1986-05-12 1989-07-18 Clinicom Incorporated Portable handheld terminal including optical bar code reader and electromagnetic transceiver means for interactive wireless communication with a base communications station
EP0247790A3 (en) * 1986-05-27 1989-02-08 Fairchild Weston Systems Inc. Secure communication system for multiple remote units
US4740792A (en) * 1986-08-27 1988-04-26 Hughes Aircraft Company Vehicle location system
US4901307A (en) * 1986-10-17 1990-02-13 Qualcomm, Inc. Spread spectrum multiple access communication system using satellite or terrestrial repeaters
US4995053A (en) 1987-02-11 1991-02-19 Hillier Technologies Limited Partnership Remote control system, components and methods
US4789983A (en) 1987-03-05 1988-12-06 American Telephone And Telegraph Company, At&T Bell Laboratories Wireless network for wideband indoor communications
JPH0671241B2 (en) 1987-09-10 1994-09-07 株式会社ケンウッド Initial synchronization method of spread-spectrum communication
US4894842A (en) * 1987-10-15 1990-01-16 The Charles Stark Draper Laboratory, Inc. Precorrelation digital spread spectrum receiver
US4872182A (en) 1988-03-08 1989-10-03 Harris Corporation Frequency management system for use in multistation H.F. communication network
FR2629931B1 (en) 1988-04-08 1991-01-25 Lmt Radio Professionelle Asynchronous digital correlator and demodulators including such a correlator
US5483676A (en) * 1988-08-04 1996-01-09 Norand Corporation Mobile radio data communication system and method
US5029183A (en) 1989-06-29 1991-07-02 Symbol Technologies, Inc. Packet data communication network
US5280498A (en) * 1989-06-29 1994-01-18 Symbol Technologies, Inc. Packet data communication system
US5668803A (en) 1989-06-29 1997-09-16 Symbol Technologies, Inc. Protocol for packet data communication system
US5103461A (en) * 1989-06-29 1992-04-07 Symbol Technologies, Inc. Signal quality measure in packet data communication
US5142550A (en) 1989-06-29 1992-08-25 Symbol Technologies, Inc. Packet data communication system
US5528621A (en) 1989-06-29 1996-06-18 Symbol Technologies, Inc. Packet data communication system
US5815811A (en) 1989-06-29 1998-09-29 Symbol Technologies, Inc. Preemptive roaming in a cellular local area wireless network
US6580700B1 (en) 1995-10-27 2003-06-17 Symbol Technologies, Inc. Data rate algorithms for use in wireless local area networks
US5157687A (en) 1989-06-29 1992-10-20 Symbol Technologies, Inc. Packet data communication network
JP2660441B2 (en) * 1989-07-03 1997-10-08 双葉電子工業 株式会社 Spread spectrum communication receiving apparatus
US5109390A (en) * 1989-11-07 1992-04-28 Qualcomm Incorporated Diversity receiver in a cdma cellular telephone system
US5187575A (en) * 1989-12-29 1993-02-16 Massachusetts Institute Of Technology Source adaptive television system
US5103459B1 (en) * 1990-06-25 1999-07-06 Qualcomm Inc System and method for generating signal waveforms in a cdma cellular telephone system
US5231633A (en) 1990-07-11 1993-07-27 Codex Corporation Method for prioritizing, selectively discarding, and multiplexing differing traffic type fast packets
US5584048A (en) 1990-08-17 1996-12-10 Motorola, Inc. Beacon based packet radio standby energy saver
US5151919A (en) 1990-12-17 1992-09-29 Ericsson-Ge Mobile Communications Holding Inc. Cdma subtractive demodulation
CA2059734C (en) 1991-05-29 1996-05-21 Chris Rose Cordless telephone apparatus
US5187675A (en) 1991-09-18 1993-02-16 Ericsson-Ge Mobile Communications Holding Inc. Maximum search circuit
FI100043B (en) 1992-01-23 1997-08-29 Nokia Telecommunications Oy The cellular radio planning method and system
US5267261A (en) 1992-03-05 1993-11-30 Qualcomm Incorporated Mobile station assisted soft handoff in a CDMA cellular communications system
US5896561A (en) * 1992-04-06 1999-04-20 Intermec Ip Corp. Communication network having a dormant polling protocol
US5418812A (en) 1992-06-26 1995-05-23 Symbol Technologies, Inc. Radio network initialization method and apparatus
US5285494A (en) * 1992-07-31 1994-02-08 Pactel Corporation Network management system
GB9223890D0 (en) 1992-11-13 1993-01-06 Ncr Int Inc Wireless local area network system
US5465401A (en) 1992-12-15 1995-11-07 Texas Instruments Incorporated Communication system and methods for enhanced information transfer
CA2111634C (en) * 1992-12-17 1999-02-16 Toshio Nishida Private branch exchange
GB9304636D0 (en) 1993-03-06 1993-04-21 Ncr Int Inc A method of accessing a communication system
US5568513A (en) 1993-05-11 1996-10-22 Ericsson Inc. Standby power savings with cumulative parity check in mobile phones
EP0702871A4 (en) 1993-06-07 1998-01-28 Telecom Technologies Pty Ltd Communication system
DE4326749C2 (en) 1993-08-05 1995-05-04 Klaus Dr Ing Jaeckel Local ISDN radio transmission system
US5491644A (en) 1993-09-07 1996-02-13 Georgia Tech Research Corporation Cell engineering tool and methods
US5598532A (en) * 1993-10-21 1997-01-28 Optimal Networks Method and apparatus for optimizing computer networks
US5488569A (en) * 1993-12-20 1996-01-30 At&T Corp. Application-oriented telecommunication system interface
US5450615A (en) 1993-12-22 1995-09-12 At&T Corp. Prediction of indoor electromagnetic wave propagation for wireless indoor systems
WO1995019084A1 (en) * 1994-01-05 1995-07-13 Thomson Consumer Electronics, Inc. Clear channel selection system for a cordless telephone
CA2176401C (en) 1994-02-17 2003-07-08 John H. Cafarella A high-data-rate wireless local-area network
US5594782A (en) * 1994-02-24 1997-01-14 Gte Mobile Communications Service Corporation Multiple mode personal wireless communications system
US5448569A (en) 1994-04-12 1995-09-05 International Business Machines Corporation Handoff monitoring in cellular communication networks using slow frequency hopping
US5655148A (en) * 1994-05-27 1997-08-05 Microsoft Corporation Method for automatically configuring devices including a network adapter without manual intervention and without prior configuration information
US5517495A (en) * 1994-12-06 1996-05-14 At&T Corp. Fair prioritized scheduling in an input-buffered switch
US5519762A (en) * 1994-12-21 1996-05-21 At&T Corp. Adaptive power cycling for a cordless telephone
US5915214A (en) 1995-02-23 1999-06-22 Reece; Richard W. Mobile communication service provider selection system
US5828960A (en) 1995-03-31 1998-10-27 Motorola, Inc. Method for wireless communication system planning
US6535732B1 (en) * 1995-05-04 2003-03-18 Interwave Communications International, Ltd. Cellular network having a concentrated base transceiver station and a plurality of remote transceivers
US5734699A (en) * 1995-05-04 1998-03-31 Interwave Communications International, Ltd. Cellular private branch exchanges
US6697415B1 (en) * 1996-06-03 2004-02-24 Broadcom Corporation Spread spectrum transceiver module utilizing multiple mode transmission
US5630207A (en) * 1995-06-19 1997-05-13 Lucent Technologies Inc. Methods and apparatus for bandwidth reduction in a two-way paging system
JP2771478B2 (en) 1995-06-20 1998-07-02 静岡日本電気株式会社 Display function with a wireless selective call receiver
US5649289A (en) 1995-07-10 1997-07-15 Motorola, Inc. Flexible mobility management in a two-way messaging system and method therefor
JPH0936799A (en) 1995-07-21 1997-02-07 Toshiba Corp Radio communication equipment
US5794128A (en) 1995-09-20 1998-08-11 The United States Of America As Represented By The Secretary Of The Army Apparatus and processes for realistic simulation of wireless information transport systems
US5721733A (en) 1995-10-13 1998-02-24 General Wireless Communications, Inc. Wireless network access scheme
US5920821A (en) 1995-12-04 1999-07-06 Bell Atlantic Network Services, Inc. Use of cellular digital packet data (CDPD) communications to convey system identification list data to roaming cellular subscriber stations
US5987062A (en) 1995-12-15 1999-11-16 Netwave Technologies, Inc. Seamless roaming for wireless local area networks
US5838907A (en) 1996-02-20 1998-11-17 Compaq Computer Corporation Configuration manager for network devices and an associated method for providing configuration information thereto
US6118771A (en) 1996-03-14 2000-09-12 Kabushiki Kaisha Toshiba System and method for controlling communication
US5933420A (en) * 1996-04-30 1999-08-03 3Com Corporation Method and apparatus for assigning spectrum of a wireless local area network
US6088591A (en) 1996-06-28 2000-07-11 Aironet Wireless Communications, Inc. Cellular system hand-off protocol
JPH1021599A (en) * 1996-06-28 1998-01-23 Matsushita Electric Ind Co Ltd Magnetic field modulation recording and reproducing method using super resolution recording medium
US5949988A (en) 1996-07-16 1999-09-07 Lucent Technologies Inc. Prediction system for RF power distribution
US5844900A (en) 1996-09-23 1998-12-01 Proxim, Inc. Method and apparatus for optimizing a medium access control protocol
US5875179A (en) * 1996-10-29 1999-02-23 Proxim, Inc. Method and apparatus for synchronized communication over wireless backbone architecture
US7535913B2 (en) * 2002-03-06 2009-05-19 Nvidia Corporation Gigabit ethernet adapter supporting the iSCSI and IPSEC protocols
US6011784A (en) * 1996-12-18 2000-01-04 Motorola, Inc. Communication system and method using asynchronous and isochronous spectrum for voice and data
US6078568A (en) 1997-02-25 2000-06-20 Telefonaktiebolaget Lm Ericsson Multiple access communication network with dynamic access control
US6240083B1 (en) * 1997-02-25 2001-05-29 Telefonaktiebolaget L.M. Ericsson Multiple access communication network with combined contention and reservation mode access
JPH10261980A (en) 1997-03-18 1998-09-29 Fujitsu Ltd Base station unit for radio communication network, communication control method for radio communication network, radio communication network system and radio terminal
US5987328A (en) 1997-04-24 1999-11-16 Ephremides; Anthony Method and device for placement of transmitters in wireless networks
US6075814A (en) 1997-05-09 2000-06-13 Broadcom Homenetworking, Inc. Method and apparatus for reducing signal processing requirements for transmitting packet-based data with a modem
US5982779A (en) 1997-05-28 1999-11-09 Lucent Technologies Inc. Priority access for real-time traffic in contention-based networks
US6199032B1 (en) * 1997-07-23 2001-03-06 Edx Engineering, Inc. Presenting an output signal generated by a receiving device in a simulated communication system
DE69729295D1 (en) 1997-08-20 2004-07-01 Nec Usa Inc ATM switching architecture for wireless telecommunications network
US6119009A (en) 1997-09-18 2000-09-12 Lucent Technologies, Inc. Method and apparatus for modeling the propagation of wireless signals in buildings
US5953669A (en) 1997-12-11 1999-09-14 Motorola, Inc. Method and apparatus for predicting signal characteristics in a wireless communication system
US6188694B1 (en) 1997-12-23 2001-02-13 Cisco Technology, Inc. Shared spanning tree protocol
US6356758B1 (en) * 1997-12-31 2002-03-12 Nortel Networks Limited Wireless tools for data manipulation and visualization
KR100257184B1 (en) 1998-01-31 2000-05-15 정장호 Optic relay system for extending coverage
US6115385A (en) 1998-03-11 2000-09-05 Cisco Technology, Inc. Method and system for subnetting in a switched IP network
GB9810843D0 (en) 1998-05-21 1998-07-22 3Com Technologies Ltd Method for storing data in network devices
US6594238B1 (en) * 1998-06-19 2003-07-15 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for dynamically adapting a connection state in a mobile communications system
US6725260B1 (en) * 1998-09-11 2004-04-20 L.V. Partners, L.P. Method and apparatus for configuring configurable equipment with configuration information received from a remote location
US6101539A (en) 1998-10-02 2000-08-08 Kennelly; Richard J. Dynamic presentation of management objectives based on administrator privileges
US6160804A (en) 1998-11-13 2000-12-12 Lucent Technologies Inc. Mobility management for a multimedia mobile network
US6336035B1 (en) * 1998-11-19 2002-01-01 Nortel Networks Limited Tools for wireless network planning
US6218930B1 (en) * 1999-03-10 2001-04-17 Merlot Communications Apparatus and method for remotely powering access equipment over a 10/100 switched ethernet network
US6614787B1 (en) 1999-03-30 2003-09-02 3Com Corporation System and method for efficiently handling multicast packets by aggregating VLAN context
US6839348B2 (en) * 1999-04-30 2005-01-04 Cisco Technology, Inc. System and method for distributing multicasts in virtual local area networks
US6208841B1 (en) * 1999-05-03 2001-03-27 Qualcomm Incorporated Environmental simulator for a wireless communication device
US6285662B1 (en) 1999-05-14 2001-09-04 Nokia Mobile Phones Limited Apparatus, and associated method for selecting a size of a contention window for a packet of data system
US6493679B1 (en) 1999-05-26 2002-12-10 Wireless Valley Communications, Inc. Method and system for managing a real time bill of materials
US6317599B1 (en) 1999-05-26 2001-11-13 Wireless Valley Communications, Inc. Method and system for automated optimization of antenna positioning in 3-D
US7027773B1 (en) * 1999-05-28 2006-04-11 Afx Technology Group International, Inc. On/off keying node-to-node messaging transceiver network with dynamic routing and configuring
US6892230B1 (en) 1999-06-11 2005-05-10 Microsoft Corporation Dynamic self-configuration for ad hoc peer networking using mark-up language formated description messages
US6996630B1 (en) * 1999-06-18 2006-02-07 Mitsubishi Denki Kabushiki Kaisha Integrated network system
US6393290B1 (en) 1999-06-30 2002-05-21 Lucent Technologies Inc. Cost based model for wireless architecture
US6760324B1 (en) 1999-09-10 2004-07-06 Array Telecom Corporation Method, system, and computer program product for providing voice over the internet communication
US7089322B1 (en) * 1999-10-28 2006-08-08 Motient Communications Inc. System and method of aggregating data from a plurality of data generating machines
US6631267B1 (en) 1999-11-04 2003-10-07 Lucent Technologies Inc. Road-based evaluation and interpolation of wireless network parameters
US6587680B1 (en) 1999-11-23 2003-07-01 Nokia Corporation Transfer of security association during a mobile terminal handover
US7373425B2 (en) * 2000-08-22 2008-05-13 Conexant Systems, Inc. High-speed MAC address search engine
US7024199B1 (en) * 1999-12-30 2006-04-04 Motient Communications Inc. System and method of querying a device, checking device roaming history and/or obtaining device modem statistics when device is within a home network and/or complementary network
US6856786B2 (en) * 2000-01-26 2005-02-15 Vyyo Ltd. Quality of service scheduling scheme for a broadband wireless access system
US6512916B1 (en) * 2000-02-23 2003-01-28 America Connect, Inc. Method for selecting markets in which to deploy fixed wireless communication systems
FI109163B (en) 2000-02-24 2002-05-31 Nokia Corp A method and apparatus for supporting mobility in a telecommunication system
US6785275B1 (en) 2000-03-13 2004-08-31 International Business Machines Corporation Method and system for creating small group multicast over an existing unicast packet network
US7024394B1 (en) 2000-07-07 2006-04-04 International Business Machines Corporation System and method for protecting user logoff from web business transactions
US6985465B2 (en) * 2000-07-07 2006-01-10 Koninklijke Philips Electronics N.V. Dynamic channel selection scheme for IEEE 802.11 WLANs
US6659947B1 (en) 2000-07-13 2003-12-09 Ge Medical Systems Information Technologies, Inc. Wireless LAN architecture for integrated time-critical and non-time-critical services within medical facilities
US7020773B1 (en) * 2000-07-17 2006-03-28 Citrix Systems, Inc. Strong mutual authentication of devices
US6404772B1 (en) 2000-07-27 2002-06-11 Symbol Technologies, Inc. Voice and data wireless communications network and method
US6625454B1 (en) 2000-08-04 2003-09-23 Wireless Valley Communications, Inc. Method and system for designing or deploying a communications network which considers frequency dependent effects
US6687498B2 (en) * 2000-08-14 2004-02-03 Vesuvius Inc. Communique system with noncontiguous communique coverage areas in cellular communication networks
US7280495B1 (en) 2000-08-18 2007-10-09 Nortel Networks Limited Reliable broadcast protocol in a wireless local area network
US6973622B1 (en) 2000-09-25 2005-12-06 Wireless Valley Communications, Inc. System and method for design, tracking, measurement, prediction and optimization of data communication networks
US6937576B1 (en) 2000-10-17 2005-08-30 Cisco Technology, Inc. Multiple instance spanning tree protocol
US6954790B2 (en) 2000-12-05 2005-10-11 Interactive People Unplugged Ab Network-based mobile workgroup system
US6978301B2 (en) 2000-12-06 2005-12-20 Intelliden System and method for configuring a network device
US7155518B2 (en) 2001-01-08 2006-12-26 Interactive People Unplugged Ab Extranet workgroup formation across multiple mobile virtual private networks
US7133909B2 (en) 2001-01-12 2006-11-07 Microsoft Corporation Systems and methods for locating mobile computer users in a wireless network
US20020101868A1 (en) 2001-01-30 2002-08-01 David Clear Vlan tunneling protocol
EP1257092B1 (en) 2001-05-08 2005-01-05 Agere Systems Guardian Corporation Dynamic frequency selection in a wireless LAN with channel swapping between access points
US7483411B2 (en) 2001-06-04 2009-01-27 Nec Corporation Apparatus for public access mobility LAN and method of operation thereof
US7570656B2 (en) 2001-06-18 2009-08-04 Yitran Communications Ltd. Channel access method for powerline carrier based media access control protocol
US7231521B2 (en) * 2001-07-05 2007-06-12 Lucent Technologies Inc. Scheme for authentication and dynamic key exchange
US7313819B2 (en) * 2001-07-20 2007-12-25 Intel Corporation Automated establishment of addressability of a network device for a target network environment
JP2003069570A (en) * 2001-08-27 2003-03-07 Allied Tereshisu Kk Management system
US20030107590A1 (en) 2001-11-07 2003-06-12 Phillippe Levillain Policy rule management for QoS provisioning
US7406319B2 (en) 2001-11-19 2008-07-29 At&T Corp. WLAN having load balancing by access point admission/termination
CA2414789A1 (en) 2002-01-09 2003-07-09 Peel Wireless Inc. Wireless networks security system
US7076760B2 (en) * 2002-01-31 2006-07-11 Cadence Design Systems, Inc. Method and apparatus for specifying encoded sub-networks
US6879812B2 (en) * 2002-02-08 2005-04-12 Networks Associates Technology Inc. Portable computing device and associated method for analyzing a wireless local area network
JP3904462B2 (en) * 2002-02-12 2007-04-11 株式会社日立製作所 Wireless communication method and a radio communication system
US20030174706A1 (en) 2002-03-15 2003-09-18 Broadcom Corporation Fastpath implementation for transparent local area network (LAN) services over multiprotocol label switching (MPLS)
US6839338B1 (en) * 2002-03-20 2005-01-04 Utstarcom Incorporated Method to provide dynamic internet protocol security policy service
US7711809B2 (en) 2002-04-04 2010-05-04 Airmagnet, Inc. Detecting an unauthorized station in a wireless local area network
US6624762B1 (en) 2002-04-11 2003-09-23 Unisys Corporation Hardware-based, LZW data compression co-processor
WO2003098880A1 (en) * 2002-05-20 2003-11-27 Fujitsu Limited Network relaying device, network relaying method, and network relaying program
WO2004095192A3 (en) 2003-04-21 2007-11-29 Airdefense Inc Systems and methods for securing wireless computer networks
US20030227934A1 (en) 2002-06-11 2003-12-11 White Eric D. System and method for multicast media access using broadcast transmissions with multiple acknowledgements in an Ad-Hoc communications network
US20050193103A1 (en) 2002-06-18 2005-09-01 John Drabik Method and apparatus for automatic configuration and management of a virtual private network
KR101010806B1 (en) 2002-06-21 2011-01-25 톰슨 라이센싱 Registration of a wlan as a umts routing area for wlan-umts interworking
US7965842B2 (en) * 2002-06-28 2011-06-21 Wavelink Corporation System and method for detecting unauthorized wireless access points
DE60203708D1 (en) 2002-07-05 2005-05-19 Alcatel Sa Resource access control in an access network
US7509096B2 (en) * 2002-07-26 2009-03-24 Broadcom Corporation Wireless access point setup and management within wireless local area network
US7017186B2 (en) * 2002-07-30 2006-03-21 Steelcloud, Inc. Intrusion detection system using self-organizing clusters
US7068999B2 (en) 2002-08-02 2006-06-27 Symbol Technologies, Inc. System and method for detection of a rogue wireless access point in a wireless communication network
EP1389812A1 (en) 2002-08-13 2004-02-18 Agilent Technologies Inc A mounting arrangement for high frequency electro-optical components
WO2004023307A1 (en) 2002-09-06 2004-03-18 O2Micro, Inc. Vpn and firewall integrated system
US7680086B2 (en) * 2002-09-09 2010-03-16 Siemens Canada Limited Wireless local area network with clients having extended freedom of movement
US7245918B2 (en) * 2002-09-18 2007-07-17 Telefonaktiebolaget Lm Ericsson (Publ) Distributing shared network access information in a shared network mobile communications system
US6957067B1 (en) 2002-09-24 2005-10-18 Aruba Networks System and method for monitoring and enforcing policy within a wireless network
US7130917B2 (en) * 2002-09-26 2006-10-31 Cisco Technology, Inc. Quality of service in a gateway
US7440573B2 (en) * 2002-10-08 2008-10-21 Broadcom Corporation Enterprise wireless local area network switching system
US7369859B2 (en) 2003-10-17 2008-05-06 Kineto Wireless, Inc. Method and system for determining the location of an unlicensed mobile access subscriber
US7062566B2 (en) 2002-10-24 2006-06-13 3Com Corporation System and method for using virtual local area network tags with a virtual private network
US7421248B1 (en) 2002-11-12 2008-09-02 Cisco Technology, Inc. Method and apparatus for adjusting operational parameter of a wireless device bases upon a monitored characteristic
US20040203752A1 (en) 2002-11-18 2004-10-14 Toshiba America Information Systems, Inc. Mobility communications system
US8139551B2 (en) 2002-11-19 2012-03-20 Toshiba America Research, Inc. Quality of service (QoS) assurance system using data transmission control
CA2520494A1 (en) 2003-04-17 2004-11-04 Cisco Technology, Inc. 802.11 using a compressed reassociation exchange to facilitate fast handoff
US7020438B2 (en) * 2003-01-09 2006-03-28 Nokia Corporation Selection of access point in a wireless communication system
US7295960B2 (en) 2003-01-22 2007-11-13 Wireless Valley Communications, Inc. System and method for automated placement or configuration of equipment for obtaining desired network performance objectives
US7266089B2 (en) 2003-02-21 2007-09-04 Qwest Communications International Inc. Systems and methods for creating a wireless network
WO2004077724A3 (en) 2003-02-24 2005-09-22 Autocell Lab Inc System and method for channel selection in a wireless network
US20040208570A1 (en) 2003-04-18 2004-10-21 Reader Scot A. Wavelength-oriented virtual networks
US7359676B2 (en) * 2003-04-21 2008-04-15 Airdefense, Inc. Systems and methods for adaptively scanning for wireless communications
US20040259555A1 (en) 2003-04-23 2004-12-23 Rappaport Theodore S. System and method for predicting network performance and position location using multiple table lookups
WO2004097584A3 (en) 2003-04-28 2005-04-07 P G I Solutions Llc Method and system for remote network security management
US7849217B2 (en) 2003-04-30 2010-12-07 Cisco Technology, Inc. Mobile ethernet
US6925378B2 (en) 2003-05-12 2005-08-02 Circumnav Networks, Inc. Enhanced mobile communication device with extended radio, and applications
US8108916B2 (en) 2003-05-21 2012-01-31 Wayport, Inc. User fraud detection and prevention of access to a distributed network communication system
EP1482686A3 (en) * 2003-05-28 2005-01-26 Broadcom Corporation Extending the mobility of a wireless headset by using access points of a wireless local area network (WLAN)
US7257107B2 (en) * 2003-07-15 2007-08-14 Highwall Technologies, Llc Device and method for detecting unauthorized, “rogue” wireless LAN access points
JP4211529B2 (en) 2003-08-06 2009-01-21 日本電気株式会社 Channel selection method and a radio station and a program used therewith
WO2005024598A3 (en) * 2003-09-09 2006-02-16 Oto Software Inc Method and system for securing and monitoring a wireless network
US7324468B2 (en) * 2003-09-10 2008-01-29 Broadcom Corporation System and method for medium access control in a power-save network
US20050073980A1 (en) * 2003-09-17 2005-04-07 Trapeze Networks, Inc. Wireless LAN management
US20050059406A1 (en) * 2003-09-17 2005-03-17 Trapeze Networks, Inc. Wireless LAN measurement feedback
US20050059405A1 (en) * 2003-09-17 2005-03-17 Trapeze Networks, Inc. Simulation driven wireless LAN planning
US7221946B2 (en) * 2003-09-22 2007-05-22 Broadcom Corporation Automatic quality of service based resource allocation
US7110756B2 (en) 2003-10-03 2006-09-19 Cognio, Inc. Automated real-time site survey in a shared frequency band environment
US20050157730A1 (en) 2003-10-31 2005-07-21 Grant Robert H. Configuration management for transparent gateways in heterogeneous storage networks
US20050223111A1 (en) 2003-11-04 2005-10-06 Nehru Bhandaru Secure, standards-based communications across a wide-area network
US9131272B2 (en) 2003-11-04 2015-09-08 Universal Electronics Inc. System and method for saving and recalling state data for media and home appliances
US20050122977A1 (en) 2003-12-05 2005-06-09 Microsoft Corporation Efficient download mechanism for devices with limited local storage
US7002943B2 (en) 2003-12-08 2006-02-21 Airtight Networks, Inc. Method and system for monitoring a selected region of an airspace associated with local area networks of computing devices
US7466678B2 (en) 2003-12-29 2008-12-16 Lenovo (Singapore) Pte. Ltd. System and method for passive scanning of authorized wireless channels
US7221927B2 (en) 2004-02-13 2007-05-22 Trapeze Networks, Inc. Station mobility between access points
US7489648B2 (en) * 2004-03-11 2009-02-10 Cisco Technology, Inc. Optimizing 802.11 power-save for VLAN
US20050245269A1 (en) 2004-04-30 2005-11-03 Intel Corporation Channel scanning in wireless networks
US7376080B1 (en) 2004-05-11 2008-05-20 Packeteer, Inc. Packet load shedding
US20060045050A1 (en) * 2004-08-27 2006-03-02 Andreas Floros Method and system for a quality of service mechanism for a wireless network
US7317914B2 (en) * 2004-09-24 2008-01-08 Microsoft Corporation Collaboratively locating disconnected clients and rogue access points in a wireless network
US20060104224A1 (en) 2004-10-13 2006-05-18 Gurminder Singh Wireless access point with fingerprint authentication
US7224970B2 (en) 2004-10-26 2007-05-29 Motorola, Inc. Method of scanning for beacon transmissions in a WLAN
JP4433400B2 (en) 2004-12-09 2010-03-17 レノボ シンガポール プライヴェート リミテッド Wireless network communication card, device incorporating the card, a method of detecting a wireless access point for devices that support wireless network communications, and wireless network communications
US7725938B2 (en) 2005-01-20 2010-05-25 Cisco Technology, Inc. Inline intrusion detection
US7630713B2 (en) 2005-02-18 2009-12-08 Lenovo (Singapore) Pte Ltd. Apparatus, system, and method for rapid wireless network association
US7370362B2 (en) 2005-03-03 2008-05-06 Cisco Technology, Inc. Method and apparatus for locating rogue access point switch ports in a wireless network
DE112006000618T5 (en) 2005-03-15 2008-02-07 Trapeze Networks, Inc., Pleasanton System and method for distributing keys in a wireless network
US20060245393A1 (en) 2005-04-27 2006-11-02 Symbol Technologies, Inc. Method, system and apparatus for layer 3 roaming in wireless local area networks (WLANs)
WO2006125085A3 (en) 2005-05-18 2008-10-30 Telcordia Tech Inc Seamless handoff across heterogeneous access networks using a handoff controller in a service control point
US7724717B2 (en) * 2005-07-22 2010-05-25 Sri International Method and apparatus for wireless network security
US7561599B2 (en) * 2005-09-19 2009-07-14 Motorola, Inc. Method of reliable multicasting
US20070070937A1 (en) * 2005-09-28 2007-03-29 Mustafa Demirhan Multi-radio mesh network channel selection and load balancing
US20070083924A1 (en) * 2005-10-08 2007-04-12 Lu Hongqian K System and method for multi-stage packet filtering on a networked-enabled device
US7551619B2 (en) 2005-10-13 2009-06-23 Trapeze Networks, Inc. Identity-based networking
US7724703B2 (en) * 2005-10-13 2010-05-25 Belden, Inc. System and method for wireless network monitoring
US7573859B2 (en) 2005-10-13 2009-08-11 Trapeze Networks, Inc. System and method for remote monitoring in a wireless network
US7688755B2 (en) * 2005-10-25 2010-03-30 Motorola, Inc. Method and apparatus for group leader selection in wireless multicast service
US20070260720A1 (en) 2006-05-03 2007-11-08 Morain Gary E Mobility domain
US7577453B2 (en) 2006-06-01 2009-08-18 Trapeze Networks, Inc. Wireless load balancing across bands
US7912982B2 (en) 2006-06-09 2011-03-22 Trapeze Networks, Inc. Wireless routing selection system and method
US9191799B2 (en) 2006-06-09 2015-11-17 Juniper Networks, Inc. Sharing data between wireless switches system and method
US20080002588A1 (en) * 2006-06-30 2008-01-03 Mccaughan Sherry L Method and apparatus for routing data packets in a global IP network
US8229455B2 (en) * 2006-07-07 2012-07-24 Skyhook Wireless, Inc. System and method of gathering and caching WLAN packet information to improve position estimates of a WLAN positioning device
US7724704B2 (en) * 2006-07-17 2010-05-25 Beiden Inc. Wireless VLAN system and method
US7813744B2 (en) * 2006-08-31 2010-10-12 Polycom, Inc. Method for determining DFS channel availability in a wireless LAN
KR100758354B1 (en) * 2006-09-01 2007-09-14 삼성전자주식회사 Method for scanning access points during station's handoff procedure in wireless communication system and station of performing the method, and network interface of supporting the method and wireless communication system of enabling the method
US8072952B2 (en) 2006-10-16 2011-12-06 Juniper Networks, Inc. Load balancing
US20080107077A1 (en) 2006-11-03 2008-05-08 James Murphy Subnet mobility supporting wireless handoff
US20080151844A1 (en) 2006-12-20 2008-06-26 Manish Tiwari Wireless access point authentication system and method
US7865713B2 (en) 2006-12-28 2011-01-04 Trapeze Networks, Inc. Application-aware wireless network system and method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6545979B1 (en) * 1998-11-27 2003-04-08 Alcatel Canada Inc. Round trip delay measurement
US20050286426A1 (en) * 2004-06-23 2005-12-29 Microsoft Corporation System and method for link quality routing using a weighted cumulative expected transmission time metric
US20080153458A1 (en) * 2005-05-31 2008-06-26 Noldus Rogier August Caspar Jo Method and System for Delivering Advice of Charge in a Communications System
US20070140114A1 (en) * 2005-12-20 2007-06-21 Mosko Marc E Method and apparatus for multi-path load balancing using multiple metrics

Cited By (45)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8161278B2 (en) 2005-03-15 2012-04-17 Trapeze Networks, Inc. System and method for distributing keys in a wireless network
US8635444B2 (en) 2005-03-15 2014-01-21 Trapeze Networks, Inc. System and method for distributing keys in a wireless network
US8457031B2 (en) 2005-10-13 2013-06-04 Trapeze Networks, Inc. System and method for reliable multicast
US8638762B2 (en) 2005-10-13 2014-01-28 Trapeze Networks, Inc. System and method for network integrity
US8116275B2 (en) 2005-10-13 2012-02-14 Trapeze Networks, Inc. System and network for wireless network monitoring
US8514827B2 (en) 2005-10-13 2013-08-20 Trapeze Networks, Inc. System and network for wireless network monitoring
US8218449B2 (en) 2005-10-13 2012-07-10 Trapeze Networks, Inc. System and method for remote monitoring in a wireless network
US8964747B2 (en) 2006-05-03 2015-02-24 Trapeze Networks, Inc. System and method for restricting network access using forwarding databases
US8966018B2 (en) 2006-05-19 2015-02-24 Trapeze Networks, Inc. Automated network device configuration and network deployment
US8818322B2 (en) 2006-06-09 2014-08-26 Trapeze Networks, Inc. Untethered access point mesh system and method
US9258702B2 (en) 2006-06-09 2016-02-09 Trapeze Networks, Inc. AP-local dynamic switching
US9191799B2 (en) 2006-06-09 2015-11-17 Juniper Networks, Inc. Sharing data between wireless switches system and method
US9838942B2 (en) 2006-06-09 2017-12-05 Trapeze Networks, Inc. AP-local dynamic switching
US8340110B2 (en) 2006-09-15 2012-12-25 Trapeze Networks, Inc. Quality of service provisioning for wireless networks
US8670383B2 (en) 2006-12-28 2014-03-11 Trapeze Networks, Inc. System and method for aggregation and queuing in a wireless network
US8902904B2 (en) 2007-09-07 2014-12-02 Trapeze Networks, Inc. Network assignment based on priority
US8238942B2 (en) 2007-11-21 2012-08-07 Trapeze Networks, Inc. Wireless station location detection
US8150357B2 (en) 2008-03-28 2012-04-03 Trapeze Networks, Inc. Smoothing filter for irregular update intervals
US8978105B2 (en) 2008-07-25 2015-03-10 Trapeze Networks, Inc. Affirming network relationships and resource access via related networks
US8238298B2 (en) 2008-08-29 2012-08-07 Trapeze Networks, Inc. Picking an optimal channel for an access point in a wireless network
US9686194B2 (en) 2009-10-21 2017-06-20 Cisco Technology, Inc. Adaptive multi-interface use for content networking
US20150208316A1 (en) * 2014-01-22 2015-07-23 Palo Alto Research Center Incorporated Gateways and routing in software-defined manets
US9836540B2 (en) 2014-03-04 2017-12-05 Cisco Technology, Inc. System and method for direct storage access in a content-centric network
US9626413B2 (en) 2014-03-10 2017-04-18 Cisco Systems, Inc. System and method for ranking content popularity in a content-centric network
US9716622B2 (en) 2014-04-01 2017-07-25 Cisco Technology, Inc. System and method for dynamic name configuration in content-centric networks
US9473576B2 (en) 2014-04-07 2016-10-18 Palo Alto Research Center Incorporated Service discovery using collection synchronization with exact names
US9609014B2 (en) 2014-05-22 2017-03-28 Cisco Systems, Inc. Method and apparatus for preventing insertion of malicious content at a named data network router
US9699198B2 (en) 2014-07-07 2017-07-04 Cisco Technology, Inc. System and method for parallel secure content bootstrapping in content-centric networks
US9621354B2 (en) 2014-07-17 2017-04-11 Cisco Systems, Inc. Reconstructable content objects
US9590887B2 (en) 2014-07-18 2017-03-07 Cisco Systems, Inc. Method and system for keeping interest alive in a content centric network
US9729616B2 (en) 2014-07-18 2017-08-08 Cisco Technology, Inc. Reputation-based strategy for forwarding and responding to interests over a content centric network
US9929935B2 (en) 2014-07-18 2018-03-27 Cisco Technology, Inc. Method and system for keeping interest alive in a content centric network
US9882964B2 (en) 2014-08-08 2018-01-30 Cisco Technology, Inc. Explicit strategy feedback in name-based forwarding
US9729662B2 (en) 2014-08-11 2017-08-08 Cisco Technology, Inc. Probabilistic lazy-forwarding technique without validation in a content centric network
US9800637B2 (en) 2014-08-19 2017-10-24 Cisco Technology, Inc. System and method for all-in-one content stream in content-centric networks
US9590948B2 (en) 2014-12-15 2017-03-07 Cisco Systems, Inc. CCN routing using hardware-assisted hash tables
US9660825B2 (en) 2014-12-24 2017-05-23 Cisco Technology, Inc. System and method for multi-source multicasting in content-centric networks
US9916457B2 (en) 2015-01-12 2018-03-13 Cisco Technology, Inc. Decoupled name security binding for CCN objects
US9832291B2 (en) 2015-01-12 2017-11-28 Cisco Technology, Inc. Auto-configurable transport stack
US9832123B2 (en) 2015-09-11 2017-11-28 Cisco Technology, Inc. Network named fragments in a content centric network
US9794238B2 (en) 2015-10-29 2017-10-17 Cisco Technology, Inc. System for key exchange in a content centric network
US9807205B2 (en) 2015-11-02 2017-10-31 Cisco Technology, Inc. Header compression for CCN messages using dictionary
US9912776B2 (en) 2015-12-02 2018-03-06 Cisco Technology, Inc. Explicit content deletion commands in a content centric network
US9832116B2 (en) 2016-03-14 2017-11-28 Cisco Technology, Inc. Adjusting entries in a forwarding information base in a content centric network
US9930146B2 (en) 2016-04-04 2018-03-27 Cisco Technology, Inc. System and method for compressing content centric networking messages

Also Published As

Publication number Publication date Type
US7912982B2 (en) 2011-03-22 grant
US20080117822A1 (en) 2008-05-22 application

Similar Documents

Publication Publication Date Title
Lim et al. TCP performance over multipath routing in mobile ad hoc networks
Zhong et al. On the efficacy of opportunistic routing
Biswas et al. Opportunistic routing in multi-hop wireless networks
Li et al. Minimizing end-to-end delay: A novel routing metric for multi-radio wireless mesh networks
US7002949B2 (en) Bandwidth efficient source tracing (BEST) routing protocol for wireless networks
US8243603B2 (en) Method and system for improving a wireless communication route
Draves et al. Comparison of routing metrics for static multi-hop wireless networks
US8233905B2 (en) Load management in wireless mesh communications networks
US6922390B1 (en) Method and apparatus for forecasting and controlling congestion in a data transport network
US20090003232A1 (en) Route and link evaluation in wireless mesh communications networks
US20090003356A1 (en) Node discovery and culling in wireless mesh communications networks
Baumann et al. A survey on routing metrics
Rozner et al. SOAR: Simple opportunistic adaptive routing protocol for wireless mesh networks
US20070140129A1 (en) Ad-hoc network routing metric optimization
US20020191573A1 (en) Embedded routing algorithms under the internet protocol routing layer of a software architecture protocol stack in a mobile Ad-Hoc network
US20090116393A1 (en) Multi-metric routing calculations
US20060029074A2 (en) ENHANCED MULTICASE FORWARDING CACHE (eMFC)
Fu et al. The impact of multihop wireless channel on TCP performance
US20120307629A1 (en) Source routing convergence in constrained computer networks
US20070286097A1 (en) Network Architecture
US20050249215A1 (en) Directing packets in a mesh network
Chachulski et al. Trading structure for randomness in wireless opportunistic routing
US20110063979A1 (en) Network traffic management
US20100165846A1 (en) Replay transmission device and replay transmission method
US20140204759A1 (en) Load Balanced Routing for Low Power and Lossy Networks

Legal Events

Date Code Title Description
AS Assignment

Owner name: BELDEN INC., MISSOURI

Free format text: MERGER;ASSIGNOR:TRAPEZE NETWORKS, INC.;REEL/FRAME:027367/0456

Effective date: 20091221

Owner name: TRAPEZE NETWORKS, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BELDEN INC.;REEL/FRAME:027367/0021

Effective date: 20101108

Owner name: TRAPEZE NETWORKS, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MURPHY, JAMES;MORAIN, GARY;REEL/FRAME:027368/0304

Effective date: 20061122