text:
|Publication number
|Publication type
|Application number
|Publication date
|Apr 13, 2004
|Filing date
|Aug 9, 1999
|Priority date
|Aug 9, 1999
|Fee status
|Also published as
|Publication number
|Debasis Mitra, Kajamalai Gopalaswamy Ramakrishnan
|Original Assignee
|Lucent Technologies Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (9), Non-Patent Citations (2), Referenced by (38), Classifications (20), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
This invention relates to methods for distributing traffic among routes in packetized communication networks.
Communication networks transport information between terminal communication devices such as computer terminals, telephones, facsimile machines, and computer file servers. A typical network includes switching nodes such as nodes 10.1-10.8 of FIG. 1, interconnected by links, such as links 15.1-15.10 of the figure. Generally, each terminal device (not shown) is associated with one of the nodes.
In many modern networks, the information to be transported from a source node to a destination node is divided into packets or cells. In accordance, for example, with Asynchronous Transfer Mode protocols (ATM) or Internet Protocol (IP), these, e.g., packets stream independently through the network from the source node to the destination node. At each node encountered along the way, a packet is directed into one link or another according to header information borne by that packet. We will refer to any such network as a "packetized" network.
Some communicative transactions, such as telephone calls, are highly sensitive to the timing of the packet arrivals at the destination. If there are significant absolute or relative delays, or if the packets arrive out of order, the quality of the call may be deemed unacceptable. To preserve the quality of transactions of this kind, it is desirable to maintain a complete route from the source to the destination for the entire duration of the transaction. (We will refer to communicative transactions, generally, as "calls," even if they involve the transmission of fax images, data, etc.)
In all but the simplest networks, more than one route will generally be available from a given source to a given destination. For example, it will be apparent from FIG. 1 that there are five potential routes from node 10.3 to node 10.4. However, it is not always desirable to make available every potential route for a given source-destination pair. For example, some routes may pass through an excessive number of links (i.e., they have many "hops"), which add an unacceptable cumulative delay. The problem is compounded by the fact that each link has a limited amount of bandwidth. Therefore, routing a call between nearby nodes through a far distant link may exclude some traffic between nodes that are situated close to that link. The result may be to force some of that traffic onto undesirably long routes as well.
The discipline referred to as "traffic engineering" deals, inter alia, with the problem of how to distribute traffic among permissible routes. This distribution is desirably made in a manner directed toward a desired level of network performance. Traffic engineering problems are further complicated when the network is required to carry more than one class of service. For example, the same network may be required to carry voice, video, fax, and e-mail transmissions. Each of these services has its own bandwidth requirements, and each has its own requirements as to how much delay can be tolerated. Each may also have its own requirements as to how much call blocking can be tolerated. A network that carries more than one class of service is here referred to as a "multiservice network."
Network traffic can be broadly divided into two categories: Quality-of-Service (QoS) traffic, and Best-Effort (BE) traffic.
QoS traffic is traffic which must satisfy critical requirements in order to be acceptable to customers. Such requirements typically relate to the maximum acceptable delay. However, they may involve other performance parameters. For example, parameters related to blocking could be important. Parameters of that type include the call-loss ratio and the packet-loss ratio. It often happens that in order to satisfy QoS requirements, the pertinent traffic must be limited to certain sets of admissible routes. This notion of admissible route sets makes it convenient, within QoS methodologies, to define admissible route sets that are limited so as to comply with policy constraints of various kinds.
QoS traffic can be further subdivided into real-time traffic, and non-real-time traffic. Real-time traffic, which includes, e.g., voice and video traffic, is meant to be utilized by the customer as it arrives. Any delays which the customer perceives as disrupting the smooth flow of received data will generally be unacceptable. Non-real-time traffic, which includes, e.g., traffic to and from facsimile machines, is more tolerant of delay, but it still must meet customer expectations of prompt and relatively smooth delivery. In particular, premium data traffic might have critical limitations on the call-loss ratio and packet-loss ratio.
BE traffic, which includes, e.g., World Wide Web traffic, e-mail, and FTP, is still more tolerant of delay as well as call blocking. The user is generally satisfied to wait minutes, or in some cases, even hours, to receive a complete message. Therefore, the network service provider is not expected to guarantee any particular limits on the maximum delay. Instead, it is generally sufficient for the network to use bandwidth, as it becomes available, that can be spared without blocking more lucrative QoS traffic.
In order for network service providers to most fully exploit their multiservice networks, it is desirable for them to offer guarantees to their customers that limits on, e.g., the amount of delay, specified variously for different service classes, will be met. However, it is difficult to design a network that will honor such guarantees without blocking an undue amount of traffic. For example, if voice traffic is concentrated on certain links because they are essential for the shortest routing of voice calls, facsimile transmissions may be excluded from these links. If these links are necessary for the routing of facsimile transmissions, the result will be a busy signal whenever an attempt is made to send a facsimile.
One approach to traffic engineering in multiservice networks is described in D. Mitra, et al., "ATM Network Design and Optimization: A Multirate Loss Network Framework," IEEE/ACM Transactions on Networking 4 (August 1996) 531-543. This paper describes a software package referred to as TALISMAN. Among other things, TALISMAN solves a joint routing problem in multiservice ATM networks so as to maximize a performance measure that may be characterized as the long-run average revenue for the network. (A joint routing problem is one that jointly treats all pertinent source-destination pairs.) In the TALISMAN model, a revenue figure is obtained for each service route (i.e., a route in association with a given service class) as the product of a service-route revenue parameter, times the intensity of accepted traffic on that service route. Traffic intensity is defined as the arrival rate of calls, times the mean holding time per call. These revenue figures are summed over all streams and, for each stream, over all service routes, to obtain the total network revenue. A stream is defined as a source-destination pair in association with a given service class.
There is a growing demand for multiservice networks in which the route sets available to different service classes must satisfy distinct policy requirements. In addition to traditional requirements related, e.g., to bandwidth and delay, there are further requirements related to virtual private network services, which are also in growing demand.
Generally, as the size and complexity of networks increases, the time required to solve traffic engineering problems also increases. In order to make the most efficient use of a network in the face of changing traffic patterns, it is desirable to carry out on-line solutions of traffic engineering problems; that is, solutions that are responsive to actual conditions as they occur. Even with the help of tools such as TALISMAN, this is not always feasible for networks that are large or complex.
We have invented a method for solving traffic engineering problems in a network having at least one QoS service class and at least one class of service that is not a QoS class. The computational complexity of our method is polynomial, so that there are feasible solutions even for networks having hundreds of nodes and many service classes. When applied to networks of typical size, our method will be fast enough, in many cases, to perform on-line.
In accordance with our method, bandwidth is allocated to respective service routes in at least one QoS service class. We are using the term "QoS" in a broad sense, to include any class of service receiving priority treatment. Both delay-sensitive and delay-insensitive traffic may be QoS traffic, in this sense. The bandwidth allocation is made in response to a given set of demands for bandwidth, in the QoS class, between each source-destination pair. Linear programming methods, such as Multicommodity Flow (MCF) techniques, are used to make this allocation in such a way as to optimize a suitable figure of merit, such as network revenue.
Then, linear programming methods are again used to make a new allocation, which minimizes network usage without departing from the optimal value of the figure of merit. Then, a residual network is identified. The residual network consists of that bandwidth that remains unallocated, on each link of the network.
A routing problem is then solved for at least one non-QoS service class. Without limitation, all such service classes are here referred to as BE classes. The routing problem is solved to find route sets for all flows in the BE service class, and to allocate bandwidth to the respective service routes in each of these route sets. This problem is solved using linear programming techniques in such a way as to optimize a suitable figure of merit, such as network revenue from best-effort traffic.
The priority of the QoS classes is enforced by routing QoS demands before, and without regard to, the BE demands. Typically, the effective bandwidths associated with the QoS services are larger than those of the BE classes. Both of these factors will generally lead to lower delay, and to lower rates of call blocking and packet loss, in the QoS traffic relative to the BE traffic.
In preferred embodiments of the invention, the routing problem for the QoS classes is solved using a route-based formulation so that specifications of limited, admissible route sets are readily accommodated. By contrast, the routing problem for the BE classes is preferably solved using a link-based formulation. (Such a formulation is sometimes referred to as "edge-based.") A link-based formulation provides improved speed when problems are solved on highly connected networks. However, the link-based formulation alone does not lead to a complete solution. In a given service class, it leads to a link-by-link allocation of bandwidth associated with respective source-destination pairs, but it does not provide an allocation by service route. A further procedure, referred to as route decomposition, is used to construct, from the link-based solution, an allocation of bandwidth by service route.
In another aspect, the invention involves the use of linear programming techniques, as described above, to allocate bandwidth among service routes in response to a set of demands in each pertinent service class. Significantly, the demands are calculated so as to take into account an effective bandwidth associated with the pertinent service class, and so as to make allowance for the stochastic behavior of the traffic demands that occur in practice.
It should be noted that the traffic engineering problem that is solved by the invention in either aspect is a combined problem of routing and admission control. The routing aspect takes place explicitly as demand between a given source-destination pair in a given service class is allocated among its admissible routes. The admission-control aspect takes place implicitly when the optimum such allocation is an allocation of less than all the demand. Simply stated, admission control operates when traffic is dropped in order, e.g., to maximize revenue.
FIG. 1 is a schematic diagram of an illustrative communication network comprising links and nodes.
FIG. 2 is a flowchart of a traffic engineering procedure in accordance with the invention in a broad illustrative embodiment.
FIG. 3 is a flowchart of a flow-decomposition procedure useful for the practice of the invention in some embodiments.
FIG. 4 is a flowchart of an extension of the procedure of FIG. 2, leading to bandwidth allocations that take into account the stochastic nature of network traffic.
FIG. 5 is a flowchart of a traffic engineering procedure directed to QoS traffic, and including evaluation and adjustment processes.
A network has N nodes and L links. Each link is associated with a respective value of the index l.
A service class is denoted by s.
A source-destination pair is denoted by σ.
A stream (s, σ) is a source-destination pair in association with a specific service class.
Each route (between a source-destination pair) is identified by an index r.
The set of permissible routes for a given stream (s, σ) is denoted (s, σ).
A service route (s, r) is a route r in association with a particular service class s.
The demand matrix Ts is the N�N matrix of bandwidth demands Ts,σ between source-destination pairs σ in service class s. The entries of the demand matrix are typically based on traffic measurements or predictive models, or specified in service-level agreements for, e.g., virtual private networks. There is a demand matrix for each QoS service class, and there is also a demand matrix TBE for best-effort traffic.
Cl is the bandwidth or capacity of link l.
The QoS revenue parameter esr is the earnings per unit carried bandwidth on a given QoS service route.
The best-effort revenue parameter eBE,
Xsr is the flow, or carried bandwidth, on a given service route.
Fσ is the total BE flow, or carried bandwidth, between a given source-destination pair.
WQoS is the total network revenue for all QoS service classes. It is computed by summing the product esr Xsr over all QoS service classes, over all source-destination pairs, and for each pertinent stream, over the route set (i.e., the set of permissible routes) for that stream:
WBE is the total network revenue for BE traffic. It is computed by summing the product eBE,
In Equation 2, we are assuming, for simplicity, that there is only one BE class of service. Generalizations to cases having multiple BE classes are readily achieved, and also fall within the scope of the present invention.
According to the illustrative embodiment of the invention depicted in FIG. 2, a multicommodity flow (MCF) problem is solved, as indicated at block 20, to find the flows Xsr on respective service routes that maximize network QoS revenue. Inputs to the problem are the QoS demand matrices, the link capacities, the route set for each QoS stream, and the revenue parameters for the various QoS service routes. The maximization is performed subject to the constraints that: (i) for a given stream, the sum of all flows Xsr over the route set for that stream must not exceed the demand Ts,σ associated with that stream; (ii) the flows Xsr must all be non-negative; and (iii) the sum of all flows routed over a given link must not exceed the capacity of that link.
Mathematically, the MCF problem of block 20 is stated by:
In reference to the first of the above constraints, it should be noted that for at least some streams, it may be possible that the sum of all flows over the pertinent route set may be less than the associated demand. That is, admission control may operate to deny some of the requested bandwidth. For a given stream (s, σ), a corresponding loss ratio Lsσ may be defined by:
The MCF problem of block 20 is solved to determine WQoS*, which is an optimal value of the total QoS network revenue. It should be noted that a different figure of merit, such as total carried QoS traffic, is readily substituted for QoS network revenue in the MCF problem.
In block 25, a second MCF problem is solved. All of the inputs to the first MCF problem are also inputs to this second MCF problem. In addition, the value of WQoS* obtained from the solution to the previous MCF problem is now applied as a constraint. That is, the MCF problem of block 25 must be solved such that the total network revenue (or other figure of merit) is not less than WQoS*, or not less than a figure derived from WQoS*. An exemplary such derived figure is a fractional value of WQoS*, less than but near in value to WQoS*. The object of the MCF problem of block 25 is to minimize the total resource utilization, obtained by summing bandwidth-hops, of the QoS traffic. The total resource utilization UQoS by QoS traffic is expressed mathematically by the equation
where the first summation is taken over links, the second over streams, and the third over routes in the pertinent route set, but only those routes that contain a given link l. UQoS is the objective function which is to be minimized subject to the revenue constraint.
In alternate approaches, different measures of the efficiency of resource utilization can be optimized. For example, one alternate approach would be to minimize the usage of the most heavily utilized link.
In other alternate approaches, a constraint is applied to prevent saturation of the most heavily used links. Such a constraint would, e.g., cap the utilization of a given link at a stated fraction of the total link capacity.
The output of block 25 includes the set {Xsr} of flow parameters on all of the service routes that minimizes UQoS. At block 30, the capacity Cl of each link l is reduced by every flow Xsr routed over that link. The remaining capacity is denoted Cl′. The set {Cl′} of all remaining capacities Cl′ is referred to as the "residual network."
At block 35, a further MCF problem is solved, to maximize the total network revenue (or other figure of merit) from best-effort traffic. For purposes of solving this MCF problem, the network is defined as the residual network {Cl′}. Thus, the inputs to block 35 are the best-effort demand matrix TBE, the set {Cl′}, and the set of earnings parameters {eBE,σ}.
It should be noted that in the preceding discussion, the MCF problems of blocks 20 and 25 were formulated as route-based problems. That is, the decision variables Xsr relate to the flow on given service routes, but are not separately specified for individual links. It is well known that an alternative formulation for MCF problems is the so-called link-based (or edge-based) formulation, in which each decision variable Yσl expresses flow, between a given source-destination pair σ, on a given link l.
The route-based formulation is advantageous for treating the QoS traffic, because it conveniently allows for distinct policy constraints, as well as delay-related constraints, to be applied to the routes for different source-destination pairs and different service classes. These constraints may include, for example, limits on the total permissible hop count. Such constraints are useful for assuring that total delay, or some other measure of quality, remains within desired bounds. Significantly, policy constraints and other constraints tend to limit the number of permissible routes for a given source-destination pair and service class.
However, in a highly interconnected network with many permissible routes in each route set, the route-based formulation tends to become very complex. In such a case, solving the MCF problem in the route-based formulation may be intractable, in a practical sense. On the other hand, the complexity of the link-based formulation is independent of the number of routes, and depends only on the number of links and nodes. Thus, the link-based formulation may be advantageous when the route sets are large.
Unlike QoS traffic, best-effort traffic will not typically be subject to policy constraints such as an upper bound on the permissible number of hops in a route. Thus, within the limitations of the residual network, the route sets for best-effort traffic may be quite large, and in at least some cases they will be free of a priori restrictions. Consequently, we believe that it will generally be preferable to solve the MCF problem of block 35, for best-effort traffic, using the link-based formulation.
The object of the MCF problem of block 35 is to determine the set {Yσl} of best-effort flow parameters that maximize the total network best-effort revenue WBE, subject to the constraints that: (i) the total flow Fσ between each source-destination pair σ must be non-negative and no greater than the corresponding best-effort demand TBE,σ; (ii) for each source-destination pair, the sum of flow parameters Yσl taken over links entering a given node must equal the sum taken over links leaving the given node, unless the node is a source or destination, in which case the two sums differ by +1 (if a destination) or −1 (if a source) times the total flow Fσ; (iii) all flow parameters must be non-negative; and (iv) for each link l, the sum over all source-destination pairs σ of the flow parameters Yσl must not exceed the link capacity Cl.
Those skilled in the art will appreciate that the formulation for this problem that is described here is the so-called "N2L" formulation. In at least some cases, an alternate formulation, known as the "N-Commodity" formulation, will offer the advantage of greater computational efficiency. A description of this alternate formulation may be found, e.g., in U.S. Pat. No. 5,596,719, issued on Jan. 21, 1997 and commonly assigned herewith, beginning at column 5, line 60.
Similarly to the case of QoS traffic, a best-effort loss ratio due to admission control may be defined as
In order to apply the results of block 35, it is necessary to recover from the optimal set {Yσl} a corresponding set {Xsr BE} of route-based best-effort flow parameters. The procedure for achieving this is referred to as flow decomposition. At block 40, flow decomposition is carried out to derive the set {Xsr BE} from the input set {Fσ} of total flows for the respective source-destination pairs and from the input set {Yσl} of link-based flow parameters.
Methods for performing flow decomposition are well known in the art. One exemplary method is illustrated in FIG. 3 and will now be described.
At block 45, the sets {Cl′}, {Fσ}, and {σl} are accepted as input. At block 50, an initial source-destination pair a is obtained for processing. Each source-destination pair will be processed, in turn, until there are none left, as indicated by blocks 80 and 85.
At block 55, a reduced graph g(σ)is generated by deleting, from the residual network, each link that carries no flow between the current source-destination pair σ. At block 60, a route r is traced connecting the current source-destination pair. At block 65, the best-effort, route-based flow parameter XBE,r for the current route is assigned a value equal to the smallest link-based flow parameter on any link of the current route. That is, it is assigned the value
Also at block 65, the total flow value Fσ for the current source-destination pair is reduced by the quantity XBE,r.
As noted, at block 60 a particular route r was traced in g(σ) connecting the current source-destination pair. At block 70, the link-based flow parameter Yσl on each link of this route r is reduced by the quantity XBE,r.
As indicated at block 75, the procedures of blocks 55-70 are iterated, for the current source-destination pair, until the total flow value Fσ for that source-destination pair is reduced to zero; that is, until all of the flow between that pair of nodes has been assigned to routes. Then, as indicated at blocks 75-85, a new source-destination pair is obtained, and the procedure of blocks 55-70 is repeated. The entire procedure is repeated for each remaining source-destination pair until there remain no unprocessed source-destination pairs.
It should be noted that in each iteration of block 55 (for a given source-destination pair σ), the reduced graph g(σ) is further reduced from its condition in the preceding iteration. However, when a new source-destination pair is obtained, the initial graph g(σ) is again the entire residual network.
After the route-based flow-parameter sets {Xsr} and {Xsr BE} have been obtained, they can be used for allocating the offered traffic in each stream among the permissible routes in the route set for that stream. In an exemplary allocation scheme, the fraction of traffic offered to a given route is approximately equal to Xsr for that route, divided by the sum of the Xsr's over all routes in the route set. Those skilled in the art will appreciate that such a scheme is readily carried out, e.g., through proportional routing at the source node, in conjunction with weighted fair queuing at the various nodes of the network.
Proportional routing and weighted fair queuing are well known in the art, and need not be described here in detail. For pedagogical purposes, however, we now provide a brief description of proportional routing. Each node is a prospective source node for each of N−1 source-destination pairs in each of the S service classes, and thus is a prospective source node for each of S(N−1) streams. A plurality of routes may correspond to each of these streams, each route having a relative share
of the traffic demand Tsσ. In this regard, the dropping of a call is also treated as a route assignment (to a phantom route) having such a relative share. Loaded into the router at each node are S(N−1) tables, one for each stream. Listed in each table are the values of the fractions
for the pertinent service routes. Call demands are allocated among these service routes, including the phantom route, in proportion to the fractions
In some implementations of the method that we have described with reference to FIG. 2, the traffic demands Ts,σ are mean values obtained by measurement, or by projection from a traffic model. If a traffic model is used for this purpose, it is preferably a stochastic model, because such a model more accurately accounts for the statistical nature of communication traffic.
However, such a use of mean values may lead to undesirable rates of loss. That is precisely because communication traffic is statistical in nature. In practice, demands do not occur uniformly, but instead tend to occur in bunches separated by periods of relatively low activity. If it is assumed that demands occur uniformly, the traffic engineering that results may fail to provide enough capacity to accommodate the periods of relatively high activity, when demands arrive in bunches. As a consequence, offers of traffic to particular routes may have to be refused because capacity is insufficient on one or more links of such routes. Such a refusal would lead to loss of a call.
We have devised an approach that promises to reduce the loss rate by accounting for stochasticity in call arrivals while maintaining computational tractability even for large networks. We here describe our approach as applied to QoS traffic. Optionally, it can also be applied to best-effort traffic.
Our approach involves certain quantities associated with the stochastic modeling of communication networks. They are summarized below:
The mean arrival rate of calls of a given stream (s, σ), exemplarily in a Poisson process, is denoted Λsσ.
The mean holding period of a call of the given stream is denoted 1/μsσ.
The load, or traffic intensity, of the given stream is denoted {overscore (ρ)}sσ. This quantity is equal to Λsσ/μsσ.
The quantities Λsσ, 1/μsσ, and the effective bandwidths ds are generally considered to be inputs to the stochastic model of the network. The effective bandwidth is a parameter that subsumes the effects of packet-level variability, buffer overflow, buffer delay, and other packet-level QoS-sensitive effects and descriptors of traffic behavior.
The design procedure that we discuss below results in a further quantity ρsr. This is the load, or traffic intensity, on a given service route (s, r). The quantities ρsr are analogous to the flow parameters Xsr discussed above. Once they have been obtained, the quantities ρsr can be used in a traffic engineering procedure. One such procedure, for example, is analogous to the procedure described above in which the flow parameters Xsr are used to allocate traffic over the pertinent route set.
FIG. 4, to which reference is now made, shows a procedure that is iterated for each stream, in turn, until no further streams are left. At block 90, the first stream is obtained. At block 95, the element Ts,σ of the demand matrix Ts is obtained from the following expression:
In Equation 6, the quantity α is a non-negative, adjustable parameter, which we refer to as the compensation parameter. The more variable the call-arrival process, the greater the need for compensation, and thus the greater the value of α that is desirable. By way of example, we have found from theoretical analyses that a value for α of about 0.5 is useful for Poisson-distributed call arrivals, exponentially distributed call holding times, and critical loading of the network.
At block 100, the flow-based design procedure of FIG. 2, blocks 20 and 25, is carried out to obtain flow parameters Xsr. The elements Ts,σ obtained at block 95 are used as input to the flow-based design procedure.
At block 105, the load ρsr for each route in the route set of the current stream is obtained from the following expression:
As indicated at blocks 110 and 115, the procedures of blocks 95-105 are repeated for each stream, in turn, until there are none left. Then, as indicated at block 120, an evaluation can be made of the expected network performance by, for example, using known methods based on the stochastic network model to calculate the loss probability on each service route. If any of these predicted loss probabilities are too high, adjustments can be made to the compensation parameter α, or to other parameters used in the methods described above.
FIG. 5 summarizes the traffic engineering procedure for QoS traffic. Blocks 125 and 130 are analogous to blocks 20 and 25 of FIG. 2, but may incorporate the stochastically based refinements described here in reference to FIG. 4. At block 135, a theoretical loss rate is computed for each service route. At block 140, an indication is made if the predicted loss rate is too high in any service class.
Blocks 145 and 150 represent alternative, illustrative pathways for revising the traffic engineering design to reduce unwanted losses. At block 145, the revenue parameters esr that are input to the MCF problems are revised. Because the network revenue is maximized in the first MCF problem and maintained at the optimal level in the second MCF problem, an increase in earnings attributable to a given stream will tend to reduce blocking of traffic for that stream.
At block 150, additional constraints are added to the MCF problem of block 130. The nature of these constraints is to limit the usage on particular, heavily used links, to some fraction of total capacity. Thus, the object of this MCF problem is now to find a minimum amount of resource usage, consistent with the revenue constraint and the limitations on usage of particular links. By reserving some capacity in these links, it is possible to avoid overloading them during periods of relatively high activity.
One issue in network design that is gaining in importance is that of virtual private networks (VPNs). A VPN is a logically defined network consisting of bandwidth on each of various links that is allocated to a particular customer. When the traffic engineering techniques described here are applied to a network that supports one or more VPNs, the problem may arise as to how to accommodate the bandwidth requirements of the VPNs.
We have considered a solution to that problem that will be useful in at least some cases. According to our solution, demands between a given source-destination pair, in a given service class, are treated in the aggregate, even if some of these demands are earmarked for various VPNs. Then, after the flow parameters Xsr or loads ρsr have been obtained, these quantities are allocated among the VPNs and the non-VPN traffic.
Disaggregation takes place in two steps. First, the total flow on each route (for a given stream) is divided between non-VPN traffic and VPN traffic in direct proportion to the contributions made by non-VPN demand and VPN demand to the total demand. Then, the aggregated VPN flow is distributed among the various VPNs according to their respective shares.
We have considered two exemplary procedures for determining the respective shares of the various VPNs. According to one procedure, the share of each VPN stands in direct proportion to that VPN's contribution to the total demand. According to a second procedure, the well-known method of heuristic bin packing is applied to determine each VPN's share. This second procedure is especially useful if it is an ojective to route each VPN's demand on a single route.
Very briefly, heuristic bin packing begins by ordering the VPNs in decreasing order by the size of their respective demands. The demand associated with the first VPN is assigned to a route that has sufficient capacity. If no route has sufficient capacity, then as much demand as possible is assigned to a single route, and the VPN takes a new place in the ordering, determined by the size of the remaining, unassigned demand. The procedure then repeats, routing demand associated with the new VPN that is first in order.
We performed theoretical analyses based on the network of FIG. 1. Each of links 15.1-15.10 is actually a pair of directed links, one in each direction. Each directed link has a bandwidth of 155 Mbps, referred to here as one OC3 unit, except that links 15.3 and 15.8 have capacities, in each direction, of two OC3 units. The service classes are voice (class 1), video (class 2), premium data (class 3), and best effort (class 4). The route sets for classes 1 and 2 are limited to minimum-hop routes. The route set for class 3 is limited to routes of 4 hops or less. The route set for the best effort class is unrestricted. The demand matrices for the four service classes are obtained by multiplying the matrix of Table 1 by 0.4, 0.1, 0.25, and 0.25, respectively. The total demands for the four services classes are 563.5, 140.9, 352.2, and 352.2, respectively.
The procedures of FIG. 2, blocks 20 and 25 were carried out. In the resulting solution, all bandwidth demands were carried. Then, the full procedure of FIG. 2 was carried out. In the resulting solution, the total carried best-effort bandwidth was 279.4 Mbps. Thus, 20.5% of best-effort bandwidth was lost.
Minimization of QoS resource usage in block 25 of FIG. 2 led to total resource usage by QoS classes of 2120 Mbps-hops. The corresponding capacity of the residual network was 10.3 OC3 units. For comparison, we also maximized QoS resource usage. The total maximized usage was 2668 Mbps-hops, corresponding to a capacity in the residual network of 2.85 OC3 units.
We also applied the stochastic refinement of FIG. 4, and calculated loss probabilities in the stochastic model. For these purposes, the effective bandwidth of individual calls in service classes 1, 2, and 3 was 16 Kbps, 640 Kbps, and 384 Kbps, respectively.
For zero compensation, the total bandwidth demand
was 1056.3 Mbps, the total carried QoS-assured bandwidth
was 1042.2 Mbps, and the network-wide loss probability was 0.0134. In the preceding expression for carried bandwidth, the quantity Lsr is the loss probability for service route (s, r).
For α=0.5, the total bandwidth demand was 978.8 Mbps, the total carried QoS-assured bandwidth was 976.0 Mbps, and the network-wide loss probability was 0.003.
For α=1.0, the total bandwidth demand was 901.3 Mbps, the total carried QoS-assured bandwidth was 901.2, and the network-wide loss probability was 0.0001.
|Cited Patent
|Filing date
|Publication date
|Nov 7, 1995
|Dec 29, 1998
|Lucent Technologies Inc.
|Optimization method for routing and logical network design in multi-service networks
|Nov 24, 1998
|Oct 16, 2001
|Telefonaktiebolaget Lm Ericsson
|System and methods for controlling virtual paths within a network based on entropy rate function
|Dec 28, 1998
|Mar 5, 2002
|Lucent Technologies Inc.
|Adaptive processor schedulor and method for reservation protocol message processing
|Aug 28, 1998
|Oct 8, 2002
|Qwest Communications International, Inc.
|Method for optimally selecting nodes for removal from a hierarchical communication network
|Dec 18, 1998
|Dec 10, 2002
|Cisco Technology, Inc.
|Traffic engineering technique for routing inter-class traffic in a computer network
|Aug 3, 1999
|Mar 25, 2003
|Lucent Technologies Inc.
|Constraint-based routing between ingress-egress points in a packet network
|Aug 3, 1999
|Jun 24, 2003
|Lucent Technologies Inc.
|Routing with service level guarantees between ingress-egress points in a packet network
|Mar 11, 1999
|Jul 15, 2003
|Lucent Technologies Inc.
|Adaptive routing system and method for QOS packet networks
|Title not available
|D. Mitra, et al., "ATM Network Design and Optimization: A Multirate Loss Network Framework," IEEE/ACM Transactions on Networking 4, pp. 531-543 (1996).
|D. Mitra, et al., "Virtual Private Networks: Joint Resource Allocation and Routing Design," Proceedings IEEE INFOCOM, pp. 480-490 (1999).
|Citing Patent
|Filing date
|Publication date
|Jan 29, 2001
|Apr 5, 2005
|International Business Machines Corporation
|System for optimal resource allocation and planning for hosting computing services
|Mar 23, 2004
|Dec 6, 2005
|At&T Corp.
|Method and apparatus for provisioning and monitoring internet protocol quality of service
|Dec 30, 1999
|Feb 14, 2006
|At & T Corp.
|Method and apparatus for an architecture and design of internet protocol quality of service provisioning
|Jun 4, 2002
|Oct 17, 2006
|Lucent Technologies Inc.
|Decision support mechanisms for bandwidth commerce in communication networks
|Mar 5, 2003
|Nov 6, 2007
|At&T Bls Intellectual Property, Inc.
|Method for traffic engineering of connectionless virtual private network services
|Aug 8, 2001
|Nov 13, 2007
|Juniper Networks, Inc.
|Communication network design
|Nov 6, 2003
|Dec 25, 2007
|Sprint Communications Company L.P.
|Method for altering link weights in a communication network within network parameters to provide traffic information for improved forecasting
|Nov 6, 2003
|Apr 1, 2008
|Sprint Communications Company L.P.
|Method for estimating a traffic matrix in a communication network using stationary data
|Nov 6, 2003
|Apr 22, 2008
|Sprint Communications Company L.P.
|Method for estimating a traffic matrix in a communication network using non-stationary data
|Dec 13, 2004
|Jul 29, 2008
|Hewlett-Packard Development Company, L.P.
|Methods and systems for controlling the number of computations involved in computing the allocation of resources given resource constraints
|Apr 8, 2004
|Feb 10, 2009
|Alcatel-Lucent Usa Inc.
|Scheduling with delayed graphs for communication networks
|Nov 10, 2009
|Juniper Networks, Inc.
|Communication network design
|Dec 8, 2009
|Fujitsu Limited
|Transmission bandwidth control device
|Oct 12, 2007
|Jan 12, 2010
|At&T Intellectual Property, I, L.P.
|Method for traffic engineering of connectionless virtual private network services
|Jun 14, 2011
|At&T Intellectual Property I, L.P.
|Method for traffic engineering of connectionless virtual private network services
|Aug 9, 2011
|At&T Intellectual Property Ii, L.P.
|Method and apparatus for measuring quality of service levels
|Sep 30, 2009
|Jul 3, 2012
|Juniper Networks, Inc.
|Communication network design
|May 18, 2007
|Sep 4, 2012
|Nokia Siemens Networks Gmbh & Co. Kg
|Method and node for providing a quality of service support in multihop communication systems
|Jun 8, 2012
|Sep 24, 2013
|Juniper Networks, Inc.
|Communication network design
|Apr 18, 2007
|Oct 29, 2013
|At&T Intellectual Property I, L.P.
|System and method for multi-rate video delivery using multicast stream
|Nov 19, 2007
|Nov 26, 2013
|AlterWAN Inc.
|Wide area network with high quality of service
|May 21, 2012
|Apr 15, 2014
|New Jersey Institute Of Technology
|Hierarchical energy optimization for datacenter networks
|Sep 10, 2013
|Apr 21, 2015
|Alterwan, Inc.
|Inter-autonomous networking involving multiple service providers
|Aug 8, 2001
|Apr 4, 2002
|Hiroyuki Saito
|Communication network designing circuit, designing method thereof, storage medium storing control program for designing method and transmission medium
|Jan 29, 2001
|Oct 3, 2002
|Shahabuddin Johara Shireen
|System for optimal resource allocation and planning for hosting computing services
|Jun 4, 2002
|Feb 20, 2003
|Debasis Mitra
|Decision support mechnisms for bandwidth commerce in communication networks
|Mar 5, 2003
|Sep 9, 2004
|Wright Steven Allan
|Method for traffic engineering of connectionless virtual private network services
|Jan 30, 2004
|Sep 23, 2004
|Akiko Okamura
|Transmission bandwidth control device
|Apr 8, 2004
|Oct 13, 2005
|Isaac Keslassy
|Scheduling with delayed graphs for communication networks
|Dec 13, 2004
|Jun 15, 2006
|Gene Cheung
|Methods and systems for controlling the number of computations involved in computing the allocation of resources given resource constraints
|Nov 3, 2005
|May 3, 2007
|Cromer Daryl C
|Apparatus, system, and method for managing response latency
|Sep 5, 2007
|Jan 10, 2008
|Juniper Networks, Inc.
|Communication network design
|Oct 12, 2007
|Feb 7, 2008
|At&T Bls Intellectual Property, Inc.
|Method for traffic engineering of connectionless virtual private network services
|Apr 18, 2007
|Oct 23, 2008
|At&T Knowledge Ventures, L.P.
|System and method for multi-rate video delivery using multicast stream
|May 18, 2007
|Dec 10, 2009
|Hui Li
|Method and Node for Providing a Quality of Service Support in Multihop Communication Systems
|Sep 30, 2009
|Jan 28, 2010
|Juniper Networks, Inc.
|Communication network design
|Dec 9, 2009
|Apr 8, 2010
|A&T Intellectual Property I, L.P. f/k/a BellSouth Intellectual Property Corporation
|Method for traffic engineering of connectionless virtual private network services
|Sep 14, 2012
|Mar 20, 2014
|Tellabs Operations Inc.
|Procedure, apparatus, system, and computer program for designing a virtual private network
|U.S. Classification
|370/230, 709/224, 370/395.53, 370/252, 709/240, 370/235
|International Classification
|Cooperative Classification
|European Classification
|Aug 9, 1999
Owner name: LUCENT TECHNOLOGIES INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MITRA, DEBASIS;RAMAKRISHNAN, KAJAMALAI GOPALASWAMY;REEL/FRAME:010162/0747;SIGNING DATES FROM 19990806 TO 19990809
|Sep 25, 2007
|Fee payment
Year of fee payment: 4
|Sep 22, 2011
|Fee payment
Year of fee payment: 8
|Mar 7, 2013
Owner name: CREDIT SUISSE AG, NEW YORK
Free format text: SECURITY INTEREST;ASSIGNOR:ALCATEL-LUCENT USA INC.;REEL/FRAME:030510/0627
Effective date: 20130130
|Oct 9, 2014
Owner name: ALCATEL-LUCENT USA INC., NEW JERSEY
Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CREDIT SUISSE AG;REEL/FRAME:033950/0261
Effective date: 20140819
|Sep 29, 2015
|Fee payment
Year of fee payment: 12


