US20030214938A1 - Method for routing of label switched paths (LSPS) through an internet supporting multi-protocol label switching (MPLS) technology - Google Patents
Method for routing of label switched paths (LSPS) through an internet supporting multi-protocol label switching (MPLS) technology Download PDFInfo
- Publication number
- US20030214938A1 US20030214938A1 US10/388,765 US38876503A US2003214938A1 US 20030214938 A1 US20030214938 A1 US 20030214938A1 US 38876503 A US38876503 A US 38876503A US 2003214938 A1 US2003214938 A1 US 2003214938A1
- Authority
- US
- United States
- Prior art keywords
- ingress
- egress
- link
- path
- pair
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
Definitions
- the invention relates to a method for routing of Label Switched Paths (LSPS) through an internet supporting Multi-Protocol Label Switching (MPLS) technology.
- LSPS Label Switched Paths
- MPLS Multi-Protocol Label Switching
- MMAFRA Maximum Minimum Additional Flow Routing Algorithm
- the Internet has evolved to a stage where it is expected to support transfer of not only elastic traffic but also real-time traffic with delay, jitter and loss guarantees. In this scenario where guarantees must be provided, there is a need to reserve network resources before information transfer begins, so that packets of information generated by real-time applications receive adequate service from the network.
- Network resources like bandwidth and butter space are reserved along an end-to-end path, called a Virtual Path, connecting the source and destination through the network.
- MPLS Multi-Protocol Label Switching
- LSPs Label Switched Paths
- FIG. 1 which in the accompanying illustration is an example backbone network showing ingress and egress routers.
- Some of the routers behave as ingress points (or “sources” S) for traffic into the backbone, while some behave as egress points (or “destinations” D). It is possible for the same router to behave as both ingress and egress.
- the natural granularity for measuring traffic is aggregate flows and not individual session micro-flows.
- the need is to route aggregate flows between ingress and egress points, and the route assigned to an aggregate flow is referred to as a Label Switched Path.
- the bandwidth demand of an aggregate flow in the backbone is obtained from the bandwidth demands of numerous non-persistent session micro-flows between individual sources and destinations.
- the inventors also use the term “traffic request” to mean an aggregate flow.
- Arriving traffic requests specify a source-destination pair and the amount of bandwidth needed.
- routing it is necessary to find a path through the network that has sufficient capacity—this is referred to as “routing”. It is also usually necessary to route the entire flow along a single path; in other words, a flow cannot be split among several paths. In case a path of appropriate capacity cannot be found, the arriving request has to be denied service or “rejected”. It is the goal of any routing algorithm to reject as few requests as possible.
- the “residual capacity” of a link is defined to be the difference between the capacity of the link and the sum of the bandwidth demands of Lisps that have already been routed through that link.
- a new LSP can be routed along a link only if the residual capacity of the link exceeds the bandwidth requested by the new LSP.
- Such links are called “feasible” with respect to the given LSP demand.
- SWP Shortest Widest Path
- WSP routing [3].
- This algorithm is a refinement of the MH algorithm. It obtains a set of paths from ingress to egress with the least number of feasible links. When several such paths exist, it chooses one with the largest residual capacity. WSP routing performs better than SWP routing, but it is itself outperformed by another algorithm (MIRA, see below) proposed in the literature.
- Least Loaded Routing [4].
- the least utilized feasible path from a set of candidates is chosen to route the new request.
- the scheme attempts to distribute load among the candidate routes.
- a drawback of this algorithm is “fragmentation”, where some capacity remains unutilized on many paths, leading to inefficient use of network resources.
- MIR Minimum Interference Routing Algorithm
- a drawback of this algorithm is that it is computationally expensive, because min-cuts for different ingress-egress pairs must be obtained. Also, it can be shown that MIRA will not perform well for Ring topologies, because it can choose the longer path (of the two possible in a Ring topology) between an ingress and an egress.
- PBR Profile-based Routing
- the inventors' formulation of the routing problem is more direct.
- the arrived request for (S,D)1 must be routed along a single (unsplit) path in such a way that
- the arrived request for (S,D)1 must be routed along a single (unsplit) path in such a way that the minimum unsplit flow between all other ingress-egress pairs is maximised; here, all other ingress-egress pairs have traffic flowing simultaneously.
- MMAFRA Maximum Minimum Additional Flow Routing Algorithm
- the algorithm has two phases: Off-Line and On-Line. It can be summarised as follows:
- the on-line phase begins with the arrival of a bandwidth demand for the ingress-egress pair j with a bandwidth demand of D (say). Then:
- FIG. 3 shows the comparison of three routing algorithms.
- Three routing algorithms compared are: Min-Hop, MIRA and MMAFRA.
- the metric used is the “fraction of arriving LSP requests that are rejected”.
- the example network is taken from the paper where MIRA was proposed. Even for this network, MAFRA performs better.
- this is a polynomial0time algorithm since it relies on the Dijkstra algorithm whose worst-case running time is known to be a polynomial function of the size of the network.
Abstract
The Internet has evolved to a stage where it is expected to support transfer of not only elastic traffic but also real-time traffic with delay, jitter and loss guarantees. Upon the arrival of a request it is necessary to find a path through the network that has sufficient capacity—this is referred to as ‘routing’. It is essential to set up Virtual Paths through a network of routers. Such Virtual Paths are called Label switched Paths (LPs) in MPLS terminology. The arrived request for ingress-egress pair (S,D)1 must be routed along a single (unsplit) path in such a way that the minimum unsplit flow between all other ingress-egress pairs is maximized; here all other ingress-egress pairs have traffic flowing simultaneously. Thus explaining the name Maximum Minimum Additional Flow Routing Algorithm (MMAFRA).
MMAFRA has 2 phases:
1. Off Line Phase
a) Enumerate all paths for all ingress-egress pairs.
b) For each pair obtain the set of links utilized by one or more paths by that pair. This set is called the ‘link set’ for that pair.
c) For each link, obtain its ‘weight’ as the number of all ingress-egress pairs whose link sets contain that link.
2. On Line Phase
It begins with the arrival of a bandwidth demand for the ingress-egress pair (j) with a bandwidth demand of D (say). Then
a) Eliminate all links, which have residual capacities less than D units and obtain a reduced network.
b) Update the weight of each link in the reduced network by considering the residual capacity of the link; the weight should increase as the residual capacity decreases.
c) Use the updated weights and apply Dijkstra's algorithm to compute the least—weight path for the ingress-egress pair (j).
d) The route for the LSP request is given by the least-weight path above. Finally, the residual capacities of links in the least-weight path are also up-dated.
Description
- Not Applicable
- Not Applicable
- Not Applicable
- The invention relates to a method for routing of Label Switched Paths (LSPS) through an internet supporting Multi-Protocol Label Switching (MPLS) technology.
- Maximum Minimum Additional Flow Routing Algorithm (MMAFRA).
- The Internet has evolved to a stage where it is expected to support transfer of not only elastic traffic but also real-time traffic with delay, jitter and loss guarantees. In this scenario where guarantees must be provided, there is a need to reserve network resources before information transfer begins, so that packets of information generated by real-time applications receive adequate service from the network. Network resources like bandwidth and butter space are reserved along an end-to-end path, called a Virtual Path, connecting the source and destination through the network. Although the concepts of Virtual Paths and Virtual Circuits have been known for some time, the arrival of Multi-Protocol Label Switching (MPLS) technology has revived interest in techniques for setting up Virtual Paths through a network of routers. These Virtual Paths are called Label Switched Paths (LSPs) in MPLS terminology.
- The scenario considered by the inventors is as follows: Consider a backbone network, consisting of routers and links, as shown in FIG. 1, which in the accompanying illustration is an example backbone network showing ingress and egress routers. Some of the routers behave as ingress points (or “sources” S) for traffic into the backbone, while some behave as egress points (or “destinations” D). It is possible for the same router to behave as both ingress and egress.
- For the problem of routing traffic in a backbone network, the natural granularity for measuring traffic is aggregate flows and not individual session micro-flows. The need is to route aggregate flows between ingress and egress points, and the route assigned to an aggregate flow is referred to as a Label Switched Path. The bandwidth demand of an aggregate flow in the backbone is obtained from the bandwidth demands of numerous non-persistent session micro-flows between individual sources and destinations. Henceforth, the inventors also use the term “traffic request” to mean an aggregate flow.
- Arriving traffic requests specify a source-destination pair and the amount of bandwidth needed. Upon the arrival of a request, it is necessary to find a path through the network that has sufficient capacity—this is referred to as “routing”. It is also usually necessary to route the entire flow along a single path; in other words, a flow cannot be split among several paths. In case a path of appropriate capacity cannot be found, the arriving request has to be denied service or “rejected”. It is the goal of any routing algorithm to reject as few requests as possible.
- A variety of routing algorithms have been proposed and some have been widely implemented. The “Minimum Hop” (MH) routing algorithm is well-known. However, there are situations where the MH algorithm is inadequate; an example is given in FIG. 2, which in the accompanying illustration is an example network where Min-Hop Routing does not perform well.
- In this example, suppose that all links are of capacity C units. If a request of bandwidth C units for (S3, D3) arrives, then the MH algorithm would route the request on the path S3-R1-R2-D3, since that path has the minimum number of hops (3). However, this means that future requests for (S1, D1) or (S2, D2) have to be rejected, because the bottleneck link between R1 and R2 has no spare capacity left. So in this network it may be better to route the initial request for (S3, D3) on the path S3-R3-R4-R5-D3, even though there are 4 hops on this path. This example shows that simple algorithms may not be sufficient. Algorithms that take network topology information and location of sources and destinations into account may be needed in order to reduce the chances of rejecting LSP requests.
- In the following, the inventors discuss several MPLS routing algorithms that have appeared in the literature. The inventors have considered only “greedy” algorithms, that is, algorithms that accept LSP requests whenever possible. In general, a routing algorithm may reject an LSP request even when it is possible to admit it, because the revenue obtained by accepting the LSP request is small. The motivation is that the algorithm would rather not accept a low-revenue LSP request to conserve resources for a high-revenue LSP request that may arrive in the future. This type of method must be provided a “revenue table” giving the revenues obtainable by accepting different LSP requests. In this work, however, the inventors do not consider revenues explicitly, restricting their attention to greedy methods only.
- The “residual capacity” of a link is defined to be the difference between the capacity of the link and the sum of the bandwidth demands of Lisps that have already been routed through that link. A new LSP can be routed along a link only if the residual capacity of the link exceeds the bandwidth requested by the new LSP. Such links are called “feasible” with respect to the given LSP demand. When computing routes, it is enough to consider feasible links only.
- 1. Minimum Hop (MH) routing [1]. In this algorithm, a path from the ingress to the egress with the least number of feasible links is chosen. As has been seen, this simple algorithm can lead to congestion on certain links and thereby increased LSP rejection ratios.
- 2. Shortest Widest Path (SWP) routing [2]. This algorithm finds paths from the ingress to the egress with the largest residual capacity (“widest” paths). The width of a path is given by the residual capacity of the link with the least residual capacity, i.e, the “bottleneck” link. When several such paths exist, it chooses one with the least number of feasible links. Studies have shown that the SWP algorithm can often choose long paths and thereby consume large amounts of network resources. This leaves less resources for future LSP requests and thereby increases chances of rejection.
- 3. Widest Shortest Path (WSP) routing [3]. This algorithm is a refinement of the MH algorithm. It obtains a set of paths from ingress to egress with the least number of feasible links. When several such paths exist, it chooses one with the largest residual capacity. WSP routing performs better than SWP routing, but it is itself outperformed by another algorithm (MIRA, see below) proposed in the literature.
- 4. Least Loaded Routing (LLR) [4]. In this algorithm, the least utilized feasible path from a set of candidates is chosen to route the new request. The scheme attempts to distribute load among the candidate routes. A drawback of this algorithm is “fragmentation”, where some capacity remains unutilized on many paths, leading to inefficient use of network resources.
- 5. Maximally Loaded Routing (MLR) [5]. This algorithm is motivated by the need to avoid fragmentation in LLR. It is based on the opposite idea, viz., “packing” of requests wherever possible on paths in the candidate set. Therefore, the most heavily utilized feasible path from the candidate set is chosen. The performance of this algorithm can depend on the choice of the set of candidate routes. If the set is large, then it is possible that an admitted request will consume unnecessarily more network resources because it is routed on a longer path.
- 6. Minimum Interference Routing Algorithm (MIR) [6]. This recently proposed algorithm takes explicit note of the locations of ingress-egress pairs and the topology of the network. The basic idea is to route a request along a path that causes least “interference” to the next request for some other ingress-egress pair. This is done by identifying a set of “critical” links, where a link is defined to be critical for an ingress-egress pair if it belongs to any min-cut for that ingress-egress pair. In the simplest case, the weight of a critical link is obtained by counting the number of ingress-egress pairs for which that link is critical. After obtaining the critical links, the algorithm chooses a feasible path with the least weight. A drawback of this algorithm is that it is computationally expensive, because min-cuts for different ingress-egress pairs must be obtained. Also, it can be shown that MIRA will not perform well for Ring topologies, because it can choose the longer path (of the two possible in a Ring topology) between an ingress and an egress.
- 7. Profile-based Routing (PBR) [7]. This algorithm is based on the belief that “yesterday's traffic between an ingress-egress pair can serve as a good predictor for today's traffic” particularly in light of the fact that service providers aggregate a large number of flows. The predicted amounts of each class of traffic is called a “profile” of that traffic class. The basic idea is to reserve a fraction of the capacity of each link for each class of traffic, the fraction being calculated on the basis of the profiles. Thus, capacities of links are pre-allocated to different classes, and an arriving request of a given class can only utilise bandwidth that has been earmarked for that class. Since this algorithm relies on pre-allocated capacities, its performance will degrade when there is an unpredictable change in the overall traffic pattern.
- Proposed Solution: The proposed algorithm is motivated by the MIRA algorithm above, but it addresses the shortcomings of MIRA. In MIRA, the “interference” caused by a particular route for an ingress-egress pair (S,D)1 is measured by the reduction in maxflow values between all other ingress-egress pairs. However, the maxflow concept considers all possible paths from an ingress to an egress; so the usual constraint of unsplittable flows is not respected. Thus, the reduction of maxflow values for other ingress-egress pairs is an indirect way of measuring the interference caused by a chosen route for (S,D)1.
- The inventors' formulation of the routing problem is more direct. The arrived request for (S,D)1 must be routed along a single (unsplit) path in such a way that
- (a) all other ingress-egress pairs can simultaneously have unsplit flows of at least x units between them,
- (b) the value of x is maximised.
- This can also be stated as: the arrived request for (S,D)1 must be routed along a single (unsplit) path in such a way that the minimum unsplit flow between all other ingress-egress pairs is maximised; here, all other ingress-egress pairs have traffic flowing simultaneously. This also explains the name Maximum Minimum Additional Flow Routing Algorithm (MMAFRA). The problem formulation leads to a constrained non-linear integer program which, however, is hard to solve efficiently as it belongs to the class of problems that are NP-Hard. Therefore, the inventors resort to a heuristic algorithm which provides very good performance and outperforms MIRA.
- The algorithm has two phases: Off-Line and On-Line. It can be summarised as follows:
- Off-Line Phase
- 1. Enumerate all paths for all ingress-egress pairs.
- 2. For each pair, obtain the set of links utilised by one or more paths for that pair. This set is called the “link set” for that pair.
- 3. For each link, obtain its “weight” as the number of all ingress-egress pairs whose link sets contain this link.
- On-Line Phase
- The on-line phase begins with the arrival of a bandwidth demand for the ingress-egress pair j with a bandwidth demand of D (say). Then:
- 1. Eliminate all links which have residual capacities less than D units and obtain a reduced network.
- 2. Update the weight of each link in the reduced network by considering the residual capacity of the link; the weight should increase as the residual capacity decreases.
- 3. Use the updated weights and apply Dijkstra's algorithm to complete the least-weight path for the ingress-egress pair j.
- 4. The route for the LSP request is given by the least-weight path above. Finally, the residual capacities of links in the least-weight path are also updated.
- Simulation studies of the algorithm on a variety of networks indicate that its performance is better than that of existing algorithms available in the literature. An example is given in FIG. 3, which in the accompanying illustration shows the comparison of three routing algorithms. Three routing algorithms compared are: Min-Hop, MIRA and MMAFRA. The metric used is the “fraction of arriving LSP requests that are rejected”. The example network is taken from the paper where MIRA was proposed. Even for this network, MAFRA performs better. Secondly, as far as computational speed is concrned, this is a polynomial0time algorithm since it relies on the Dijkstra algorithm whose worst-case running time is known to be a polynomial function of the size of the network.
Claims (2)
1) A routing method that routes an arrived bandwidth-demand in an unsplit way so as to explicitly maximise the smallest unsplit flow that can be routed in future between all other ingress-egress pairs simultaneously.
2) The routing method of claim 1 further including a method of assigning weights to links for efficient implementation of method in claim 1.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
IN273DE2002 | 2002-03-21 | ||
IN273/DEL/2002 | 2002-03-21 |
Publications (1)
Publication Number | Publication Date |
---|---|
US20030214938A1 true US20030214938A1 (en) | 2003-11-20 |
Family
ID=29415965
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/388,765 Abandoned US20030214938A1 (en) | 2002-03-21 | 2003-03-17 | Method for routing of label switched paths (LSPS) through an internet supporting multi-protocol label switching (MPLS) technology |
Country Status (1)
Country | Link |
---|---|
US (1) | US20030214938A1 (en) |
Cited By (33)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2005032064A1 (en) * | 2003-09-30 | 2005-04-07 | Siemens Aktiengesellschaft | A call routing method |
US20070237160A1 (en) * | 2006-03-30 | 2007-10-11 | Narayanan Natarajan | Dynamic traffic rearrangement to enforce policy changes in MPLS networks |
US7313629B1 (en) * | 2003-11-06 | 2007-12-25 | Sprint Communications Company L.P. | Method for altering link weights in a communication network within network parameters to provide traffic information for improved forecasting |
US7353294B1 (en) * | 2003-11-06 | 2008-04-01 | Sprint Communications Company L.P. | Method for estimating a traffic matrix in a communication network using stationary data |
US7363386B1 (en) * | 2003-11-06 | 2008-04-22 | Sprint Communications Company L.P. | Method for estimating a traffic matrix in a communication network using non-stationary data |
CN100401701C (en) * | 2004-01-30 | 2008-07-09 | 富士通株式会社 | Network controlling apparatus and path controlling method therein |
US7590149B1 (en) * | 2006-11-10 | 2009-09-15 | Juniper Networks, Inc. | Load balancing with unequal routing metrics in a meshed overlay network |
WO2017082185A1 (en) * | 2015-11-13 | 2017-05-18 | 日本電信電話株式会社 | Resource allocating device and resource allocating method |
US9729439B2 (en) | 2014-09-26 | 2017-08-08 | 128 Technology, Inc. | Network packet flow controller |
US9729682B2 (en) | 2015-05-18 | 2017-08-08 | 128 Technology, Inc. | Network device and method for processing a session using a packet signature |
US9736184B2 (en) | 2015-03-17 | 2017-08-15 | 128 Technology, Inc. | Apparatus and method for using certificate data to route data |
US9762485B2 (en) | 2015-08-24 | 2017-09-12 | 128 Technology, Inc. | Network packet flow controller with extended session management |
US9832072B1 (en) | 2016-05-31 | 2017-11-28 | 128 Technology, Inc. | Self-configuring computer network router |
US9871748B2 (en) | 2015-12-09 | 2018-01-16 | 128 Technology, Inc. | Router with optimized statistical functionality |
US9985872B2 (en) | 2016-10-03 | 2018-05-29 | 128 Technology, Inc. | Router with bilateral TCP session monitoring |
US9985883B2 (en) | 2016-02-26 | 2018-05-29 | 128 Technology, Inc. | Name-based routing system and method |
US10009282B2 (en) | 2016-06-06 | 2018-06-26 | 128 Technology, Inc. | Self-protecting computer network router with queue resource manager |
US10091099B2 (en) | 2016-05-31 | 2018-10-02 | 128 Technology, Inc. | Session continuity in the presence of network address translation |
US10200264B2 (en) | 2016-05-31 | 2019-02-05 | 128 Technology, Inc. | Link status monitoring based on packet loss detection |
US10205651B2 (en) | 2016-05-13 | 2019-02-12 | 128 Technology, Inc. | Apparatus and method of selecting next hops for a session |
US10257061B2 (en) | 2016-05-31 | 2019-04-09 | 128 Technology, Inc. | Detecting source network address translation in a communication system |
US10277506B2 (en) | 2014-12-08 | 2019-04-30 | 128 Technology, Inc. | Stateful load balancing in a stateless network |
US10298616B2 (en) | 2016-05-26 | 2019-05-21 | 128 Technology, Inc. | Apparatus and method of securing network communications |
US10320654B2 (en) * | 2017-07-12 | 2019-06-11 | International Business Machines Corporation | Method for remote node discovery and communication channel validation and connection |
US10425511B2 (en) | 2017-01-30 | 2019-09-24 | 128 Technology, Inc. | Method and apparatus for managing routing disruptions in a computer network |
US10432519B2 (en) | 2017-05-26 | 2019-10-01 | 128 Technology, Inc. | Packet redirecting router |
US10637766B2 (en) * | 2015-04-27 | 2020-04-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Resource provisioning in a virtualized network |
US10833980B2 (en) | 2017-03-07 | 2020-11-10 | 128 Technology, Inc. | Router device using flow duplication |
US10841206B2 (en) | 2016-05-31 | 2020-11-17 | 128 Technology, Inc. | Flow modification including shared context |
US11075836B2 (en) | 2016-05-31 | 2021-07-27 | 128 Technology, Inc. | Reverse forwarding information base enforcement |
US11165863B1 (en) | 2017-08-04 | 2021-11-02 | 128 Technology, Inc. | Network neighborhoods for establishing communication relationships between communication interfaces in an administrative domain |
US11652739B2 (en) | 2018-02-15 | 2023-05-16 | 128 Technology, Inc. | Service related routing method and apparatus |
US11658902B2 (en) | 2020-04-23 | 2023-05-23 | Juniper Networks, Inc. | Session monitoring using metrics of session establishment |
Citations (43)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3234512A (en) * | 1961-03-09 | 1966-02-08 | Monroe Int | Keying method and apparatus |
US3478220A (en) * | 1966-05-11 | 1969-11-11 | Us Navy | Electro-optic cursor manipulator with associated logic circuitry |
US4103252A (en) * | 1976-11-26 | 1978-07-25 | Xerox Corporation | Capacitive touch-activated transducer system including a plurality of oscillators |
US4110749A (en) * | 1977-05-06 | 1978-08-29 | Tektronix, Inc. | Touch display to digital encoding system |
US4177421A (en) * | 1978-02-27 | 1979-12-04 | Xerox Corporation | Capacitive transducer |
US4246452A (en) * | 1979-01-05 | 1981-01-20 | Mattel, Inc. | Switch apparatus |
US4386346A (en) * | 1981-03-27 | 1983-05-31 | International Business Machines Corporation | Cursor controller |
US4550221A (en) * | 1983-10-07 | 1985-10-29 | Scott Mabusth | Touch sensitive control device |
US4595913A (en) * | 1983-02-10 | 1986-06-17 | Pie Associates | Capacitor touch activated switching system |
US4736191A (en) * | 1985-08-02 | 1988-04-05 | Karl E. Matzke | Touch activated control method and apparatus |
US4777328A (en) * | 1987-05-13 | 1988-10-11 | Elographics, Inc. | Circular electrographic touch sensor with orthogonal fields and linear response |
US4951036A (en) * | 1988-08-04 | 1990-08-21 | The Grass Valley Group, Inc. | Touchpad jogger |
US5159159A (en) * | 1990-12-07 | 1992-10-27 | Asher David J | Touch sensor and controller |
US5305017A (en) * | 1989-08-16 | 1994-04-19 | Gerpheide George E | Methods and apparatus for data input |
US5453761A (en) * | 1990-06-18 | 1995-09-26 | Sony Corporation | Information processing apparatus |
US5518078A (en) * | 1991-11-08 | 1996-05-21 | Sharp Kabushiki Kaisha | Coordinates input device |
US5543591A (en) * | 1992-06-08 | 1996-08-06 | Synaptics, Incorporated | Object position detector with edge motion feature and gesture recognition |
US5565658A (en) * | 1992-07-13 | 1996-10-15 | Cirque Corporation | Capacitance-based proximity with interference rejection apparatus and methods |
US5736865A (en) * | 1996-09-16 | 1998-04-07 | Delco Electronics Corporation | Capacitive rotary position encoder |
US5748185A (en) * | 1996-07-03 | 1998-05-05 | Stratos Product Development Group | Touchpad with scroll and pan regions |
US5844506A (en) * | 1994-04-05 | 1998-12-01 | Binstead; Ronald Peter | Multiple input proximity detector and touchpad system |
US5861875A (en) * | 1992-07-13 | 1999-01-19 | Cirque Corporation | Methods and apparatus for data input |
US5907472A (en) * | 1994-10-07 | 1999-05-25 | Maxwell Laboratories, Inc. | Multi-electrode double layer capacitor having single electrolyte seal and aluminum-impregnated carbon cloth electrodes |
US5914465A (en) * | 1992-06-08 | 1999-06-22 | Synaptics, Inc. | Object position detector |
US5933102A (en) * | 1997-09-24 | 1999-08-03 | Tanisys Technology, Inc. | Capacitive sensitive switch method and system |
US5943052A (en) * | 1997-08-12 | 1999-08-24 | Synaptics, Incorporated | Method and apparatus for scroll bar control |
US6067075A (en) * | 1995-12-21 | 2000-05-23 | Eastman Kodak Company | Controller for medical image review station |
US6088023A (en) * | 1996-12-10 | 2000-07-11 | Willow Design, Inc. | Integrated pointing and drawing graphics system for computers |
US6163312A (en) * | 1997-12-22 | 2000-12-19 | Sony Corporation | Portable radio information terminal, screen scroll method, recording medium and microcomputer |
US6262717B1 (en) * | 1998-07-02 | 2001-07-17 | Cirque Corporation | Kiosk touch pad |
US6266050B1 (en) * | 1997-08-08 | 2001-07-24 | Samsung Electronics Co., Ltd. | Portable computer having touch pad input control function |
US20020000978A1 (en) * | 2000-04-11 | 2002-01-03 | George Gerpheide | Efficient entry of characters from a large character set into a portable information appliance |
US20020018264A1 (en) * | 2000-07-06 | 2002-02-14 | Kodialam Muralidharan S. | Dynamic path routing with service level guarantees in optical networks |
US6473069B1 (en) * | 1995-11-13 | 2002-10-29 | Cirque Corporation | Apparatus and method for tactile feedback from input device |
USD469103S1 (en) * | 2001-07-16 | 2003-01-21 | Matsushita Electric Industrial Co., Ltd. | Disc cartridge |
USD472245S1 (en) * | 2001-10-22 | 2003-03-25 | Apple Computer, Inc. | Media player |
US20030076306A1 (en) * | 2001-10-22 | 2003-04-24 | Zadesky Stephen Paul | Touch pad handheld device |
US20030076303A1 (en) * | 2001-10-22 | 2003-04-24 | Apple Computers, Inc. | Mouse having a rotary dial |
US20030076301A1 (en) * | 2001-10-22 | 2003-04-24 | Apple Computer, Inc. | Method and apparatus for accelerated scrolling |
US20030095096A1 (en) * | 2001-10-22 | 2003-05-22 | Apple Computer, Inc. | Method and apparatus for use of rotational user inputs |
US20030210286A1 (en) * | 2002-02-26 | 2003-11-13 | George Gerpheide | Touchpad having fine and coarse input resolution |
US20040021694A1 (en) * | 2002-08-01 | 2004-02-05 | Apple Computer, Inc. | Mode activated scrolling |
US20040055446A1 (en) * | 2002-07-30 | 2004-03-25 | Apple Computer, Inc. | Graphical user interface and methods of use thereof in a multimedia player |
-
2003
- 2003-03-17 US US10/388,765 patent/US20030214938A1/en not_active Abandoned
Patent Citations (45)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3234512A (en) * | 1961-03-09 | 1966-02-08 | Monroe Int | Keying method and apparatus |
US3478220A (en) * | 1966-05-11 | 1969-11-11 | Us Navy | Electro-optic cursor manipulator with associated logic circuitry |
US4103252A (en) * | 1976-11-26 | 1978-07-25 | Xerox Corporation | Capacitive touch-activated transducer system including a plurality of oscillators |
US4110749A (en) * | 1977-05-06 | 1978-08-29 | Tektronix, Inc. | Touch display to digital encoding system |
US4177421A (en) * | 1978-02-27 | 1979-12-04 | Xerox Corporation | Capacitive transducer |
US4246452A (en) * | 1979-01-05 | 1981-01-20 | Mattel, Inc. | Switch apparatus |
US4386346A (en) * | 1981-03-27 | 1983-05-31 | International Business Machines Corporation | Cursor controller |
US4595913A (en) * | 1983-02-10 | 1986-06-17 | Pie Associates | Capacitor touch activated switching system |
US4550221A (en) * | 1983-10-07 | 1985-10-29 | Scott Mabusth | Touch sensitive control device |
US4736191A (en) * | 1985-08-02 | 1988-04-05 | Karl E. Matzke | Touch activated control method and apparatus |
US4777328A (en) * | 1987-05-13 | 1988-10-11 | Elographics, Inc. | Circular electrographic touch sensor with orthogonal fields and linear response |
US4951036A (en) * | 1988-08-04 | 1990-08-21 | The Grass Valley Group, Inc. | Touchpad jogger |
US5305017A (en) * | 1989-08-16 | 1994-04-19 | Gerpheide George E | Methods and apparatus for data input |
US5453761A (en) * | 1990-06-18 | 1995-09-26 | Sony Corporation | Information processing apparatus |
US5159159A (en) * | 1990-12-07 | 1992-10-27 | Asher David J | Touch sensor and controller |
US5518078A (en) * | 1991-11-08 | 1996-05-21 | Sharp Kabushiki Kaisha | Coordinates input device |
US5543591A (en) * | 1992-06-08 | 1996-08-06 | Synaptics, Incorporated | Object position detector with edge motion feature and gesture recognition |
US5914465A (en) * | 1992-06-08 | 1999-06-22 | Synaptics, Inc. | Object position detector |
US5565658A (en) * | 1992-07-13 | 1996-10-15 | Cirque Corporation | Capacitance-based proximity with interference rejection apparatus and methods |
US5861875A (en) * | 1992-07-13 | 1999-01-19 | Cirque Corporation | Methods and apparatus for data input |
US6137427A (en) * | 1994-04-05 | 2000-10-24 | Binstead; Ronald Peter | Multiple input proximity detector and touchpad system |
US5844506A (en) * | 1994-04-05 | 1998-12-01 | Binstead; Ronald Peter | Multiple input proximity detector and touchpad system |
US5907472A (en) * | 1994-10-07 | 1999-05-25 | Maxwell Laboratories, Inc. | Multi-electrode double layer capacitor having single electrolyte seal and aluminum-impregnated carbon cloth electrodes |
US6473069B1 (en) * | 1995-11-13 | 2002-10-29 | Cirque Corporation | Apparatus and method for tactile feedback from input device |
US6067075A (en) * | 1995-12-21 | 2000-05-23 | Eastman Kodak Company | Controller for medical image review station |
US5748185A (en) * | 1996-07-03 | 1998-05-05 | Stratos Product Development Group | Touchpad with scroll and pan regions |
US5941122A (en) * | 1996-09-16 | 1999-08-24 | Delco Electronics Corporation | Liquid level sensor incorporating a capacitive rotary position encoder |
US5736865A (en) * | 1996-09-16 | 1998-04-07 | Delco Electronics Corporation | Capacitive rotary position encoder |
US6088023A (en) * | 1996-12-10 | 2000-07-11 | Willow Design, Inc. | Integrated pointing and drawing graphics system for computers |
US6266050B1 (en) * | 1997-08-08 | 2001-07-24 | Samsung Electronics Co., Ltd. | Portable computer having touch pad input control function |
US5943052A (en) * | 1997-08-12 | 1999-08-24 | Synaptics, Incorporated | Method and apparatus for scroll bar control |
US5933102A (en) * | 1997-09-24 | 1999-08-03 | Tanisys Technology, Inc. | Capacitive sensitive switch method and system |
US6163312A (en) * | 1997-12-22 | 2000-12-19 | Sony Corporation | Portable radio information terminal, screen scroll method, recording medium and microcomputer |
US6262717B1 (en) * | 1998-07-02 | 2001-07-17 | Cirque Corporation | Kiosk touch pad |
US20020000978A1 (en) * | 2000-04-11 | 2002-01-03 | George Gerpheide | Efficient entry of characters from a large character set into a portable information appliance |
US20020018264A1 (en) * | 2000-07-06 | 2002-02-14 | Kodialam Muralidharan S. | Dynamic path routing with service level guarantees in optical networks |
USD469103S1 (en) * | 2001-07-16 | 2003-01-21 | Matsushita Electric Industrial Co., Ltd. | Disc cartridge |
USD472245S1 (en) * | 2001-10-22 | 2003-03-25 | Apple Computer, Inc. | Media player |
US20030076306A1 (en) * | 2001-10-22 | 2003-04-24 | Zadesky Stephen Paul | Touch pad handheld device |
US20030076303A1 (en) * | 2001-10-22 | 2003-04-24 | Apple Computers, Inc. | Mouse having a rotary dial |
US20030076301A1 (en) * | 2001-10-22 | 2003-04-24 | Apple Computer, Inc. | Method and apparatus for accelerated scrolling |
US20030095096A1 (en) * | 2001-10-22 | 2003-05-22 | Apple Computer, Inc. | Method and apparatus for use of rotational user inputs |
US20030210286A1 (en) * | 2002-02-26 | 2003-11-13 | George Gerpheide | Touchpad having fine and coarse input resolution |
US20040055446A1 (en) * | 2002-07-30 | 2004-03-25 | Apple Computer, Inc. | Graphical user interface and methods of use thereof in a multimedia player |
US20040021694A1 (en) * | 2002-08-01 | 2004-02-05 | Apple Computer, Inc. | Mode activated scrolling |
Cited By (48)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2406739B (en) * | 2003-09-30 | 2006-04-19 | Siemens Ag | A call routing method |
WO2005032064A1 (en) * | 2003-09-30 | 2005-04-07 | Siemens Aktiengesellschaft | A call routing method |
US7313629B1 (en) * | 2003-11-06 | 2007-12-25 | Sprint Communications Company L.P. | Method for altering link weights in a communication network within network parameters to provide traffic information for improved forecasting |
US7353294B1 (en) * | 2003-11-06 | 2008-04-01 | Sprint Communications Company L.P. | Method for estimating a traffic matrix in a communication network using stationary data |
US7363386B1 (en) * | 2003-11-06 | 2008-04-22 | Sprint Communications Company L.P. | Method for estimating a traffic matrix in a communication network using non-stationary data |
CN100401701C (en) * | 2004-01-30 | 2008-07-09 | 富士通株式会社 | Network controlling apparatus and path controlling method therein |
US7839780B2 (en) | 2006-03-30 | 2010-11-23 | Telcordia Technologies, Inc. | Dynamic traffic rearrangement to enforce policy changes in MPLS networks |
US20110026398A1 (en) * | 2006-03-30 | 2011-02-03 | Telcordia Technologies, Inc. | Dynamic Traffic Rearrangement to Enforce Policy Change in MPLS Networks |
US20070237160A1 (en) * | 2006-03-30 | 2007-10-11 | Narayanan Natarajan | Dynamic traffic rearrangement to enforce policy changes in MPLS networks |
US7590149B1 (en) * | 2006-11-10 | 2009-09-15 | Juniper Networks, Inc. | Load balancing with unequal routing metrics in a meshed overlay network |
US7936783B1 (en) * | 2006-11-10 | 2011-05-03 | Juniper Networks, Inc. | Load balancing with unequal routing metrics in a meshed overlay network |
US9923833B2 (en) | 2014-09-26 | 2018-03-20 | 128 Technology, Inc. | Network packet flow controller |
US9729439B2 (en) | 2014-09-26 | 2017-08-08 | 128 Technology, Inc. | Network packet flow controller |
US10277506B2 (en) | 2014-12-08 | 2019-04-30 | 128 Technology, Inc. | Stateful load balancing in a stateless network |
US9736184B2 (en) | 2015-03-17 | 2017-08-15 | 128 Technology, Inc. | Apparatus and method for using certificate data to route data |
US10091247B2 (en) | 2015-03-17 | 2018-10-02 | 128 Technology, Inc. | Apparatus and method for using certificate data to route data |
US10637766B2 (en) * | 2015-04-27 | 2020-04-28 | Telefonaktiebolaget Lm Ericsson (Publ) | Resource provisioning in a virtualized network |
US10033843B2 (en) | 2015-05-18 | 2018-07-24 | 128 Technology, Inc. | Network device and method for processing a session using a packet signature |
US9729682B2 (en) | 2015-05-18 | 2017-08-08 | 128 Technology, Inc. | Network device and method for processing a session using a packet signature |
US10432522B2 (en) | 2015-08-24 | 2019-10-01 | 128 Technology, Inc. | Network packet flow controller with extended session management |
US9762485B2 (en) | 2015-08-24 | 2017-09-12 | 128 Technology, Inc. | Network packet flow controller with extended session management |
US10660069B2 (en) | 2015-11-13 | 2020-05-19 | Nippon Telegraph And Telephone Corporation | Resource allocation device and resource allocation method |
WO2017082185A1 (en) * | 2015-11-13 | 2017-05-18 | 日本電信電話株式会社 | Resource allocating device and resource allocating method |
JPWO2017082185A1 (en) * | 2015-11-13 | 2018-07-26 | 日本電信電話株式会社 | Resource allocation device and resource allocation method |
US9871748B2 (en) | 2015-12-09 | 2018-01-16 | 128 Technology, Inc. | Router with optimized statistical functionality |
US9985883B2 (en) | 2016-02-26 | 2018-05-29 | 128 Technology, Inc. | Name-based routing system and method |
US10205651B2 (en) | 2016-05-13 | 2019-02-12 | 128 Technology, Inc. | Apparatus and method of selecting next hops for a session |
US10298616B2 (en) | 2016-05-26 | 2019-05-21 | 128 Technology, Inc. | Apparatus and method of securing network communications |
US10200264B2 (en) | 2016-05-31 | 2019-02-05 | 128 Technology, Inc. | Link status monitoring based on packet loss detection |
US10257061B2 (en) | 2016-05-31 | 2019-04-09 | 128 Technology, Inc. | Detecting source network address translation in a communication system |
US10091099B2 (en) | 2016-05-31 | 2018-10-02 | 128 Technology, Inc. | Session continuity in the presence of network address translation |
US11722405B2 (en) | 2016-05-31 | 2023-08-08 | 128 Technology, Inc. | Reverse forwarding information base enforcement |
US11075836B2 (en) | 2016-05-31 | 2021-07-27 | 128 Technology, Inc. | Reverse forwarding information base enforcement |
US10841206B2 (en) | 2016-05-31 | 2020-11-17 | 128 Technology, Inc. | Flow modification including shared context |
US9832072B1 (en) | 2016-05-31 | 2017-11-28 | 128 Technology, Inc. | Self-configuring computer network router |
US10009282B2 (en) | 2016-06-06 | 2018-06-26 | 128 Technology, Inc. | Self-protecting computer network router with queue resource manager |
US9985872B2 (en) | 2016-10-03 | 2018-05-29 | 128 Technology, Inc. | Router with bilateral TCP session monitoring |
US10425511B2 (en) | 2017-01-30 | 2019-09-24 | 128 Technology, Inc. | Method and apparatus for managing routing disruptions in a computer network |
US10833980B2 (en) | 2017-03-07 | 2020-11-10 | 128 Technology, Inc. | Router device using flow duplication |
US11496390B2 (en) | 2017-03-07 | 2022-11-08 | 128 Technology, Inc. | Router device using flow duplication |
US11799760B2 (en) | 2017-03-07 | 2023-10-24 | 128 Technology, Inc. | Router device using flow duplication |
US10432519B2 (en) | 2017-05-26 | 2019-10-01 | 128 Technology, Inc. | Packet redirecting router |
US10326687B2 (en) | 2017-07-12 | 2019-06-18 | International Business Machines Corporation | Method for remote node discovery and communication channel validation and connection |
US10320654B2 (en) * | 2017-07-12 | 2019-06-11 | International Business Machines Corporation | Method for remote node discovery and communication channel validation and connection |
US11165863B1 (en) | 2017-08-04 | 2021-11-02 | 128 Technology, Inc. | Network neighborhoods for establishing communication relationships between communication interfaces in an administrative domain |
US11503116B1 (en) | 2017-08-04 | 2022-11-15 | 128 Technology, Inc. | Network neighborhoods for establishing communication relationships between communication interfaces in an administrative domain |
US11652739B2 (en) | 2018-02-15 | 2023-05-16 | 128 Technology, Inc. | Service related routing method and apparatus |
US11658902B2 (en) | 2020-04-23 | 2023-05-23 | Juniper Networks, Inc. | Session monitoring using metrics of session establishment |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20030214938A1 (en) | Method for routing of label switched paths (LSPS) through an internet supporting multi-protocol label switching (MPLS) technology | |
US6925061B2 (en) | Multi-constraint routing system and method | |
KR100411251B1 (en) | A constrained multipath routing method | |
He et al. | Toward internet-wide multipath routing | |
Wang et al. | A new bandwidth guaranteed routing algorithm for MPLS traffic engineering | |
US8787400B1 (en) | Weighted equal-cost multipath | |
US7123620B1 (en) | Apparatus and method for scalable and dynamic traffic engineering in a data communication network | |
US6538991B1 (en) | Constraint-based routing between ingress-egress points in a packet network | |
US7139278B2 (en) | Routing traffic in a communications network | |
US9071541B2 (en) | Path weighted equal-cost multipath | |
US6584071B1 (en) | Routing with service level guarantees between ingress-egress points in a packet network | |
US20060133282A1 (en) | Systems and methods for multipath routing | |
US20050243723A1 (en) | Multi-parameter load balancing device for a label switched communications network peripheral device | |
US20030028670A1 (en) | Network resource allocation methods and systems | |
EP1356642A2 (en) | Path determination in a data network | |
US7296087B1 (en) | Dynamic allocation of shared network resources between connection-oriented and connectionless traffic | |
Masip-Bruin et al. | QoS routing algorithms under inaccurate routing for bandwidth constrained applications | |
Li et al. | MPLS traffic engineering load balance algorithm using deviation path | |
Kotti et al. | Bandwidth constrained routing algorithm for MPLS traffic engineering | |
Karaman | Constraint-based routing in traffic engineering | |
Alidadi et al. | A new low-complexity QoS routing algorithm for MPLS traffic engineering | |
Oki et al. | F-TPR: Fine two-phase IP routing scheme over shortest paths for hose model | |
Sa-Ngiamsk et al. | A bandwidth-based constraint routing algorithm for multi-protocol label switching networks | |
Hu et al. | Path selection with joint latency and packet loss for edge computing in SDN | |
Zhang et al. | Building MPLS VPNs with QoS Routing Capability |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: HIMACHAL FUTURISTIC COMMUNICATIONS LTD, INDIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:JINDAL, DEEPAK;KURI, JOY;KUMAR, ANURAG;REEL/FRAME:014305/0903;SIGNING DATES FROM 20030426 TO 20030526 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |