text:
Bishop Sankey rushes for 189 yards as Washington tops Cal
BERKELEY, Calif. -- After going more than a year without a road win, Washington coach Steve Sarkisian had his players wear suits for the plane ride to drive home the message that this was a business trip.
The play on the field may not have looked as good as the players did on the plane but the result did.
Bishop Sankey ran for a career-high 189 yards and two touchdowns and Washington overcame four turnovers and 12 penalties for its first road win in 13 months, 21-13 over California on Friday night.
"That was the whole message," quarterback Keith Price said. "We're not here for vacation. A lot of guys were home back here playing. That's not what we were here for. We were here to get a win and we did that."
Austin Seferian-Jenkins caught eight passes for 154 yards and a touchdown for the Huskies (5-4, 3-3 Pac-12), who had been outscored 145-41 in three road games this season and had lost six straight away games since beating Utah on Oct. 1, 2011.
The Golden Bears (3-7, 2-5) lost for the fourth time in six games at their renovated stadium and are assured of missing out on a bowl for the second time in three seasons. That will only raise more questions about the status of coach Jeff Tedford, who has a 23-25 record since the start of the 2009 season.
"It is not something we're used to," Tedford said. "You work very hard, so it is always disappointing to not be able to play in the postseason. It does not happen to us often and it's not a good feeling."
Cal played the game without injured star receiver Keenan Allen and then lost starting quarterback Zach Maynard to a left knee injury late in the fourth quarter. Allen might not be back this season, while Maynard is undergoing an MRI and his status is unknown.
Backup Allan Bridgford drove the Bears to the 25 with just over a minute left but he missed C.J. Anderson down the sideline on fourth-and-5 to end Cal's hopes and send the Huskies home happy.
Each team had four turnovers in a sloppy game, including three lost fumbles in a span of six plays early in the fourth quarter. An interception on the next drive helped seal the win for Washington.
Shaq Thompson intercepted a pass by Maynard near midfield and returned it 33 yards to the Cal 28. Making that play even more painful for the Bears was the fact that Thompson originally committed to play at Cal before changing his mind when top recruiter Tosh Lupoi left for Washington just weeks before signing day.
Sankey ran four straight plays and scored from 1-yard out to give the Huskies a 21-13 lead. Washington needs just one win in its final three games against the bottom teams in the conference, Utah, Colorado and Washington State, to become bowl eligible.
"We knew we had to close it out and we knew we were on their side of the field," Sankey said. "It was on the O-line's back and on the running game and I feel like we did a great job with that."
Cal settled for field goals twice in the third quarter after driving deep into Washington territory, which proved costly when Seferian-Jenkins made a leaping grab over the smaller Steve Williams for a 29-yard score on third-and-goal to give the Huskies a 14-13 lead in the final minute of the third quarter.
The score remained there when Cal failed to capitalize on another good chance. Maynard overthrew an open Chris Harper in the end zone and D'Amato missed wide right from 41 yards, ending a streak of 11 straight makes.
"I don't think we executed all of our plays like we were supposed to," Harper said. "We had a couple of drops and fumbles. All of the turnovers, we need to try to eliminate them. When we're close to the zone we need to have the mentality that we have to get in."
Both teams had little trouble moving the ball in the first half but struggled to get it into the end zone. Washington scored on Sankey's 4-yard run on its second drive of the game but came up empty on three other trips into Cal territory. Sankey was stopped on fourth-and-1 twice in the first half and Price was intercepted by Nick Forbes in the closing seconds on third-and-5 from the 9.
The Bears also squandered good scoring chances with Isi Sofele losing a fumble at the Washington 21 on their first drive of the game and Brendan Bigelow losing a fumble at the 11 on the second drive.
Cal scored late in the second quarter on Harper's 14-yard reverse on a drive extended by a personal foul on Danny Shelton on third-and-long.
ESPN Fan Shop Powered By
Nike Youth Washington Huskies Black #7 Football Game JerseyShop
NCAAF News
No. 25 Florida rides big first half to down No. 3 Ole Miss, moves to 5-0
Will Grier threw four touchdown passes to four receivers -- all in the first half -- and No. 25 Florida downed third-ranked Mississippi 38-10 on Saturday night.
LSU's Leonard Fournette first in SEC to have 3 straight 200-yard rushing games
Leonard Fournette highlighted his SEC-record third straight 200-yard game with a 75-yard touchdown run, and No. 9 LSU overcame Eastern Michigan 44-22 on Saturday night.
Officials place first-down marker in wrong spot, leading to OK State TD
An officiating error led to an Oklahoma State touchdown Saturday in the Cowboys' 36-34 win over Kansas State.
Ricky Seals-Jones, ejected in 2nd, tweets during Texas A&M game
Texas A&M receiver Ricky Seals-Jones, who was ejected for targeting midway in the second quarter of Saturday's game, took to Twitter late in the game, retweeting a tweet that questioned the call.
RB Dalvin Cook day-to-day with left hamstring injury after exiting FSU win
Florida State running back Dalvin Cook exited in the first quarter of the Seminoles' 24-16 win over Wake Forest with a left hamstring injury. He is day-to-day.
Longhorns CB appears to retweet transfer request; Rangers staffer fired
As if things weren't going bad enough at Texas, the Longhorns appear to have players on Twitter during lopsided losses and jabs at their coach accidentally being sent from other nearby teams.
2015 Pac 12 - North Standings
|Oregon State
|Washington State


