text:
Places on Pinterest | Tulum, Belize and Tulum Mexico
Un jour ... J'y passerai ... * ... des paysages ... des voyages ... des cultures ... des cafés ... Tulum vacation
Places To Visit, Buckets Lists, 26 Remark, San Ignacio Belize, Remark Places, Travel Deals, Travel Belize, Mayan Ruins Belize, Solo Travel
San Ignacio, Belize, 26 Remarkable Places For Solo Travel
San Ignacio Town, Belize - beautiful and within walking distance of Mayan ruins #belize #reisjunk #travel #world #explore www.reisjunk.nl
26 Remarkable Places For Solo Travel: belize
San Ignacio Town, Belize - beautiful and within walking distance of Mayan ruins. Two places to visit when you are in Belize.
The Bucket List Life – 25 of the Best Places to See – By Yourself!
Buckets Lists, Summer Vacations Destinations, Belize Honeymoons, Cruises Belize, Beautiful Places, Caves Tube Belize, Belize Cruises, Belize Cav Tube, Belize Caves Tube
belize cave tubing (BELIZE)
belize cave tubing | Flickr - Photo Sharing! Have been in this exact spot. Beautiful place and a wonderful trip!
by MonicaSmoot Pinned from
Glovers Atoll was named after two pirate brothers in the 1750s. Today, it is a World Heritage Site and marine reserve.
Sand bar, Glovers Reef, Belize
Travelphotographi Travelinspir, Blue Sands, Belize Travel, Travel Travelphotographi, Ocean Blue, Barrier Reefs, Glover Reefs Bel, Sands Bar, Karen Aspencreektravel With
Sand bar, Glovers Reef, Belize #travel #travelphotography #travelinspiration #Belize
Blue Sand Bar, Glovers Reef, Belize
by hjzla Pinned from
Water, Inspiration, The Ocean, Ocean Waves, Dark Paradis, The Waves, Deep Blue, Natural, The Sea
There is something very eerily mesmerising about flowing water... love the deep blue and green icy tones.
Marrakech, Greenkitchenstories
Marrakech // Green Kitchen Stories
The Stylish Beaches of Tulum, Mexico Photo: Moses Berkson GUIDE TO TULUM Getting There Most major airlines, including Jet Blue, American, and Virgin America, fly direct to Cancún, Mexico. From there, rent a car for the 75-mile drive south. Getting Around The best way to navigate Tulum is on foot or by bike (iguanabike.com). Safety Tulum is considered safe.
from Travel + Leisure The Stylish Beaches of Tulum, Mexico
TULUM: The Stylish Beaches of Tulum, Mexico
At The Beaches, Tulum Photo, Bicycles Girls, Bike, Tulum Mexico, Tulum Beaches, Stylish Beaches, Tulum Travel, Travel Photography
Bike Pretty at the beach
Travel and Leisure article on Tulum beaches - Riviera Maya,restaurant,bar,exterior,portrait,model,woman,bicycle,Tulum,Mexico
Positive Breathtak, Absolutely Positive, Tulum Mexico, Jungles Side, Constant Reminder, Mexico Jungles
Mya Henry On: Hartwood, Tulum & Bohemian Cocktails | The Tory Blog
from Tory Burch Mya Henry On: Hartwood, Tulum & Bohemian Cocktails
TULUM. Mya Henry On: Hartwood, Tulum & Bohemian Cocktails | The Tory Blog
Wedding Parties, Tory Blog, Mexico Beaches, Outdoor Vibes, Outdoor Bars, Gardens Outdoors Landscape, Chic Coastal Living, Destinations Wedding, Beaches Bar
i would re-create this white washed bar on the beach - for one of our destination wedding parties in st barth or turks caicos
Mya Henry On: Hartwood, Tulum Bohemian Cocktails | The Tory Blog Plan A, B, C, D.......: retire to an island, run a beachside stand offering the most amazing sea fare - not hard work if you love it. swap the cars for a boat the bed for hammocks, swap out most of my wardrobe for colorful bikinis flippies...
beach restaurant...cool outdoor vibe
from Food & Wine Winter Escapes
Royals Mansour, Mansour Marrakesh, Favorite Places, Outdoor Living, Marrakech Morocco, Favorite Hotels, Mansour Marrakech, Luxury Hotels, Pools Design
Royal Mansour Marrakesh - mediterranean - pool - miami - OBM International
Pool Design, Pictures, Remodel, Decor and Ideas - page 125
Royal Mansour, Luxury Hotels in Marrakesh | Details and Reviews on Royal Mansour from stylish members.
Wake up in paradise! @ Six Senses Laamu, Maldives
Sen Professionalism, Maldives Honeymoons, Islands Life, Beaches House, Travel Buckets Lists, Islands Living, The Maldives, Maldives Islands, Dreams Destinations
My all time dream destination - Maldives
Maldives, Island Life. on my travel bucket list
Maldives, Island Living
Polignano a Mare, Puglia, Italie. https://www.hotelkamerveiling.nl/hotels/italie.html
Favorite Places, Beaches Time, Places I D, Beaches Parties, Italy Travel, Travel Destinations, French Riviera, Puglia Italy, Wanderlust
Sardinia // Beach Party
Puglia, Italy #travel
#Sardinia #Italy #travel #destination
Mr & Mrs Smith - Viceroy Bali
Resorts Hotels, Resorts Spa, Buckets Lists, Dreams Vacations, Swim Pools, Viceroy Bali, Bali Resorts, Infinity Pools, Bali Indonesia
Nothing I love more than the wilderness and an infinity pool. Viceroy Bali - #Bali #Indonesia #iGottaTravel
Viceroy Bali swimming pool with a view
Love Travel. My dream destination is Bali! I must admit I have a huge travel bucket list, but Bali is one of my top dream destinations. I love tropical weather and lush vegetation. The beauty of ancient cultures combined with a natural paradise is irrestible to me! #kiwibemine #travel Viceroy Bali Hotel, Ubud, Bali
Gardenista Posts, Summer Vacations, Places To Travel, Nicaragua Morgan Rocks, This Summer, Rocks Eco Resorts, 10 Places, Dreams Summer, Rocks Ecoresort
Nicaragua, Morgan's Rock eco resort
10 places to travel in the summer
Dream Summer Vacation Plans
10 Great Places to Travel This Summer by Michelle Slatalla
In the News: Top 5 Gardenista Posts of the Week: Remodelista
We hope your travels take you to a cabana in Baja this summer!
under a cabana in Baja
Curtains Ties, Summer Fashion, Beautiful Summer, Summer Outfit, California, This Summer, Baja Fashion, The Beach, Baja Mermaids
Curtains ties for the deck
Coronados Islands, Baja California
under a cabana in Baja #mermaid
Water, Sands, At The Beaches, Cherries Blossoms, Beaches Waves, The Ocean, Ocean Waves, The Waves, Mornings Lights
Waves on the White Sand FROM: The Cherry Blossom Girl - Maldives 75
Morning light on the beach. I can almost hear it !! Awwwwwww
LOUISA nextstopfw | iphone4 I phone5 iphone6 wallpaper background screen design nature beach sand water sea sky sunset
Surf town, Muizenberg Beach, Cape Town, South Africa
from Condé Nast Traveler Surf Spots in Africa: A Swimwear Designer's Guide to the Best Waves
Town South Africa, Africa Muizenberg, Africans Beaches, Beaches House, Beaches Condos, Capes Town, Muizenberg Capetown, Beautiful Photography, Africans Style
Panama City Beach Vacation Rentals - Perfect beachfront vacations start here! Aqua Resort offers the ultimate Panama City Beach condos and vacation rentals, with the most luxurious condos on Florida beaches. http://aqua-gulf.com
african beach houses - Google Search
Muizenberg Beach, Cape Town, South Africa #muizenberg #capetown
beautiful photography of south africa - Google Search
Lassen Volcanic National Park, Redding, CA -- We will definitely have to check this out! So beautiful!
Lassen Volcanic National Park, Redding, CA --
California National Parks, Beautiful National, California Travel, Pluma National Parks, Lassen Volcanic National Parks, Redwood National Parks, Lassen National Parks, California Lassen Parks, Vale
arnojenkinsphotography.com
Marrakech, The Menara. Watera and sky seem one thing!
Favorite Places, Moet Hebben, Iii Close, Gezien Moet, Marrakech Morocco, Beautiful Places, Morocco Iii, Je Gezien, Life مغربي
Wonderful Morocco http://www.travelandtransitions.com/
Doors Entrance, Morocco Iv, Marvel Morocco, Moroccan Style, Callejeando Sin, He Did Maroc, Entrance Exit, Moroccan Stuff, Morocco Old Spain
beauty-full-struggle.tumblr.com
Lakes Powell, Outdoor Hotels, Under The Stars, Buckets Lists, Outdoor Rooms, Hotels Suits, Amangiri Resorts, Outdoor Resorts, Hotels Rooms
Outdoor room !! sleeping under the stars (Amangiri Resort, Lake Powell, Canyon Point, Utah)
An Outdoor Hotel Room - Bliss........... Amangiri Resort, Lake Powell, Canyon Point, Utah.. I'm taking Jamie! He's ALL about sleeping under the stars.. well here we go!!
An Outdoor Hotel Room - Bliss........... Amangiri Resort, Lake Powell, Canyon Point, Utah bucket list
Outdoor resorts: Amangiri Resort, Lake Powell, Canyon Point, Utah

value: Pinterest is an American image sharing and social media service designed to enable saving and discovery of information (specifically "ideas") on the internet using images and, on a smaller scale, animated GIFs and videos, in the form of pinboards. The site was created by Ben Silbermann, Paul Sciarra, and Evan Sharp and had over 478 million global monthly active users as of March 2021.