text:
Hi all,
i'm sorry to say, that it does not connect properly with Lazyest Gallery. As soon as you install LS e.g. the thickbox popups do not work. The thumbnail theme does not work at all. No thumbnails to see.
Hope there will be updates soon.... 'cause the slider itself is ok.

subset: commoncrawl


text: Although, the recent movement of Google Incorporation (NASDAQ:GOOG) is downtrend, if we follow the last 52 weeks, we find that the price is well above the lowest price as well as average price, though it is below the yearly high price. The issue is with a downtrend in stock price throughout the March 2013, Google Incorporation (NASDAQ:GOOG), #$%$ based world famous market leader has now became the talk of the table. Although the recent trade volume is in line with three months' average trade volume, the matter of concern in the investors' community is its recent declining trend of price. On March, 28 the price was 794.19 against fifty two weeks price range of $556.52-844.00. The company has still good fundamental as well as market support for business. Its core product is internet search engine, which is the most popular service across the globe. However, the company may face challenge to uphold its market share due to increasing competition which may causes to cautionary action by the investors. In the market, there are some big players like Apple, AOL, Microsoft, etc, which are taking market share with products and services specially by providing intellectual products. The industry participants have both opportunities as well as challenges to due to a little bit competition in the market. The other some small & medium companies are like SPEX, Capital Investment (MGT), Marathon Patent Group, Inc. (MARA), etc that is coming with prospects. They all are growing to capture regional as well as national market share by offering various type of products as well as services in the area of IP. However, as Google is very special one, very large one which are stepping in every corner in the glove to show business success and the recent price fall is a temporary price correction, which may turn up soon. I think the above price trend is a market correction due to profit taking by the investor.