text:
School News
Chesapeake Academy appoints new trustees
The Chesapeake Academy board of trustees supports the mission of the school by creating and implementing the school's strategic plan.
09.23.2015Christchurch to induct five into school hall of fame on Saturday
Christchurch School is pleased to announce that the following people will be inducted into the school's hall of fame on Saturday, September 26, at 10 a.m. during Family Weekend and Homecoming festivities:
09.23.2015Author-therapist to speak at RCC
Local therapist, entrepreneur, author, consultant and workshop presenter Ronnie Sidney has accepted an invitation to give two talks about his new graphic novel, "Nelson Beats the Odds," at Rappahannock Community College.
09.23.2015Christchurch School choirs and musicians to present 'Riversong'
The choirs and musicians of Christchurch School are preparing for the third annual "Riversong, a Celebration of Music and Culture" on Saturday, October 3, at 7 p.m. on the school campus.
More School News: page 3 of 371 pages « First < 1 2 3 4 5 > Last »

subset: commoncrawl


text:
The agent of Napoli goalkeeper Gennaro Iezzo insists the player is happy at the Serie A high-flyers.
Luca Urbani said: "Iezzo has a contract until 2010 and is happy with Napoli.
Tribal Football Staff are dedicated to the football tribes from all over the world. Our team is passionate about delivering football news to our hundreds of thousands of followers in all the corners of the globe. Football is life, It never stops, Neither do we.
Already part of MyTribe? Sign In
Already have an account? Sign In
Not signed up to MyTribe yet?
Sign Up Now


text:
The Style Gallery is a great new way for you to view, love, and share outfit photos. It's meant to showcase
all the expressive, creative, and inspirational personalities of our community!
Love you too!
Your email has been sent!
Music fans go wild for an artist who matches their power-packed songs with a bold signature style, that's why they're so amped to see you leap onto the stage in this the adorable vintage collar! A fierce, fleecy swathe of animal-inspired print in tones of tan, black, and brown, this tamed timeless accent frames your grin as you pounce on every note of an unforgettable riff.
Sorry this item isn't available anymore
Remarkable fashion & decor, inspired by our community, & delivered with uncommon care.
Copyright ©2002-2015 ModCloth.com. All Rights Reserved.
Site Map
CA Notice
Privacy & Security
Terms of Use


text: Richard Rhodes Richard Rhodes is the author of numerous books and the winner of the Pulitzer Prize, the National Book Award, and the National Book Critics Circle Award. He graduated from Yale University and has received fellowships from the Ford Foundation, the National Endowment for the Arts, the John Simon Guggenheim Memorial Foundation, and the Alfred P. Sloan Foundation. Appearing as host and correspondent for documentaries on public television's Frontline and American Experience series, he has also been a visiting scholar at Harvard and MIT and is an affiliate of the Center for International Security and Cooperation at Stanford University. Visit his website: RichardRhodes.com Become a Fan × BECOME A FAN Get updates about Richard Rhodes and recommended reads from Simon & Schuster. Plus, get a FREE eBook when you sign up! Email Address Free eBook available to NEW subscribers only. Offer redeemable at Bookshout.com. Code expires 12/31/2015. See full terms and conditions. By clicking SIGN UP, I acknowledge that I have read and agreed to the Privacy Policy and the Terms of Use. Books by this Author Hell and Good Company Hell and Good Company By Richard RhodesBy Richard Rhodes Farm Farm By Richard RhodesBy Richard Rhodes Making Love Making Love By Richard RhodesBy Richard Rhodes The Making of the Atomic Bomb The Making of the Atomic Bomb By Richard RhodesBy Richard Rhodes see more books by Richard Rhodes Video History in Five: Richard Rhodes on the Spanish Civil War Pulitzer Prize winning author of The Making of the Atomic Bomb Richard Rhodes describes the remarkable story of the Spanish Civil War. Link: http://videos.simonandschuster.com:80/History-in-Five-Richard-Rhodes-on-the-Spanish/4115040918001 Get a FREE eBook when you join our mailing list. Plus, receive updates about Richard Rhodes,recommended reads and more from Simon & Schuster. Email Address Free eBook available to NEW subscribers only. Offer redeemable at Bookshout.com. Code expires 12/31/2015.See full terms and conditions and this month's choices.


