text:
So my question is how soon after a vaginal birth can you take a shower? How about after a c-section?
I have plans to jump in the shower real quickly before I head to the hospital on the big day but I fear I may have to go two days or more without showering


text:
Temporary Price Drop
Sale Price
$247.33 -
List Price: $269.95
Was: - (Save )
Ends: Today at ET!
You save 8%
HN-KALO019 Kalokids
Kalokids Back to Nature Ladybug 2 Seat SofaItem # HN-KALO019
Roll over to zoom
Click for full screen
- Modular 2-seat sofa
- Vinyl upholstery with ladybug and sunflower graphics
- Stain-resistant and easily wipes clean
- Provides posture support for kids and adults
- Recommended for ages 3 to 10
Full Description
Delivery Estimate
Guarantee & Returns
Recommended Accessories
Kalokids Back to Nature Ladybug 3 Seat Giant Sofa
Kalokids Ocean Life Turtle 2 Seat Sofa
Kalokids Ocean Life Turtle 3 Seat Sofa
Kalokids Ocean Life Seahorse Pouf
Kalokids Ocean Life Marine Armchair
Kalokids Ocean Life Turtle 2 Seat Sofa with Arms
Show All 8 Recommended Accessories Collapse Recommended Accessories
Similar Daycare Tables & Chairs
Anatex Deluxe Mini Cube Activity Center
Jonti-Craft Ridgeline Rectangle Activity Table
$119.99 - $254.95
KidKraft Farmhouse Table and 4 Chair Set
KidKraft Rectangle Table & 2 Chair Set
$117.98 - $118.36
Wood Designs Childrens Chair - Natural - Set of 2
$102.99 - $206.99
Hoohobbers Gofer Folding Lap Table
$65.00 - $70.84
Customer Reviews
Earn up to $3 in My Reward points
for reviewing this product when you join My Hayneedle Rewards
Write a review
200 points for each review = $2
300 points for reviews including an image or video = $3 Learn More
for reviewing this product when you join My Hayneedle Rewards
Write a review
200 points for each review = $2
300 points for reviews including an image or video = $3 Learn More
Customer Q & A
Be the first to ask a question about this product.
Enter your question, and one of our Customer Care experts will respond via email and also post the answer here.
Ask a Question
Email Address
Please Enter
Your Valid Email
Your Valid Email
Your Question
Please Enter
Your Question
Your Question
Sponsored Links
Kalokids Back to Nature Ladybug 2 Seat Sofa
Create a cozy reading and storytelling area that kids will love to hang out in with the Kalokids Back to Nature 2 Seat Sofa. This sofa is the perfect addition to single chair seating for adding variety to possible seating arrangements. The ladybug and sunflower graphics on the backrest coordinate perfectly with the other Kalokids Back to Nature seating. The durable vinyl upholstery easily wipes clean, making it ideal for heavy use, and the simple design provides ergonomic support to both kids and adults. &

subset: commoncrawl


text:
"This accomplishment is a key step toward the important goal of mapping neural circuit dynamics on a millisecond timescale to see if impairments in these dynamics underlie severe psychiatric symptoms," said National Institutes of Health (NIH) Director Elias A. Zerhouni. "The work is also a prime example of the highly innovative approaches to major challenges in biomedical research that we support through the NIH Director's Pioneer Award program."
Karl Deisseroth, an assistant professor of bioengineering and of psychiatry who led the research group that authored the paper, received the NIH award in 2005.
"This research provides a tool that we didn't have before, which is precise on-or-off control over specific neural cells in living creatures and intact circuits," says Deisseroth, whose Stanford research group collaborated with researchers at the Max Planck Institute of Biophysics, the Johann Wolfgang Goethe University in Frankfurt and the University of Würzburg in Germany. "This gives us the power to ask what the causal role of specific cell types is in neural circuit function."
Knowing the effects that different neurons have could ultimately help researchers figure out the workings of healthy and unhealthy brain circuits, explains graduate student Feng Zhang, a lead author of the paper along with Stanford postdoctoral scholar Li-Ping Wang.
Source:Stanford University


text:
Sunday, October 4
By Nyketa
Full Story »
By Don Juan Fasho
By Darnella Dunham, Senior Producer
By Jonathan Hailey
By DJ Skillz
By Russ Parr
By Wiz Nation
Copyright ©2015,
Interactive One, LLC . All Rights Reserved
Powered by WordPress.com VIP
Get every new post delivered to your Inbox.
Join 826 other followers


text:
Latin American
AVEVA Opens Office in Chile
AVEVA (LSE:AVV), announced on June 18, 2012 that it has further expanded its Latin American presence by opening an office in Chile. The office in Santiago de Chile will also be the location for AVEVA's Mining & Metals Centre of Excellence (MMCoE). The Chilean office will serve a number of Latin American countries providing sales and support for AVEVA's entire product and solution portfolio. The new MMCoE will act as a global resource, working with customers in Latin America, Australia and other mining intensive regions. "Chile is a very key location for AVEVA in Latin American," said Santiago Pena, Senior Vice President of Latin America, AVEVA. "As our main hub for the Mining, Metals & Minerals industry it will also serve our customers in Argentina, Paraguay and Uruguay. The new Mining & Metals CoE is being established here to take advantage of the extensive local industry knowledge, both within AVEVA and with our customers. The MMCoE will develop customised applications and configurations for the Mining, Metals & Minerals industry, as well as special projects for our Plant customers. Our Chilean team is very customer focused and with the Latin American market, experiencing dramatic change, it is their mission to help our customers meet challenging technical and business objectives."
CP Ships to Acquire Nordana Line
CP Ships, one of the world's top ten container shipping companies, has reached agreement with Dannebrog of Denmark to acquire Caribbean/Latin American market specialist Nordana Line. The acquisition includes Nordana's business and services and its 10,000 teu container fleet. It also includes the time charter of three roll-on/roll-off ships owned by Dannebrog and the sub-charter of three chartered-in ships. "The acquisition of Nordana Line is a good example of one of the principal elements
Viking Life-Saving Equipment Expands to Panama
VIKING has announced the next step in its continued global expansion with a Latin American sales and service facility at Colon, Panama. Leading marine safety equipment provider VIKING Life-Saving Equipment has announced the addition of a Latin American sales and service facility located at Colon, Panama on November 1, 2011. The move to establish a presence in Panama is another step towards fulfilling VIKING's goal of expanding its network to include more service and stock
As the Reefer Market Grows, Hapag-Lloyd Invests Record Volumes
Largest reefer order in Hapag-Lloyd's history spurred by growth opportunities in the South American trade lanes Hapag-Lloyd is investing a double-digit million amount in its container fleet and has ordered 6,000 (12,000 TEU) of the latest generation of reefer containers. The Company is already one of the largest reefer carriers in the world today. This strong position will enable Hapag-Lloyd to benefit from increasing transport volumes not just on East-West trades
Need for Latin American Transport Infrastructure Investment Highlighted
TT Club's Senior Underwriter, Dan Negron, speaking at the recent TOC Americas Conference in Miami outlined his views on future Latin American trade growth and the pressures that this will create on the region's transport infrastructure. Excerpts from his address follow: "Two examples of robust economies are Colombia and Peru. The latter has grown its export trade by a multiple of five over the last decade
Hapag-Lloyd Orders 5 Ships for More Panama Canal Trade
Ship container line Hapag-Lloyd has placed an order for five vessels as it looks to bolster trade in Latin America ahead of next year's planned expansion of the Panama Canal, the world's fourth biggest player said on Monday. Workers are installing 22-storey lock gates to accommodate larger container ships through the canal, one of the world's busiest maritime routes, which plans to open on April 1 2016.
APM TEC2 Receives Cranes
The first three of the world's largest and most technologically advanced Ship-to-Shore (STS) container cranes and two rail mounted cranes for the intermodal rail facility have been delivered to APM Terminals' Lázaro Cárdenas (TEC2), now in the final stages of construction at Mexico's second-largest container port. The terminal development milestone was commemorated by a ceremony held in Mexico's capital city
Port Leaders To Focus on Trade and Security at Convention
Port authority leaders from across the Western Hemisphere will gather from September 22 - 26, 2002, at the Breakers Hotel in Palm Beach, Florida, to address issues such as trade trends, maritime security, financing requirements at ports, and cruise operations. The 91st Annual Convention of the American Association of Port Authorities (AAPA) is expected to attract up to 800 delegates and guests to Palm Beach. The Port of Palm Beach will serve as host and plans a number of social events to
Volvo Penta Targets Marine for Growth
Ron Huibers has been on the job as president of Volvo Penta Region America for just more than six months, but upon entering the position in the autumn of 2013, the goal for the engine industry veteran was clear: "We have the mandate to grow the business substantially; we want to double the business in the next few years." A strong brand in the leisure marine segment, Volvo Penta is now making the moves it believes will help it fortify and extend as a player in the commercial
Bender to Repair Pemex Semi-Sub
Bender Shipbuilding & Repair Co., Inc., signed a contract with Pemex, the national oil company of Mexico, for the repair, refurbishment and dry docking of Pemex's semi-submersible accommodation/maintenance vessel, the PSS Chemul. The 13,000 ton Chemul was recently drydocked in Mobile on the Mobile Heavy Lifter, a submersible heavy lift barge chartered in by Bender for the docking of the semi. Chemul was then towed to the work site at Bender's Yard 9
Hapag-Lloyd Adds 6,000 Reefer Containers
In order to profit from the growing reefer markets in South America and Asia, Hapag-Lloyd has ordered 6,000 cutting-edge reefer containers – more than ever before in the company's history. Hapag-Lloyd is gearing up for the temperature-sensitive cargo business in the important
Traders Scramble for Caribbean Crude Storage
Demand for crude storage in the Caribbean, one of the world's most important oil hubs, is rising as producers and traders try to ride out the worst price crash in six years by holding onto more barrels or making blends that can be sold for premiums.
APM Terminals Enters Colombia
APM Terminals and Colombian-based port and terminal operating company, Compañia de Puertos Asociados S.A. (Compas S.A.) have signed a joint venture agreement to jointly manage and operate Compas S.A.'s existing multipurpose Cartagena Terminal.
Almarin: 85 Years Strong
Your company is celebrating its 85th anniversary this year. Please provide an overview of your activities. The Lindley group of companies began its activities in 1930 with the establishment of Ahlers, Lindley, Lda. as a distributor of harbour and industrial equipment in Lisbon
Carnival's Fathom Names Senior Sales Leader
Carnival Corporation's new brand Fathom has appointed Michelle Sutter as a company senior sales leader. Sutter will be responsible for marketing and business development supporting sales of the new "social impact travel" brand.
Vallianz Bags $ 458 Mln in Charter Renewals
Vallianz Holdings Limited a fast growing provider of offshore support vessels and integrated marine solutions to the oil and gas industry, has signed new contracts valued up to US$458 million that has lengthened the charter duration for 19 of its offshore support vessels currently deployed
Container Shipping Lucky to Break Even in 2015
A toxic mixture of overcapacity, weak demand and aggressive commercial pricing is threatening liner shipping industry profitability for the rest of 2015, according to the Container Forecaster report published by global shipping consultancy Drewry.
Ecopetrol Breaks Silence in Risk-on Day for LatAm Markets
A recovery in LatAm debt spreads opened a window for Colombia's Ecopetrol on Tuesday when it printed a US$1.5bn 11-year bond - the state-owned oil company's first debt issue in nine months. Optimism over Greek debt talks spurred risk buying on Tuesday
Hapag-Lloyd Orders 5 New Containerships
When the expansion of the Panama Canal is complete, liner shipping companies will finally be able to use larger vessels. Hapag-Lloyd has therefore ordered five state-of-the-art ships. Hapag-Lloyd has ordered five modern container ships from the South Korean shipbuilder Hyundai Samho Heavy
Tanker Demand Picks-up in Canada
Canada's role in the oil industry has changed dramatically in recent years driven by synthetic crude oil production in the oil sands of Alberta. New plans for Energy East, a cross-Canada West to East pipeline with a capacity of 1
CMA CGM Upgrades Gulfbridge, Hispaniola Lines
Container shipping company CMA CGM Group announced its Gulfbridge service upgrade, and its Hispaniola feeder service optimization. The CMA CGM Group upgrades its Gulfbridge service between the Gulf of Mexico and the Caribbean area
Danelec Marine Expands in Latin America
Voyage Data Recorder (VDR) supplier Danelec Marine today announced it is adding two new distributors in Brazil and Mexico to expand its distribution in Latin America. Telnav Telecomuniçacões Navais, in Rio de Janeiro, Brazil, and Indumar, based in Veracruz, Mexico
CMA CGM Box Ship is the Largest to Call Brazil
CMA CGM reinforces its position in Brazil, introducing the largest vessel in terms of TEU capacity to ever call Brazil Containership CMA CGM Tigris, one of the newest vessels in the CMA CGM fleet, is due to call the Port of Santos on February, 6
Zamakona, Finnish GS-Hydro Ink Deal
The presentation ceremony of the Finnish multinational leader in water services GS-Hydro, new partner of Zamakona Yards in Canarias was held yesterday (January 29th at 7 p.m.) in the auditorium of Zona Franca in the Las Palmas Port.
Investors Gamble Forest Preservation Will Pay Off in Carbon Markets
Some private investment companies are looking to profit from preserving forests in developing countries, betting that the emissions reductions can be sold in future carbon markets. London-based Permian Global said on the sidelines of U.N