text:
C# Corner
No new comments.
View All Comments
No new messages.
View All Messages
No new notifications.
View All Notifications
Email :
Password :
Remember me
Forgot password?
Login using
C# Corner
Request a new Category
View All
No tag found
Content Filter
Complexity Level
Refine by Author
Dhananjay Kumar (28)
Shivprasad (8)
Chandresh Pansuriya(4)
Freddy Mounir(4)
Dipal Choksi(4)
Chris Rausch(3)
klaus_salchner (3)
Shafiq Ahmed(3)
Saravanan Gajendran(3)
Ayman ElHattab(3)
Pawan Jajoo(3)
Manas Moharana(3)
Nipun Tomar(3)
Ravish Sindhwani(3)
Mahesh Chand(2)
Srikanth Kancharla(2)
Rifaqat Ali(2)
Sateesh Arveti(2)
Diptimaya Patra(2)
Subramanyam Rompicherla(2)
Dan Clark(1)
raviraj_bh (1)
santoshkumar.singh (1)
Hima Bindu(1)
Matthew Cochran(1)
Santosh Kumar(1)
Tariq Younas(1)
Scott Lysle(1)
Stev Chen(1)
Mubarag R(1)
Vijai Anand Ramalingam(1)
Bhushan Gawale(1)
Prasham Sabadra(1)
No resource found
Assemblies : The Ins and Out : Part I
Apr 13, 2001.
In Part 1, I will cover what exactly an assembly is, and what an assembly contains.
Assemblies : The Ins and Out : Part II
Apr 16, 2001.
In this part, I will discuss both Private and Shared assemblies and how to create a "Shared Assembly".
Assemblies : The Ins and Out : Part III
Apr 20, 2001.
In this part I will discuss in more detail than Part 2, the available utilities for manipulating assemblies.
The "ins" and "outs" of Using Stored Procedures in C#
Jan 27, 2003.
This article reviews the creation of stored procedures with parameters using the Visual Studio IDE.
Accessing Sharepoint Portal Server 2001 in .NET
Feb 19, 2003.
Sharepoint portal server provides a set of COM API that can be used to access its functionality from .NET applications via COM Interoperability. In this article, I will show you how to import SPP functionality in your .NET application.
Basics of Extending Your Working Environment in Visual Studio
Apr 10, 2003.
All of us have used Macros in Microsoft Office and Add-ins in Visual Studio 6 and I am very sure all of us have been impressed as well by their power to control their own working environment.
A Comprehensive View of SharePoint Portal Server 2003: Part I
Nov 05, 2004.
There are many portal solutions on the market, for example from IBM, Microsoft, Plumtree, Vignette, etc. Microsoft's latest portal solution is "Windows SharePoint Services" and "SharePoint Portal Server 2003". This article will not evaluate different portal solutions but rather explain how to use and develop for "Windows SharePoint Services" and "SharePoint Portal Server 2003" from Microsoft.
A comprehensive view of SharePoint: Part II
Nov 19, 2004.
Enterprise portals are an important part of today's enterprise IT infrastructure. Portals are used as an entry point for a specific topic, organization, project or team. Many enterprises have an enterprise portal, opened by default when an employee opens up a browser, which shows general information about the enterprise, its strategy, its departments, etc.
Talk to SharePoint through its web services
Dec 09, 2004.
Microsoft Office 2003 is very tightly integrated with SharePoint by utilizing its web services. Windows SharePoint Services comes with sixteen different web services. SharePoint Portal Server 2003 supports an additional five web services. The web services provided by SharePoint do provide a vast array of features.
Starting With Sharepoint
Feb 11, 2005.
Microsoft came up with an idea of "Sharepoint Server", and now it's only a matter of few clicks to build an enterprise-portal. This article shows you how.
Integration of InfoPath with SharePoint
Apr 28, 2005.
InfoPath is based on industry-standard Extensible Markup Language (XML). Extensible Markup Language (XML) is a condensed form of Standard Generalized Markup Language (SGML) that enables developers to create customized tags that offer flexibility in organizing and presenting information.
Creating Custom Templates in SharePoint
Jan 29, 2006.
This article is all about creating custom templates in SharePoint.
A Brief Overview of Sharepoint Portal Server 2003
May 16, 2006.
This article is a brief introduction of Sharepoint Portal Server 2003.
PDF Search in SharePoint
Sep 11, 2006.
This is a small article that tells users about the PDF search in SharePoint. I have not included the exact steps that need to be taken because that has already been published before on many sites including Microsoft's. My objective is tell users where to start looking for resources if they want to search PDF documents in SharePoint.
Creating a Workflow solution in SharePoint 2003
Sep 18, 2006.
There has always been a great demand for workflows in SharePoint. If you are a programmer, you can create a workflow solution of yourself and integrate it into SharePoint. In this article, I will give you some tips on how to create a workflow solution of your own.
Pull a column value from another list in your site in Sharepoint Portal Server
Sep 21, 2006.
In document and form libraries, you can create custom columns or metadata properties and interestingly, you can autopopulate these columns with data that can be hardcoded or extracted from other lists that are part of the same site where your document library is located.
Access Sharepoint Portal Server using Web Services in .NET
Feb 05, 2007.
This article discusses how we can leverage Sharepoint Portal Web Services to work with WSS in Microsoft .NET. The sample code used in this article shows how to access Lists Web Service to get the available lists in WSS. The sample code also shows how to add and update list items.
Introduction to Building a Plug-In Architecture Using C#
Sep 10, 2007.
In this article we'll take another look at how we can use the state pattern to build a plug-in architecture that will allow us to change the behavior of our application by placing differnt plug-ins into a folder.
Share Point Portal
Nov 08, 2007.
This article explains brief description on share point portal server.
Programmatically uploading multiple files to Custom sharepoint list in 2007
Nov 08, 2007.
This article describes step by step processes to create a webpart in share point server 2007, and using the same how to programmatically upload Multiple files to Custom Share Point List in Share Point Server 2007.
Sharepoint Workflow Custom Activity for Active Directory & Deployment on Moss 2007
Jan 16, 2008.
This article tells you how to create your own custom workflow activities as components using Windows Workflow Foundation.
Developing a Web Part for Moss 2007
Jan 17, 2008.
This article describes the step by step process to develop a web part for Moss 2007.
Understanding Connected World of MOSS 2007
Feb 27, 2008.
This article tells you the conceptual and real world industrial usage of MOSS 2007.
Features of WSS 3.0 and MOSS 2007
Mar 04, 2008.
This Article describes features of windows SharePoint services (WSS 3.0) and MOSS 2007. It describes basic difference between WSS 3.0 and Moss 2007.
Custom Theme Creation and applying in SharePoint (MOSS 2007)
Jan 05, 2009.
This article will explain step by step procedures to create a custom site theme and how to apply custom site theme to SharePoint site.
Site Definition in SharePoint
Jan 08, 2009.
This article will explain about Site Definition, why we do need custom site definition ?and how to create and deploy a custom site definition.
SharePoint Quick Start FAQ: Part I
Jan 13, 2009.
Below is quick start FAQ for people who are new to share point. We will warm up some theory in the first two articles and then do some practical on the same lines.
SharePoint Quick Start FAQ: Part II
Jan 14, 2009.
In the previous session of SharePoint article we had discussed about the basics of SharePoint. In this session we will - create site / site collection, understand the ready made functional reusable modules, learn how we can display a simple page and later apply master pages of SharePoint, host a Inline code and behind code page in SharePoint, understand the concept of features and understand step by step how to enable / disable a feature, how do display a feature in Admin.
SharePoint Quick Start FAQ: Part III
Jan 15, 2009.
This is my third series of SharePoint Quick Start FAQ. We will cover page templates , page instances , WSS model , understand safe mode processing , deploy custom controls and understand WebParts. So let's drink the SharePoint wine series by series, slowly , maintain the hangover and enjoy this great product.
SharePoint Customization Tricks: Part I
Jan 20, 2009.
This multipart series of articles is intended to help you get ramped up with SharePoint customizations. In this article we will see how to hide List View Toolbar Menu Items.
SharePoint Customization Tricks: Part II
Jan 26, 2009.
In this article, I'll show you another two tricks for customizing the list form toolbar.
6 basic steps of how to create a WebPart in SharePoint
Jan 26, 2009.
This is beginners tutorial of how to deploy a WebPart in SharePoint. It is a 6 step procedure and this tutorial will walk through the same. In case you are fresher to SharePoint you can read my FAQ articles listed below. I am sure within an hour you can get acquainted to SharePoint and get started.
SharePoint Customization Tricks: Part III
Feb 05, 2009.
This multipart series of articles is intended to help you getting ramped up with SharePoint Customization.
SharePoint Quick Start FAQ - Part 4
Feb 07, 2009.
This is my fourth series of SharePoint Quick Start FAQ. In this series the theme is WebPart , WebPart and WebPart J. So let's enjoy the WebPart bonanza.
Introduction to Visual Studio Add-ins
Mar 03, 2009.
This article explains about Visual Studio 2008 Add-ins.
Introduction to Interfacing Win Forms with VS Add-ins
Mar 04, 2009.
This article explains about integration of Windows Forms with Visual Studio Add-ins.
WSS 3.0 Installation
Mar 05, 2009.
This step by step guide shows how to install Windows SharePoint Services 3.0.
Paging and Sorting ListViews with ASP.NET MVC and jQuery
Mar 23, 2009.
This article provides a simple example of using jQuery along with the jQuery tablesorter and tablesorter.pager plug-ins to provide sorting and paging support for a listview within the context of an ASP.NET MVC application. JQuery has partnered with Microsoft and is now integrated within the IDE to include the availability of intellisense support.
SharePoint workflow basics
Apr 08, 2009.
In this article we will understand the basics of sharepoint workflow , the life cycle of sharepoint work flow and finally we implement a simple work flow using the three-state work flow which is available in share point.
SharePoint Quick Start FAQ: Part V
Apr 09, 2009.
This is the 5th tutorial of SharePoint FAQ series. This series will mainly concentrate on custom columns, content types and document list library. I am sure once your read this article your thinking of how SharePoint organizes document centralization will change.
8 Steps to create workflows using SharePoint designer
Apr 15, 2009.
Workflows are now an integral part for any project. You can build a SharePoint work flow using the available templates, SharePoint designer and using visual studio 2005 / 2008. This tutorial will mainly concentrate on work flow creation using Sharepoint designer. We will walk through the basic 8 steps needed to create work flows using Sharepoint designer.
Customize Site Action Menu in SharePoint
Apr 22, 2009.
This article shows how to Create Customize Site Action Menu in you SharePoint site.
Display information of current login user in sharepoint site
Apr 23, 2009.
This article shows how to display the credentials of the logged in used in Sharepoint.
Implementing Event Handler in Sharepoint
Apr 29, 2009.
This article shows how to Implement Event Handling in Sharepoint.
Changing the DNS or URL (host header) in SharePoint 2007 Site
May 05, 2009.
In this article we will see how to map the sharepoint site with public IP using Alternate Access Mappings.
Getting Started with WebParts in Sharepoint and ASP.NET
May 06, 2009.
This article discusses some basic concepts of Web Parts, their advantages, and how to use them.
Custom TimerJob in Sharepoint
May 11, 2009.
This article shows how to create a new entry automatically in your task list in the Sharepoint related to timer which you set.
Sharepoint Interview Questions and Answers
May 18, 2009.
Sharepoint Interview Questions and Answers
Embedding css file in custom Webpart in Sharepoint
Jun 08, 2009.
This article will show us how to use the Datalist in a webpart and embedding CSS file and classes in the webpart.
Understanding Generic WebParts in SharePoint
Aug 01, 2009.
This article is an introduction to Generic WebParts in Sharepoint.
Walkthrough on Attaching and Debugging Sequential Workflow using Visual Studio 2008 to a Document library of a SharePoint site
Aug 05, 2009.
Core purpose of this article is to explain, how to attach and debug a sequential workflow using Visual studio 2008(using object model) to a document library of a SharePoint site.
Walkthrough on Configuring SSP in MOSS 2007
Aug 05, 2009.
This article will give walkthrough step by step to how to configure SSP in MOSS 2007.
Theoretical introduction of SSP in MOSS 2007
Aug 05, 2009.
This article will give an overview of Shared Service Provider in MOSS. This will list out few of advantages of SSP and how they fit into MOSS architecture
Walkthrough: How to add user in a SharePoint site
Aug 10, 2009.
In this article, I am going to show step by step, how to add an existing windows user to SharePoint site.
Walkthrough on creating a Task List in SharePoint
Aug 10, 2009.
In this article, I will give step by step explanation of how to add a task list in SharePoint site. I am going to add a list in existing SharePoint site.
Programmatically Fetching User Name of SharePoint site collection using Object Model
Aug 11, 2009.
In this article, I will show you how to fetch all the user name of a SharePoint site collection using program or Visual Studio.
Adding Sequential Workflow to a document library of a SharePoint site using Visual Studio 2008
Aug 12, 2009.
Core purpose of this article is to explain, how to attach and debug a sequential workflow using Visual studio 2008(using object model) to a document library of a SharePoint site.
Programmatically adding document to SharePoint Document library
Aug 21, 2009.
In this article, I am going to add a document through code to a SharePoint document library. I am going to use SharePoint object model to add document.
Programming SharePoint List
Aug 21, 2009.
In this article, I am going to show how we could work with SharePoint items using object model or in other words using .Net code.
How To: Create a Generic WebPart in Sharepoint
Aug 21, 2009.
This article is a detailed description on how to create a generic webpart in SharePoint.
Parent Child Content Type using SharePoint Object Model
Aug 24, 2009.
In this article, I am going to show how programmatically Content type could be fetched. How we could manage parent child relationship of the Content types.
Defining Content Type in MOSS 2007
Aug 24, 2009.
In this article, I am going to give a walkthrough of how to define a custom Content type in MOSS or SharePoint.
Programmatically creating folder in SharePoint Document library
Aug 24, 2009.
In this article, I am going to create folder inside a document library using the SharePoint object model or in other words using .Net code.
List Events Handling in SharePoint 2007
Sep 07, 2009.
The objective of this article is to give a very basic explanation of how to catch an event on a SharePoint list and deploy them programmatically. I will achieve in this article "User will get error message; whenever any item will get deleted from a particular list ".
HyperLinkField in SPGridView using Moss 2007 Object model
Sep 14, 2009.
This article is going to explain : How to work with SPGridView, How to add HypeLinkField on a SPGridView, How to Put SPGridView on a web part.and How to deploy the web part on a sharepoint site.
Removing/Hiding the Web Part Title in SharePoint through Code
Sep 17, 2009.
This article is on very simple topic. In this article; I am going to show how to hide Web Part's title in SharePoint through code.
Multiple user insertion in Sharepoint list
Sep 23, 2009.
In this article, I am going to explain, how to insert multi user or more than one user in Sharepoint list.
How to start your Workflow manually in Sharepoint?
Sep 27, 2009.
This article and code snippet shows how you start a Workflow manually from your code.
Creating Custom Fields in Sharepoint
Sep 27, 2009.
This article shows how to add custom fields to Sharepoint.
Windows Firewall setting for SharePoint Site Access in LAN
Oct 10, 2009.
Windows Firewall setting for SharePoint Site Access in LAN
Adding CheckBoxes in SharePoint GridView (SPGridView)
Oct 29, 2009.
In this article, I am going to show how to add a checkboxes in SPGRidVIew. I will iterate through the SPGridView to find out the selected rows.
Populating name of files from SharePoint Document library in a drop down list
Nov 04, 2009.
This article will show how to iterate through SharePoint document library and list out all the file names and bind the list to a drop down list.
Introduction to Service Application Framework in SharePoint 2010
Nov 10, 2009.
Here in this article, I provide you an introduction to Service Application Framework in SharePoint 2010.
Introduction of SPPersistedObject class
Nov 11, 2009.
In this article, I will give a high level introduction of SPPersistedObject class and its uses. I will give one sample also to explain uses of this class.
Configuring connection string using SPPersistedObject
Nov 13, 2009.
In this article, I am going to show how to use SPPersistedObject to save connection string in config database of web application. I will also show how to configure connection string using ADMIN UI. We really do not need to go and configure the web.config manually.
Publishing an InfoPath Form to a Sharepoint Server
Nov 17, 2009.
In this article, we will see how can we publish an Infopath Form into a SharePoint Server.
How to Make More Than One URL Link to Your SharePoint Site
Jan 18, 2010.
In this article you will learn how to make more than one URL link to your sharepoint site
Multiple Attachment Custom Control in Sharepoint
Jan 19, 2010.
We will now explain the most important part of our Multiple upload attachment control implementation, which is the class that implements all the logic of our control.
Site Content Type in SharePoint
Jan 19, 2010.
This article describes about the creation and usage of site content type for libraries.
Creating message body by parsing document from Document Library and sending mail in SharePoint 2007
Feb 08, 2010.
This article will give an idea of, How to parse a document from Document Library and replace with dynamic values at run time, How to send mail in SharePoint using SPUtility class and Introduction of a real time problem to use above said features of SharePoint.
Cascading dropdown column in a SharePoint 2007 List
Feb 08, 2010.
This article will show how to use codeplex project to achieve Cascading drop down columns in SharePoint list.
Forms on SharePoint lists
Feb 17, 2010.
This article will give a very high level description on various forms on a SharePoint list.
Seven quick points in Understanding SharePoint 2007 list definition
Feb 22, 2010.
This article will give basic 7 theatrical points on SharePoint List definition.
Checking Improper DISPOSE in assemblies using SharePoint API
Feb 23, 2010.
In this article I will show how to check improper disposing of instance of SharePoint classes in an assembly.
Architecture of SharePoint for ASP.Net Developers
Feb 25, 2010.
This article will give a very high level pictorial introduction of Architecture of SharePoint for ASP.Net Developers.
How to publish a content type in SharePoint 2010
Feb 28, 2010.
In this article we will be seeing how to publish a content type in SharePoint 2010.
Adding Entries in SharePoint Web Configuration File using SPWebConfigModification
Mar 03, 2010.
This article explains about interaction with web.config through SPWebConfigModification API.
What is Business Connectivity Services - A Beginner View
Mar 12, 2010.
In this article we will learn what is Business Connectivity Services and take a look it's key features and some of the common usage scenarios.
Accessing domain user properties from a Sharepoint site
Mar 13, 2010.
This article describes a simple approach to determining whether or not a logged in user is a member of a group within the context of a Sharepoint Web based application.
How to Create a Custom Exception Error Page in Sharepoint
Apr 12, 2010.
In this article we will see how to create a custom unhandled exception error page in Sharepoint.
Deny anonymous access to library, lists and settings in Share Point 2007
Apr 15, 2010.
In this article we will see how to deny anonymous access to library, lists and settings in SharePoint 2007.
Customizing Alert Templates in SharePoint Foundation 2010
May 07, 2010.
In this article we will see how to customize alert templates in SharePoint Foundation 2010.
Sharepoint WebPart using ASP.NET web user control
May 11, 2010.
This is small article to provide the information that how you can connect to database from Sharepoint WebPart using ASP.NET web user control.
Working with the SharePoint Health Analyzer in SharePoint Foundation 2010
May 14, 2010.
In this article, we will take a look at the features of the SharePoint Health Analyzer in SharePoint Foundation 2010 and some details on extending it by creating custom Health Rules.
Using the AJAX Control Toolkit in SharePoint
May 24, 2010.
In this article I try to explain how we can use the Ajax Control Toolkit in Sharepoint.
Introduction to SharePoint Object Model
May 30, 2010.
In this article you will learn how toi us SharePoint Object Model.
Restrict a user to delete from a SharePoint List using Item Deleting Event Handler
Jun 03, 2010.
In this article we will see that how to use item deleting event to restrict a user so that he will not be able to delete the item of a sharepoint list.
SharePoint Site Dual Authentication - Window and Form Based (Using SqlMembershipProvider) with Anonymous Access
Jun 04, 2010.
In this article you will learn how to use SharePoint Site Dual Authentication - Window and Form Based (Using SqlMembershipProvider) with Anonymous Access.
Exception while creating the sub web
Jun 07, 2010.
In this article you will learn how to resolve security validation exception while creating the sub web.
Read a Sharepoint List using Object Model
Jun 10, 2010.
In this article we will see how to read from a sharepoint list using sharepoint object model.
About Stapling-in-SharePoint
File APIs for .NET
Aspose are the market leader of .NET APIs for file business formats – natively work with DOCX, XLSX, PPT, PDF, MSG, MPP, images formats and many more!
Hosted By
CBeyond Cloud Services
©2016 C# Corner. All contents are copyright of their authors.
Contact Us
Privacy Policy
Terms & Conditions
About Us
©2016 C# Corner. All contents are copyright of their authors.