text:
SAN FRANCISCO — "The Last of Us" won the top honor at the Game Developers Choice Awards.
The gripping post-apocalyptic survival saga created by developer Naughty Dog for the PlayStation 3 picked up the game of the year trophy Wednesday at the 14th annual ceremony. "The Last of Us" also won the awards for best design and narrative.
"I can't stress what a collaboration it is to put something like this together," said creative director Neil Druckmann, who was joined on stage at the Moscone Center by dozens of "Last of Us" developers. "This is just a sampling of Naughty Dogs, but there's another 200 people slaving away back at the office — and outsourced people and actors and composers and just so many people that brought this to life."
Irrational Games' slick sky-high shooter "BioShock Infinite" nabbed the awards for best audio and visual art, while Lucas Pope's quirky 8-bit immigration agent simulator "Papers, Please" captured both the innovation award and best downloadable game trophy.
"If the criteria is fastest to download, 'Papers, Please' is 40 megabytes zipped," joked Pope. "It's a little unfair, but I'll take it."
Selected by a jury of more than 2,200 game creators, the Game Developers Choice Awards honor the best games of the past year during the Game Developers Conference, an annual gather of game creators.
Other winners included Rockstar Games' heist romp "Grand Theft Auto V" for best technology, Nintendo's shape-shifting adventure "The Legend of Zelda: A Link Between Worlds" for best handheld game and The Fullbright Company's coming-of-age story "Gone Home" for best debut. Squad's wacky space flight simulator "Kerbal Space Program" landed the audience award, which was selected by online votes.
Ken Kutaragi, the former chairman of Sony Computer Entertainment who's dubbed "the father of the PlayStation," was honored with the Lifetime Achievement Award.
"I am so grateful to be able to share this great moment with my colleagues, my team members and of course all of you here tonight," Kutaragi told the crowd.
Anita Sarkeesian, creator of the Feminist Frequency video series, was presented with the Ambassador Award, which recognizes individuals who have helped advanced the gaming industry.
Brandon Beck and Marc Merrill, the co-founders of "League of Legends" studio Riot Games, received the Pioneer Award for their contributions to the industry, which included raising the profile of e-sports.
"Until you've really been deeply engaged and immersed in an online community, you really don't know how much fun you're missing and how deep the relationships are that you can really build," said Merrill. "We truly believe that type of participation in the great gaming community is really one of the best experiences you can have in all of gaming."
StarTribune.com welcomes and encourages readers to comment and engage in substantive, mutually respectful exchanges over news topics. Commenters must follow our Terms of Use.
- Keep it civil and stay on topic.
- No profanity, vulgarity, racial slurs or personal attacks.
- Comments with web links are not permitted.
- Comments that violate the above will be removed. Repeat violators may lose their commenting privileges on StarTribune.com.
Comments will be reviewed before being published.
- Mpls. weighs sweeping new rules for sick time, work schedules
- Conservatives begin to doubt Supreme Court Chief Justice John Roberts
- Despite Mpls. moratorium, K-1 kids still getting suspended
- Placing the blame for another mass shooting
- Meet Val the bartender: Hillary Clinton does an 'SNL' skit
- Two Edina elementaries hire recess consultant


text:
Latest Audio
This Week in Palestine Week 41 2015
Palestinian attacks
The Wall
Lebanon war
Palestinian Politics
Holy sites
Non-violent action
Israeli Politics
Israeli Settlement
Human rights
Israeli attacks
Peace process
International Politics
English Audio Report
Internal Unrest
Italian Audio Report
Gaza Siege
International News
Boycott Movement
Sunday September 27, 2015 - 22:37
Clashes broke out in the Al-Aqsa Mosque compound when Israeli forces stormed the holy site on Sunday morning, the last day of the Muslim Eid al-Adha holiday, witnesses said. Full Story
Sunday September 27, 2015 - 06:37
Palestinian medical sources have reported, Saturday, that a Palestinian teen was shot and injured, by Israeli army fire, after several military vehicles invaded Beit Forik town, east of the northern West Bank city of Nablus. Full Story
Saturday September 26, 2015 - 19:56
Two AFP journalists were assaulted Friday by Israeli soldiers who destroyed and seized their equipment in the occupied West Bank, after the funeral of a Palestinian killed by the army. Full Story
Saturday September 26, 2015 - 16:40
Amnesty International has reported that it obtained evidence indicating that the killing of Hadeel al-Hashlamoun, 18 years of age, by Israeli soldiers in the southern West Bank city of Hebron on September 22, 2015, was an extrajudicial Full Story
Saturday September 26, 2015 - 13:23
Two Palestinians have been kidnapped, earlier Saturday, after Israeli soldiers invaded Doura and Halhoul towns, in the southern West Bank district of Hebron. Full Story
Saturday September 26, 2015 - 12:55
Israeli soldiers, and police officers, have kidnapped on Friday evening five Palestinians in occupied East Jerusalem, allegedly after they attacked an Israeli settler, mildly wounding him. Full Story
Saturday September 26, 2015 - 11:12
Palestinian medical sources have reported, on Friday evening, that three Palestinians were injured by live Israeli army fire in Teqoua town, east of Bethlehem, while many residents suffered the effects of tear gas inhalation. The army also attacked, and wounded, two journalists near the northern West Bank city of Nablus. Full Story
Saturday September 26, 2015 - 03:23
Israeli soldiers assaulted, Friday, the weekly nonviolent protest against the Annexation Wall and illegal Israeli settlements, in Bil'in village west of the central West Bank city of Ramallah, wounding two residents, while dozens suffered the effects of teargas inhalation. Full Story
Friday September 25, 2015 - 23:45
The chief of police in the Nablus district and his three-year-old daughter were injured after being shot by Israeli forces with rubber-coated bullets, on Friday, during a raid in the village of Kafr Qaddoum, in the northern West Bank district of Qalqilia. Full Story
Friday September 25, 2015 - 20:16
Thousands of Palestinians marched in the funeral of Ahmad Izzat Khatatbeh, 25, who died on Thursday from wounds sustained by Israeli forces at the Beit Furik checkpoint, in the occupied West Bank, last week. Full Story
Opinion and Analysis
The Killing of Palestinians Will Last as Long as Israeli Imp...
Stupidity of Force in the Face of Resistance
DCIP: Over 1,996 Palestinian Children Killed Since Outbreak ...
Human Interest Stories
VIDEO: What Was Abdul-Rahman Doing in the Last Few Minutes o...
The Broken Wheel of Israeli Justice. The Case of Mahmoud A...
Ellen Siegel: Why have the killers of Sabra and Shatila esca...
Testimony: Vittorio Fera on His Arrest and the Israeli Syste...