text:
a.d. | 009
"Op. in Los" | written & performed by ALEC DREISER
additional noise, mastering & production by CARLO MARRONE
video realized by GIANLUCA T. ZENONE
creature sequence
performed by OPHELIA QUEEN & GABRIELE MILIA
videography ANDREA DE TADDEO
mua OPHELIA QUEEN
produced by: echelon_inc. (cc) 2013
Loading more stuff…
Hmm…it looks like things are taking a while to load. Try again?


text:
Bay Bridge Opening In Question and Asiana Crash Update
Watch Complete Episode: July 12, 2013 »
Two days after transportation officials announced that the Bay Bridge opening would be delayed until December, an independent review panel proposed a surprise interim fix that would allow the span to open on Labor Day or sooner. The plan calls for installing steel plates -- shims -- in gaps between bearings to prevent them from swiveling. We also get an update on new revelations about the Asiana Airlines Flight 214 crash at San Francisco International Airport.
Also on KQED.org this week ...
Jacques Pépin Heart & Soul
Jacques Pépin Heart & Soul is chef Jacques Pépin's final television cooking series. Get recipes, view behind-the-scenes photos and more!
KQED Celebrates Latino Heritage Month
In September, KQED proudly celebrates the diversity of our community with special Latino Heritage Month programming. These programs are highlighted in a guide along with information about community events.


text:
Search Checkatrade for suitable tradespeople and add them to your list for them to call you back.
Sign in to retrieve a saved callback list.
Corder Remedial Services is a family run business with over 20 years experience in the industry that offers a professional and high quality service to the public and the trade, we specialise...
Plastering, rendering, damp proofing, condensation control, wood worm, wet rot, dry rot.
Welcome to Lewis-Bradbury.Lewis-Bradbury is a Specialist Damp-Proofing & Timber Treatments company based in Brighton, Sussex. We cover Brighton, London, and the South East. We are approved...
At BWT South East Ltd we specialise in remedial services to fight timber and structural degradation. With a combined experience of over 30 years we pride ourselves on being customer focused,...
The Woodworm Firm are specialists in all different types of woodworm treatment and eradication. We pride ourselves on being punctual, polite, honest, environmentally friendly and all with...
Plastering, skimming, damproofing, ceilings skimmed, artex skimmed, patch plaster, exposed brickwork, plaster boarding, bonding, rendering, coving, decorative mouldings, tiling and painting.
The DPS Group - Brighton & Hove Based, fully insured and highly regarded Property Maintenance Company. Decoration, Building, Damp Proofing, Wood Rot Treatment, Plastering. FREE quotations.
JCJ Construction is a reputable main contractor operating throughout Sussex. Our values of accuracy, quality and transparency set us apart from the competition.
Based in London, covering the surrounding areas, The Damp Company (UK) Ltd offer 17 years experience in comprehensive damp solutions for rising, penetrating, condensation and ingress damp.
Specialises in older properties.Insurance backed guarantee on all work.We were recently featured on DIY SOS for the BBC - please see the link below for pictures and further...
I have been trading for the last 20 years and have over 25 years experience.
Please contact me for a free no obligation quote.
Hi My name is Paul Voller and I have been in the building industry for 26 years in this time I have gained a massive amount of knowledge of properties new and old and the way they are...
Independent local company based near Horsham and covering Sussex and Surrey. Member of the Property Care Association (PCA) and offering Insurance Backed Guarantees
Surrey Hills Preservation provide a specialist comprehensive service for Damp treatments, mould, condensation control, tanking, basements, re-pointing and plastering.
Providing the
Property Care Association fully qualified technician. Small family business based in Dorking. Friendly, honest & reliable.
We offer damp proofing & plastering services in Surrey &
Allbright are a family run business who specialise in all aspects of Plastering and Decorating.
We undertake Domestic, Commercial and Insurance work. Our main goal is to provide a
We specialise in damp proofing and woodworm treatments and we are proud to use traditional methods, tools and equipment.
We specialise in Damp Proofing, Condensation Control, Structural Waterproofing, Woodworm, Dry/Wet Rot, Structural Repairs, Remedial Works, Plastering & Rendering. Call 07561 528318.
We have 10 years experience in damp proofing and timber treatment in Hampshire including;
Rising damp
Water proofing
Basement tanking
Condensation control
Woodworm treatment
Welcome to Templar Developments Ltd.We provide a complete construction service tailor made with the customer in mind from thought to finish. We pride ourselves on the ability of our fully...
Customer feedback and scores for all to see
No registration required to view and contact our members
nationwide to choose from


text:
50 Favorite Weight Watchers Recipes
Whether you're craving a creamy casserole or chocolate fudge, get ready to indulge with these popular guilt-free Weight Watchers recipes. Plus, find more low-point faves here »
of photos
Pumpkin Muffins
"These are awesome! It's hard to believe just three ingredients can make such wonderfully delicious muffins." -Tiffanee
Recipe by nad smithGet the Recipe
Photo by May I Have That Recipe


text:
1 / 5000
151012-N-WJ261-067 NORFOLK (Oct. 12, 2015) Rear Adm. Christopher W. Grady, Cmdr. James Quaresimo and Command Master Chief Michael Fisher carry a wreath at the USS Cole Memorial during a ceremony at Naval Station Norfolk. This ceremony commemorates the 15-year anniversary of the Oct.12, 2000 terrorist attack on the guided-missile destroyer USS Cole (DDG 67). (U.S. Navy photo by Mass Communication Specialist 3rd Class Amber Donnelly/Released)
wreathlaidUSSColememorialcommemorateyearanniversaryOct.2000attackNavynavalshipcolebombingpeoplesailorsterrorismMultiple-Exposures-Media, from


text:
Select Local Merchants
Nashoba Valley WineryRead MoreNashoba Valley Winery serves American-style cuisine in the middle of Bolton's Bolton district. Plan to indulge a bit at Nashoba Valley Winery, though, because they don't offer any low-fat fare. Nashoba Valley Winery is a suitable restaurant for both large and small groups. Reservations are offered, so call ahead to lock down your table. No need to be formal, business casual will pass. null Nashoba Valley Winery is a little bit on the pricey side, so save it for a special night out. Chow down on breakfast, lunch, or dinner fare at Nashoba Valley Winery — they're open for all three meals.100 Wattaquadock Hill RoadBolton, MA US
Taylor Brooke WineryRead MoreFill up on fare from Taylor Brooke Winery in Woodstock and be sure to satisfy your stomach. We'll let you park onsite to help get you closer to our scrumptious menu. Taylor Brooke Winery offers parking for all diners, including those who travel by bike. No matter what you choose off the menu at Taylor Brooke Winery, you won't completely break the bank with prices averaging around $30.848 Route 171Woodstock, CT US
Sharpe Hill VineyardRead MoreSharpe Hill Vineyard may sit in the sleepy town of Pomfret, but that hasn't done anything to diminish the winery's international profile. Its wines have racked up more than 250 medals over the years, and with good reason. The Ballet of Angels vintage alone has won 15 awards; critics far and wide have spoken highly of the semi-dry white's citrusy blend with notes of peach, pear, and grapefruit. But that's just one of the vintages crafted by winemaster Howard Burnsen, who draws on 25 years of experience to create an eclectic variety of wines. The rich Cabernet Franc, for instance, pairs nicely with chocolate desserts and chocolate-covered vegetables, while the St. Croix, a dry red, pairs best with beef and lamb. Try out any of these pairings at the winery's own Fireside Tavern restaurant.108 Wade RoadPomfret, CT US
Harvard Wine Co.Read MoreGrab a seat and dig in! Harvard Wine Co. in Cambridge offers tasty eats everyone will enjoy. Harvard Wine Co.'s patrons can find places to park in the area. Heading to Harvard Wine Co.? Hop aboard one of the many nearby transit options, including Porter Square (Fitchburg/South Acton) and Porter Square Station (Red). The average check at Harvard Wine Co. will stay below $30 per person, so it's a relatively affordable option.1664 Massachusetts AveCambridge, MA US
Prp Wine InternationalRead MoreCocktail enthusiasts will be happy to know that Prp Wine International has affordable and tasty liquor and spirit options. With an eye for convenience, Prp Wine International is located centrally to available parking.82 Spring StreetEverett, MA US
Shelalara Vineyards & WineryRead MoreAt ShelaLara Vineyards & Winery, vintners work with modern equipment to produce more than 20 different wines. Using grapes and fruit imported from California and other sun-soaked regions, the enophiles fill tanks with sweet elixirs including their in-house specialty wine slush. The glacier wines, fruit essences, and vintage wines run a colorful gamut from the off purple of the sky just after sunset to the hue of warm honey. ShelaLara's winemaking process, including fermentation, bottling, and 21-gun salutes following spills, all takes place in Rhode Island.21-B Reservoir Rd.Coventry, RI US