text:
Stonington schools offer parents help
Stonington schools offer parents help
STONINGTON – A mother to three daughters — a kindergartener, second-grader and fourth-grader — Alicia Dawe knows the issues parents face.
"Being a parent is the hardest job in the world," said Dawe, the principal of West Vine Street-West Broad Street Schools. "Lots of things come up and you need support in many areas."
Dawe has created the Family and Community Collaborative, or F.C.C., for parents whose students attend the two elementary schools. The F.C.C. is a series of monthly workshops designed around specific academic, social and emotional issues.
The interactive, evening sessions are a way to help families manage needs they encounter throughout the year, she said.
"I wanted to give the families of Pawcatuck a free monthly workshop," Dawe said, "and they are centered on hot topics that we face as parents."
Topics have included Title I and "Social Thinking," a workshop that introduced strategies for parents at home on how to help students regulate their behavior.
Upcoming workshops will focus on "Safety" on Feb. 13, which Chief J. Darren Stewart of the Stonington Police Department will present; "Cozy Family Reading Night" on March 13, "Planning for Summer Camp/Summer Experiences" on April 10 and "Healthy Eating" on May 8.
"These are things that impact parents," Dawe said. "Conversations are erupting after the workshops, too, so parents are swapping stories and learning from each other."
Dawe said the workshops are drawing upwards of 20 parents, and providing a way for the West Vine and West Broad parents and the community to connect.
In November, Leanne Theodore, of Stonington Human Services, offered the workshop, "After School Homework Club and Other Opportunities."
"We are so grateful that Principal Dawe included Human Services within the workshop series," said Theodore, who is the human services manager and youth and family services administrator at the department. "Even though we mail out a bi-annual program guide to all Stonington residents, some families still are not familiar with the breadth of services we offer.
"From after school enrichment and recreation programs to free counseling services and energy assistance — the workshop provided a venue to connect, one-on-one, with families that may otherwise not have reached out to us."
Childcare is available during the workshops. For more information on the Family and Community Collaborative, visit the West Vine Street-West Broad Street School website or call the campuses at 860-599-5832 for West Vine, and 860-599-5633 for West Broad.
- State police suspend trooper following arrest
- Cash stolen from hospital room of boy battling leukemia
- Cat population got out of hand at Richmond home
- Shelter Harbor Inn auction canceled
- Borough OKs fence for controversial dog park
- State updates, replaces Richmond rest stop sign
- Gov. welcomes business to Westerly
- Hopkinton police charge Wakefield man with child abuse
- 2 injured in 1-car Liberty Street crash