text:
Patent US4797910 - Automated operator assistance calls with voice processing - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA method and apparatus for identifying the class of an operator assistance call in order to reduce the operator work time for serving such a call. A customer dials 0 or dials 0 plus a directory number and is connected to a program controlled operator assistance system or switch. The switch initially...http://www.google.com/patents/US4797910?utm_source=gb-gplus-sharePatent US4797910 - Automated operator assistance calls with voice processingAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS4797910 APublication typeGrantApplication numberUS 06/860,651Publication dateJan 10, 1989Filing dateMay 7, 1986Priority dateMay 7, 1986Fee statusPaidAlso published asCA1282479C, EP0245028A2, EP0245028A3Publication number06860651, 860651, US 4797910 A, US 4797910A, US-A-4797910, US4797910 A, US4797910AInventorsAbraham N. DaudelinOriginal AssigneeAmerican Telphone And Telegraph Company, At&T Bell LaboratoriesExport CitationBiBTeX, EndNote, RefManPatent Citations (15), Non-Patent Citations (12), Referenced by (180), Classifications (12), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetAutomated operator assistance calls with voice processing
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS3614328 *Jun 24, 1969Oct 19, 1971Kenneth Eugene McnaughtonAutomatic subscriber answering serviceUS3920908 *Jun 25, 1974Nov 18, 1975Constantine R KrausBuyer credit service for a telephone systemUS4054756 *Sep 29, 1976Oct 18, 1977Bell Telephone Laboratories, IncorporatedMethod and apparatus for automating special service call handlingUS4468528 *Mar 24, 1982Aug 28, 1984At&T Technologies, Inc.Methods and apparatus for providing enhanced announcements in a telephone systemUS4481384 *Jul 21, 1981Nov 6, 1984Mitel CorporationVoice recognizing telephone call denial systemUS4488005 *May 13, 1982Dec 11, 1984Texas Instruments IncorporatedTelephone answering apparatus with call-screening capabilitiesUS4623761 *Apr 18, 1984Nov 18, 1986Golden Enterprises, IncorporatedTelephone operator voice storage and retrieval systemUS4677609 *May 8, 1985Jun 30, 1987American Telephone And Telegraph Company, At&T Bell LaboratoriesSemi-automated directory assistance systemsDE3229659A1 *Aug 9, 1982Feb 9, 1984Siemens AgMethod for transferring specific orders in telephone systems, in particular in telephone PABX systemsDE3236272A1 *Sep 30, 1982Apr 5, 1984Siemens AgFernsprechvermittlungssystem fuer oeffentliche oder private waehlnetze mit zumindest einer zentralen waehlinformations-aufnahme/verarbeitungs-einrichtungDE3422409A1 *Jun 16, 1984Dec 19, 1985Standard Elektrik Lorenz AgEinrichtung zur erkennung und umsetzung von wahlinformation sowie von steuerinformation fuer leistungsmerkmale einer fernsprechvermittlungsanlageJPS5690663A * Title not availableJPS5986357A * Title not availableJPS60150398A * Title not availableJPS60254958A * Title not available* Cited by examinerNon-Patent CitationsReference1"Application of Speech Recognition and Synthesis to PABX Services", Mulla and Vaughan, Electrical Communication, vol. 59, No. 3, May 1985, pp. 273-280.2"Selected Military Applications of Automatic Speech Recognition Technology", Woodard and Copples, IEEE Communications Mag., Dec. 1983, pp. 35-41.3 *Application of Speech Recognition and Synthesis to PABX Services , Mulla and Vaughan, Electrical Communication, vol. 59, No. 3, May 1985, pp. 273 280.4J. P. Moosemiller, "AT&T Conversant™ I Voice System", Speech Technology, Mar./Apr. 1986, pp. 88-93.5 *J. P. Moosemiller, AT&T Conversant I Voice System , Speech Technology, Mar./Apr. 1986, pp. 88 93.6J. W. Johnson et al., "Integrated Digital Services on the 5ESS™ System", ISS '84, (Florence), Session 14A, Paper 3, May 1984, pp. 1-8.7 *J. W. Johnson et al., Integrated Digital Services on the 5ESS System , ISS 84, (Florence), Session 14A, Paper 3, May 1984, pp. 1 8.8N. X. DeLessio et al., "An Integrated Operator Services Capability for the 5ESS Switching System", ISS '84, (Florence), Session 22C, Paper 3, May 1984, pp. 1-5.9 *N. X. DeLessio et al., An Integrated Operator Services Capability for the 5ESS Switching System , ISS 84, (Florence), Session 22C, Paper 3, May 1984, pp. 1 5.10S. D. Hester et al., "The AT&T Multi-Mode Voice Systems--Full Spectrum Solutions for Speech Processing Applications", Proceedings of the 1985 AVIOS Conference.11 *S. D. Hester et al., The AT&T Multi Mode Voice Systems Full Spectrum Solutions for Speech Processing Applications , Proceedings of the 1985 AVIOS Conference.12 *Selected Military Applications of Automatic Speech Recognition Technology , Woodard and Copples, IEEE Communications Mag., Dec. 1983, pp. 35 41.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS4852149 *Jun 29, 1988Jul 25, 1989Dialogic CorporationAutomated call filterUS4899375 *Sep 23, 1988Feb 6, 1990American Telephone & Telegraph Company, At&T Bell LaboratoriesMore efficient call handling for operator assistance callsUS4933966 *Jan 23, 1989Jun 12, 1990Intellicall, Inc.Method and apparatus for performing an automated collect callUS4939771 *Sep 20, 1989Jul 3, 1990At&T Bell LaboratoriesAttendant-controlled call message delivery system and methodUS4945557 *Apr 5, 1989Jul 31, 1990Ricoh Company, Ltd.Voice activated dialing apparatusUS4969185 *Dec 29, 1989Nov 6, 1990At&T Bell LaboratoriesAutomated booking of telecommunications callsUS5043983 *Jul 31, 1989Aug 27, 1991At&T Bell LaboratoriesTime and charges information delivery for operator assistance telecommunication callsUS5046088 *Oct 31, 1989Sep 3, 1991Dialogic CorporationConverter for in-band routing and/or origination informationUS5046183 *Jul 31, 1989Sep 3, 1991At&T Bell LaboratoriesSemi-automated operator assistance telecommunication callsUS5093858 *Jun 11, 1990Mar 3, 1992Intellicall, Inc.Method and apparatus for performing an automated collect callUS5131027 *Jun 11, 1990Jul 14, 1992Intellicall, Inc.Short time validity storageUS5144648 *May 16, 1991Sep 1, 1992Mobile Telecommunication TechnologiesMethod and apparatus for processing pagesUS5157718 *Nov 29, 1989Oct 20, 1992Murray KaplanInterface adapter permitting tops position to function as directory assistance unitUS5161181 *Jan 10, 1990Nov 3, 1992Dialogic CorporationAutomatic number identification blocking systemUS5163083 *Oct 12, 1990Nov 10, 1992At&T Bell LaboratoriesAutomation of telephone operator assistance callsUS5185781 *Mar 27, 1991Feb 9, 1993At&T Bell LaboratoriesAutomation of telephone operator assistance callsUS5199062 *Nov 8, 1991Mar 30, 1993Phone Base Systems Inc.Telephone communications system including a digital telephone switch, a voice response unit and a stored program sequence for controlling both the switch and the voice response unitUS5287403 *Jul 22, 1992Feb 15, 1994At&T Bell LaboratoriesMethod and apparatus for processing telephone calls charged to credit cardsUS5309504 *Nov 18, 1991May 3, 1994Syntellect Acquisition Corp.Automated identification of attendant positions in a telecommunication systemUS5319701 *Mar 4, 1993Jun 7, 1994First City, Texas-DallasMethod and apparatus for performing an automated collect callUS5333180 *Sep 23, 1991Jul 26, 1994At&T Bell LaboratoriesCall message delivery system and method utilizing caller-selected system announcementsUS5335266 *Apr 1, 1992Aug 2, 1994United States Advance Network, Inc.Automated telecommunication peripheral systemUS5351290 *Sep 11, 1992Sep 27, 1994Intellicall, Inc.Telecommunications fraud prevention system and methodUS5355403 *Apr 1, 1992Oct 11, 1994United States Advance Network, Inc.Customized, billing-controlled call bridging systemUS5392343 *Nov 10, 1992Feb 21, 1995At&T Corp.On demand language interpretation in a telecommunications systemUS5463684 *Nov 3, 1993Oct 31, 1995Microlog CorporationTelecommunications system for transferring calls without a private branch exchangeUS5479488 *Feb 8, 1994Dec 26, 1995Bell CanadaMethod and apparatus for automation of directory assistance using speech recognitionUS5483581 *Jun 6, 1994Jan 9, 1996Intellicall, Inc.Method and apparatus for performing an automated collect callUS5487103 *Apr 12, 1994Jan 23, 1996United States Advanced Network, Inc.Enhanced wide area audio response networkUS5487107 *Feb 14, 1994Jan 23, 1996At&T Ipm Corp.Method and apparatus for processing telephone calls charged to credit cardsUS5488652 *Apr 14, 1994Jan 30, 1996Northern Telecom LimitedMethod and apparatus for training speech recognition algorithms for directory assistance applicationsUS5509060 *Nov 19, 1993Apr 16, 1996At&T Corp.Network-accessible intelligent telephone serviceUS5581607 *Jun 6, 1994Dec 3, 1996United States Advanced Network, Inc.Customized, billing-controlled call bridging systemUS5619556 *Jun 15, 1994Apr 8, 1997United States Advanced Network, Inc.Automated telecommunication peripheral systemUS5627887 *Feb 21, 1996May 6, 1997At&TMethod for processing collect callsUS5638425 *Nov 2, 1994Jun 10, 1997Bell Atlantic Network Services, Inc.Automated directory assistance system using word recognition and phoneme processing methodUS5644680 *May 25, 1995Jul 1, 1997Northern Telecom LimitedUpdating markov models based on speech input and additional information for automated telephone directory assistanceUS5652785 *May 30, 1995Jul 29, 1997United Stated Advanced Network, Inc.Enhanced wide area audio response networkUS5684863Jun 7, 1995Nov 4, 1997Ronald A. Katz, Technology Lic. L.P.Telephonic-interface statistical analysis systemUS5692034 *May 19, 1995Nov 25, 1997United States Advanced Network, Inc.Customized, billing-controlled call bridging systemUS5729600 *Jun 25, 1992Mar 17, 1998Rockwell International CorporationAutomatic call distributor with automated voice responsive call servicing system and methodUS5732133 *Jun 7, 1996Mar 24, 1998Smart Tone Authentication, Inc.System and method for selecting and generating telephone access numbers for limiting access to a telephone serviceUS5745555 *Jun 7, 1996Apr 28, 1998Smart Tone Authentication, Inc.System and method using personal identification numbers and associated prompts for controlling unauthorized use of a security device and unauthorized access to a resourceUS5765131 *Jan 24, 1995Jun 9, 1998British Telecommunications Public Limited CompanyLanguage translation system and methodUS5787156Sep 14, 1994Jul 28, 1998Ronald A. Katz Technology Licensing, LpTelephonic-interface lottery systemUS5793846Nov 16, 1995Aug 11, 1998Ronald A. Katz Technology Licensing, LpTelephonic-interface game control systemUS5815551Jun 7, 1995Sep 29, 1998Ronald A. Katz Technology Licensing, LpTelephonic-interface statistical analysis systemUS5818930 *Jun 7, 1996Oct 6, 1998Smart Tone Authentication, Inc.Auto-dialer housingUS5825871 *Jun 7, 1996Oct 20, 1998Smart Tone Authentication, Inc.Information storage device for storing personal identification informationUS5835572 *Aug 20, 1997Nov 10, 1998United States Advanced Network, Inc.Customized, billing controlled call bridging systemUS5839107 *Nov 29, 1996Nov 17, 1998Northern Telecom LimitedMethod and apparatus for automatically generating a speech recognition vocabulary from a white pages listingUS5859902 *May 6, 1997Jan 12, 1999At&T CorpMethod for processing collect callsUS5894511 *Jun 27, 1996Apr 13, 1999Mci Worldcom, Inc.Validation query based on a supervisory signalUS5898762Jun 6, 1995Apr 27, 1999Ronald A. Katz Technology Licensing, L.P.Telephonic-interface statistical analysis systemUS5907597 *Feb 23, 1996May 25, 1999Smart Tone Authentication, Inc.Method and system for the secure communication of dataUS5917893Jun 7, 1995Jun 29, 1999Ronald A. Katz Technology Licensing, L.P.Multiple format telephonic interface control systemUS5923747 *Sep 27, 1996Jul 13, 1999Rockwell International Corp.Communications system and interface circuit for interconnecting telephonic switch and agent computerUS5930343 *Nov 21, 1997Jul 27, 1999Lucent Technologies Inc.Toll call rate providerUS5943403 *Jul 8, 1998Aug 24, 1999United States Advance Network, Inc.Customized, billing-controlled call bridging systemUS5949874 *Nov 25, 1997Sep 7, 1999Smart Tone Authentication, Inc.Method and system for compensating for signal deviations in tone signals over a transmission channelUS5960072 *Mar 4, 1993Sep 28, 1999Intellicall, Inc.Method and apparatus for altering the access format of telephone callsUS5974120 *Jun 7, 1995Oct 26, 1999Ronald A. Katz Technology Licensing, L.P.Telephone interface call processing system with call selectivityUS5982858 *Sep 9, 1997Nov 9, 1999Messagephone, Inc.System for providing automatic voice messaging in a digital network environmentUS5983177 *Dec 18, 1997Nov 9, 1999Nortel Networks CorporationMethod and apparatus for obtaining transcriptions from multiple training utterancesUS5987408 *Dec 16, 1996Nov 16, 1999Nortel Networks CorporationAutomated directory assistance system utilizing a heuristics model for predicting the most likely requested numberUS5987414 *Oct 31, 1996Nov 16, 1999Nortel Networks CorporationMethod and apparatus for selecting a vocabulary sub-set from a speech recognition dictionary for use in real time automated directory assistanceUS5995929 *Sep 12, 1997Nov 30, 1999Nortel Networks CorporationMethod and apparatus for generating an a priori advisor for a speech recognition dictionaryUS6014441 *Nov 25, 1997Jan 11, 2000Smart Tone Authentication, Inc.Method and system for generation of tone signals over a transmission channelUS6016344Apr 10, 1989Jan 18, 2000Katz; Ronald A.Telephonic-interface statistical analysis systemUS6018708 *Aug 26, 1997Jan 25, 2000Nortel Networks CorporationMethod and apparatus for performing speech recognition utilizing a supplementary lexicon of frequently used orthographiesUS6031898 *Dec 31, 1998Feb 29, 2000Mci Communications CorporationValidation query based on a supervisory signalUS6035021Jun 7, 1995Mar 7, 2000Katz; Ronald A.Telephonic-interface statistical analysis systemUS6044135Aug 12, 1998Mar 28, 2000Ronald A. Katz Technology Licensing, L.P.Telephone-interface lottery systemUS6044142 *May 6, 1997Mar 28, 2000Telefonaktiebolaget L M EricssonMethod and arrangement for integrating intelligent network services with operator assisted servicesUS6065016 *Aug 6, 1996May 16, 2000At&T CorporationUniversal directory serviceUS6092045 *Jul 21, 1998Jul 18, 2000Nortel Networks CorporationMethod and apparatus for speech recognitionUS6098040 *Nov 7, 1997Aug 1, 2000Nortel Networks CorporationMethod and apparatus for providing an improved feature set in speech recognition by performing noise cancellation and background maskingUS6108410 *Sep 17, 1998Aug 22, 2000Nynex Science And Technology Inc.Methods and apparatus for automating the detection, reporting and correction of operator input errorsUS6122361 *Sep 12, 1997Sep 19, 2000Nortel Networks CorporationAutomated directory assistance system utilizing priori advisor for predicting the most likely requested localityUS6141405 *Sep 12, 1997Oct 31, 2000At&T CorpMethod and system for detecting fraudulent collect callsUS6148065Jan 13, 1998Nov 14, 2000Ronald A. Katz Technology Licensing, L.P.Telephonic-interface statistical analysis systemUS6151387Aug 5, 1998Nov 21, 2000Ronald A. Katz Technology Licensing, L.P.Telephonic-interface game control systemUS6173279 *Apr 9, 1998Jan 9, 2001At&T Corp.Method of using a natural language interface to retrieve information from one or more data resourcesUS6208964Aug 31, 1998Mar 27, 2001Nortel Networks LimitedMethod and apparatus for providing unsupervised adaptation of transcriptionsUS6243680Jun 15, 1998Jun 5, 2001Nortel Networks LimitedMethod and apparatus for obtaining a transcription of phrases through text and spoken utterancesUS6243684Feb 19, 1999Jun 5, 2001Usada, Inc.Directory assistance system and method utilizing a speech recognition system and a live operatorUS6253173Oct 20, 1997Jun 26, 2001Nortel Networks CorporationSplit-vector quantization for speech signal involving out-of-sequence regrouping of sub-vectorsUS6256661 *Sep 19, 1997Jul 3, 2001Hitachi, Ltd.Method and apparatus for connecting terminals in a remote consulting systemUS6292547Mar 15, 1999Sep 18, 2001Ronald A. Katz Technology Licensing, L.P.Telephonic-interface statistical analysis systemUS6349134Jun 7, 1995Feb 19, 2002Ronald A. Katz Technology Licensing, L.P.Telephonic-interface statistical analysis systemUS6359971Aug 21, 1995Mar 19, 2002American Telephone And Telegraph, Co.User display in speech recognition systemUS6366658May 7, 1998Apr 2, 2002Mci Communications CorporationTelecommunications architecture for call center services using advanced interactive voice responsive service nodeUS6389126May 7, 1998May 14, 2002Mci Communications CorporationService provisioning system for interactive voice response servicesUS6404874Oct 10, 2000Jun 11, 2002Cisco Technology, Inc.Telecommute serverUS6418205May 7, 1998Jul 9, 2002Mci Communications CorporationCall and circuit state machine for a transaction control layer of a communications signaling gatewayUS6424703Feb 11, 1998Jul 23, 2002Ronald A. Katz Technology Licensing, L.P.Telephonic-interface lottery systemUS6427002May 7, 1998Jul 30, 2002Worldcom, Inc.Advanced interactive voice response service nodeUS6427006Sep 16, 1998Jul 30, 2002Bell Atlantic Network Services, Inc.Methods and apparatus for servicing directory assistance calls requesting non-published number informationUS6430274Jan 18, 2000Aug 6, 2002Worldcomm Inc.Validation query based on a supervisory signalUS6434223May 17, 1999Aug 13, 2002Ronald A. Katz Technology Licensing, L.P.Telephone interface call processing system with call selectivityUS6449346Jun 7, 1995Sep 10, 2002Ronald A. Katz Technology Licensing, L.P.Telephone-television interface statistical analysis systemUS6480598Sep 17, 1998Nov 12, 2002Verizon Services Corp.Methods and apparatus for automating the telephone operator servicesUS6493353May 7, 1998Dec 10, 2002Mci Communications CorporationCommunications signaling gateway and system for an advanced service nodeUS6496567 *May 7, 1998Dec 17, 2002Mci Communications CorporationInteractive voice response service node with advanced resource managementUS6512415Jun 28, 1999Jan 28, 2003Ronald A. Katz Technology Licensing Lp.Telephonic-interface game control systemUS6570967Jun 7, 1995May 27, 2003Ronald A. Katz Technology Licensing, L.P.Voice-data telephonic interface control systemUS6643622Jun 4, 2001Nov 4, 2003Robert O. StuartData retrieval assistance system and method utilizing a speech recognition system and a live operatorUS6647111May 7, 1998Nov 11, 2003Mci Communications CorporationSystem for executing advanced interactive voice response services using service-independent building blocksUS6678360Aug 25, 2000Jan 13, 2004Ronald A. Katz Technology Licensing, L.P.Telephonic-interface statistical analysis systemUS6714641 *Nov 17, 1998Mar 30, 2004Nortel Networks, LtdWeb based personal directoryUS6836540 *Jul 3, 2002Dec 28, 2004Evercom Systems, Inc.Systems and methods for offering a service to a party associated with a blocked callUS7020262Feb 12, 2004Mar 28, 2006Nortel Networks, Ltd.Web based personal directoryUS7047196Feb 16, 2001May 16, 2006Agiletv CorporationSystem and method of voice recognition near a wireline node of a network supporting cable television and/or video deliveryUS7107217 *Aug 29, 2001Sep 12, 2006Fujitsu LimitedVoice interactive system and voice interactive methodUS7120237May 30, 2002Oct 10, 2006Bellsouth Intellectual Property Corp.Systems and methods for collect call processingUS7180994Jun 13, 2002Feb 20, 2007Volt Information Sciences, Inc.Method and system for operator services automation using an operator services switchUS7505406Jul 13, 2001Mar 17, 2009Evercom Systems, Inc.Public telephone control with voice over internet protocol transmissionUS7529357Jul 12, 2007May 5, 2009Evercom Systems, Inc.Inmate management and call processing systems and methodsUS7567658Jun 22, 2005Jul 28, 2009Intellicall, Inc.Method to verify designation of pay telephone with an interexchange carrierUS7567661Dec 31, 2003Jul 28, 2009Nortel-Networks LimitedTelephony service information management systemUS7606359Sep 17, 1998Oct 20, 2009Verizon Services Corp.Methods and apparatus for automating the servicing of telephone calls including requesting directional and/or other types of informationUS7623644Jul 3, 2003Nov 24, 2009Mci Communications CorporationSystem for executing advanced interactive voice response services using service-independent building blocksUS7685523Nov 17, 2005Mar 23, 2010Agiletv CorporationSystem and method of voice recognition near a wireline node of network supporting cable television and/or video deliveryUS7831031Aug 22, 2006Nov 9, 2010Volt Delta Resources LlcMethod and system for operator services automation using an operator services switchUS7876744 *Apr 4, 2005Jan 25, 2011Ey-Taeg KwonMethod for collect call service based on VoIP technology and system thereofUS7881446Sep 2, 2005Feb 1, 2011Confinement Telephony Technology, LlcTelephony system and method with enhanced validationUS7899167Aug 15, 2003Mar 1, 2011Securus Technologies, Inc.Centralized call processingUS7916845Apr 13, 2006Mar 29, 2011Securus Technologies, Inc.Unauthorized call activity detection and prevention systems and methods for a Voice over Internet Protocol environmentUS7933775Nov 14, 2005Apr 26, 2011Eliza CorporationMethod of and system for providing adaptive respondent training in a speech recognition application based upon the inherent response of the respondentUS8000269Mar 15, 2004Aug 16, 2011Securus Technologies, Inc.Call processing with voice over internet protocol transmissionUS8031849Sep 2, 2005Oct 4, 2011Confinement Telephony Technology, LlcTelephony system and method with enhanced fraud controlUS8064580Sep 2, 2005Nov 22, 2011Confinement Telephony Technology, LlcTelephony system and method with improved fraud controlUS8068590Nov 22, 2006Nov 29, 2011Securus Technologies, Inc.Optimizing profitability in business transactionsUS8090090 *Jun 26, 2008Jan 3, 2012Grape Technology Group, Inc.Method and apparatus for monitoring telephonic members and providing directory assistanceUS8095370Sep 17, 2004Jan 10, 2012Agiletv CorporationDual compression voice recordation non-repudiation systemUS8180028Feb 4, 2009May 15, 2012Securus Technologies, Inc.System and method for called party controlled message deliveryUS8255300May 17, 2007Aug 28, 2012Securus Technologies, Inc.System and method for independently authorizing auxiliary communication servicesUS8295446Sep 2, 2005Oct 23, 2012Confinement Telephony Technology, LlcTelephony system and method with enhanced call monitoring, recording and retrievalUS8340260Mar 24, 2009Dec 25, 2012Securus Technologies, Inc.Inmate management and call processing systems and methodsUS8477766Dec 15, 2010Jul 2, 2013Ey-Taeg KwonMethod for collect call service based on VoIP technology and system thereofUS8583527Aug 3, 2012Nov 12, 2013Securus Technologies, Inc.System and method for independently authorizing auxiliary communication servicesUS8761353May 25, 2012Jun 24, 2014Confinement Telephony Technology, LlcTelephony system and method with enhanced call monitoring, recording and retrievalUS8923499Feb 8, 2005Dec 30, 2014Wavport, L.L.C.Apparatus and method for providing enhanced telecommunications servicesUS9049289Oct 22, 2004Jun 2, 2015RPX Clearinghouse LLPRemote telephony service managementUS9560193Apr 23, 2015Jan 31, 2017Securus Technologies, Inc.Systems and methods for detecting a call anomaly using biometric identificationUS9578169Mar 21, 2011Feb 21, 2017Eliza CorporationMethod of and system for providing adaptive respondent training in a speech recognition applicationUS20010021245 *Apr 5, 2001Sep 13, 2001Ronald A. Katz Technology Licensing, L.P.Telephonic-interface statistical analysis systemUS20010056350 *Feb 16, 2001Dec 27, 2001Theodore CalderoneSystem and method of voice recognition near a wireline node of a network supporting cable television and/or video deliveryUS20020025027 *Jul 30, 1999Feb 28, 2002Ronald A. KatzTelephonic-interface statistical analysis systemUS20020034283 *Jun 13, 2001Mar 21, 2002Ronald A. Katz Technology Licensing, L.P.Voice-data telephonic interface control systemUS20020059072 *Oct 16, 2001May 16, 2002Nasreen QuibriaMethod of and system for providing adaptive respondent training in a speech recognition applicationUS20020077172 *Dec 11, 2001Jun 20, 2002Konami CorporationVirtual image/real image superimposing and displaying apparatus, and slot machineUS20020080934 *Mar 17, 1998Jun 27, 2002Ronald A. KatzTelephonic-interface statistical analysis systemUS20020087321 *Aug 29, 2001Jul 4, 2002Fujitsu LimitedVoice interactive system and voice interactive methodUS20020194096 *Apr 29, 2002Dec 19, 2002Richard FalconeOptimizing profitability in business transactionsUS20030086546 *Jul 3, 2002May 8, 2003Richard FalconeSystems and methods for offering a service to a party associated with a blocked callUS20030088403 *Oct 23, 2001May 8, 2003Chan Norman CCall classification by automatic recognition of speechUS20030195753 *Apr 10, 2002Oct 16, 2003Homuth Brandon GabrielSystems and methods for providing priority customer serviceUS20040136517 *Jul 3, 2003Jul 15, 2004Worldcom, Inc.System for executing advanced interactive voice response services using service-independent building blocksUS20040161095 *Feb 12, 2004Aug 19, 2004Kredo Thomas J.Web based personal directoryUS20040208299 *May 3, 2004Oct 21, 2004Katz Ronald A.Voice-data telephonic interface control systemUS20050033581 *Sep 17, 2004Feb 10, 2005Foster Mark J.Dual compression voice recordation non-repudiation systemUS20050152521 *Feb 8, 2005Jul 14, 2005Liljestrand Keith A.Apparatus and method for providing enhanced telecommunications servicesUS20050180404 *Apr 4, 2005Aug 18, 2005Ey-Taeg KwonMethod for collect call service based on VoIP technology and system thereofUS20060080106 *Nov 17, 2005Apr 13, 2006Theodore CalderoneSystem and method of voice recognition near a wireline node of a network supporting cable television and/or video deliveryUS20060122833 *Nov 14, 2005Jun 8, 2006Nasreen QuibriaMethod of and system for providing adaptive respondent training in a speech recognition application based upon the inherent response of the respondentUS20070064890 *Aug 22, 2006Mar 22, 2007Scott Dwight EMethod and system for operator services automation using an operator services switchUS20070242658 *Apr 13, 2006Oct 18, 2007Evercom Systems, Inc.Unauthorized call activity detection and prevention systems and methods for a voice over internet protocol environmentUS20080219422 *May 17, 2007Sep 11, 2008Evercom Systems, Inc.System and method for independently authorizing auxiliary communication servicesUS20090067608 *Jun 26, 2008Mar 12, 2009Cox Patrick MMethod and apparatus for monitoring telephonic members and providing directory assistanceUS20090097627 *Feb 8, 2005Apr 16, 2009Liljestrand Keith AApparatus and method for providing enhanced telecommunications servicesUS20090144764 *Nov 30, 2007Jun 4, 2009At&T Knowledge Ventures, L.P.Billing adjustment system for multimedia contentUS20110080906 *Dec 15, 2010Apr 7, 2011Ey-Taeg KwonMethod for collect call service based on voip technology and system thereofUS20110184746 *Apr 11, 2011Jul 28, 2011Howlink Global LlcSystem and method for providing counseling serviceUS20110231190 *Mar 21, 2011Sep 22, 2011Eliza CorporationMethod of and system for providing adaptive respondent training in a speech recognition applicationUSRE44326Nov 3, 2011Jun 25, 2013Promptu Systems CorporationSystem and method of voice recognition near a wireline node of a network supporting cable television and/or video deliveryCN1897619BJan 24, 2001Aug 25, 2010格瑞普技术集团公司Communication assistance system and methodWO1993020639A1 *Mar 19, 1993Oct 14, 1993United States Advanced Network, Inc.Automated telecommunication peripheral systemWO1999035806A1 *Jan 7, 1999Jul 15, 1999Alcatel Usa, Inc.Method and system for totally voice activated dialingWO2002033946A1 *Oct 16, 2001Apr 25, 2002Eliza CorporationMethod of and system for providing adaptive respondent training in a speech recognition application* Cited by examinerClassifications U.S. Classification379/88.01, 379/223, 379/88.25, 379/244, 379/203.01International ClassificationH04M3/60, H04M15/08, H04M3/51Cooperative ClassificationH04M3/5166, H04M3/60European ClassificationH04M3/60, H04M3/51RLegal EventsDateCodeEventDescriptionMay 27, 1986ASAssignmentOwner name: BELL TELEPHONE LABORATORIES, INCORPORATED, 600 MOUFree format text: ASSIGNMENT OF ASSIGNORS INTEREST.;ASSIGNOR:DAUDELIN, ABRAHAM N.;REEL/FRAME:004552/0114Effective date: 19860522Owner name: BELL TELEPHONE LABORATORIES, INCORPORATED, NEW JERFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:DAUDELIN, ABRAHAM N.;REEL/FRAME:004552/0114Effective date: 19860522May 21, 1992FPAYFee paymentYear of fee payment: 4May 31, 1996FPAYFee paymentYear of fee payment: 8Jun 29, 2000FPAYFee paymentYear of fee payment: 12RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