text:
So that s high in saturated fats such as food items come at quite an affordable price. Eating a healthy meal. If you, I am a graphic designer and I donít get it from drying. According to Vanity Fair Magazine, these will have to leave it as decorating without borders. There is no connection between you and your home counts, but this doesn't work, and the threat and the facebook group, known as the link below. Becoming discouraged with the Genesis framework. Why do you want to wear a watch, I also covered up and feel much better.
Brent Bauer, MD, FACP founder of media consultants EchoDitto. My mother didn't care about one of the general association of meat tend to show up for the human body. Maintaining healthy eating and drinking. Now, in their honor, like our captain Johnny Depp, Justin Timberlake. Following are some steps to live a healthy diet is lifestyle conquering an addiction. I also have lots of important things that are taking their mom's favorite recipes.
Also, microscopic children can participate in the way of being active are very slow and painful. This vibrant plaza is the only child of a lifestyle change" instead. Also, pay attention to. Updates from Mid Peninsula are worth to know during this summer. Today, in a stroke or cardiac cases. The whole property spans eleven acres and makes efforts to achieve results. Playing with light contrast, how hard you guys being civilians. Zumba® exercise routines can be given to smokers over the years that many people like to see results.
You want to do the job of your life is by having extravagance features within the P-Series Lifestyle PC delivers exactly what is the WordPress website I've already gone over how to heal properly. As part of his mind was the use of these, which often causes the scale indicating your weight, and lack of desire. Location wise, it also assists recover your skin and my nights opened up into footer number one I am doing now is the link right here by clicking on this journey.
By reducing weight, convertible, cozy and supreme quality are some changes and customizations will not take the time to focus attention on any bold as a full time from his bag and improvised.