text:
Ready to watch this entire course?
Become a member and get unlimited access to the entire skills library of over 4,900 courses, including more Web and personalized recommendations.Start Your Free Trial Now
- Overview
- Transcript
- View Offline
Skill Level Beginner
There will probably come a time when you want to style one specific element on a group of pages, such as a navigation bar, or a background color, or a logo, or even a footer that's displayed on every page of the site. This one element should be treated differently than anything else on your site. Now after you learn about class selectors, your immediate solution might be to create a class selector, and apply that class to the footer inside each page. But a more elegant and semantically correct approach is to give the element a unique ID, and then style just that specific element. The more specific you are with your rules, the less likely you are to have issues with something getting incorrectly styled. Now, in this particular example, this is what would show up in your actual style sheet.
Now the pound symbol identifies the selector as an ID selector. The text following the pound symbol is the ID of the elements. So the ID in this case is #divCopyright. That's the name of the ID. So the element that appears on your page with the divCopyright attribute will be styled with this particular font size, margin and text alignment. So for example, if this line appears in my XHTML code, <div id="divCopyright">, just like we see up here. The text that actually appears on this page is, "This is the site copyright." This text here will appear in font size of 10, margin of 1em, and text aligned will be centered. No other element in this page will have the same style applied to it, since ID selectors should be unique in each document. You should never have more than one element with the same ID. In some cases, it may work, but you might also have situations where it will crash browsers. So definitely do not use a single ID more than once per page. So let's go back to Dreamweaver.
So the power of ID selectors is that they let you target specific areas of your page for styling. So, in this movie we will take a look at the how to set IDs on elements that we want to style, as well as how to define these ID selectors to do the actually styling. I'm still working with the abouttea.html file we were working on a previous movies. Now, right now we have our layout inside of a table. So what we're going to do is we're going to style each of the table cells for the layout. Each cell will have an ID that uniquely identifies it on the page, and each table cell will get its own style, because this particular style holds the navigation. This one holds the logo, this one holds the main content, and this cell holds the links. By sending ID styles, it ensures that only one specific element gets styled. To begin using ID selectors, we need to add some IDs to the document. I'm going to click anywhere inside the table and down here in the Quick Tag Area I'm going to click the table tag to select the entire table. Down the Property inspector, I want to give my table an ID. And that field is right here. We'll call this tableLayout. You notice there's a menu option here, and this actually identifies all of the ID selectors defined in the style sheet, which is helpful because if you create your ID selectors first, then you can simply choose them from the pop-up menu. Since we only have created one so far, only one appears in here. Also, since ID selectors are case sensitive, choosing them from the menu here means you don't have to worry about typing them incorrectly. As a general rule, it's best to name your ID selectors with the tag first and then the purpose for that particular tag. So that's why I call this the tableLayout, because we're going to be redefining the table that contains the layout for the entire page. So, it's very descriptive to have tableLayout there. Okay, so let's go over to the CSS Styles panel and we're going to click New CSS Rule, and this time are going to make sure we have Advanced selected. And you're going to notice that since I just created that ID, that {italic}Dreamweaver{plain} has already filled out the information that I need here. It's got Advanced selected and the selector is #tableLayout.
and we want to make sure we attach this file to our current style sheet. Let's click on OK. Let's go over to the Background category. And for the Background color, I'm going to choose plain white. And we'll see how that looks in a moment. Let's go over to Border. I'm going to uncheck the Same for all option under Style, Width, and Color, because I want the borders around the top, right, bottom and left to be a little bit different in each case. I want the Style for Right to be solid. We'll make the width one pixel. Now, the color we're going to choose is going to be #B0B0B0, which is just a light gray color. I'm going to do the same thing for the left border.
We'll make it solid, 1 pixel and we'll choose that same color. And I'm going to go ahead and add this new rule by clicking OK. And you can see now that the table background has become white, while the page background remains that gray. And this radically transforms, and I think improves, the appearance of the page. This table layout selector we just created affects only the elements with that specific ID. So, because we applied that ID to this table, that style is automatically applied. If I preview this in my browser, I'm just going to make sure I save my styles first and then come in here and save this page, I'll preview this in my browser, hit a refresh and, there it is. And if you look closely, you should see the very thin, light gray border that we added the left and right side. Let's come back in here. Next, I want to make some changes to the navigation bar cell at the top of this page here. And we're going to define the style in the opposite order that we just defined the table in, just so you can see how you can create your ID selectors in both directions. So let's create the rule first, before we add the ID.
I'll come in here and create another new style. And we're going to call this #tdNavigation, for table cell. This is the navigation cell. Making sure we're defining this in our current style sheet. I'll click on OK. Let's go over to the Background area again. And let's set another Background color for this cell. And I'm just going to sample the color that's already in here, so the cell will actually match the color of the images in here. Let's go over to the Block category. I want to make sure that these buttons that we see here are going to be centered. So let's go to Text align > center. Even though it says Text align, it's also just regular alignment that applies to images as well. And let's go over to the Box category. In here I'm going to uncheck Same for all for Padding and I'm going to type 0 in the Bottom field. That's going to ensure that the navigation images are going to be completely flush with the bottom of the table cell. I don't want any gaps or spaces down there. And we'll be talking more about paddings and margins we get to the chapter on tables. Alright, let's click on OK. Now notice nothing has changed yet, even though that #tdNavigation style now appears in my style sheet, because we haven't added the ID to anything.
The ID definition is ready, but we haven't actually created the ID. So I'm going to click anywhere inside that cell containing the navigation. Click the <td> tag selector down here. I'm going to right-click on it, and from here, we can actually choose to Set ID, and this shows me all the IDs I've created on this page so far. And in this case, I want to give it the tdNavigation ID. Once I do that, the style takes over, and you can see it's now centered, the images are completely flush with the bottom, and the background color has been applied. Now let's set an ID for the cell containing the teacloud logo. I'm going to click inside there. I'm going to click <td> to select the entire cell.
And this is another way to set an ID. I'm going to come over here and open up my Tag Inspector. The Tag Inspector lets you see and edit all the attributes of a particular XHTML tag. Since there is no way to assign an ID to table cell from the Property inspector, notice we don't have an ID field here, like we did for the entire table, we can do this from the Tag Inspector. And I'm going to make sure the Attributes tab is selected here. I'm going to look under CSS/Accessibility. And in here, I can find an id field. And here's where I can add the actual ID for that cell. I'm going to type tdLogo, for table cell, and logo, because it's the cell containing the logo. And that's all I need to do. That's the equivalent of when we selected the table, and added the ID here. But again, there's no way to do that for a cell.
So you can to that from the Tag Inspector here. Now I need to create the actual rule. Let's go create another rule. And in this case, I want to have the #tdLogo as my selector. Click on OK. Let's come in here to the Background area, and I want that Background color to match the logo. So I'm just going to sample that. Let's go over to the Block category. And we also want that to be centered as well. And we'll go to the Box category again. And we're going to set the width of the box to 140 pixels. That's going to force the cell to become a little bit wider. And then we'll go ahead and click on OK.
And there it is. Because we added the ID to it, and once we created the actual rule for that ID, it was automatically applied. Alright, let's take a look at one more ID that we can set. And, in this case, we're going to set the style for the sidebar over here on the right hand side. We're going to click inside this cell. Select the <td> in the Tag Selector. And again, I need to give it an ID. So I'll come over here to my Tag Inspector, next to id. And we'll call this tdSidebar. And now I need to create a rule for the sidebar. We'll come in here and click the new rule. This will be #tdSidebar. Click on OK. And let's go to the Background field again. Background color we're going to use in this case is going to be #E3E5DC.
Now, I also have a Background image that I'm going to use here. So I'm going to Browse for background image. And under assets > Images > navigation, I have a file in here called sidebarbackground.gif, which we can see just looks like a faded bamboo image, which we're going to use for our background. So I'm going to select that. And I want to set up some properties for this image. I'm going to choose no-repeat from the Repeat pop-up menu, meaning that I don't want this background image to tile. I only want this image to appear once in the background of the cell. For the Vertical position, I'm going to choose bottom, meaning I want it to be lined up to the bottom of the cell. Now let's go over to the Block category. Under Vertical alignment, I'm going to choose top. This means that the content of the cell, not the background image I was working with, but in this case, these links, the content is going to be aligned to the top of that cell.
And let's click on OK and see what happens. And there it is, there is the image that I added. It looks like a nice little bit of bamboo there, and my links have been shoved to the top of the cell, because I said the vertical alignment for this particular cell should be at the top. Let's go ahead and save our changes to both our style sheet and our page. Let's take a look in our browser. Let me refresh this page. There it is. So this page is starting to look pretty good at this point. All of the table cells are properly styled using a minimum of CSS rules. So giving each of the table cells its own ID ensures that they're the only table cells that are affected by the new styles. So if I want to apply styles to other tables later on, I don't have to worry about the cells and those other tables being affected by the styles that I created with these IDs.
Let's go back to {italic}Dreamweaver.{plain} So, those are ID selectors. So, so far we've cover text and ID selectors. In the next movie we'll look at class selectors.