text:
Could there be a Borg King?
View Single Post
August 28 2012, 11:57 AM
Location: Texas
Re: Could there be a Borg King?
teacake wrote:
But why is the gender identity always female?
The only reason I could ever come up with was the "perfection" of the arrangement of the chromosomes in the female gene.
But then one has to wonder do all females of all alian races have this arrangement? Well no because not all Terrian species have the odd pairing of chromosomes ending in a male.
In birds, the opposite is true: the male is the homogameticsex, having two Z chromosomes (ZZ), and the female (hen) is hetergametics, having one Z and one W chromosome (ZW).
I see no reason that there wouldn't have been Borg Kings. Maybe we only saw Queens.
JarodRussell wrote:
Well there's no king in bee hives either.
Well yes there is but he only serves one purpose and quickly dies afterward.
"My name is Matai Shang and I do not exist, indeed I work very hard at it."
Avatar by Me
View Public Profile
Send a private message to Brit
Find More Posts by Brit


text:
With its recent launch of a second-generation of tag products, NXP Semiconductors hopes to tap into what it sees as increasing demand by advertisers for data analytics on prospective customers.
NXP is positioning the new line of tags, the NTAG21x, as a way for advertisers and brands to more quickly roll out campaigns using NFC tags to collect data online, through such media as smart posters and print ads. There is also a feature that enables advertisers to collect rudimentary data in offline mode. Another feature enables simple authentication of luxury products.
Most of the features in the line are not new and are possible with NXP's popular NTAG203 chip tag. But the Netherlands-based chip maker, the largest producer of NFC chips worldwide, is continuing to try to encourage demand for NFC technology beyond payment.
Get access to all premium content and the world's first global newsletter devoted to the NFC and contactless markets by subscribing to NFC Times, the most authoritative source for news and analysis in the industry.
Subscription Options
If you already have a subscription, log in here.
NFC Times Exclusive Insight – With contactless card payment growing more popular in Europe and high-profile NFC mobile-payments services such as Apple Pay starting to gain a foothold there, payment schemes are preparing to significantly raise or eliminate caps on transaction value to try to encourage even more growth in contactless and NFC payments.
NFC Times Exclusive Insight – At least one more of China's big four banks, and perhaps two, have reportedly introduced mobile payments with host card emulation, following Industrial and Commercial Bank of China, which launched HCE-based service in May.
NFC Times Exclusive – A joint venture of Taiwanese banks and banking groups has chosen U.S.-based Mozido to supply it with host card emulation, tokenization and wallet technology, a surprise win for Mozido, which bought the U.S. mobile commerce arm of South Korean IT services firm SK C&C less than a year ago, NFC Times has learned.
NFC Times Exclusive Insight – U.S.-based unattended retail payments company USA Technologies had nearly 300,000 NFC-enabled cashless payment terminals connected to its network as of the end of the 2015 fiscal year and expects that to grow strongly next year, as mobile-payments services such as Android Pay roll out, the company said.
NFC Times Exclusive Insight – Barclaycard, one of the top payment card issuers in the UK, plans to launch NFC payments from its mobile-banking app in November using host card emulation, which will allow the issuer to avoid putting its payment applications on secure elements to roll out mobile payments.
NFC Times Exclusive Insight – Google officially launched Android Pay in the U.S., its host card emulation-based rival to Apple Pay and its second stab at rolling out NFC payments for in-store payments, following its little-used Google Wallet.
NFC Times Exclusive Insight – MasterCard Worldwide Tuesday announced its hub-like commercial tokenization program, Digital Enablement Express, a widely expected move that matches a similar service that rival Visa introduced in late May, Visa Digital Enablement Program, or VDEP. Like VDEP, MasterCard's new tokenization program has signed up Google and Samsung for their respective payments services, though neither MasterCard nor Visa has announced that Apple would join.
NFC Times Exclusive – Mobile security company Trustonic says its two remaining owners are increasing funding for the joint venture, and it plans to get into new markets, as the company seeks to capitalize on growing interest in securing mobile payment services, among other applications.
NFC Times Exclusive Insight – CaixaBank, Spain's large savings bank and one of the most important early adopters globally among financial institutions of SIM-based NFC payments, has introduced a mobile-payments app based on host card emulation.
NFC Times Exclusive Insight – France-based Gemalto estimates it is losing around €30 million (US$33.8 million) in revenue per quarter from the closing of the Softcard mobile-payments service in the U.S. last March–a setback that will end up costing the vendor nearly €100 million in lost sales this year and around €50 million in profit.
NFC Times Exclusive – Commercial standards organization EMVCo says it will publish what are considered overdue updates to its tokenization specification before the end of the year, though the organization is releasing few specific details overall, and it's unclear whether there will be a major update to the specification this year, NFC Times has learned.
NFC Times Exclusive – Turkish banking group BKM and at least some Turkish banks are among those planning to support their own form of tokenization–alternate PANs–for early and perhaps later rollouts of NFC mobile payments–a move that could put a crimp in the tokenization plans of the major payments schemes, Visa and MasterCard Worldwide.


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