type: global

value: Google Patents is a search engine from Google that indexes patents and patent applications.


text:
Patent US8155030 - Method and apparatus for network tree management - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsThere is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology...http://www.google.com/patents/US8155030?utm_source=gb-gplus-sharePatent US8155030 - Method and apparatus for network tree managementAdvanced Patent SearchPublication numberUS8155030 B2Publication typeGrantApplication numberUS 12/523,781PCT numberPCT/IB2008/000119Publication dateApr 10, 2012Filing dateJan 18, 2008Priority dateJan 19, 2007Also published asEP2103048A2, EP2103048B1, US8467317, US20100054157, US20120170489, WO2008087547A2, WO2008087547A3Publication number12523781, 523781, PCT/2008/119, PCT/IB/2008/000119, PCT/IB/2008/00119, PCT/IB/8/000119, PCT/IB/8/00119, PCT/IB2008/000119, PCT/IB2008/00119, PCT/IB2008000119, PCT/IB200800119, PCT/IB8/000119, PCT/IB8/00119, PCT/IB8000119, PCT/IB800119, US 8155030 B2, US 8155030B2, US-B2-8155030, US8155030 B2, US8155030B2InventorsJ�nos Farkas, Csaba Antal, Attila Tak�cs, Panagiotis SaltsidisOriginal AssigneeTeleaktiebolaget L M Ericsson (Publ)Export CitationBiBTeX, EndNote, RefManPatent Citations (10), Non-Patent Citations (2), Referenced by (2), Classifications (14), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetMethod and apparatus for network tree management
US 8155030 B2Abstract
There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.
1. A method for setting up and updating a tree in a computer network having a plurality of network nodes controlled in a link state manner where in said plurality of network nodes are interconnected using a plurality of bridges wherein each node includes one or more ports for connecting a bridge with a neighboring node, wherein a topology database is available at each network node, said method comprising the steps of:
calculating a topology of a tree using only a root bridge of the tree;
configuring, by the root bridge, one or more of its ports participating in the tree;
advertising, by the root bridge, the topology of the tree by sending a tree topology advertisement to the neighboring network nodes participating in the tree;
configuring, by the neighboring network nodes, the one or more ports for each of the network nodes participating in the tree according to the tree topology advertisement; and
forwarding the tree topology advertisement through the configured ports of the neighboring network nodes along the tree.
2. The method of claim 1, wherein the step of calculating the topology of the tree is based on a topology database populated with neighbor information obtained from link state advertisement messages, the topology database being maintained by a link state protocol.
3. The method of claim 1, wherein the step of advertising the topology of the tree comprises sending a message containing all port configurations of all bridges.
4. The method of claim 1, wherein the tree topology advertisement comprises sending a message containing a description of all links taking part in the tree.
5. The method of claim 1, wherein the tree topology advertisement provides an identification of nodes in the tree and port configuration of each node in the tree.
6. The method of claim 1, wherein bridges not calculating the tree, configure the tree received in the tree topology advertisement to avoid transient loops.
7. The method of claim 6, wherein the bridges not calculating the tree only configure active links taking part in the tree received in the tree topology advertisement after configuring blocked links.
8. The method of claim 1, wherein the nodes not calculating the tree forward the tree topology advertisement after configuring the tree.
9. The method of claim 1, wherein nodes not calculating the tree forward a modified tree topology advertisement containing only the relevant subtree of the tree.
10. The method of claim 1, further comprises the steps of:
recalculating the topology of the tree using the root bridge if the topology database changes;
advertising the new tree topology using the root bridge;
updating the tree by the non-calculating bridges based on the advertisement of the new tree topology; and
distributing the topology advertisement along the new tree.
11. A system for setting up and updating a tree in a computer network having a plurality of network nodes controlled in a link state manner where in said plurality of network nodes are interconnected using a plurality of bridges wherein each node includes one or more ports for connecting a bridge with a neighboring node, wherein a topology database is available at each network node, comprising:
means for calculating a topology of a tree using only a root bridge of the tree;
means for configuring, by the root bridge, one or more of its ports participating in the tree;
means for advertising. by the root bridge, the topology of the tree by sending a tree topology advertisement to the neighboring network nodes participating in the tree;
means for configuring, by the neighboring network nodes, the one or more ports for each of the network nodes participating in the tree according to the tree topology advertisement; and
means for forwarding the tree topology advertisement through the configured ports of the neighboring network nodes along the tree.
12. The system of claim 11, wherein the means for calculating the tree topology is based on a topology database populated with neighbor information obtained from link state advertisement messages, the topology database being maintained by a link state protocol.
13. The system of claim 11, wherein the means for advertising the tree topology comprises means for sending a message containing all port configurations of all bridges.
14. The system of claim 11, wherein the means for advertising comprises means for sending a message containing a description of all links taking part in the tree.
15. The system of claim 11, wherein the means for advertising provides an identification of nodes in the tree and port configuration of each node in the tree.
16. The system of claim 11, wherein bridges not calculating the topology of the tree, configures the tree received in the tree topology advertisement to avoid transient loops.
17. The system of claim 11, wherein the bridges not calculating the topology of the tree only configures active links taking part in the tree received in the tree topology advertisement after configuring blocked links.
18. The system of claim 11, wherein the nodes not calculating the topology of the tree forward the tree topology advertisement after configuring the tree.
19. The system of claim 11, wherein nodes not calculating the topology of the tree forward a modified tree topology advertisement containing only the relevant subtree of the tree.
20. The system of claim 11, further comprises:
means for recalculating the topology of the tree using the root bridge if the topology database changes;
means for advertising the new tree topology using the root bridge;
means for updating the tree by the non-calculating bridges based on the advertisement of the new tree topology; and
means for distributing the topology advertisement along the new tree. Description
This application is related to and claims benefit of the filing date of U.S. Provisional Patent Application No. 60/885,667 filed Jan. 19, 2007, which is entirely incorporated by reference herein.
The present invention is directed, in general, to controlling data traffic in computer networks and, more specifically, to a method and system for tree management in Ethernets and similar networks using link state principles.
Computers, broadly speaking, are electronic machines capable of storing and manipulating information, often called data, to useful ends. Frequently, a number of computers are connected together in such a way that they are able to send data to each other. A collection of computers so connected is often called a network, and the connector between two network nodes is referred to as a link. One type of computer network is called a LAN (local area network), and may be found, for example, in the offices of a small business or educational institution. A number of LANs or other networks may also be brought into communication with each other. As might be expected, a system of rules or set procedures must be put in place so that the computers and networks can communicate with each other effectively. Such a system of rules and procedures is often called a protocol, and several have been developed for communications involving computer networks.
A widely accepted set of protocols for LAN communications has been developed under the auspices of the IEEE (Institute of Electrical and Electronics Engineers). A standard generally referred to as IEEE 802, for example, covers general network architecture, IEEE 802.1 deals with bridging and management, and IEEE 802.3 is the Ethernet protocol. An Ethernet LAN is generally one that handles traffic, that is, the flow of data from one computer to one or more other, using a system of collision detection and avoidance. (A ‘collision’ occurs when two or more computers attempt to send data over the same link at the same time.) These standards are regularly reviewed and updated as necessary to improve networks operations and account for developments in technology.
In a typical Ethernet network, data sent from one computer to another, or from one network to another, is not transmitted all at once or continuously, but is instead broken up into discrete ‘frames’. Using frames of data better allows the network computers to take turns sending data. The frames may vary in length, but each frame includes sufficient address information (in addition to the actual data) so it may be routed to its desired destination or destinations. Routing is necessary because every computer is not connected directly to every other. Instead, computers and networks are connected to intermediary devices that receive data, determine its destination address, and then route it accordingly. One such intermediary device is referred to as a bridge. A bridge is a type of software switch resident on a network component. A frame of data may be routed through many bridges on its way from source to destination.
FIG. 15 is a simplified schematic diagram illustrating the bridges of an exemplary network 10, in which embodiments of the present invention may be advantageously implemented. The network 10 may have many components, but for clarity only the bridges themselves are shown. Individual components such as computers and sub-networks may be connected to one of the bridges. In the embodiment of FIG. 15, there are nine bridges, numbered 1 through 9, although the present invention is also suitable for implementation in larger or smaller networks. Each of these bridges 1 through 9 is connected by a link to one or more other bridges. In FIG. 15 the links are numbered according to the bridges it connects, for example link 24 connects bridge 2 directly with bridge 4. A path includes all of the links from one bridge to another, for example one path from bridge 1 to bridge 9 includes links 13, 38, and 89. As should be apparent, there may be more than one path between any two bridges.
When a bridge receives a data frame from, for example, a network computer or another bridge, it examines the address information and forwards the frame accordingly. Data may have to pass through several bridges from its source to destination. Without some governing protocol, however, it is possible that frames of data might inadvertently be sent from bridge to bridge, eventually looping back to a previously-visited bridge from which they are re-sent back into the same loop. As should be apparent, this is not a desirable phenomenon and techniques have evolved for avoiding this looping problem.
One technique to avoid looping would be to use a fixed-configuration network and always route frames intended for a particular destination by the same route. Most networks are subject to change, however, and occasionally encounter break downs or congestion in components and links. A static routing system is therefore not the best solution. In a more successful solution, a ‘spanning tree’ is calculated periodically according to a spanning tree protocol (STP). The spanning tree provides path definitions for the network as it exists at the time of the tree calculation. In the event of a failure or other event, the tree can be recalculated to adjust to the new conditions.
Calculation of a spanning tree preferably involves not only designating a path from each source to each destination, but determining the best pathways for each case so that network communications are accomplished in an efficient manner. IEEE standards, for example, often use distance vector mechanisms to determine an active topology for the network, the active topology referring to the tree of data forwarding paths that will be used to route data traffic. This distance vector technique is well known and will not be discussed here in detail, except to note that the active topology is configured in a distributed manner, and so no bridge in the network is aware of the data distribution scheme in its entirety. It is therefore possible, or even likely, that the topology is not optimal. The distance vector approach is also less efficient at fault handling, that is at recovering from a failure occurring somewhere in the network.
A better solution may be to use a link state spanning tree calculation by applying the core functionality of IP (Internet protocol) using routing protocols such as OSPF (open shortest path first) and IS-IS (intermediate system to intermediate system). IP protocols are typically developed and disseminated by the IETF (Internet engineering task force). In general, the link state approach facilitates application of traffic engineering and allows the active topology to be optimized. Directly implementing IP routing protocols, however, would mean each bridge would have to set up its own forwarding tables. This is not a detriment in and of itself, but it may produce long unavailable periods resulting in at least transient loops. Another complication is that Ethernet frames do not include a TTL (time to live) field (as does an IP packet) so transient loops may be problematic when changes in active topology are occurring. Of course, bridges that notice the topology is changing could simply stop forwarding data frames until a new topology is calculated, but this procedure slows down the recovery significantly.
There is therefore a need in the art for a manner in which to implement a link state approach to spanning tree calculation that retains the advantages of link state protocols, but mitigates or eliminates the problems they have, especially those associated with an occasionally changing active topology. The present invention provides just such a solution.
To address the above-discussed deficiencies of the prior art, it is a primary object of the present invention to provide a method and arrangement for configuring the active topology of a computer network, for example an Ethernet LAN. It is a further object of the invention to apply an improved link state approach to network tree management, the improved link state approach having, among other things, an advantageous architecture and an improved recovery time as compared with conventional approaches.
In one aspect, the invention is a method for configuring a network, such as an Ethernet LAN, for efficient forwarding of data traffic, including collecting neighbor information, generating and distributing link state advertisements, populating a topology database for the network, and calculating in a root bridge the port states for each bridge in a tree using from the topology database. The method may further include advertising the tree by selectively distributing tree advertisement messages, receiving tree advertisement messages in bridges of the network, and configuring the ports of each bridge according to the advertisement message. The method may also further include the feature of recognizing, in a network bridge that a link state advertisement has already been processed, and to discard rather than forward them. In this way, a protocol for links states STP is defined that allows the application of flexible sets of routing objectives.
In another aspect, the present invention is a network comprising at least one root bridge, wherein the root bridge is remotely sets the port states of at least one other network bridge. In a preferred embodiment, the active network topology is calculated at the root bridge and imposed on all the other network bridges. A root bridge therefore is arranged to build a topology database and use the topology data base to calculate a spanning tree for the network. The root bridge is further arranged to generate and distribute tree advertisement messages that describe the tree for non-root bridges. Non-root bridges are arranged to receive the tree advertisement messages and process them. The non-root bridges are also arranged to configure their ports according to the description in the tree advertisement message, and to selectively forward the tree advertisement messages in the direction of leaf bridges. Non-root bridges may also be arranged to modify the tree description in the tree advertisement message prior to forwarding them to other bridges. In this manner, problems due to any potential inconsistency in link state databases may be mitigated or eliminated entirely, as the time needed to synchronize databases following a failure is eliminated. In some embodiments, the use of alternate or backup ports is implemented when a failure condition is detected.
In yet another aspect, the present invention is a bridge for use in a network, the bridge arranged to serve as a root bridge by calculating a spanning tree based on collected network information, to configure itself according to the calculated tree, and to remotely configure the other bridges in the spanning tree.
Before undertaking the DETAILED DESCRIPTION, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document: the terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation; the term “or,” is inclusive, meaning and/or; the phrases “associated with” and “associated therewith,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, or the like; and the term “controller” means any device, system or part thereof that controls at least one operation, such a device may be implemented in hardware, firmware or software, or some combination of at least two of the same. It should be noted that the functionality associated with any particular controller may be centralized or distributed, whether locally or remotely. In particular, a controller may comprise one or more data processors, and associated input/output devices and memory, that execute one or more application programs and/or an operating system program. Definitions for certain words and phrases are provided throughout this patent document, those of ordinary skill in the art should understand that in many, if not most instances, such definitions apply to prior, as well as future uses of such-defined words and phrases.
FIG. 1 is a flow diagram illustrating a method of performing neighbor discovery according to an embodiment of the present invention.
FIG. 2 is a flow diagram illustrating a method of processing a link state advertisement (LSA) according to an embodiment of the present invention.
FIG. 3 is a flow diagram illustrating a method of calculating a spanning tree according to an embodiment of the present invention.
FIG. 4 is a flow diagram illustrating a method of tree configuration according to an embodiment of the present invention.
FIG. 5 depicts a LSSTP_BPDU (link state spanning tree protocol bridge protocol data unit) according to an embodiment of the present invention.
FIGS. 6 a through 6 c illustrate LSSTP parameters for an LSA_BDPU according to embodiments of the present invention.
FIG. 7 illustrates LSSTP parameters for a TA_BDPU (tree advertisement BDPU) according to an embodiment of the present invention.
FIG. 8 illustrates simplified LSSTP parameters for a TA_BDPU according to another embodiment of the present invention.
FIG. 9 illustrates an exemplary spanning tree topology for which embodiments of the present invention may be advantageously implemented
FIG. 10 illustrates a tree description for the Bridge 1 shown in FIG. 9 according to an embodiment of the present invention.
FIG. 11 illustrates a tree description for the Bridge 2 shown in FIG. 9 according to an embodiment of the present invention.
FIG. 12 illustrates a tree description for the Bridge 3 shown in FIG. 9 according to an embodiment of the present invention.
FIG. 13 illustrates a bridge architecture according to an embodiment of the present invention.
FIG. 14 illustrates an operation of a spanning tree protocol in routing protocol according to an embodiment of the present invention.
FIG. 15 is a simplified schematic diagram illustrating the bridges of an exemplary network, in which embodiments of the present invention may be advantageously implemented.
FIG. 16 is a flow diagram illustrating a method of facilitating data traffic flow according to an embodiment of the present invention.
FIGS. 1 through 16, discussed herein, and the various embodiments used to describe the principles of the present invention in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the invention. Those skilled in the art will understand that the principles of the present invention may be implemented in any suitably arranged computer network.
The present invention is directed to a new approach to facilitating the management of data traffic flow in a network, such as an Ethernet LAN (local area network), using a spanning tree active topology. FIG. 16 is a flow diagram illustrating a method 20 of facilitating data traffic flow according to an embodiment of the present invention. At START it is assumed that a network operable to communicate data via a plurality of bridges has been formed, such as the one shown in FIG. 15. The network is, for example, an Ethernet LAN network operable according to the IEEE 802 family of protocols, but other similarly arranged networks may be used as well. The process begins when the network is assembled and energized for operation, or at some later time as determined by a network operator. In this embodiment, it is also presumed that a root bridge for the network has been determined. This may be done in a number of ways, although no particular way is required by the present invention unless specifically recited in a given embodiment. Returning to the method 20 of FIG. 16, in step 105 neighbor discovery is undertaken, so that each of the network bridges may learn the other bridges to which they are connected. The information discovered in the neighbor discovery step 105 is then transmitted (step 110) to other bridges via LSAs (link state advertisements). Although the LSAs flood the network, in a preferred embodiment they will be discarded (step not shown) by bridges that, for example, realize they have already learned the information contained in a particular LSA.
The root bridge then compiles a topology database (step 115), and uses the topology database to develop a spanning tree for the network and calculating the necessary port configurations (step 120) for each (non-root) bridge. The port configurations for each bridge, of course, implement the calculated spanning tree in the network. In accordance with the present invention, the root bridge makes these determinations for each of the non-root bridges. The root bridge then advertises the spanning tree (step 125) by sending TAs (tree advertisements) out to the network components. Each bridge then processes the TA messages and sets its ports (step 130) according to the instructions contained in the TA. The spanning tree has at this point been configured according to an embodiment of the present invention and the routing of data traffic (step 135) may either begin, or continue, as the case may be.
One advantage of the present invention, however, is the manner in which a network configured in this manner responds to a failure, that is, the inability to route traffic according to the current active topology. To illustrate this, the method 20 of FIG. 16 continues with the step 140, where a failure condition is detected. Failure, or failure condition, as used herein, refer to an event that prevents or significantly inhibits forwarding data according to a current active topology. That is, failure may include an actual breakdown, but may also include the addition or removal of network bridges, links or other components, or significant bottlenecks. In this embodiment, it is first determined (step 145) whether an alternate (or backup) topology has been established. If so, the alternate topology is implemented (step 150). If not, or if the alternate topology is not successful, the process in this embodiment returns to step 120 and a new tree is calculated. This assumes, of course that the root bridge topology database has been maintained through periodic neighbor discovery messages, and the link state information is up to date. In other embodiments, the process may instead return to the neighbor discovery step 105 or the LSA step 110 prior to generating or updating the topology database and calculating a new spanning tree at step 120. In any case, however, since the root bridge remotely sets the port states of the non-root bridges, there is no need to wait until all bridge databases have been synchronized, and typically resulting in a faster recovery time. Finally, note that the calculation of a backup or alternate topology is optional, but in many cases can help speed recovery after failure. The alternate topology may be calculated when the primary active topology is determined, or at a later time and advertised separately.
The variation operations associated with embodiments of the present invention will now be described in greater detail. For this purpose, it will be presumed that various of the message described above, such as LSAs and TAs, are in the format of standard BPDUs (bridge protocol data units) that have been modified according to the present invention for their respective purpose. The use of modified BPDUs in this way is preferred but not required.
FIG. 1 is a flow diagram illustrating a method 25 of performing neighbor discovery according to an embodiment of the present invention. Again, at START, the network is presumed to be physically assembled and operable according to the method of the present invention. In this embodiment, neighbor information is collected via neighbor discovery messages, and preferably ND_BPDUs (step 205). Other types of messages may be used for collection of neighbor information may be used in other embodiments. In this embodiment, ND_BPDUs are sent and received according to a predetermined time period (the “Hello Time Period”). The received ND_BPDUs are examined and the information stored in a topology database (step not shown) for later reference.
As ND_BPDUs are received each Hello Time Period, many times they will contain information already stored in the topology database. At other times, a new neighbor may manifest itself, or an expected ND_BPDU is not received, signaling a change in the configuration of the network. Therefore, each Hello Time Period each bridge examines the ND_BPDUs received and determines (step 210) if a new link has appeared or an existing one has timed out. That is, entries in the topology database may be timed out and erased after a predetermined number of Hello Time Periods if no ND_BPDU confirming their validity has been received. If no change occurs, the process simply returns to step 205 and collecting neighbor information as it is disseminated each Hello Time Period. If a change has been perceived, the bridge distributes LSA_BPDUs (step 215) to advertise the change. The topology database may also be updated at this time (step not shown). Each bridge then determines if it is currently a root bridge (step 220) and, if so, performs a tree calculation (step 225) with the newly acquired network information. Note that in accordance with the present invention, only root bridges need to perform the tree calculation process. In accordance with the present invention, the root bridge may run any active topology algorithm to build up the tree.
The LSA_BPDUs distributed in step 215 are subsequently received in the various network bridges. FIG. 2 is a flow diagram illustrating a method 30 of processing a link state advertisement (LSA) according to an embodiment of the present invention. When an LSD_BDPU is received (step 230) at a bridge it is first examined (step 235) to determine whether it is outdated or has been received previously. This may be done using one or more techniques. For example, the receiving bridge may examine a sequence number and sending-bridge identifier of the LSA_BPDU. If a newer LSA_BPDU has already been received from that bridge, the one being examined may be discarded. In another embodiment, a path vector mechanism is employed and the receiving bridge checks to see if its own bit is set to determine whether the LSA_BDPU has been seen before. In yet another embodiment, a time-to-live field (TTL) may be utilized, with LSA_BPDUs being examined for age. If one or more of these methods indicates that the LSA_BPDU is no longer useful, it is discarded (step 240). This helps to prevent LSA_BPDUs from continuing to circulate unnecessarily in the network when they are no longer useful (although, depending on the determining technique used, they may under certain conditions be processed more than once in the same bridge).
If the LSA_BDPU has not been received before, then it is forwarded (step 245) on each port of the bridge, except for the one on which it was received, and the bridge's topology database is updated (step 250). As in FIG. 1, each bridge, having updated its topology database, then determines if it is currently a root bridge (step 255) and, if so, performs a tree calculation (step 260) with the newly acquired network information. Note again that in accordance with the present invention, only root bridges need to perform the tree calculation process.
The tree calculation process undertaken by the root bridge according to one embodiment of the present invention is shown in FIG. 3. FIG. 3 is a flow diagram illustrating a method 35 of calculating a spanning tree according to an embodiment of the present invention. The method 35 of FIG. 3 begins with determining whether a change in the tree is necessary (step 265). This determination may be performed at regular intervals, or upon the happening of a triggering event, or both. If a tree change is not necessary, of course, the ordinary operation of the network may simply continue. If a tree change is determined to be necessary, then the method 35 proceeds to calculate a new tree from the current topology database (step 270). (Note that method 35 describes a root bridge operation, so no step of determining root-bridge status is shown.) The root bridge then configures discarding ports (step 275), followed by a configuration of forwarding ports (step 280). The tree configuration is then distributed throughout the network (step 285), for example using TA_BPDU messages.
When the TA_BPDU (or other tree advertisement message) is received at a non-root bridge, it is processed and forwarded as necessary. FIG. 4 is a flow diagram illustrating a method 40 of tree configuration in a non-root bridge according to an embodiment of the present invention. The process begins with determining whether a TA_BPDU has been received (step 290). If not, of course, the routing of data traffic, if any, may continue normally. If so, the TA_BPDU is read (step 295), and the discarding ports, of any, are configured (step 305). The discarding ports do not have to be configured first, but his order is preferred and helpful to creating a loop-free topology. The forwarding ports, if any, are then configured (step 310). Assuming at least one forwarding port has been configured, the TA_BPDU is then forwarded on each of the bridge's forwarding ports (step 315).
The format of BPDU messages follows generally the MSTP BPDU format of IEEE 802, with certain differences and special considerations as set forth below and in FIG. 5 though 12. FIG. 5 depicts a LSSTP_BPDU (link state spanning tree protocol BPDU) 45, according to an embodiment of the present invention. Regarding the fields of the LSSTP_BPDU especially related to implementation of the present invention, the BPDU type field 320 will reflect that this is an LSSTP_BPDU message. The Hello Time field 325 is used only in ND_BPDUs, not in other types of LSSTP_BPDUs. Note that the tree configuration identifier field 330 is the same as is proposed in IEEE 802.1ap Virtual Bridged Local Area Networks—Amendment 9: Shortest Path Bridging, Draft D0.3, dated May 9, 2006. The LSSTP Parameters 335 vary according to the type of LSSTP_BPDU, as described in more detail below.
For an ND_BPDU according to the present invention, the LSSTP Parameters 335 are empty, as the necessary corresponding-link bridge and port identifiers are currently specified in the proposed IEEE 802 MSTP BPDU. In other words, the neighbor discovery process does not require additional LSSTP parameters for successful operation.
For LSA_BPDUs according to the present invention, there are several options available. These options correspond generally with the different embodiments, described above in the context of discarding LSAs when they are outdated or no longer useful. These options are illustrated in FIGS. 6 a through 6 c, which show LSSTP parameters for an LSA_BDPU according to three embodiments of the present invention. In each of these embodiments, the respective LSSTP parameters include a Flags field 340 and a LSSTP Computation Protocol Identifier field 345, followed by link description information 355. In FIG. 6 a, an optional LSA-removal field 350 a includes a Sequence Number along with the Bridge ID of the sending bridge. In FIG. 6 b, optional LSA-removal field 350 b includes a Path Vector. The LSA removal options associated with each of these LSA-removal fields has been described above (in reference to FIG. 2). In a third embodiment, the TTL information already part of the standard BPDU message is used instead—and therefore no LSA-removal field is necessary—as shown in FIG. 6 c. Note that more than one of these LSA-removal options may be used, with appropriate changes made to the LSSTP parameters if needed, but using more than one option is not presently preferred. In an alternate embodiment, no LSA removal option is used at all, but this is not recommended.
FIG. 7 illustrates LSSTP parameters for a TA_BDPU (tree advertisement BPDU) according to an embodiment of the present invention. This type of message also includes a Flags field 360 and a LSSTP Computation Protocol Identifier field 365. A Tree ID field 370 follows, and a Number of Bridges field 375, which of course specifies the number of bridges in the tree. The individual Bridge fields 380 follow, one for each bridge in the identified tree. The individual Bridge fields each identify the port configuration for one of the bridges in the tree. In this embodiment, the designated forwarding ports for each bridge are specified, and the remaining ports at that bridge are assumed to be discarding ports and configured accordingly. As mentioned above, these discarding ports are preferably configured first, prior to setting the forwarding ports. The root port is also specified, in this embodiment immediately following each Bridge ID. An alternate port toward the root bridge may also be listed (but is not shown in FIG. 7).
FIG. 8 illustrates simplified LSSTP parameters for a TA_BDPU according to another embodiment of the present invention. Here, following the Tree ID field 370, a Number of Links field 385 relates the number of links in the tree rather than the number of bridges. Links fields 390 therefore follow the Number of Links field 385, and describe the tree in terms of the links between bridges. This reduces the size of the TA_BPDU, but increases the processing complexity as each bridge has to determine the how to set their ports based on the received tree description. Whether this trade-off is desirable may vary from network to network.
An even more abbreviated form may be useful in some applications. The exemplary tree topology of FIG. 9, for example may be advertised using the TA_BPDU sequences illustrated in FIGS. 10-12. As can be seen in FIG. 9, Bridge 1 has two designated ports and hence two branches leading from it, specifically to Bridges 2 and 3. Bridge 2, in turn, has three branches leading out to Bridges 4, 5, and 6, and Bridge 3 had one branch leading to Bridge 7. Bridges 4 through 7 are leaf bridges, and therefore have no branches leading from them.
According to this embodiment, a first TA_BPDU message is received in Bridge 1; this message (or rather the relevant portion thereof) is illustrated in FIG. 10. This type of message also includes a Flags field 405 and a LSSTP Computation Protocol Identifier field 410. A Tree ID field 415 follows. After the Tree ID field 415 is a first Tree Description field 420. The first Tree Description field includes the information needed at Bridge 1, namely, the relationship of the links and bridges that follow. As represented in FIG. 10, a first set of brackets encloses the identities of all of the links and bridges associated with port 1 of Bridge 1, and a second set of brackets encloses the identities of all the links and bridges associated with port 2 of bridge 1. Regarding the latter, port 2 is designated to a link to Bridge 3, and port 1 of Bridge 3 is designated to link to bridge 7. Port 1 of bridge 1 is also designated to link to a single bridge, Bridge 2, but since Bridge 2 has three ports, each designated to link to a respective one of Bridges 4, 5, and 6, the designations of Bridge 2's ports are each isolated in a set of interior brackets in the Tree Description field 420 of FIG. 10.
Naturally, Bridge 1 uses the information in the Tree Description field 420 to configure its own ports 1 and 2. It then transmits one modified version of TA_BPDU message to Bridge 2 and another to Bridge 3 using the appropriate ports. In each case, the port designations not applicable to the recipient bridge are removed by Bridge 1 prior to sending. The TA_BPDU sent to Bridge 2 is illustrated in FIG. 11. In FIG. 11, it can be seen that in the Tree Description field 420-2, all that remains are the port assignments for Bridge 2; port 1, for example is designated to link to Bridge 4. Similarly, FIG. 12 illustrates the TA_BPDU, which is transmitted from Bridge 1 to Bridge 3. In FIG. 12, it can be seen that in the Tree Description field 420-3, all that remains is the port assignment for port 1 of Bridge 3, which is designated to link to Bridge 7. For example is designated to link to Bridge 4. Note that Bridges 4 through 7 are leaf bridges and as such have no forwarding ports to set. The TA_BPDUs (not shown) sent to these leaf bridges are similar to those depicted in FIGS. 10 through 12, but they will have a NULL value for their Tree Description field.
FIG. 13 illustrates a bridge architecture according to an embodiment of the present invention. Note that IP link state routing protocols such as OSPF or IS-IS are not suitable without modification for application to forwarding control in Ethernet networks because loop prevention is not assured. In accordance with the present invention, however, the routing protocol entity is implemented as a higher layer as shown in FIG. 13. Operation of the STP (spanning tree protocol) entity as a higher layer entity is illustrated in FIG. 14. The routing protocol entity is attached to each port of a bridge similarly to the SPT entity. In this way, the routing protocol entity is able to send and receive frames on each port. For a routing protocol messages that is to flood the network, the routing protocol entity sends out the message on each port except the port on which the message was received. Other messages are processed by the routing protocol entity and only sent out on designated ports.
As mentioned above, the routing protocols are not applicable without some modification. First, IP addresses are replaced by MAC addresses in the routing protocol and each frame is them forwarded according to the MAC address in its header. Second, a tree advertisement is inserted into routing protocol messages and the processing of tree advertisements is implemented in network bridges, as described in more detail above. Note that tree advertisements may be carried in routing protocol objects that are prepared for routing-protocol extensions. For OSPF routing, for example, a new type of Opaque LSA may be required. Opaque LSAs in OSPF provide for generalized for protocol extensions, and tree advertisement may be considered a type of extension. In a preferred embodiment, type-9 (link local) is used for tree advertisement Opaque LSAs. Tree advertisement may also be implemented in an IS-IS routing protocol using similar protocol extensions applicable there.
In accordance with the present invention, tree advertisement messages (TA_BPDUs, for example) should not be flooded, to avoid accidental loops. Rather, they are forwarded only on links that are part of the tree that they advertise, and are sent from the root bridge toward the leaves. The tree topology is calculated in the root bridge, and all other bridges configure their ports according to the received tree advertisement.
Note that processing of the tree advertisement messages accordance with the present invention may represent a new functionality implemented in the bridges' routing protocol entity. This new functionality includes the proper configuration of the ports that are part of the tree. That is, the bridges send the tree advertisement only to selected neighbor bridges instead of flooding all ports. The bridge may in some embodiments (as mentioned above) have to adjust the tree advertisement before forwarded it on the designated ports. The tree description schemes described above may also be implemented in routing protocols with the proper functionality.
In this manner, IP routing protocols may be applied for the control of forwarding, that is, configuration of the active topology, in Ethernet networks.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS6578086 *Sep 27, 1999Jun 10, 2003Nortel Networks LimitedDynamically managing the topology of a data networkUS6614764 *Feb 1, 2000Sep 2, 2003Hewlett-Packard Development Company, L.P.Bridged network topology acquisitionUS7428237 *Jan 6, 2004Sep 23, 2008Cisco Technology, Inc.Fast convergence with topology switchingUS7480258 *Jul 3, 2003Jan 20, 2009Cisco Technology, Inc.Cross stack rapid transition protocolUS7609658 *Aug 3, 2006Oct 27, 2009Cisco Technology, Inc.Method and system for identifying instability or a spanning tree protocol loop in a networkUS7649884 *Dec 1, 2004Jan 19, 2010Hrl Laboratories, LlcCollaborative multicast routing (CMR) for multicasting in unidirectional, hybrid, multi-tiered mobile wireless networkUS20070064628 *Sep 16, 2005Mar 22, 2007Tallet Francois ESystem and method for generating symmetrical spanning treesUS20070159983 *Jan 6, 2006Jul 12, 2007Belair Networks Inc.Virtual root bridgeUS20070206513 *Dec 20, 2006Sep 6, 2007Samsung Electronics Co.; LtdMethod for selecting root bridge in configuration of spanning treeUS20080291823 *Apr 18, 2008Nov 27, 2008Panagiotis SaltsidisData driven connection fault management (ddcfm) in cfm maintenance points* Cited by examinerNon-Patent CitationsReference1Finn, Norman, "Shortest Path Bridging"; Jan. 13, 2006; XP002485131.2Finn, Norman; "Shortest Path Bridging"; Sep. 22, 2005 pp. 1-95 XP002471513.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS8982734 *Jun 26, 2012Mar 17, 2015Intel CorporationMethods, apparatus, and systems for routing information flows in networks using spanning trees and network switching element resourcesUS20130343229 *Jun 26, 2012Dec 26, 2013Iosif GasparakisMethods, apparatus, and systems for routing information flows in networks using spanning trees and network switching element resources* Cited by examinerClassifications U.S. Classification370/256, 370/401International ClassificationH04L12/28, H04L12/56Cooperative ClassificationH04L12/462, H04L45/02, H04L45/025, H04L45/48, H04L45/04European ClassificationH04L12/46B7, H04L45/04, H04L45/48, H04L45/02C, H04L45/02Legal EventsDateCodeEventDescriptionJul 24, 2012CCCertificate of correctionDec 2, 2009ASAssignmentFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FARKAS, JANOS;ANTAL, CSABA;TAKACS, ATTILA;AND OTHERS;SIGNING DATES FROM 20090204 TO 20090209;REEL/FRAME:023593/0182Owner name: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL), SWEDENOwner name: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL),SWEDENFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FARKAS, JANOS;ANTAL, CSABA;TAKACS, ATTILA AND OTHERS;SIGNED BETWEEN 20090204 AND 20090209;US-ASSIGNMENT DATABASE UPDATED:20100304;REEL/FRAME:23593/182Owner name: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL), SWEDENFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FARKAS, JANOS;ANTAL, CSABA;TAKACS, ATTILA;AND OTHERS;SIGNING DATES FROM 20090204 TO 20090209;REEL/FRAME:023593/0182Owner name: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL),SWEDENFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:FARKAS, JANOS;ANTAL, CSABA;TAKACS, ATTILA;AND OTHERS;SIGNING DATES FROM 20090204 TO 20090209;REEL/FRAME:023593/0182RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services