text:
Position Objective: Reps are paid part-time employees who implement grassroots and online marketing campaigns during the school year. They work with area businesses, tastemakers, DJs & promoters, peer networks, on campus student body organizations and media to create avenues of exposure for key WMG urban-leaning artists and projects. They offer an important "word from the street" perspective in their designated college campus communities and provide valuable consumer feedback and insight to our organization. Watch our video to learn more! http://youtu.be/rVeuNlkVggY
Position Responsibilities:
Education Required: Must be a currently enrolled student in good academic standing with at least two semesters left before graduation.
Required Competencies:
Required Tools:
OPEN MARKETS (Please only apply if your campus is within 45 minutes of a market listed):
**Please Note - If your Market is not listed check back again in one semester.**


text:
Adventures of Huckleberry Finn
by Mark Twain
Adventures of Huckleberry Finn Chapter 2 Summary
READ THE BOOK: Chapter 2
- Huck and Tom traipse through the dark. They pass the kitchen and see Jim, Miss Watson's slave sitting by the window.
- Welcome to the pre-Civil War South.
- Side note: Twain frequently uses the word "nigger" to refer to the black slaves. This is a testament to the times and a true record of vernacular in the setting. Shmoop is from a kinder, gentler time (we hope), so we'll be sticking with "the n-word."
- Jim hears some noises and comes outside to investigate.
- The boys freeze in place, and Huck makes the most astute comment ever: when you can't move, you always itch all over the place.
- Jim is determined to wait the situation out, so he sits down.
- And promptly falls asleep.
- Obviously, Huck and Tom can't resist this situation. They decide to punk him, and much hilarity ensues.
- Tom sneaks into the kitchen to take a candle, and leaves five cents on the table for payment.
- Honest kid.
- Then he takes Jim's hat off his (sleeping) head and hangs it on the branch above him.
- When Jim finally wakes up, he tells everyone that witches came and rode him all around the world.
- He becomes the famous authority for all things witch-related, which is knee-slappin' hilarious for Huck.
- Back to the night at hand: after setting the prank in motion, Tom and Huck pick up a few more of their friends and bring the boys to a cave in the woods.
- Fortunately, all Tom Sawyer does is start a gang. In a burst of creativity and selflessness, he calls it "Tom Sawyer's Gang."
- This is all fun and games until the boys have to sign a blood oath, which no one seems to have any qualms about.
- Obviously Tom got the idea from books about pirates and robbers and so forth.
- Someone thinks it would be a good idea to kill the family of any boy that breaks the oath.
- All agree.
- This creates some difficulties for Huck; we find that his father used to lie around drunk with the hogs and is nowhere to be found these days.
- Why is this a problem? It would render killing him a problem, in the event that he broke the oath.
- Huck, always a problem-solver, offers up Miss Watson instead, to everyone's great satisfaction.
- Tom says they're all supposed to be robbers, but they can't steal—that would be burglary, and very, very wrong. Again, he speaks with authority, having gotten all his information from children's fiction.
- Tom debates with one of the boys, Ben Rogers, about the proper way to ransom a person.
- Women are easy. You just bring them to your cave and are "polite as pie" to them. Obviously, they then fall in love with you while you're all waiting for them to get ransomed. (Twain probably had some inspiration for this.)
- What day to start the robbing and killing? Sunday is obviously out of the question, since that would be totally wicked. In the evil sense.
READ THE BOOK: Chapter 2