text:
Browse our beautiful beads by the strand, Precious and Semi-precious Gemstones, Glass Beads, Cabochons, Swarovski® Crystals, Preciosa® Crystals, Czech Fire Polish Glass, Wire, and Brass Filigree (new and vintage). Gold-filled, Vermeil, Sterling Silver and base metal findings, tools; Global inspired treasures, Vintage beads, jewelry & components.
Bead Weavers and Bead Embroidery enthusiasts will find an extensive selection of Miyuki®, Japanese and Czech Seed Beads: Delicas®, Magatamas®, Tila® Beads, Half-Tilas®, Long Drops, Cube Beads, Twin Beads, Superduo Beads, Superuno Beads, Rizo Beads, Rulla Beads, and Vintage Charlotte Cut Seed Beads.
While you're here be sure to pick up your copy of the latest beading Books-Magazines-DVDs, and much more with new items added each week.
We offer daily Classes, Handmade Jewelry, Beading and Jewelry making supplies. Let us make your Custom Jewelry Designs. Repairs welcome.
Our Kid's Summer Camp Schedule adheres to the Mooresville Graded School District Schedule and will begin each June on the first Tuesday after the last day of school, and ends the Tuesday before school begins in August.
Call us to schedule your Birthday Party or Private Event. Meet-up Socials, Scout Groups, and Home School Groups are offered free meeting space during regular classroom hours.
We are located at 152 N. Main Street in Historic Downtown Mooresville in the Lake Norman area, just north of Charlotte, NC. Take exit 33, 35 or 36 off I-77 and follow signs to Downtown Mooresville.
Our hours are Monday -Saturday 10:00am to 6:00pm. We are closed Sundays. Phone 704-746-9278
Whether you are in the Lake Norman and Mooresville areas, or passing thru Charlotte on your way to the beach or to visit family, be sure to stop in and visit with us!
Ain't Miss Bead Haven Bead Shop in Mooresville is the premier full-service bead shop in the Lake Norman area. We are just a short drive from Charlotte and the surrounding area.
Ain't Miss Bead Haven Bead Shop in Mooresville is the premier full-service bead shop in the Lake Norman area. We are just a short drive from Charlotte and the surrounding area.
Whether you are an avid beader, in search of some much needed bead therapy, or enjoy collecting beads, you will enjoy our large selection of loose beads and charms.


text:
Cell-phone numbers long have been regarded as personal as Social Security numbers. That will likely change.
The cell-phone industry is developing a directory of wireless-phone numbers that could lift the veil of privacy consumers have come to expect. The directory could be completed by next year.
Cell-phone carriers say the growing number of consumers cutting ties with traditional phone companies and relying solely on wireless phones will make the directory useful. There are an estimated 163 million cell-phone subscribers, and 8 million people have cut ties with their local exchange carriers and use only a wireless device, according to the Cellular Telecommunications and Internet Association, which represents cell- phone companies.
"If people want to be found in the future, and they live entirely by their wireless phone, a wireless directory will be necessary," CTIA spokesman Travis Larson said.
But critics — including the nation's largest wireless carrier — say it's merely an attempt by wireless companies to generate revenue, and they warn a directory will jeopardize consumer privacy. They also argue a wireless directory is unnecessary because consumers can have cell-phone numbers listed in phone books.
Cell-phone companies vow to protect consumer privacy by including in the directory only the wireless numbers of those subscribers who agree to be listed.
The customer-service agreements of wireless carriers give companies the right to put a subscriber's number in a directory once they sign up for service. Wireless companies won't do that if subscribers say they want to be kept off a single, industrywide directory of subscribers, Mr. Larson said.
"Privacy is number one," he said.
But Jordana Beebe, spokeswoman for the San Diego-based Privacy Rights Clearinghouse, said wireless companies will be asking the wrong question. They shouldn't ask people whether they want to be removed from the directory, they should ask whether they want to be added to the list.
"The standard has to be opt-in," she said.
Rep. Joe Pitts, Pennsylvania Republican, introduced a bill in November to regulate how the industry collects data for the directory. The House Energy and Commerce subcommittee on telecommunications and the Internet could hold a hearing on the issue this summer.
"The list could be a good thing, but it has to be done right," said Derek Karchner, press secretary for Mr. Pitts.
The congressman's bill would legalize the opt-in approach by requiring cell-phone companies to ask current subscribers whether they want to be on the list; allow new subscribers to keep numbers off it; and prevent cell-phone companies from charging people who want numbers off the list.
Mr. Larson said there are no plans to charge consumers in exchange for keeping numbers off the directory.
A list would generate money for the industry each time someone calls directory assistance for a wireless number, though fees haven't been established and could vary from carrier to carrier. A directory could raise $3 billion a year by 2009, according to a study by telecommunications industry consultant Zelos Group Inc.