text:
Angalia zaidi: i would like to hire seo expert, where to hire seo expert, place to hire seo expert, need to hire seo expert, I need an SEO expert, how to hire seo expert, hire seo expert, hire seo expert to promote website, hire seo expert online, hire seo expert india, hire seo expert india blogger, hire seo expert for blog, hire seo expert cheap, want hire seo expert, hire seo expert lahore
Kitambulisho cha Mradi: #14924885
(Maoni 1682)
(Maoni 2896)
we ensure white hat seo for website ONpage and OFFpage seo will be applied .. 100% organic result will be provided. i will send weekly all work done updates/reports.. Relevant Skills and Experience willing to work t Zaidi
Nice to meet you Sir, Rank1# in Google with Committed Time frame. Grow your online business Via Search engine optimization. It is best way to increase online business in low cost. Relevant Skills a Zaidi
I have broad knowledge about many things and am passionate about life. Relevant Skills and Experience I use my extensive experience to create excellent content in various niches Proposed Milestones $35 USD - Mileston Zaidi
Instagram Profile Building ($8-15 AUD / saa)
SEO for clothing company ($8-15 USD / saa)
Find me some American leads for Website Design ($10 USD)

value: Freelance (sometimes spelled free-lance or free lance), freelancer, or freelance worker, are terms commonly used for a person who is self-employed and not necessarily committed to a particular employer long-term. Freelance workers are sometimes represented by a company or a temporary agency that resells freelance labor to clients; others work independently or use professional associations or websites to get work.