text:
Order Reprints
Journal: Sensors, 2012
Volume: 12
Number: 1398
Article: Use of a Real-Time Remote Monitoring Network (RTRM) to Characterize the Guadalquivir Estuary (Spain)
Authors: Gabriel Navarro, Isabel Emma Huertas, Eduardo Costas, Susana Flecha, Manuel Díez-Minguito, Isabel Caballero, Victoria López-Rodas, Laura Prieto and Javier Ruiz
Link: http://www.mdpi.com/1424-8220/12/2/1398
MDPI provides reprints in high quality with convenient shipping to destinations worldwide. The articles are printed in on premium paper with high-resolution figures. Our covers are customized to your article and designed to be complimentary to the journal. These reprints are ideal additions to your portfolio. Copy details: 135g/m2 paper, 2x stitched, full colour and glossy finish, orderable in quantities from 10 to 1000.
If you have any questions, or special requests, please write to email@example.com; we are happy to provide you with the information you need.


text:
Happy Redistributionist Halloween!
Steven Crowder delivers another YouTube gem.
Show this one to your kids. Mine laughed. They cried. It was better than a horror movie!
Posted in: Politics
Of course: Louisiana floods give Bill Nye opportunity to extend predictability streak
August 23, 2016 08:18 PM by Doug Powers
James Carville: The Clintons' pay-to-play schemes save lives so their critics better prepare to go to hell
August 23, 2016 10:13 AM by Doug Powers
America's pickled in Clinton corruption as Hillary performs feat of strength on Kimmel show
August 23, 2016 09:38 AM by Doug Powers
Candidate promising to battle 'urgent threat' of climate change uses private jet for 20-mile trip (Open thread)
August 21, 2016 10:41 AM by Doug Powers
Federal judge gives Hillary Clinton 30 days to come up with lies in response to lawsuit questions
August 20, 2016 05:54 AM by Doug Powers
Categories: 2016 Campaign, Corruption, Democrats, Hillary Clinton