text:
C. 1970 Vintage 9-9.5mm Gray Cultured Pearl Ring With Diamond Accents in 14kt Yellow Gold. Size 5.5
Item#: 860550
C. 1970. Art inspired by nature: From our Estate collection, this ring sets three 9-9.5mm gray cultured freshwater pearls in a nest of lifelike branches. The semi-baroque pearls are accented with a sash of diamonds. Textured 14kt yellow gold ring. Exclusive, one-of-a-kind Estate Jewelry.
Product Details (for C. 1970 Vintage 9-9.5mm Gray Cultured Pearl Ring With Diamond Accents in 14kt Yellow Gold. Size 5.5)
1 inch
14kt close 14KT: Karat (abbreviated kt or K) is a unit that indicates the purity of gold in the metal. 14kt is 58.33% gold. In the United States, 14K yellow gold is most favored and used in jewelry. Yellow Gold close YELLOW GOLD: Gold is a precious metal with a natural yellow color. It is quite soft and often alloyed with other metals to increase its strength. The purity of the metal is indicated by a unit called a "karat," with 24kt having the highest percentage of natural gold.
Textured close TEXTURED: A unique and varying finish with a tactile surface applied through various techniques, both by hand and with machinery.
Gemstone 1:
Diamond close Diamond: The hardest and most brilliant of all gemstones, a diamond can make the heart race with its pure and fiery spark. An ancient symbol of love, a diamond is the preferred gemstone for tokens of affection, such as rings, earrings, necklaces and bracelets. Diamond is the birthstone for April. (Quantity: 5, Shape & Cutting Style: Round Single-Cut close SINGLE-CUT: A gemstone cutting technique that dates back to the 1300s. Still used today, the single-cut usually features 18 facets that go in one direction without crossing each other. , Color Grade: H-I close Color Grade H-I: Near-colorless , Weight: 0.07 ct. t.w.)
Gemstone 2:
Cultured Pearl close CULTURED PEARLS: Likened to the moon, pearls have been valued for their luminous glow and natural beauty for thousands of years. Today, high-quality cultured freshwater pearls make pearl jewelry affordable to all. Pearl is the traditional birthstone for the month of June. (Color: Gray, Quantity: 3, Shape & Cutting Style: Semi-baroque close SEMI-BAROQUE: A pearl with a slightly irregular shape. , Size: 9-9.5 mm)
All weights and measures are approximate.
Ross-Simons Presentation Box Your purchase includes an elegant Ross-Simons presentation box.
100% Moneyback Guarantee every item, every order, every day
Free Shipping on orders $250 or more
Only $7.95 Flat Rate for any order under $250
24/7 Live Help toll free at 1-800-835-0919
100% Secure Checkout verified by Norton Security
Recently Viewed Items:
Learn More About Pearls Estate Jewelry Cultured Pearl Yellow Gold Textured Finish Diamond Semi-baroque Pearl Free Ring Sizer


text:
Parent Action Team
The Parent Action Team is a group of volunteers available to help Mr. Wright with the planning and execution of events for teachers and students. The two biggest events are PHS Staff Christmas Party and PHS Staff Appreciation Week. There is no membership fee and volunteers can pick and choose to help with the events that best fit their schedule. There are monthly meetings that members can attend. These meetings are held so that proper planning and preparation can take place. If you are interested in getting your email including on the volunteer distribution list please contact us at firstname.lastname@example.com
Your Parent Action Executive Board
President:�Billie Russell
Vice President: OPEN
Secretary: Keri Lambert
Treasurer: Lynn Wissel
All parents are members.�
|Visit our official website at PHSParentActionTeam.com!
|Contact: firstname.lastname@example.com
PAT Meetings will be the second Monday of each month. All Meetings are in the Library Conference Room at 9:00am.
Upcoming Events:
5/11-15 Staff Appreciation Week
6/1 Senior Tailgate
|Upcoming Meeting Dates: 5/18
Upcoming Events:
5/11-15 Staff Appreciation Week
6/1 Senior Tailgate
Last Updated: 10/21/2013 03:10 PM


text:
Camp HarlowDavid A. R. White
In Camp Harlow, Alex is invited to summer camp by her school crush. She agrees because she wants to spend more time with him, but upon arriving, learns that it is a Christian camp, and immediately wants to leave. She is determined to shut everyone out, but through relation... Read More
More From: David A. R. White
She is determined to shut everyone out, but through relationships with others, and especially her most unlikely friend, a horse, she grows out of her shell and develops a faith in Christ.
Product Details:
Not Rated
Run Time: 90 Minutes
Released: 05/2014
- Product type: Video
- Format: DVD
- Release Date: May 13, 2014
- Height: 0.7
- Width: 7.5
- Length: 5.4
- Language: English
- Volumes/Discs: 1
Customer ReviewsWrite your own review
- wanted to like it but it feel very short by Pen on 8/30/2014
The idea is good but the acting is often like a poorly done "after school special". The message is forced. The (new) DVD I purchased was not scratched yet in one section the audio and picture are not discernible. Sadly it fits the Christian media stereotype. I've seen much better Christian films. I wanted to like it because I work with horses and children with special needs.
- Enlightening! by Karen on 7/9/2014
It's amazing what God and a horse can do to soften a young girls heart and attitude. Just watching the preview gave me continued peace and joy to myself. Thank you for this production. We need these types of films (videos) to keep God's Love and protection in our lives in these end times.
God Bless All God's Children!!