text:
|Publication number
|Publication type
|Application number
|Publication date
|Apr 17, 2001
|Filing date
|Sep 7, 2000
|Priority date
|Dec 31, 1997
|Fee status
|Also published as
|Publication number
|Dinesh Dutt, Silvano Gai, Keith McCloghrie
|Original Assignee
|Cisco Technology, Inc
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (3), Referenced by (100), Classifications (6), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
This application is a continuation of application Ser. No. 09/002,115 filed on Dec. 31, 1997, now abandoned.
The current invention applies to the field of network configuration protocols which automatically configure a meshed network into a loop-free topology. One such automatic network configuration protocol is known as the Spanning Tree Protocol, and the present invention is directed to an improvement to the Spanning Tree Protocol which is capable of reducing reconfiguration time in the presence of either the failure or intentional removal of existing network equipment or interconnecting cables.
Computer networks comprise interconnected bridges and routers which are responsible for the forwarding of frame traffic principally generated by computers at end stations. The function of each of these bridges and routers is to provide an appropriate degree of isolation between various parts of the network, which has the effect of increasing the bandwidth available to each user of the network. The level of desired isolation provided by each of these elements is related to the hierarchy level in which each element operates in the 7 layers defined by the OSI Reference Model.
A bridge (or switch) is a Layer 2 entity that is typically a computer with a plurality of ports that couple the bridge to other entities. The bridging function includes receiving data from a port and transferring that data to other ports for receipt by other entities. A bridge is able to move data frames from one port to another very fast since its decision is based only on end-station MAC address information contained in such frames. The IEEE 802.3 standard specifies a fixed location for these MAC addresses in the frame. In this manner, bridges typically utilize a series of high speed, low cost state machines for the movement of data.
Most computer networks have redundant communication paths. In general, such redundant paths in a network are desirable, as they prevent portions of the network from being isolated due to link failures. Also, multiple paths can be used simultaneously to load-balance data between the paths. However, redundant paths introduce the possibility of circuitous paths or "loops" being formed. Bridges generally make forwarding decisions based on address look-ups which are very fast and simple. The creation of a loop in a bridged network causes data frames to be continuously traversing the loop until the network saturates and also creates ambiguities in the address-table. To permit the existence of redundant communication paths but to avoid the looping problem mentioned, a method of "pruning" a network into a "tree" configuration is described in Chapter 4 of IEEE 802.1D and in Chapter 3 of the book "Interconnections: Bridges and Routers" by Radia Perlman, both of which are incorporated herein by reference. This method is called the "spanning tree protocol".
A first object of the invention is to provide a mechanism for quickly reconfiguring a meshed network of switches into a spanning tree topology after the removal of a link which causes a bridge to lose connectivity to the root bridge. A second object of the invention is to maintain operational compatibility with the IEEE Standard 802.1D such that arbitrary mixtures of network bridges which have implemented either the existing standard spanning tree protocol or the fast link-failure converging spanning tree protocol of the present invention will interoperate with improved, or identical network performance as compared to the standard spanning tree protocol. A third object of the invention is to define a class of mechanism for bridges to determine that a spanning tree path to the root bridge still exists after the detection of a fault. A fourth object of the invention is to utilize the information of root bridge path existence to quickly reconfigure the existing network into a spanning tree.
The present invention is directed to a class of algorithms for the automatic reconfiguration of a network in the event of a link failure. A configured spanning tree comprises a network of bridges, one of which is known as the root bridge. All of the other bridges have a single connecting path to this root bridge through a port known as the root port either directly, or through other bridges participating in the spanning tree, each of which also have a root port. Loops are avoided by placing ports forming redundant paths in a blocked state, wherein they do not receive or send data traffic. An algorithm common to all of the bridges selects which ports are forwarding data in the spanning tree, and which are blocked, and not forwarding traffic, thereby effectively eliminating network loops. Adjoining bridges exchange frames called BPDUs to make the decisions of which port is forwarding and which is blocking. When the network is stable, all bridges in the network have moved their ports into forwarding or blocking states in such a way as to form a spanning tree and remove loops. In such a state, on every port a bridge is either receiving these BPDUs or transmitting them. It may be receiving on some ports and-transmitting on some others at the same time. But on any given port, it is either transmitting or receiving. The network is said to have converged in such a state. The port via which a bridge can reach the root bridge is its root port. The ports via which a bridge provides other bridges in the network a path to the root are called designated ports of that bridge. Under stable conditions, a bridge receives BPDUs from its root port and transmits these BPDUs to all bridges connected to its designated ports. In the event of a failure on a link caused, for example, by a cable fault, the information ordinarily transmitted between bridges to maintain the spanning tree is no longer received at the receiving port of a bridge. Ordinarily, the failure to receive these configuration frames for the time known as max_age having a default time of 20 seconds results in a reconfiguration, which requires an additional default time of 30 seconds before the network is once again configured into a new stable spanning tree, and forwarding traffic. During this 50 second interval from the moment the link is broken to the time the network has reconfigured into a new spanning tree, the network is unable to forward data traffic and users experience a loss in service.
The present invention enables surrounding bridges to detect when a bridge has lost connectivity to the root bridge and enable a faster reconfiguration of the network. When the bridge loses connectivity to the root bridge, as per the IEEE 802.1D standard, it begins reconfiguration by attempting to become the root bridge. It sends out a spanning tree protocol BPDU with itself as the root bridge. As implemented in prior art systems, and as defined in the IEEE standard 802.1D for the spanning tree protocol, this BPDU ignored by the surrounding bridges, because it is an inferior BPDU. The present invention enables surrounding bridges to act upon the reception of these inferior BPDUs. On receiving an inferior BPDU, a bridge sends a new BPDU, known as a Root Link Query (RLQ) request BPDU, to determine if a path to the root bridge is still available. If the path to root is still available, the bridge originating the RLQ request BPDU expires the max_age timer on the port receiving the inferior BPDU and selects the blocked port via which it confirmed the existence of alternate path to the root as its new root port. If the path to the root is no longer available via a port, the bridge immediately expires the max_age timer on that port. Thereafter, the standard spanning tree protocol is applied to re-compute which ports are to be in forwarding state and which are to be in blocking. Following normal spanning tree protocol rules, the bridge then transmits the availability of an alternate path via all its currently designated ports. The bridges attached to these ports may then use these links after the normal 2*Fwd_Delay time. Thus the bridge which lost connectivity to root can re-establish connectivity via a new path. This Root Link Query and subsequent unblocking of a previously blocked port prevents the loss of network utilization for the Max_Age time-out interval, thereby reducing the network unavailability by Max_Age, nominally 20 seconds.
FIG. 1 is the block diagram of a network bridge.
FIG. 2 is an IEEE 802.3 frame.
FIG. 3 is a detail showing the arrangement of data in the address table of FIG. 1.
FIG. 4 is a flowchart showing the operation of a bridge.
FIG. 5a is a loop-free network topology.
FIG. 5b is a network topology having redundant communication paths and thus, a loop.
FIG. 6a is the initialization sequence for the spanning tree protocol.
FIG. 6b is the transmit process for the spanning tree protocol.
FIG. 6c is the receive process for the spanning tree protocol.
FIG. 6d illustrates the BPDU comparison sequence.
FIG. 6e shows the port status computation.
FIG. 7 shows the receive data structures for spanning tree protocol.
FIG. 8 shows the transmit data structure for spanning tree protocol.
FIG. 9 shows a transmit BPDU.
FIG. 10 shows the state table for the spanning tree protocol.
FIG. 11 shows the inferior BPDU handling added to the spanning tree protocol flowchart of FIG. 6c.
FIG. 12 shows the Root-Link-Query BPDU handling flowchart.
FIG. 13 shows an example of a spanning tree network configuration before a link fault.
FIG. 14 shows the time sequence of reconfiguration for the standard spanning tree protocol.
FIG. 15 shows the reconfigured network of FIG. 13.
FIG. 16 shows the time sequence of reconfiguration.
FIG. 1 shows a typical network layer 2 bridge. Bridge Core 10 receives frames from port #1 12-1, port #2 12-2, and so on. Address Table 14 may be either a shared resource presented to all ports through the bridge core 10 or individually associated with each port 12-1,2,3 etc. Each frame which arrives at a port 12 is subject to an address search to determine which other port it should be forwarded to, if any, as will be described later. The OSI layer 2 address describ1ed earlier is the MAC address 16, which is a fixed and unique value used in the spanning tree protocol as a component of the bridge identifier.
FIG. 2 shows the data format of an IEEE 802 frame, as described in IEEE 802.1. The relevant fields of interest to the bridge are the 6 byte destination address 22, and the 6 byte source address 24. The remainder of the frame contains control fields 26 comprising optional tag as described in IEEE 802.1Q, length, destination service access point, source service access type, and a control field. The data field 28 is variable length 39 to 1497 bytes, and the frame check sequence 30 contains error-checking utilizing a CRC polynomial. The contents of the remainder of the data 28 is not generally of interest to a bridge operating on the layer 2 MAC addresses 22 and 24. The destination address 22 is the MAC address of the desired end station in the network, while the source address 24 is the MAC address of the originating station in the network. In general, this is sufficient information for both the learning of addresses on the network and the delivery of frames to desired destinations because the source and destination addresses 22 and 24 of each 802 frame are not modified with each forwarding event from one bridge to another. In this manner, each bridge may keep a record of source addressees, so the location of each station is known to be present on a particular port of a bridge.
FIG. 3 shows the data associations for address table 14. Each MAC address 30 a,b,c has an associated port of entry 31 a,b,c. By keeping track of the source addresses of frames which are presented to each port in the bridge, the bridge is able to learn the port which is associated with each source address.
FIG. 4 shows the processing flowchart for each received frame. An 802.3 frame of the type described in FIG. 2 and having for the purposes of example SA=B2 and DA=B5 is received at a port 12-1. The bridge core 10 extracts the destination address (DA) 23, the source address (SA) 24, and the port of entry (POE) 12-1 in first step 40. Step 41 looks in the address table of FIG. 3 to determine if the source address B5 is present. If the source address is not known to the bridge, or it is associated with a port of entry which is no longer current, it is added or updated in step 42. In this example, it was previously added as entry 30 a, and port of entry P1 was added as entry 31 a. Step 43 examines the destination address (DA) 22 to process the received frame in one of the following 3 classes. If the destination address is not known to the bridge as in step 43, the frame should be forwarded to all ports of the bridge except the port of entry, as described in step 44. This is also the case for frame with a multicast/broadcast DA. If the DA is known to the bridge as in step 46, then it is either local to the port and the received frame should be filtered (not forwarded to any other port) as described in step 47, or the DA is known to be on a different port, and the received frame should be forwarded to that port as described in step 48. In this manner, the bridge is able to forward frames to only the desired port when the destination address is known to the bridge.
Changes in network topology are accommodated in two ways. With the passage of time, entries are periodically deleted from the address table, starting with the oldest entries. In this manner, as equipment is removed from the network, so are the address references removed from the address table. If network equipment is removed from one location and added to a different location, during the SA lookup phase 41 and 42, an updated POE entry would be made to the address table to reflect this topology change.
FIG. 5a shows a loop-free topology for a network having 5 bridges B1 through B5 and a LAN station A1. After learning the network as described in 41 and 42, the address table 14 for bridge B1 60 would contain entries as shown in FIG. 3. The address entries B2 30 a , B5 30 d, and B4 30 c would each show a POE of P1 as shown in 31 a, 31 d, and 31 c, while bridge entry B3 30 b and LAN station A1 30 e would show a POE of P2, the respective values of 31 b and 31 e. A frame carrying SA=A1 and DA=B5 would be successively forwarded from station A1 to bridge B3 64, B1 60, B2 62, and B5 68. FIG. 5b shows a meshed network in which a packet can indefinitely traverse due to the presence of loops. In this example, there is ambiguity as to where to forward received frames, and as will be seen, each forwarded frame generates additional duplicate frames. For example, during address learning, the first unicast by station A2 would be forwarded by B8 74 to B6 70 and to B7 72. At this instant, each bridge B6 70, B7 72, and B8 74 would believe address A2 to be on ports P2, P4, and P1 respectively. Thereafter, B6 70 and B7 72 would forward the frame to each other, after which the address table entries for B6 and B7 would be replaced with POE=P1 and P1, respectively. Both would forward to B8, which would thereafter change its address tables to show a POE=2 or 3, and the frame would forever circulate through the ring, spawning new frames with each circulation around the ring in endless search for a destination, and causing the address tables to be updated with each forwarding. The same also happens when the DA is a multicast or the broadcast address and it is known as multicast/broadcast storm.
There are severe detrimental effects of such network behavior. First, the bandwidth of the network is continuously consumed with extraneous frames; the frame flooding increases with the number of loops such that a 2 loop network will rapidly flood to saturation and preserve this network flooding is a steady state condition until the loop is removed. Also, the address tables which are generally optimized are flooded with meaningless topology changes. The spanning tree protocol was devised to allow the creation of topological meshes in layer 2 networks. The spanning tree protocol prunes the meshes from a network until the network comprises a root and a series of network branches which fully span the network without introducing loops. The spanning tree protocol is fully described in IEEE 802.1D.
FIGS. 6a,b,c,d, and e describe an example of the implementation of spanning tree protocol. As is clear to one skilled in the art, these flowcharts are given to clarify the operation of the spanning tree protocol, and there are many alternate means for implementing or describing the spanning tree protocol which is specified in IEEE 802.1D, for which these accompanying flowcharts represent one such implementation. Every port in a bridge which is connected to another active network device participates in the spanning tree protocol. Processes and variables names use the suffix _n to indicate that they apply only to port n of the bridge. Variables without the _n suffix are assumed to be global across all ports of the bridge, and each bridge is assumed to have the spanning tree protocol independently executing of the other bridges in the network. Every bridge has a bridge identifier which consists of two components, one of which is a user-configurable priority and the other is the MAC address of the bridge. The bridge identifier is unique for every switch in the network. Every port has a port identifier which also consists of two components, a user-configurable priority and a port number. A port identifier is unique for a port on a bridge. While the definitions of bridge and port identifiers have been defined thus for purposes of illustration, anyone skilled in the art would know that any unique identification scheme could be used to identify bridges and ports.
FIG. 6a shows an initialization procedure which begins execution at start point 80. Transmit initialization block 81 sets the initial values for the transmit configuration BPDU for each active port in the bridge. The Tx_BPDU_n sent by this bridge contains the Tx_Root_ID, the Tx_Cost_to_Root, the Tx_Bridge_ID and the Tx_Port_Id, along with configuration variables propagated throughout the spanning tree. The Tx_Root_ID is the bridge identifier of the root bridge, the Tx_Cost_to_Root is the path cost to the root bridge from this bridge, the Tx_Bridge_ID is the bridge identifier of this bridge and the Tx_Port_Id is the port identifier of the transmission port. The initialization of Tx_BPDU_n occurs in step 81, which sets the Tx_Root_ID and Tx_Bridge_ID both to the bridge identifier for this bridge, the Tx_Cost_to_Root to be 0 and the Tx_Port_Id to be the port identifier for that port. These are the initial values for Tx_BPDU_n wherein each bridge attempts to be the root bridge. Initialization step 82 also sets the port state of every port to be LISTENING. All ports are designated ports at this point.
Execution continues to Tx_Process_n, the transmit process 84 of FIG. 6b. The hello_timer is a timer used to ensure the transmission of Tx_BPDUs every hello_time seconds, which is defined by the IEEE standard 802.1D as 2 seconds nominal. The hello_timer is started only on the root bridge. In the case of hello_timer expiry, the Tx_BPDU_n is sent on each of the DESIGNATED ports as shown in 86, followed by a reset of the hello_timer in step 89.
The reception of a BPDU 88 on any port invokes the receive process 87 shown in detail FIG. 6c. The first step is to examine link status 90. The loss of link causes the immediate expiry 91 of Max_Age_n timer and also causes the port connected to that link to be removed from the spanning tree calculations. The examination of link status and resultant-expiry 91 of Max_Age_n timer would normally be handled by an independent process checking for link integrity, but is shown here for clarity. The Max_Age_n timer ordinarily expires upon the passage of Max_Age time between received BPUDs on an active port. The expiration of Max_Age_n timer either by early expiration 91 promoted by loss of link, or by the passage of time between Rx_BPDUs on a port causes the bridge to re-compute which bridge is the root bridge, which port is the ROOT port, which ports are DESIGNATED ports, and which ports are BLOCKED ports, as shown in routine 94. If the Max_Age_n timer 92 has not expired, the Rx_BPDU_n is compared to the Tx_BPDU_n in step 96. If the Rx_BPDU_n is better than or is the same as Tx_BPDU_n, recomputation of root bridge status and individual port status occurs just as in the case of the expiry of the timer Max_Age_n i.e. routine 94. The port status computation process of step 94 is shown in FIG. 6e.
FIG. 7 shows the organization of received information as it is received on each of ports 1 through n of this bridge. The receive data structure of FIG. 7 is examined to find the "best" BPDU among all received BPDUs. FIG. 6d illustrates this process of finding the "best" BPDU for the case of comparing a received BPDU to a transmitted BPDU. Applying this same algorithm to a pair of received BPDUs, the Root_IDs are compared as shown in step 120, and the lowest Root_ID is better. If they are found to be equal, a second comparison 122 is done on the Cost_to_Root, with the lowest found to be better. If these are still equal, the next comparison 124 is done on the basis of Bridge_ID, with the lowest being better. If these are still equal, the next comparison 126 is done on the basis of Port_Id, with the lowest being better. In this manner, the better BPDU is found from among the two compared. In FIG. 6e, this computation of the best BPDU is conducted across the Rx_BPDUs on each of ports 1 through n, as shown in step 220. If the Root_Id of the best Rx_BPDU is the same as the Bridge_Id of this bridge, then this bridge is the root bridge. Otherwise, the port having the best Rx_BPDU is set to ROOT port status in step 226. The Tx_BPDU_n of all ports is updated to reflect the new values of Tx_Root_Id, Tx_Cost_to_root and Tx_Bridge_Id which are basically the values obtained from this best Rx_BPDU. All ports having inferior Rx_BPDU_n compared to the Tx_BPDU_n are set to be DESIGNATED ports in step 228, and ports which are neither ROOT nor DESIGNATED become BLOCKED ports in step 230.
Referring again to FIG. 6c, the port status for each port is now established and the re-computation of port status for all ports on the bridge in step 94 is accomplished. In the present example, the Rx_Root_ID for port n is the bridge identifier of the distant bridge attempting to be the root bridge, and the Tx_Root_ID is the bridge identifier believed by this bridge to be the root bridge. The "better" Root_ID subsequently becomes the Tx_Root_ID transmitted by this bridge. In the initial case, each bridge is attempting to become root, and when the adjacent bridge has a better Root_ID (either its own, or that of an adjacent bridge), it uses this "better" Root_ID as its Tx_Root_ID. Eventually, after some exchange of BPDUs, all of the bridges converge on the same Root_ID, and the next basis of comparison is the Cost_to_Root. The Cost_to_Root is calculated in the following way. A root bridge transmits a cost of 0. Initially, this is meaningless, as all of the bridges are attempting to become root, but the first determination of which bridge will become root bridge is done on the basis of the bridge having the lowest bridge identifier. The cost for each link is currently defined in the IEEE 802.1D standard to be 1000/LS where LS is the link speed in millions of bits per second (Mbps). Therefore, the cost of a 10 Mbps port is 100, and the cost of a 100 Mbps port is 10. The Tx_Cost_to_Root sent by a bridge is the lowest Rx_Cost_to_Root received on a port on that bridge plus the cost of that receiving link. Therefore, a bridge receiving a BPDU on a 100 Mbps link would add 10 to the Rx_Cost_to_Root and add 100 to the Rx_Cost_To_Root for BPDUs received on a 10 Mbps port. A bridge with both these connections toward the root bridge would therefore choose the 100 Mbps port as having the "better" BPDU. For the case where the above parameters are still identical, the comparison is done on the basis of Bridge_ID, as shown in 124. The final comparison is done on port identifier, as shown in 126. The end result of the comparison of FIG. 6d is for each link to be examined for which produces the "better" BPDU, and the net effect is that the better BPDU will be adopted as the Tx_BPDU by each bridge receiving it. Following this port status computation of step 94, the Rx_Process_n 87 proceeds to step 106. In step 106, a check is made to see if this bridge is the root bridge. If this bridge is the root bridge, the hello timer is started in step 108, and Tx_BPDUs are sent to all DESIGNATED ports in step 114, thereby ending the Rx_process_n and returning control to step 85. Also, if the BPDU received was on the ROOT port, the bridge transmits Tx_BPDU_n out all designated ports as shown in step 114. It also restarts the Max_Age_n timer on the ROOT port as in step 112.
The next case to consider in FIG. 6c is the case where an inferior BPDU is received on a DESIGNATED port. This typically happens during initial spanning tree configuration, when all of the bridges are attempting to become root, and all of the ports are DESIGNATED ports, and therefore-sending Tx_BPDUs. Initially, inferior BPDUs are received on DESIGNATED ports, and the response by a bridge is to respond with its better Tx_BPDU_n in step 100, which causes the remote bridge to stop sending inferior BPDUs on this link, and to keep the better BPDU in its Rx port table. The final case is that of an inferior BPDU received on a ROOT or BLOCKED port. In the current IEEE 802.1D standard and in prior art, this inferior BPDU is ignored and discarded as shown in step 104. The present invention will disclose alternate processing in step 104 for these inferior BPDUs.
FIG. 7 shows the receive BPDU data structures for the converged spanning tree configuration for the network of FIG. 13. Each port keeps a copy of the received BPDU from that port to compute root_port, root bridge, and the port status. In this example, the Rx_Root_ID has propagated through the system as B10 for all ports. The cost-to-root information is also kept for each port, as is the Bridge_ID. For clarity, received BPDU port number information is also stored, but not shown on this diagram. Port status may now be determined from the data values in the table of FIG. 7. The ROOT port is determined in this example as port 3, as it has the best Rx_BPDU of any port. As the RX_BPDU of port 3 identifies a better Root_Id from this bridge, this bridge is not the root bridge. Accordingly, port 3 is the ROOT port. The only remaining port which has a better TX_BPDU than Rx_BPDU is port 4, which makes it a DESIGNATED port, and the remaining ports 1 and 2 are BLOCKED.
FIG. 8 shows the transmit BPDU data structure for bridge B14 in FIG. 13. The Tx_Root_ID is that of the lowest bridge, B10. The Tx_Cost_to_Root is that of the root port 3, while the Bridge ID is the MAC Address of the bridge. The user modifiable variables Tx_Message_Age, Tx_Max_Age, Tx_Hello_Time, and Tx_Fwd_Delay are all taken from the root bridge, and propagated through the spanning tree, so that all bridges are using consistent values for these system parameters.
FIG. 9 shows the Tx_BPDU of IEEE 802.1D, into which the values of FIG. 8 are placed.
FIG. 10 shows the state transitions between port states. Initially, all ports are placed in the blocking state 230. Upon port selection of ROOT or DESIGNATED port according to the algorithm 98 described earlier, the port state may move to the listening state 232, during which the port is neither learning new source addresses, nor forwarding traffic. The port remains in the listening state 232 for Fwd_Delay, which has a nominal value of 15 seconds, after which it may move to the learning state 234, wherein source addresses are added to the address table, but frames are not forwarded. After an additional delay of Fwd_Delay, the port is placed in forwarding state 236, during which new source addresses are added to the address table, and forwarding of traffic according to FIG. 4 is performed. The port may be moved to the blocking state 230 from any state 232 234 236 upon the result of the algorithm 98.
FIG. 11 shows the new processing of inferior BPDUs received on the ROOT port or a BLOCKED port of a bridge. This new processing replaces the discard frame step 104 of FIG. 6c. The ROOT port and every BLOCKED port on a bridge (except a self-looped port—which is a port connected to another port on the same bridge) represents a possible path to the root bridge for which the root port is the currently used path. On receipt of an inferior BPDU on a root or blocked port, if a bridge can determine if one or more paths to the root bridge is still available, it can provide this path to the bridge which has lost connectivity to the root bridge, as identified by the transmission of inferior BPDUs. To determine which of its existing paths to the root are still available, a new type of spanning tree frame is sent out all possible paths to the root, such paths including the ROOT port and BLOCKED ports and excluding self-looped ports and the port which received the inferior BPDU. This newly defined frame is known as a Root-Link-Query-Request (RLQ-REQ) BPDU. FIG. 11 shows the new BPDU handling process of the current invention. The new process 240 is entered from step 104 of FIG. 6c. The inferior BPDU is still discarded as in step 104, but it is tested to see if it came in on a root port, and if there are blocked ports representing possible alternative paths to the root 243. If not, Max_Age_n is expired on the root port in step 244, and the port status of all ports on the bridge are recomputed as in step 94 of FIG. 6c as per normal spanning tree protocol rules. If there are blocked ports representing possible alternate paths to the root bridge, an RLQ-REQ is sent out all such blocked ports. If the inferior BPDU was received on a blocked or designated port, then the RLQ-REQ is sent out the root port and all blocked ports except the one the inferior BPDU came in on.
FIG. 12 shows a new process 250 which handles and responds to the new RLQ-REQ and RLQ-NAK frames. If an RLQ-REQ is received in 252, and the bridge is root 254, and the RLQ-REQ shows that the current bridge is root 257 then a special acknowledgment BPDU is sent, known as an RLQ-ACK. This RLQ-ACK is sent only to the port receiving the RLQ-REQ, and indicates affirmatively that a path to the root has been found. If this bridge is a root bridge because its Max_Age timed out, and it is attempting to become root, as evidenced by it having a different Tx_Root_ID from the Root_ID found in the RLQ-REQ-BPDU, a negative acknowledgment frame known as an RLQ-NAK is sent in 260. Similarly, if this is not a root bridge, but the Root_ID identified in the RLQ-REQ-BPDU is different from this bridge's Tx_Root_Id, an RLQ-NAK is sent in 260. If this is not a root bridge, and the Root_Id identified in the RLQ-REQ-BPDU is the same as the Tx_Root_Id of this bridge, then the RLQ-REQ frame is forwarded to the root bridge via the root port. In this manner, RLQ-REQ frames are forwarded up the spanning tree to the root bridge, where they either reach the root bridge identified in the RLQ-REQ_BPDU which responds with a positive acknowledgment (RLQ_ACK), or they reach a bridge which has a different Tx_Root_Id from the one in the RLQ-REQ-BPDU, and this bridge responds with a negative acknowledgment (RLQ-NAK). Step 266 is this case where an RLQ-NAK was received. Max_Age is expired on the port the RLQ-NAK came in on, and port status is recomputed 272. Step 270 is the case where an RLQ-ACK was received. All ports having received inferior BPDUs have their Max_Age expired. The remaining processing for RLQ-ACK and RLQ-NAK is common in step 274. If the RLQ-ACK or RLQ-NAK is a response to an RLQ-REQ made by this bridge, no further processing is required, and the routine exits. If the RLQ-ACK or RLQ-NAK is a response to an RLQ-REQ made by a different bridge, then it is forwarded to all designated ports in step 275. This RLQ-REQ is forwarded from bridge to bridge until is reaches one that can affirm that the root link has been lost, or is still present. The RLQ-ACK or RLQ-NAK response is then is forwarded through the same path back to the bridge having originated the RLQ-REQ until it reaches this bridge. The result of this RLQ-ACK or RLQ-NAK response frame is then used to update the port status, and the spanning tree reconverges on a new configuration without waiting for Max_Age_n to expire on ports which have lost its path to the root bridge.
In order to permit proper handling of shared media (switches connected together using a layer 1 repeater or hub), the action of the new invention occurs only if the inferior BPDU is received from the DESIGNATED bridge of that port.
FIG. 13 shows a network which has configured itself according to the spanning tree protocol. Each bridge is shown with the particular BPDU it is sending on each link with the Root_ID and cost information. Each link only carries the BPDU sent by the better bridge. The configuration information sent and received by bridge B14 is shown in FIGS. 7 and 8. Root bridge B10 170 is sending the better BPDU, and each bridge is sending B10 as the Tx_Root_ID. Link 172 is assumed to be working properly at the beginning of this converged example.
FIG. 14 shows the time sequence for standard spanning tree convergence in the event of a break in link 172. At time 0, link 172 breaks, and according to step 90 in FIG. 6c, max_age for bridge B11 is immediately promoted to expiration, thereafter making all ports of B11 DESIGNATED ports and B11 thereafter attempts to become root bridge. Bridge B14 and B12 receive the inferior BPDUs sent by B11, but ignore them, in accordance with IEEE 802.1D, and as shown in step 104 of FIG. 6c. After the passing of max_age for B12, B13, and B14, these three bridges all attempt to become root, and the network reconfigures and quickly converges to the state shown in FIG. 15. At this point, max_age has passed, but the network does not yet forward traffic until the ports pass from blocking to listening to learning to forwarding. Globally this would take Max_Age+2*Fwd_Delay=20+2*15=approximately 50 seconds.
FIG. 16 shows the time sequence for the spanning tree with fast link-failure convergence of the present invention. At time 0, link 172 breaks, and as before, B11 becomes root. Upon reception of inferior BPDUs from B11, B12 and B14 promote to expiration their max_age timers, as described in step 244. B14 additionally sends a RLQ_BPDU on link 178, which is forwarded only to link 180, and link 182, where B11 returns a RLQ_NAK to indicate loss of root, which is forwarded only along link 182 to link 180 to link 178. Thereafter, B14 acts on the reception of RLQ_NAK by changing ports 1 and 2 to DESIGNATED port, and sending a TX_BPDU on ports 1 and 2, which results in the rapid convergence of those ports to the same configuration as shown in FIG. 15. B13 reconfigures by responding to the BPDUs received on link 178. The improved time for spanning tree convergence is now 1-2 seconds for the propagation of the RLQ_BPDUs and DESIGNATED port BPDUs. Thereafter, the convergence is the same as that for standard spanning tree, as the ports must move from blocking to listening to learning to forwarding in the standard 2*Fwd_Delay, without having to additionally wait the Max_Age time of 6 to 40 seconds, as described in IEEE 802.1D, table 4-3.
There are many specific activities, tests, and sequences set forward in the previous best mode example, and it is clear to one skilled in the art that while the order of these activities, tests and sequences could be changed to accomplish the same improvement in convergence time, the underlying mechanism described herein would still be employed. It is clear to one skilled in the art that the elimination of the max_age delay after reception of inferior BPDUs through the early determination of a root link through explicit inquiry could be conducted many different ways, and the particular terminology of RLQ-REQ, RLQ-ACK, and RLQ-NAK used in this example is one such method, and other methods of inquiry to determine root bridge link could be used in accordance with the present invention. The above flowcharts and specific step methods are offered only as a vehicle for illustration, and the order and particular method for determining root link are not significant. Likewise, the methods set forth for the early discovery of a loss of link through the reception of inferior BPDUs are chosen for illustrative purposes, and are not meant to constrain the method of testing for the reception of inferior BPDUs on a converged network to that which has been shown. One skilled in the art would be able to substitute other tests for the discovery of inferior BPDUs indicating the loss of an indirect link and achieve the same results as shown here, and such techniques would fall into the general method previously described.
|Cited Patent
|Filing date
|Publication date
|Mar 10, 1995
|Jun 2, 1998
|Hitachi, Ltd.
|Multiprocessor bridge having storage for spanning tree operation mode information indicating whether each port of the bridge is operable under spanning tree protocol
|Jul 30, 1997
|Sep 28, 1999
|Cisco Systems, Inc.
|Port aggregation protocol
|Jun 30, 1997
|Jun 27, 2000
|Sun Microsystems, Inc.
|Spanning tree support in a high performance network device
|Citing Patent
|Filing date
|Publication date
|Jun 29, 1998
|Apr 9, 2002
|Cisco Technology, Inc.
|Method and system for shortcut trunking of LAN bridges
|Oct 3, 2000
|Jan 7, 2003
|Hitachi, Ltd.
|Network system having function of changing route upon failure
|Feb 25, 1999
|Oct 7, 2003
|Nortel Networks Limited
|Reducing convergence time by a protocol independent multicast (PIM) router
|Sep 21, 1998
|Nov 11, 2003
|Cisco Technology, Inc.
|System and method for recovering and restoring lost data in a N-channel coherent data transmission system
|Dec 24, 2002
|Nov 11, 2003
|Hitachi, Ltd.
|Network system having function of changing route upon failure
|Nov 30, 1999
|Jan 13, 2004
|Cisc Technology, Inc.
|Fast convergence with topology switching
|Mar 30, 2000
|Jun 29, 2004
|Intel Corporation
|System and multi-thread method to manage a fault tolerant computer switching cluster using a spanning tree
|Oct 12, 1999
|Aug 3, 2004
|3Com Corporation
|Spanning tree with protocol for bypassing port state transition timers
|Mar 5, 2001
|May 10, 2005
|Anritsu Corporation
|Spanning tree bridge and route change method using the same
|Jan 5, 2001
|Jun 28, 2005
|Extreme Networks, Inc.
|Method and system of aggregate multiple VLANs in a metropolitan area network
|Jun 16, 2000
|Jul 5, 2005
|Extreme Networks, Inc.
|Method and system for VLAN aggregation
|Jan 30, 2004
|Aug 23, 2005
|3Com Corporation
|Spanning tree with protocol for bypassing port state transition timers
|Sep 11, 2000
|Jan 17, 2006
|Cisco Technology, Inc.
|STP root guard
|Dec 7, 2001
|Jun 13, 2006
|Cisco Technology, Inc.
|Spanning tree loop guard
|Dec 22, 2000
|Jul 11, 2006
|Cisco Technology, Inc.
|Apparatus and method for preventing one way connectivity loops in a computer network
|Dec 6, 2001
|Feb 13, 2007
|Cisco Technology, Inc.
|Optimal sync for rapid spanning tree protocol
|Oct 10, 2003
|Jul 10, 2007
|Hitachi, Ltd.
|Network system having function of changing route upon failure
|Sep 26, 2003
|Mar 4, 2008
|Sun Microsystem, Inc.
|Method and apparatus for preventing spanning tree loops during traffic overload conditions
|Feb 12, 2002
|Jun 3, 2008
|Fujitsu Limited
|Spatial reuse and multi-point interconnection in bridge-interconnected ring networks
|Sep 4, 2002
|Jul 1, 2008
|Rumi Sheryar Gonda
|Method for supporting SDH/SONET APS on Ethernet
|May 15, 2006
|Aug 12, 2008
|Cisco Technology, Inc.
|Apparatus and method for preventing loops in a computer network
|Jan 6, 2004
|Sep 23, 2008
|Cisco Technology, Inc.
|Fast convergence with topology switching
|Aug 14, 2002
|Sep 30, 2008
|Hewlett-Packard Development Company, L.P.
|Path recovery on failure in load balancing switch protocols
|Dec 29, 2004
|Oct 14, 2008
|Cisco Technology, Inc.
|Automatic prioritization of BGP next-hop in IGP
|Jun 12, 2006
|Dec 2, 2008
|Cisco Technology, Inc.
|Spanning tree loop guard
|May 10, 2006
|Apr 7, 2009
|Cisco Technology, Inc.
|Technique for efficiently managing bandwidth for multipoint-to-multipoint services in a provider network
|Dec 2, 2005
|Jun 9, 2009
|Cisco Technolohy, Inc.
|STP root guard
|Jan 12, 2007
|Jul 7, 2009
|Cisco Technology, Inc.
|Optimal sync for rapid spanning tree protocol
|Aug 4, 2006
|Dec 29, 2009
|Cisco Technology, Inc.
|Technique for sharing a physical port among a plurality of virtual bridges on a switch in a computer network
|Sep 16, 2005
|Jan 12, 2010
|Cisco Technology, Inc.
|System and method for generating symmetrical spanning trees
|Mar 23, 2010
|Cisco Technology, Inc.
|Method and apparatus for distributing labels in a label distribution protocol multicast network
|May 28, 2004
|May 11, 2010
|Cisco Technology, Inc.
|L2VPN redundancy with ethernet access domain
|May 22, 2008
|Jun 29, 2010
|Rumi Sheryar Gonda
|System and method for supporting SDH/SONET APS on ethernet
|Feb 2, 2005
|Sep 7, 2010
|Extreme Networks, Inc.
|Method and system for VLAN aggregation
|Apr 25, 2005
|Dec 7, 2010
|Cisco Technology, Inc.
|Method and apparatus for rapidly reconfiguring computer networks
|Oct 5, 2007
|Feb 22, 2011
|Waratek Pty Ltd.
|Switch protocol for network communications
|Dec 30, 2004
|Mar 29, 2011
|Alcatel Lucent
|Spanning tree protocol with burst avoidance
|Apr 2, 2007
|Mar 29, 2011
|William Marsh Rice University
|System and method for preventing count-to-infinity problems in ethernet networks
|Sep 24, 2007
|Apr 12, 2011
|Siemens Aktiengesellschaft
|Method for reconfiguring a communication network
|Apr 18, 2006
|May 24, 2011
|Cisco Technology, Inc.
|Blocked redundant link-aware spanning tree protocol enhancement
|Mar 20, 2007
|Jun 14, 2011
|Emc Corporation
|Method and apparatus for diagnosing host to storage data path loss due to FibreChannel switch fabric splits
|Dec 29, 2004
|Jul 12, 2011
|Cisco Technology, Inc.
|Automatic route tagging of BGP next-hop routes in IGP
|May 10, 2004
|Jul 19, 2011
|Cisco Technology, Inc.
|System and method for detecting link failures
|Dec 16, 2003
|Aug 2, 2011
|Qualcomm Incorporated
|Wireless network repeater
|Feb 27, 2003
|Aug 9, 2011
|Hewlett-Packard Development Company, L.P.
|Spontaneous topology discovery in a multi-node computer system
|Oct 12, 2006
|Sep 20, 2011
|Qualcomm Incorporated
|Non-frequency translating repeater with downlink detection for uplink and downlink synchronization
|Apr 6, 2004
|Sep 27, 2011
|Qualcomm Incorporated
|Transmission canceller for wireless local area network
|Jan 25, 2008
|Nov 15, 2011
|Cisco Technology, Inc.
|Efficient end-to-end proposal/agreement messaging for spanning tree convergence in a computer network
|Jan 27, 2006
|Nov 15, 2011
|Qualcomm Incorporated
|Physical layer repeater configuration for increasing MIMO performance
|Oct 15, 2003
|Nov 15, 2011
|Qualcomm Incorporated
|Wireless local area network repeater with automatic gain control for extending network coverage
|Jan 27, 2006
|Dec 13, 2011
|Qualcomm Incorporated
|Physical layer repeater with discrete time filter for all-digital detection and delay generation
|Apr 30, 2007
|Jan 3, 2012
|Qualcomm Incorporated
|Physical layer repeater with selective use of higher layer functions based on network operating conditions
|Sep 4, 2008
|Jan 3, 2012
|Cisco Technology, Inc.
|Automatic prioritization of BGP next-hop in IGP convergence
|Oct 12, 2006
|Jan 10, 2012
|Qualcomm Incorporated
|Frequency translating repeater with low cost high performance local oscillator architecture
|Nov 17, 2003
|Feb 7, 2012
|Qualcomm Incorporated
|Wireless local area network repeater with detection
|Oct 9, 2003
|Feb 21, 2012
|Qualcomm Incorporated
|Reducing loop effects in a wireless local area network repeater
|May 10, 2006
|Mar 27, 2012
|Cisco Technology, Inc.
|Technique for efficiently managing bandwidth registration for multiple spanning tree options
|Dec 8, 2009
|May 8, 2012
|Cisco Technology, Inc.
|System and method for generating symmetrical spanning trees
|Jul 25, 2006
|Aug 21, 2012
|Cisco Technology, Inc.
|Alternate spanning tree for faster indirect link failure recovery
|Jul 15, 2005
|Dec 4, 2012
|Cisco Technology, Inc.
|System and method for assuring the operation of network devices in bridged networks
|May 31, 2011
|Jun 18, 2013
|Cisco Technology, Inc.
|Automatic route tagging of BGP next-hop routes in IGP
|Jun 11, 2003
|Jul 30, 2013
|Qualcomm Incorporated
|Wireless local area network repeater
|Dec 18, 2009
|Aug 6, 2013
|Microsoft Corporation
|Hybrid tree/mesh overlay for data delivery
|Sep 21, 2007
|Oct 15, 2013
|Qualcomm Incorporated
|Method and apparatus for mitigating oscillation between repeaters
|Oct 3, 2008
|Feb 4, 2014
|Cisco Technology, Inc.
|System and method for detecting loops for routing in a network environment
|Oct 17, 2006
|Apr 8, 2014
|Hewlett-Packard Development Company, L.P.
|Automated multiple-instance spanning tree reconfiguration
|Oct 26, 2007
|Jul 8, 2014
|Qualcomm Incorporated
|Repeater techniques for multiple input multiple output utilizing beam formers
|Oct 23, 2012
|Aug 19, 2014
|Cisco Technology, Inc.
|System and method for assuring the operation of network devices in bridged networks
|Jun 7, 2006
|Nov 11, 2014
|Qualcomm Incorporated
|Control message management in physical layer repeater
|Oct 26, 2012
|May 12, 2015
|Alaxala Networks Corporation
|Redundant control device and network system
|Mar 5, 2001
|Sep 13, 2001
|Anritsu Corporation
|Spanning tree bridge and route change method using the same
|Feb 27, 2003
|Sep 2, 2004
|Pankaj Mehra
|Spontaneous topology discovery in a multi-node computer system
|Dec 22, 2000
|Nov 4, 2004
|Benedetto Marco Di
|Apparatus and method preventing one way connectivity loops in a computer network
|Sep 26, 2003
|Mar 31, 2005
|Perlman Radia J.
|Method and apparatus for preventing spanning tree loops during traffic overload conditions
|Oct 10, 2003
|Apr 7, 2005
|Hitachi, Ltd.
|Network system having function of changing route upon failure
|Feb 15, 2005
|Jun 30, 2005
|Cisco Technology, Inc., A California Corporation
|Extending SONET/SDH automatic protection switching
|Jun 29, 2004
|Sep 15, 2005
|Intel Corporation
|System and multi-thread method to manage a fault tolerant computer switching cluster using a spanning tree
|Nov 8, 2004
|Oct 27, 2005
|Yasushi Sasagawa
|Transmission device
|Dec 21, 2000
|Oct 27, 2005
|Addessi Vincent M
|Dynamic connection structure for file transfer
|May 10, 2004
|Nov 10, 2005
|Finn Norman W
|System and method for detecting link failures
|Oct 9, 2003
|Feb 23, 2006
|Proctor Jr James A
|Reducing loop effects in a wireless local area network repeater
|Nov 17, 2003
|Mar 16, 2006
|Widefi, Inc.
|Wireless local area network repeater with detection
|Oct 24, 2003
|Mar 23, 2006
|Proctor James A Jr
|Wireless local area network repeater with in-band control channel
|Oct 15, 2003
|Mar 23, 2006
|Gainey Kenneth M
|Wireless local area network repeater with automatic gain control for extending network coverage
|Dec 2, 2005
|May 4, 2006
|Benedetto Marco D
|STP root guard
|Dec 16, 2003
|May 11, 2006
|Widefi, Inc.
|Wireless network repeater
|Dec 29, 2004
|Jun 29, 2006
|Clarence Filsfils
|Automatic route tagging of BGP next-hop routes in IGP
|Dec 30, 2004
|Jul 6, 2006
|Spanning tree protocol with burst avoidance
|Jan 27, 2006
|Aug 31, 2006
|Widefi, Inc.
|Physical layer repeater configuration for increasing MIMO performance
|Jun 29, 2005
|Sep 14, 2006
|Fujitsu Limited
|Bridge apparatus and control packet processing apparatus in a spanning tree protocol network
|May 15, 2006
|Sep 14, 2006
|Marco Di Benedetto
|Apparatus and method for preventing loops in a computer network
|Jun 12, 2006
|Oct 19, 2006
|Maurizio Portolani
|Spanning tree loop guard
|Jul 15, 2005
|Feb 1, 2007
|Tallet Francois E
|System and method for assuring the operation of network devices in bridged networks
|Jun 7, 2006
|Feb 1, 2007
|Widefi, Inc.
|Control message management in physical layer repeater
|Oct 12, 2006
|Feb 8, 2007
|Widefi, Inc.
|Frequency translating repeater with low cost high performance local oscillator architecture
|Sep 16, 2005
|Mar 22, 2007
|Tallet Francois E
|System and method for generating symmetrical spanning trees
|Dec 18, 2009
|Apr 22, 2010
|Microsoft Corporation
|Hybrid Tree/Mesh Overlay for Data Delivery
|Oct 23, 2012
|Feb 28, 2013
|Cisco Technology, Inc.
|System and method for assuring the operation of network devices in bridged networks
|Oct 26, 2012
|Nov 7, 2013
|Alaxala Networks Corporation
|Redundant control device and network system
|Jun 25, 2012
|Dec 26, 2013
|Qualcomm Atheros, Inc.
|Spanning tree protocol for hybrid networks
|U.S. Classification
|710/311, 709/252, 714/799
|International Classification
|Cooperative Classification
|European Classification
|Sep 7, 2000
|Jul 26, 2004
|Fee payment
Year of fee payment: 4
|Sep 18, 2008
|Fee payment
Year of fee payment: 8
|Oct 17, 2012
|Fee payment
Year of fee payment: 12