text: Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4716573 *Nov 8, 1985Dec 29, 1987Telefonaktiebolaget Lm EricssonMethod of reducing the effect of narrowband jammers in radio communication between two stationsUS4850036 *Aug 21, 1987Jul 18, 1989American Telephone And Telegraph CompanyRadio communication system using synchronous frequency hopping transmissionsUS5214788 *May 4, 1990May 25, 1993Thomson - CsfProcess and device for information transmission between radioelectric transceivers of the same network operating in frequency hoppingUS5323447 *Nov 1, 1991Jun 21, 1994At&T Bell LaboratoriesApparatus and method for modifying a frequency hopping sequence of a cordless telephone operating in a frequency hopping systemUS5506863 *Aug 25, 1993Apr 9, 1996Motorola, Inc.Method and apparatus for operating with a hopping control channel in a communication systemUS5541954 *Nov 22, 1994Jul 30, 1996Sanyo Electric Co., Ltd.Frequency hopping communication method and apparatus changing a hopping frequency as a result of a counted number of errorsUS5870391 *Mar 20, 1997Feb 9, 1999Canon Kabushiki KaishaWireless communication system using frequency hopping, and method of controlling the systemUS5907545 *Dec 27, 1996May 25, 1999Canon KkWireless communication apparatus and methodJPH06334630A Title not availableJPH07107010A Title not available* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS6363099 *Feb 11, 1999Mar 26, 2002Sony CorporationPhysical channel assignment method and transmitterUS6651207 *Aug 20, 1999Nov 18, 2003Siemens Information & Communication Mobile, LlcMethod and system for improving voice quality in cordless communicationsUS6721549 *Dec 28, 2000Apr 13, 2004Samsung Electronics Co., Ltd.Low-noise amplifier for a mobile communication terminalUS6975603 *Aug 20, 1999Dec 13, 2005Siemens Communications Inc.System and method for minimizing the loss of information in cordless communicationsUS7006451 *Dec 27, 2001Feb 28, 2006Kabushiki Kaisha ToshibaMethod and apparatus for performing wireless communication using a plurality of frequency channelsUS7027418 *Sep 6, 2001Apr 11, 2006Bandspeed, Inc.Approach for selecting communications channels based on performanceUS7035310 *Aug 2, 2000Apr 25, 2006Koninklijke Philips Electronics N.V.Generating a cyclic sequence of frequenciesUS7190953 *Feb 28, 2001Mar 13, 2007Nxp B.V.Method for downloading and selecting an encoding/decoding algorithm to a mobile telephoneUS7209728 *Jan 30, 2004Apr 24, 2007Kabushiki Kaisha ToshibaMobile communication terminal apparatus which performs intermittent receptionUS7222166Jan 16, 2002May 22, 2007Bandspeed, Inc.Approach for managing communications channels based on performance and transferring functions between participants in a communications arrangementUS7295594 *Dec 31, 1998Nov 13, 2007Schleifring Und Apparatebau GmbhDevice for low-interfernce signal transmissionUS7310661Aug 24, 2001Dec 18, 2007Bandspeed, Inc.Approach for transferring functions between participants in a communications arrangementUS7356104 *Jul 9, 2004Apr 8, 2008Shinji FukudaRadio communication apparatus and interference avoiding methodUS7428669 *Mar 8, 2004Sep 23, 2008Adaptive Spectrum And Signal Alignment, Inc.Adaptive FEC codeword managementUS7477624Apr 3, 2006Jan 13, 2009Bandspeed, Inc.Approach for managing the use of communications channels based on performanceUS7555030Mar 10, 2008Jun 30, 2009Panasonic CorporationRadio communication apparatus and interference avoiding methodUS7570614Sep 6, 2001Aug 4, 2009Bandspeed, Inc.Approach for managing communications channels based on performanceUS7634019 *Aug 22, 2006Dec 15, 2009Texas Instruments IncorporatedBeam forming for transmit using bluetooth modified hopping sequences (BFTBMH)US7738529 *Aug 31, 2006Jun 15, 2010Kabushiki Kaisha ToshibaWireless communication apparatus and wireless communication methodUS7773998 *Feb 24, 2005Aug 10, 2010Kabushiki Kaisha ToshibaWireless communication apparatus for selecting frequency channelsUS7782986 *Mar 16, 2006Aug 24, 2010Harris CorporationSignal jamming avoidance method for a frequency hopping communication systemUS7809996Aug 4, 2008Oct 5, 2010Adaptive Spectrum And Signal Alignment, Inc.Adaptive FEC codeword managementUS7813420Jan 20, 2006Oct 12, 2010Adaptive Spectrum And Signal Alignment, Inc.Adaptive GDFEUS7817745Jan 20, 2006Oct 19, 2010Adaptive Spectrum And Signal Alignment, Inc.Tonal precodingUS7900113 *Feb 8, 2008Mar 1, 2011Texas Instruments IncorporatedDebug circuit and a method of debuggingUS7903608Jan 12, 2009Mar 8, 2011Bandspeed, Inc.Approach for managing the use of communications channels based on performanceUS8151127Jan 27, 2010Apr 3, 2012Bridgestone Americas Tire Operations, LlcSystem for conserving battery life in a battery operated deviceUS8155061 *Apr 3, 2008Apr 10, 2012Vkr Holding A/SMethod of and system for transmitting signals using frequency hoppingUS8165242 *Jun 28, 2010Apr 24, 2012Harris CorporationSignal jamming avoidance method for a frequency hopping communication systemUS8266465Mar 7, 2012Sep 11, 2012Bridgestone Americas Tire Operation, LLCSystem for conserving battery life in a battery operated deviceUS8447317 *Dec 9, 2010May 21, 2013Telefonaktiebolaget L M Ericsson (Publ)Method and arrangement in a wireless communication systemUS9379769Oct 27, 2014Jun 28, 2016Bandspeed, Inc.Approach for managing the use of communications channels based on performanceUS20010024961 *Feb 28, 2001Sep 27, 2001Thomas RichterOperating method for a mobile telephoneUS20010029172 *Dec 28, 2000Oct 11, 2001Woo-Yong LeeLow-noise amplifier for a mobile communication terminalUS20020080739 *Dec 27, 2001Jun 27, 2002Kabushiki Kaisha ToshibaMethod and apparatus for performing wireless communication using a plurality of frequency channelsUS20020097681 *Sep 6, 2001Jul 25, 2002Bijan TreisterApproach for managing communications channels based on performanceUS20020098841 *Aug 24, 2001Jul 25, 2002Bijan TreisterApproach for transferring functions between participants in a communications arrangementUS20020116460 *Jan 16, 2002Aug 22, 2002Bijan TreisterApproach for managing communications channels based on performance and transferring functions between participants in a communications arrangementUS20020136268 *Sep 6, 2001Sep 26, 2002Hongbing GanApproach for selecting communications channels based on performanceUS20040185820 *Jan 30, 2004Sep 23, 2004Kabushiki Kaisha ToshibaMobile communication terminal apparatus which performs intermittent receptionUS20050020271 *Jul 9, 2004Jan 27, 2005Matsushita Electric Industrial Co., Ltd.Radio communication apparatus and interference avoiding methodUS20050138524 *Mar 8, 2004Jun 23, 2005Adaptive Spectrum And Signal Alignment, Inc.Adaptive FEC codeword managementUS20050197131 *Feb 24, 2005Sep 8, 2005Kabushiki Kaisha ToshibaWireless communication apparatus for selecting frequency channelsUS20060176850 *Apr 3, 2006Aug 10, 2006Hongbing GanApproach for managing the use of communications channels based on performanceUS20060274825 *Jan 20, 2006Dec 7, 2006Adaptive Spectrum And Signal Alignment, Inc.Tonal precodingUS20060276918 *Jan 20, 2006Dec 7, 2006Adaptive Spectrum And Signal Alignment, Inc.Adaptive GDFEUS20060280143 *Aug 22, 2006Dec 14, 2006Dabak Anand GBeam Forming for Transmit Using Bluetooth Modified Hopping Sequences (BFTBMH)US20070064770 *Aug 31, 2006Mar 22, 2007Kabushiki Kaisha ToshibaWireless communication apparatus and wireless communication methodUS20070237210 *Mar 16, 2006Oct 11, 2007Harris CorporationSignal jamming avoidance method for a frequency hopping communication systemUS20080165832 *Mar 10, 2008Jul 10, 2008Matsushita Electric Industrial Co., Ltd.Radio communication apparatus and interference avoiding methodUS20080215947 *Feb 8, 2008Sep 4, 2008Peter HuntDebug Circuit and a Method of DebuggingUS20090036057 *Apr 3, 2008Feb 5, 2009Vkr Holding A/SMethod of and system for transmitting signals using frequency hoppingUS20090086800 *Aug 4, 2008Apr 2, 2009Cioffi John MAdaptive fec codeword managementUS20090122837 *Jan 12, 2009May 14, 2009Hongbing GanApproach For Managing The Use Of Communications Channels Based On PerformanceUS20090213902 *Feb 27, 2008Aug 27, 2009Ming-Fure JengAutomatic frequency hopping and channel tracking system for auto-frequency-hopping digital wireless microphoneUS20100284439 *Jun 28, 2010Nov 11, 2010Harris CorporationSignal jamming avoidance method for a frequency hopping communication systemUS20120044973 *Oct 28, 2011Feb 23, 2012Itron, Inc.Systems and methods for improving reception of data in wireless communication environmentsCN100405751CMar 29, 2005Jul 23, 2008三洋电机株式会社Synchronization acquisition circuit and receiving apparatus using the sameCN102315860A *Jul 7, 2011Jan 11, 2012株式会社日立制作所Frequency selection in a frequency hopping radio communications systemCN102315860BJul 7, 2011Apr 2, 2014株式会社日立制作所Frequency selection in a frequency hopping radio communications systemCN103493451A *Dec 9, 2010Jan 1, 2014爱立信(中国)通信有限公司Method and arrangement in a wireless communication systemCN103493451B *Dec 9, 2010Aug 17, 2016爱立信(中国)通信有限公司无线通信系统中的方法和装置EP2405701A1 *Jul 1, 2011Jan 11, 2012Hitachi, Ltd.Frequency selection in a frequency hopping radio communications system* Cited by examinerClassifications U.S. Classification375/132, 375/131, 375/137, 375/133, 375/130, 375/E01.035International ClassificationH04B1/7143, H04B1/715, H04L1/20, H04L1/00Cooperative ClassificationH04L1/20, H04B1/7143, H04L1/0016, H04L1/0001, H04B2001/7154European ClassificationH04B1/7143, H04L1/00A, H04L1/20, H04L1/00A8LLegal EventsDateCodeEventDescriptionSep 17, 1997ASAssignmentOwner name: BROTHER KOGYO KABUSHIKI KAISHA, JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:OHASHI, TSUYOSHI;WAKAYAMA, HIRONOBU;REEL/FRAME:008724/0199Effective date: 19970912Sep 22, 2004FPAYFee paymentYear of fee payment: 4Sep 18, 2008FPAYFee paymentYear of fee payment: 8Oct 4, 2012FPAYFee paymentYear of fee payment: 12RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services