text:
Upcoming Events Click HERE to see Our Full Calendar
Join Mesorah for Mincha and Maariv the Night of Shmini Azeret!
Mincha at 6:15
to be followed by Maariv at approx. 6:36
Come celebrate the Holiday of Shmini Azeret by playing Crazy Eights and other card games! Games might include Casino style card games as well.
There will also be a place to build your own edible Sukkah, so have no fear there will be snacks
Sponsored by Rutgers Mesorah, the Orthodox Community at Hillel!
Join Mesorah for Shachrit on Shmini Azeret.
Koach/Conservative community meets at 9:15am at Hillel to walk to the Highland Park Temple for services.
Please RSVP by Friday, Oct 2, at 12noon if you'd like to come.
Contact: Rabbi Esther Reed
Email: firstname.lastname@example.com
Phone: 732-545-2407
Come for a Freshmen ONLY Yom-Tov meal in the Friebergs' Sukkah!
Contact: Sara Frieberg
Email: firstname.lastname@example.com
Join Mesorah for Simchat Torah!
6PM Mincha
6:15 Kibbudim Auction-There will be things for both Men and Women to use so be sure to come!
7:15PM Maariv and Hakafot!
Join the Reform Community for an alternative way to celebrate Simchat Torah! Fold your very own paper Torahs and learn about these crazy things called Six-Word-Memiors!! Of course, there will be FREE food to snack on before dinner (because remember there are no rules in college!!). After the event, we will be joining our friends at Koach and Mesorah for some singing and dancing with the Torah!! See you all Monday night!!
Join Mesorah for Shachrit/Mussaf and Hakafot the morning of Simchat Torah!
Come join Koach for singing, dancing, and a little Torah reading 😉
#RU4Israel? #RU4Peace?
Come decorate the Rutgers Hillel sukkah!
Artists 4 Israel beautifies communities, uplifts the people and promotes the artistic and cultural freedoms of Israel through direct social service actions and dynamic Hasbarah initiatives that serve all the people of Israel.
Postponed from September 30
Contact: Ido Mahatzri
Email: firstname.lastname@example.com
Phone: 732-545-2407
More Info: https://www.facebook.com/events/515149905316859/
Come and join Sara Frieberg and the women of our community for some great learning and yummy food each week in the home of different students.
This semester we are focusing on the topic of Women in Tanach, with a different personality spotlighted each week.
Be in touch with Sara or Melanie Samad with any questions, food requests, or topic suggestions!
Contact: Sara Frieberg
Email: email@example.com
Common Ground 2015 is an all-day conference, FREE and open to the general public, that aims to bring together religious believers, secular humanists, and nonbelievers in conversation in order to gain perspective on each other's ways of seeing the world, while embracing commonalities in our human experience that bring us together for social change. Through four panel sessions, workshops, and breakout sessions, attendees will hear academics and leaders from national and local organizations discuss views on finding meaning in life, ethics and values, and how to collaborate for social action.
Our vision and highest hope is that this event will culminate in social activism through interfaith organizations, tri-sector leadership, citizen activism, and more in any arena of social justice or "doing good" for the world.
More Info: http://www.commonground2015.org/
Come and learn with Rutgers Mesorah! First hour will be led by Jenna Kershenbaum, a second year here at Rutgers, second hour will be open Beit Midrash time, so come and Study With a Buddy!
All learning will be accompanied by Hot Beverages and Assorted Snacks!
Contact: Laura Leichtman
Email: email@example.com
Walking groups will be made to walk to the hospital and visit the Jewish patients before Shabbat. Meet at 43 Huntington (corner of Sicard and Huntington) at 1 pm to walk to St. Peters!
For more info or if you have any questions, text Becca Meiner (732 853 3688)!
Contact: Seth Deneroff
Email: email@example.com
Koach/Conservative community meets at 9:15am at Hillel to walk to the Minyan Tiferet for services, and then lunch at Rabbi Reed's house.
Please RSVP by Thursday, October 8, at 12noon if you'd like to come.
Contact: Rabbi Esther Reed
Email: email@example.com
Phone: 732-545-2407 x404
Reform Saturday morning services featuring music on guitar!


text:
In Fall 2012, the Immigration and Human Rights Clinic represented a client from Mexico in removal proceedings at the Arlington Immigration Court. The client, who has been a lawful permanent resident of the United States since 1990, first came to the United States on a work visa in 1976. He was detained by Immigration and Customs Enforcement (ICE) for nearly a year pending his trial, and was facing removal to Mexico for a minor criminal conviction that occurred in 2010. At trial, the student-attorneys argued that our client merited a favorable exercise of discretion by the Immigration Court because of his long work history and ties to the United States, and that he has been completely rehabilitated and demonstrates genuine remorse for his crime. The judge granted our client's application for relief and praised our student-attorneys' hard work. Our client was released from detention and is looking forward to the opportunity to rebuild his life in the United States, his home for more than 36 years. The UDC student-attorneys who worked on this case are 3Ls Megan Challender, Aisha Ching, and Michael Perkins. The case was co-supervised by Professor Kristina Campbell and LL.M. Fellow Emily Torstveit Ngara.
Remember Me
Forgot your password?
Haven't registered yet?
10/6/2015UDC-DCSL Named One Of The Best Law Schools In 2016 Princeton Review Rankings
10/13/2015OCPD: Panel on Practicing Labor Law
10/15/2015OCPD: Fall Mock Interview Program with GWAC
10/15/2015Bar Examiners Panel
10/15/2015BEGA Best Practices Symposium
UDC David A. Clarke School of Law
4340 Connecticut Ave NW
(Mailing: 4200 Connecticut Ave NW)
Washington, DC 20008
Phone: (202) 274-7400
Fax: (202) 274-5583
Connect with the School of Law