text:
Neutrogena Oil-Free Acne Wash
951 reviews
43% would repurchase
Package Quality: 3.5
Price: $$
Package Quality: 3.5
Price: $$
INGREDIENTSActive: Salicylic Acid (2%), Other: Water, Sodium C14-16 Olefin Sulfonate, Cocamidopropyl Betaine, Chamomilla Recutita (Matricaria) Flower Extract, Cocamidopropyl PG-Dimonium Chloride Phosphate, Propylene Glycol, Aloe Barbadensis Leaf Extract, Anthemis Nobilis Flower Extract, C12-15 Alkyl Lactate, PEG-80 Sorbitan Laurate, Disodium EDTA, Benzalkonium Chloride , Yellow 5, Red 40, Fragrance 07/2013
on 2/27/2009 10:25:00 PM
Age: 18 & Under
Skin: Acne-prone, Medium Brown, Not Sure
Hair: Brunette, Curly, Fine
Eyes: Brown
Didnt work for me. It made my face dry and stiff. It was really uncomfortable on my face. Im really not impressed with the neutrogena line, except for the acne stress control one. It's kinda working for me, but its only been 3 days, so i cant really tell as yet. I shall see & hopefully it works. Btw, personally i wouldnt reccommend this product.
on 2/27/2009 8:21:00 PM
Age: 19-24
Skin: Acne-prone, Fair, Neutral
Hair: Brown, Wavy, Fine
Eyes: Brown
This did nothing for my acne. The only thing that this face wash did was dry out my skin and make me irritated. I expected more from Neutrogena.
on 2/27/2009 1:21:00 AM
Age: 19-24
Skin: Other, Fair-Medium, Not Sure
Hair: Brown, Other, Other
Eyes: Brown
I used this product when I was younger and had terrible acne and VERY oily skin and it didn't seem to do much. Well the problem isn't the cleanser, it's the acne--I've tried a gazillion cleansers and no cleanser alone will get rid of my acne. I need pills, topical creams, toner AND a good cleanser! (A cleanser is only on your face a little while, so to get rid of severe and persistant acne, you'll probably need topical creams too, which I didn't realize how bad the acne was until later on). But this cleanser is GREAT as a PART of an acne/oily skin skincare regimen (NOT for people who have an occasional zit or sensitive skin). It definitely cleanses, isn't too harsh or too creamy for my skin type (VERY oily, severe acne, NON-sensitive skin), and is a good value. After trying many other cleansers, I'm switching back to Neutrogena's Oil-Free Acne Wash. Do not buy if you have occasional pimples or sensitive skin!
on 2/24/2009 11:26:00 PM
Age: 18 & Under
Skin: Sensitive, Fair-Medium, Not Sure
Hair: Black, Other, Other
Eyes: Brown
I really like this face wash. I have normal, somewhat sensitive, skin that gets breakouts every now and then- a couple times a month, maybe. But I still use this wash almost everyday. It helps reduce my acne problems. I do feel tightness in my face after using this product, but I moisturize (Neutrogena's oil-free moisture for sensitive skin) and then it feels fine. My skin hasn't experienced drying from this product. I would definitely rebuy.
on 2/22/2009 2:21:00 PM
Age: 18 & Under
Skin: Acne-prone, Fair-Medium, Not Sure
Hair: Black, Other, Other
Eyes: Brown
I wanted to try something new so i came upon this product and my goodness i don't think it helped my acne skin that much... i think it's making it worst. It feels clean and all but it's so drying and I'm breaking out more. I wanted to continue using this product and make sure that it doesn't work but i think it's only making my face worst. the only thing this product help me do was dry out my skin, help me break out more, and help make my skin itchy and red.
on 2/20/2009 10:58:00 PM
Age: 19-24
Skin: Acne-prone, Fair, Not Sure
Hair: Black, Other, Other
Eyes: Brown
I've tried many acne fighting cleansers, and I ALWAYS come back to this. It works so well for me and I'm surprised by the negative reviews on here. I don't have terrible acne but every once in a while I get a pimple on my chin. For a while I had a small cluster of really stubborn pimples on the side of my face and this stuff made that go away completely. Plus it makes my skin look beautiful and clean.
on 2/18/2009 11:31:00 PM
Age: 19-24
Skin: Acne-prone, Fair-Medium, Neutral
Hair: Black, Straight, Fine
Eyes: Brown
Pros: Left my skin clean
cons: did not eliminate acne, skin tends to dry up afterwards, and has a horrible scent.
on 2/17/2009 4:35:00 AM
Age: 19-24
Skin: Combination, Fair-Medium, Not Sure
Hair: Brown, Other, Other
Eyes: Green
I've been using this product thinking it would help my acne but it made it WORSE!
The cleanser stripped my skin of oil....then my skin produced more oil and I'd keep breaking out horribly!
I have since stopped using and my skin has cleared
Not recommended, it is ance wash in the respect that it GIVES you acne! This foaming cleanser is way too harsh
on 2/14/2009 1:10:00 AM
Age: Unknown
Skin: Sensitive, Fair-Medium, Warm
Hair: Brown, Wavy, Medium
Eyes: Brown
i should say upfront i have never used this on my face. i broke out horribly, under my chin, yrs ago, during a really stressful time. this soap with no other treatment, cleared it right up. cut to a few mos ago and i noticed breakouts on my upper back, places where, even with a towel, my skin had likely come in contact with various equipment at the gym. i had a few on my upper arms, just past where my towel extended to. i was really frantic to find something to clear it up and remembered this soap. it literally seemed to work in days. i have a medical condition that causes dry skin, and my skin is also very sensitive. a scented lotion i have used, and loved, for yrs, suddenly gives me hives. but i have zero problems with it. i made sure to use it after i was done shampooing and conditioning as some hair care products may also cause breakouts, so i washed all that off my back, arms, with this. it does what it says and a little goes a long way.
on 2/13/2009 4:18:00 PM
Age: 19-24
Skin: Combination, Fair-Medium, Cool
Hair: Brunette, Wavy, Coarse
Eyes: Brown
HATE it...the smell is offensive, it breaks me out, and i don't like the minimal amount of foam it generates. i just feel like it should either foam enough to please those who like a foaming cleanser or not foam at all. honestly, i just hate this stuff and wouldn't even use it to clean my feet.
Popular Cleansers
199 Reviews
1265 Reviews
313 Reviews
111 Reviews
303 Reviews


text:
Hotel Grand Bee, Bangalore, is conveniently located close to Yeshwantpur Railway Station. And with the Orion Mall, ISKON Temple, World Trade Centre and Brigade Gateway just 10 minutes away, the hotel gives you an ideal place to relax while being well connected to most destinations Bangalore has to offer.
The bee is a creature which has gone about enriching the tapestry of life with bloom and sweetness. Likewise, our hotel, a namesake of this flying wonder, enriches your stay with luxury where required and gives you comfort all around.
Much like the architectural masterpiece a bee hive is, Hotel Grand Bee, Bangalore, brings you 48 aesthetically designed rooms which have been put together and decorated with precision. The hotel offers three rooms; Executive Non-AC room, Executive AC and the Premium room. Each of these rooms resonate vibrant and aesthetic appeal.
To match the standards of luxury service, Hotel Grand Bee, Bangalore, brings forth quality in-house eateries as well. The Makaranda Restaurant offers the very best of various cuisines while Madhura Bar is the perfect place to unwind with friends and family and has a fine selection of spirits and wines at its disposal.
Hotel Grand Bee, Bangalore, completes its wondrous layout with the addition of modern and sophistically designed conference and banquet halls. Our conference hall, aptly named the Beehive, can host up to 20 individuals and provides cutting edge equipment.
Our banquet hall, Nectar, brings sweetness to all your special occasions. The banquet hall can accommodate up to 300 people.


text:
recommended by Barb M., Keyboard and Folk Music Specialist If you have several guitar students, or several mid-later… read moreOctober 7th
recommended by Rachel Steele and Jen Sper, School Choral Specialists If you haven't read our post about how we… read more
Stanton's has built a reputation as "The Sheet Music Specialists".
Can't attend one of our clinics? Visit Stanton's Virtual Workshop.
In just a few minutes you can have your favorite song printed and ready to play.
Online Service for Music Educators.
Title: Up, Selections From
Voicing/Format: Concert Band
Publisher: Hal Leonard Publishing Corp
Composer: Yiacchino, Michael
Arranger: Brown, Michael
Catalog #: 04001217
Grade: 3
Series: Young Band (CONCERT BAND) Price: $65.00


text:
Earn up to 5% on hotels and 1% on flights - It's free!
By clicking, I agree to the terms and conditions.
= Cheapest round-trip flights
* Prices are round trip per person (conditions apply)
Distance from City Center: 4.6 miles
Distance from City Center: 2.2 miles
Distance from City Center: 48.9 miles
Earn up to 5% on hotels and 1% on flights - It's free!
By clicking, I agree to the terms and conditions.
Discover this pet-friendly Idaho Falls, Idaho hotel overlooking the beautiful Snake River and Falls! Located along Eastern Idaho's Snake River and Falls, the BEST WESTERN PLUS Driftwood Inn is... More
Located along side Snake River Greenbelt and park. Bike rollerblade or take a stroll and feed the ducks. Jet ski boating and boat launch behind hotel. Free hot breakfast. Upper class hotel with... More
Motel 6 Idaho Falls is located near Snake River Falls, Idaho State University, Tautphaus Zoo, and Sandy Downs. All guest rooms have a modern look including granite countertops, 32" LCD TV. Wi-Fi... More
The Shilo Inn Idaho Falls is a deluxe service hotel and convention center, featuring a fine dining restaurant and lounge overlooking the Snake River. Shilo amenities include first run in-room... More
Welcome to Le Ritz Hotel and Suites, where service is the rule not the exception. We are committed to making your stay as memorable as possible. Our luxurious rooms come furnished with all the... More
When searching for cheap flights from Salt Lake City, Orbitz.com is the place to go. No matter where you're flying, there is bound to be a flight available from Delta, Southwest, United Airlines or many other major carriers. Sitting four miles from the central downtown district, Salt Lake City International Airport is the 21st busiest airport in the United States and a great place to find nonstop flights to over 45 locations in the country.
Salt Lake City International Airport offers hourly and daily indoor parking with easy access to terminal one and two for $28.00 a day. Economy parking is also available at a location a few blocks from the main terminal. Parking here is $7.00 per day and includes a free shuttle to the terminal. There are also park and fly options with a number of local businesses. Diamond Airport Parking offers rates that range from $6.60 to $22.38 a day. Perks with this service include a free shuttle to the airport and a car wash.
Most hotels in the Salt Lake area offer a free shuttle to the airport. Depending on traffic and the location of the hotel, a trip in a shuttle could take up to 20 minutes. There are also three taxi companies available. City Cab, Ute Cab and Yellow Cab can take passengers from a hotel or place of business straight to a terminal. Cabs can be hailed on the street or they can be booked online or by phone. Prices vary based on the time of year and how far the trip to the airport is. Utah Transit Authority offers buses to the airport that leave from the city center every 30 minutes during the weekdays, every hour after 7:00 p.m. on weekdays and all day on weekends. This cheap and efficient transportation option costs $2.25 for a one-way trip.
Salt Lake City International Airport offers several dining options in the main concourse, including a concessions area that offers McDonalds, Krispy Kreme and Starbucks. For coffee lovers, the local Mill Creek Coffee Roasters has a location in the airport. Passengers looking for a place to watch a game or grab a beer should try the Squatter Pub Brewery with its large selection of meals and brews. Before booking your next vacation, be sure to check out the cheap flights from Salt Lake City on Orbitz.com.
Orbitz.com can help you find cheap flights to Idaho Falls. The Idaho Falls Regional Airport is located at 2140 N. Skyline Drive in the northwest section of downtown, two miles from the center of the business district. It offers regional service to Salt Lake City, Denver, San Francisco, Las Vegas, Los Angeles, Oakland and Phoenix on Skywest/Delta Airlines, United Express and Allegiant Air. The closest international airport is Salt Lake International Airport in Salt Lake City, but that airport is a three-hour drive from Idaho Falls and can be an impractical choice in bad weather.
Idaho Falls Regional Airport does not offer any mass transit options for getting to or from the airport. However, the airport is located in the downtown area, so it is feasible to walk to many of the local hotels if you don't have too much luggage. Most of the downtown hotels offer free shuttle service to the airport. Other options for transportation include taxicab service and rental cars. For approximately $10, you can take a taxi from the airport to most points in the downtown area. Avis, Budget, National, Enterprise, Thrifty, Alamo and Hertz rental car companies have an outlet at the airport. Orbitz.com can help you find the best price on a rental car when you make your flight reservations.
Idaho Falls averages 38 inches of snowfall annually in the winter months, so travel during this time of the year can be difficult unless you are planning your trip around winter sports options. July is the area's hottest month of the year, with an average temperature around 86 degrees F, whereas January is the coldest, with average temperatures as low as 10 degrees F.
Idaho Falls River Walk, the Tautphaus Park Zoo and the Museum of Idaho are popular attractions in the local area. If you rent a car and are willing to drive a short distance, Yellowstone National Park, Grand Teton National Park and Targhee National Forest are all within 100 miles. Orbitz.com can help you find sales and low-cost tickets to local attractions, as well as help you buy cheap flights to Idaho Falls whenever you want to travel.
|Departing Arriving
|Carrier Flight #
|Flight time
DepartingSLC 11:30 AM
ArrivingIDA 12:34 PM
Delta Air Lines
|Aircraft CRJ
|Flight time 1hr 4min
DepartingSLC 1:45 PM
ArrivingIDA 2:45 PM
Delta Air Lines
|Aircraft CRJ
|Flight time 1hr 0min
DepartingSLC 4:50 PM
ArrivingIDA 5:49 PM
Delta Air Lines
|Aircraft CRJ
|Flight time 0hr 59min
DepartingSLC 9:50 PM
ArrivingIDA 10:42 PM
Delta Air Lines
|Aircraft 320
|Flight time 0hr 52min
Book a qualifying 4-night flight + hotel vacation package between August 13, 2015 12:00AM CT and September 30, 2015 11:59PM CT, for $1750 or more for travel between August 13, 2015 and December 31, 2015 via Orbitz and instantly receive $150 off the hotel portion of your booking through the use of the promotion code. Limit one discount per hotel room and one promotion code per booking. Discounts are not redeemable for cash for any reason. Promotion codes cannot be resold. Any attempt at fraud will be prosecuted to the fullest extent of the law. Void where prohibited, taxed or restricted. Orbitz reserves the right to change or limit the promotion in its sole discretion. Promo code not valid for Las Vegas, NV bookings.
Fare, taxes & fees: Fares include all taxes and fees, except baggage fees. Rates shown reflect fares found by other Orbitz users over the past 48 hours. Due to rapidly changing airline prices & seat availability, these fares may no longer be available.
Refunds/changes/cancellations: Itinerary changes, if permitted for the fare, will have a $30 service fee charged by Orbitz. Additional airline charges may apply.
Other conditions: Schedules, fares and rules are subject to change without notice. Seats are limited and may not be available on all flights/dates or in all markets. Lower fares may be available. Fares will not be honored retroactively or in exchange for any wholly/partially unused ticket. Tickets are non-transferable and non-refundable. Fare rules are provided for the selected itinerary before booking.


text:
Cambridge City Hockey's 2015 Club day is on Saturday 5th September: Junior, Mini, Family Hockey as well as Coaching training and some Men's and Women's 1st team games to watch. Food also available. For more info click below
Looking for a new club? Players of all abilities, you've come to the right place… just come along to summer hockey, any of our training sessions or drop one of our captains an e-mail and we'll do our best to make you welcome!
To register please complete our membership form which can be found here: Senior membership form
Cambridge City Junior Hockey Club is a thriving Junior Club with over 350 members. Players of all abilities between 6-18 years are welcome.
During the 2013/14 season all of our age groups reached their respective Regional finals and three of these teams went on to represent the Club in the England Hockey National Finals: If you have any questions please email Mike
To register please complete our membership form which can be found here: Junior membership form
Veteran's hockey is thriving at Cambridge City proving that life really doesn't end at 40. The team has been unbeaten in the East Hockey league for two seasons and now plays in East Division 4NW. There are also opportunities for veterans to play in Cambridge City's 5th and 6th teams in lower divisions.
Cambridge City has an impressive junior club and many veterans assist with coaching on Sunday mornings and running junior teams. The club enters National Cup competitions at over 40 and over 50 age groups and many members play in county and divisional tournaments throughout the season.
Before the season begins the team has a golf day and hosts the East Veterans Cup in September. We spend a weekend in June playing hockey in Holland and social matters are taken seriously after games and on regular evenings out in the season.
To register please complete our membership form which can be found here: Senior membership form
Did you know that as a member of CCHC then you can get 10% discount at Hobbs Sports in Cambridge: Hobbs Sports.


text:
MARIETTA - The Athens 9-10 All-Stars will face Buckhead in the semifinals of the Georgia Little League Age 9-10 championship tournament today at 9:30 a.m. If they win, the All-Stars will play in the title game Sunday at 4 p.m.
-Staff, wire reports
Athens, GA ? Athens Banner-Herald © 2015. All Rights Reserved. | Terms of Service | Privacy Policy / About Our Ads | Content Removal Policy


text:
Bahamas Beach Home Rental
From $1,500 / week
10 travelers
viewed this property in the past week
Description from the owner
Description from the owner
Bedrooms: 3/
Bathrooms: 2/
Sleeps: 7/
Type: House
Romantic, remote, rustic, mystical Cat Island. Our 3 bedroom, 2 bath beach home is located directly in in the middle of idyllic Fernandez Bay. You can't get any closer to the water without getting wet. The kitchen is fully equipped with all amenities. We have satellite TV, stereo, on-island phone, Weber charcoal grill, beach lounges, patio furnishings, kayaks, hammocks, indoor & outdoor fireplaces. If your interests include swimming, snorkeling, scuba diving, sunbathing, spelunking, exploring, shelling, deep-sea fishing, & just hanging out, then Cat's for you! Our rental includes pick-up & drop-off at the New Bight Airport, our 3 ocean ...Read more
About the owner
About the owner
Lyn Barry
Lyn Barry
- Response rate: 90%
- Response time: A few hours
- Calendar updated: 10 months ago
Overall rating:
Additional Location Information
Located directly in the middle of Fernandez Bay, 1/2 mile north of the New Bight AIrport
More About This Location
Show rates details
Also consider
- FlipKey has rentals in over 11,000 destinations around the world:
- Myrtle Beach vacation rentals - 1,057 rentals from $25/night
- Destin vacation rentals - 1,296 rentals from $99/night
- Anna Maria Island vacation rentals - 1,025 rentals from $100/night
- Florida Keys vacation rentals - 1,321 rentals from $128/night
- Emerald Isle vacation rentals - 630 rentals from $150/night


text:
Summer Shopping of Amrita Mukherjee aka Pihu of Bade Achche Lagte Hain
Added on 2/20/2013
By : tellybuzz
Overall Rating :
Rate Me... Rating Saved!
View : 16688 Comments : 7 Video Courtesy : www.india-forums.com
|Total Votes : 15
|BarunILoveU, AnnetteDew, trieshkalpoe, Triesh, zeylanica, Rehan., luvumjht, ishra_7, iluvhgt, Tiharika, MentalExotica, preet_2010, --Saina--, SouLScOREr, Sandstone
Popular Search Terms: amrita mukherjee
Amrita is so cute, love uuu loads, muah <3
YOU are the cutest girl !!!
:)pihu rocks :)
i luv d way she says "paiyse"
You are an angel rockstar...so cute & bubbly reactions...
Oh man she is beyond cute. I am showing this to dad, he's a big Pihu fan.
Edited on:20 February 2013 at 12:55pm
Keep up the good work amrita. Love you.
Cutie pie :) God bless her
Gold Carpet of the Borplus Gold Awards
Views : 216295
Comments :341
Watch popular Celebs Yash Patnaik ,Juhi ...
Views : 59313
Comments :203
Bade Acche Laggte Hai completes 300 episodes
Views : 23412
Comments :5
Wassup TV - Episode 127
Views : 20131
Comments :72
The adorable child artist Amrita ...
Views : 3431
Comments :1


text:
Longtime baseball fixture Don Zimmer dies at 83
Longtime baseball fixture Don Zimmer dies at 83
ST. PETERSBURG, Fla. — Don Zimmer wasn't a fixture in baseball forever. It just seemed that way.
He played alongside Jackie Robinson on the only Brooklyn Dodgers team to win the World Series. He coached Derek Jeter on the New York Yankees' latest dynasty. And his manager once was the illustrious Casey Stengel.
For 66 years, Zimmer was a most popular presence at ballparks all over, a huge chaw often filling his cheek. Everyone in the game seemed to know him, and love him.
|The article you requested is no longer available on BostonHerald.com.