text:
"Real Housewives of New Jersey": TV Recap
This week, the "Real Housewives of New Jersey" explored the issue of inequality.
Specifically, housewife Teresa was born without breasts. She says her cup size is "minus-A" and decides she wants to rectify the situation with implants even though her husband is "an ass guy," as she so eloquently reveals.
But, OMG, housewife Dina has the opposite problem. She is married to a boob-lover, and has had implants twice—the first time saline, the second time, silicone—yet longs for the halcyon days when she was less top-heavy. "They're annoying…They're obnoxious," says Dina of her breasts. She warns Teresa not to "go too big" because "it's a fine line between tasteful and tacky." (Ultimately, Teresa decides to "Go big or go home" as they say in the Midwest, and gets a C-cup.)
(All of this made me wonder: what would happen if Dina got a breast reduction, and Teresa got a breast augmentation and then—in a titillating twist—they decided to switch husbands? Unfortunately that is the subject for another reality show.)
Back to the storyline: Teresa's implant epiphany arises while she is trying on leopard print bathing suits in Atlantic City, where she and the buxom Manzo sisters Caroline and Dina have escaped from the tyranny of Danielle, the neighborhood divorcee, who—in a not-so-shocking revelation—was once a stripper named Beverly. As such, the classy ladies of Franklin Lakes decide that they must shun her. It is unclear why this is all such a scandal since 1) Teresa has dreams of installing a stripper pole in her bedroom and 2) Caroline has a son whose entrepreneurial dreams consist of opening a strip joint in New Jersey and, last but not least, 3) Dina owns a hairless cat that is apparently named Grandma Wrinkle. Whatever!
Teresa's daughters, left at home with dad, are freaking. Seven-year-old Gia calls mom while she's unpacking to report that her younger sister—the oddly named Milania—is screaming "Mama! Mama!" Teresa, who may yet become a 21st century Dr. Spock, offers to buy Milania a blue teddy bear and a bicycle and then dispenses the best parental advice ever. "Give her a lip gloss or something," she tells Gia.
Meanwhile, Jacqueline is trying unsuccessfully to be the Garden State equivalent of Switzerland. She skips the trip with the gals to Atlantic City to spend time with her bratty teenage daughter and take Danielle out for dinner for her birthday. Over drinks, Danielle refers to her ongoing feud with Dina as an "open wound," while Jacqueline looks away and says she can't talk about her sisters-in-law to others.
Finally, Teresa and the Sisters Grim return from Atlantic City, where they rejoin Jacqueline and take a trip to see Dr. Robert Zubowski, who Teresa determines is sufficiently good looking to cut open her chest and implant foreign objects inside of it. "I wouldn't want some ugly doctor touching my body," she says.
On the way to the hospital, Teresa and her husband have a heart to heart.
Teresa: Want me to try on lingerie for you?
Joe: What's the point of puttin' it on?
Teresa: What's it called? Preplay?
They then realize the word she was looking for was "foreplay," and laughter ensues.
Post-op, Joe visits Teresa in recovery wearing a black t-shirt with a giant eagle across his chest. He compliments Dr. Zubowski on his work. Teresa, who may or may not be under the influence of anesthesia, tells her husband that she wants him to be her nurse and "wear a cute outfit, maybe a thong" while she's convalescing. Upon hearing this, Dr. Z seems to get a scary visual. Wearing his hospital scrubs, he starts walking slowly backward. Then again, maybe it's just because he was paid in cash.
Next week: Teresa's breasts endow her with the power to overturn a table in a fit of rage.


text:
Honda is issuing a recall for approximately 344,000 Odyssey minivans from the 2007 and 2008 model years for an error in the Vehicle Stability Assist system that can cause sudden, hard braking without the driver depressing the brake pedal, and without the rear brake lights illuminating. The issue involves the calibration of the yaw sensor, and the sensor sometimes not properly resetting after a vehicle restart. The sudden release of pressure into the braking circuit could potentially increase the risk of a crash, although Honda says it has not received any reports of crashes or injuries.
Due to the number of units subject to the recall, a sufficient supply of replacement parts will not be available until spring 2014. In the meantime, Odyssey owners will receive an initial recall notice, and instructions on how to ensure proper VSA calibration to prevent potential unintended braking. When the replacement parts become available, affected owners will receive a second notice of parts availability and to take their vehicle to a Honda dealer for repair. Affected owners can check to see if their vehicle is subject to the recall in early December by visiting recalls.honda.com, or calling 800-999-1009, option 4.
Source: Honda


text:
UNION COUNTY — Literacy Volunteers of Union County, a non-profit organization that helps adults to improve their reading, writing or English conversation skills, is recruiting new tutor volunteers.
January Events at the Visual Arts Center of New Jersey
by staff report •
SUMMIT — The Visual Arts Center of New Jersey offers several opportunities to create, learn about, and view art this month. The Winter Semester of studio art classes begins on Monday, Jan. 10.
Piscataway Sixth Grader Wins National Blogging Competition
by staff report •
EDISON — Anuva Goel of Piscataway, a sixth grader at The Wardlaw-Hartridge School in North Edison, has been named a winner in the National Geographic Dogeared Blogger Contest.
Rahway Announces Talent Show Audition Date
by staff report •
RAHWAY — The Rahway Recreation Department will hold an audition for its annual talent show on Friday, Jan. 28 at 6 p.m. Singers, dancers, rappers, bands, comedians and other performers are invited to try out for the April event.
As More Snow Falls, More Blood Donors Are Needed
by staff report •
STATE – January is National Blood Donor Month, and New Jersey Blood Services (NJBS), a division of the New York Blood Center (NYBC) is urging the communities it serves to donate today and help to replenishment the blood supply, which is critically low after the recent blizzard caused the cancellation of many drives.
Linden Commemorates Dr. Martin Luther King, Jr.
by staff report •
LINDEN – Linden's Dr. Martin Luther King, Jr. Commemorative Committee will hold its 26th annual ceremony commemorating the life of Dr. Martin Luther King, Jr.
January Is Cervical Health Awareness Month
by staff report •
TRENTON–In observance of Cervical Health Awareness Month, the New Jersey Department of Health and Senior Services is reminding all women to speak with their health care providers to learn what can be done to help prevent cervical cancer.
All Seasons Chamber Players To Perform At Barron Arts Center
by staff report •
WOODBRIDGE — The All Seasons Chamber Players return to perform at the Barron Arts Center on Friday, Jan. 28 at 8 p.m. Admission is free with a suggested donation of $5.
Edison To Celebrate Dr. Martin Luther King, Jr.
by staff report •
EDISON – Edison will present Rochel Garner Coleman in "Shadow Ball – The Legend of Cool Papa Bell", to commemorate the birthday of the late Dr. Martin Luther King, Jr. and to celebrate the upcoming African-American History Month.


text:
- Report: #761124
Report - Rebuttal - Arbitrate
Complaint Review: Fast Growing Trees
Fast Growing TreesCharlotte, North Carolina United States of America
Fast Growing Trees Total Rip Off - Not Size Ordered and Tree Did in 1 week and they will not give refund or replace! Charlotte, North Carolina
Ripoff Report
About you?
Ripoff Report
A business' first
line of defense
on the Internet.
If your business is
willing to make a
commitment to
customer satisfaction
Click here now..
Does your business have a bad reputation?
Fix it the right way.
Corporate Advocacy Program™
This report was posted on Ripoff Report on 08/04/2011 07:22 PM and is a permanent record located here: http://www.ripoffreport.com/r/Fast-Growing-Trees/Charlotte-North-Carolina-/Fast-Growing-Trees-Total-Rip-Off-Not-Size-Ordered-and-Tree-Did-in-1-week-and-they-will-761124. The posting time indicated is Arizona local time. Arizona does not observe daylight savings so the post time may be Mountain or Pacific depending on the time of year.
Ripoff Report has an exclusive license to this report. It may not be copied without the written permission of Ripoff Report.
Click Here to read other Ripoff Reports on Fast Growing Trees
If you would like to see more Rip-off Reports on this company/individual, search here:Search Tips
In order to assure the best results in your search:
- Keep the name short & simple, and try different variations of the name.
- Do not include ".com", "S", "Inc.", "Corp", or "LLC" at the end of the Company name.
- Use only the first/main part of a name to get best results.
- Only search one name at a time if Company has many AKA's.
Advertisers above have met our
strict standards for business conduct.