text:
Mighty Torque Wrench
Item # 18272506
|Eligible for 20% Off A Single Item! (see promotion details)
|Members of The League get 5% back when you spend $100! (see promotion details)
Product Details
The Mighty® torque wrench makes it easy to perform bicycle maintenance and repair. It features a high-quality steel construction with a 1/4" reversible ratchet and has an adjustable torque range from 2-24 nm. Five hex bits and a Torx bit are included.
- High-quality steel construction
- 2-24 nm torque range
- Reversible ratchet (1/4")
- 3, 4, 5, 6, 8, 10 mm hex bits
- T25 Torx bit
- 90-day limited manufacturer's warranty


text:
#17 Pirates protect home court with 3-0 win over UMHB October 6, 2015 | Women's Volleyball GEORGETOWN, Texas – In a rare Tuesday night home match for Southwestern, the Pirates easily took care of business, defeating Mary Hardin-Baylor in straight sets 27-25, 25-19,... [read more]
Pirates Q&A: Nikki Welch October 5, 2015 | Women's Volleyball Junior setter Nikki Welch recently sat down for a question-and-answer session. [read more]
#18 Pirates split Sunday action September 27, 2015 | Women's Volleyball SAN ANTONIO, Texas – Southwestern dropped their Sunday opener 3-1 to #13 Colorado College before defeating the University of Dallas 3-0. [read more]
#18 Volleyball breezes by Austin College September 26, 2015 | Women's Volleyball SAN ANTONIO, Texas – Southwestern secured a straight set win with ease to start off day one of the SCAC Divisional at Trinity, winning 25-15, 25-14, 25-16. [read more]
#18 Volleyball still perfect in SCAC September 26, 2015 | Women's Volleyball SAN ANTONIO, Texas – With a 3-0 win over Centenary the Southwestern volleyball team improves to 5-0 in conference action. [read more]
#18 Pirates make quick work of Celts September 23, 2015 | Women's Volleyball HOUSTON, Texas – The mighty Pirates continued their dominance as they cruised to a 3-0 win over the University of St. Thomas Wednesday. [read more]
/sports/w-volley/2015-16/livi.png?max_width=675&max_height=345 /sports/w-volley/2015-16/Welch-set675px.png?max_width=675&max_height=345 /sports/w-volley/2014-15/photos/0002/Drummond-Foster.jpg?max_width=675&max_height=345 /sports/w-volley/2015-16/photos/Corbett-Kaitlyn-8-3.jpg?max_width=675&max_height=345 /sports/w-volley/2014-15/photos/0002/Pool_-13-.jpg?max_width=675&max_height=345 /sports/w-volley/2014-15/photos/0002/Kincannon-Pool.jpg?max_width=675&max_height=345


text:
Government shutdown protest in Rutland todayOctober 10,2013Members of a federal employee union are forming a picket line in downtown Rutland today to protest the ongoing government shutdown.
Ten days into a shutdown brought about by a failure in Washington to agree on a new budget, members of the American Federation of Government Employees local plan to gather at 11:45 a.m. in front of the Social Security Administration office located in the Asa Bloomer Building on Merchants Row.
Protest organizers say the event is designed to urge Congress to pass a continuing resolution that will allow vital government programs and services to restart.
We need Congress to do what they were elected to do and pass a budget that allows the federal government to function. Debates over increasing the debt ceiling and implementing the Affordable Care Act should not jeopardize federal programs and services upon which millions of Americans depend, wrote Gail Earley-Renaud, vice president of the union chapter which represents federal employees in Vermont, Maine and New Hampshire.MORE IN This Just InKABUL, Afghanistan Confusion reigned in the wake of the deadly bombing Saturday of a hospital... Full StorySPRINGFIELD A fast-moving fire destroyed a freestanding two-bay garage on 432 South St. Full StoryIt will be a busy week in gubernatorial politics with two candidates holding formal campaign... Full Story
- Most Popular
- Most Emailed


text:
Cheap stocks with upward potential
Women are better investors than men
Join the NASDAQ Community today and get free, instant access to portfolios, stock ratings, real-time alerts, and more!
The leading real estate investment trust (REIT) operating
self-storage facilities -
Public Storage
) is borrowing $700 million in a one-year term loan from Wells
Fargo Bank of
Wells Fargo & Company
). The move comes as the company gears up to capitalize on the
attractive rates on a short-term bank loan.
Enter up to 25 symbols separated by commas or spaces in the text box below. These symbols will be available during your session for use on applicable pages.
You have selected to change your default setting for the Quote Search. This will now be your default target page;
unless you change your configuration again, or you delete your
cookies. Are you sure you want to change your settings?