text:
Reading mode: Light Dark
Hennie de Ruyter
Lives in Gauteng, South Africa
Works as a System Analyst
Joined on Apr 14, 2005
Hennie de Ruyter's wish list
Sorted by most recently added.
Added Feb 25, 2016
Latest reviews
Finished challenges
|Chicago Alley by tko
from Down the alleyway
|Callan-5680 by vbuhay
from What Child's Dream May Come
|Widget by Wilfried HKG
from Widget
|Oxbow Bend by stickpointed
from Landscape - Colour #2
|Isolated by PEB
from I'm single!
Most popular cameras
In-depth testingLatest Camera ReviewsBeyond the studio testsFeature Articles and VideosPIX VideosTalks, demos and panels691The Canon that canCanon EOS 80D Review364Touchscreen street shooterFujifilm X70 Review2136Upwardly mobileSony a6300 Review327Power ZoomPanasonic Lumix ZS100/TZ100 Review2481Retro through-and-throughFujifilm X-Pro2 Review203Long and short of itTamron 16-300mm F3.5-6.3 Di II VC PZD Macro review712Mono a monoLeica Monochrom (Typ 246) hands-onKirkjufell mountainBehind the Shot: Shredded210VideoCapturing nature with the Canon EOS 7D Mark II40ArticleTo St. Helens and Back: Olympus TG-Tracker Shooting ExperienceSpeed BoostSony SLT-A77 II Review537ArticlePanasonic Lumix DMC-GX8 review421Real-world testThe Sony a6000 goes surfingTwice as Nice?Canon EOS 7D Mark II Review324Can we get much wider?Canon EF 11-24mm F4 L USM galleryTwo in oneLG G5 camera reviewTouch and goNikon D5500 Review
Top threads
Follow us
All content, design, and layout are Copyright © 1998 - 2016 Digital Photography Review All Rights Reserved. Reproduction in whole or part in any form or medium without specific written permission is prohibited.


text:
Last Activity: January 10th, 2016 4:58 PM
About Me
- About Jcool
- Biography
- I initially found out about PokeCommunity from looking into Pokemon Rom Hacks back when I was still a pre-teen. Now, I am aspiring to make my own with the knowledge I have acquired over the past six or so years.
- Interests
- Producing and writing music, video-editing and let's playing, programming, playing video games, shooting hoops, and spending time with friends
- Location
- United States
- Gender
- Male ♂
- Nature
- Serious
Showing Friends 1 to 2 of 2
- Elite Four Lucian
- Elite Four - Psychic User
- TheRealOCD
- "What?! Why is my phone going off by itself?! Oh I got a call..."

subset: commoncrawl


text:
- Home
- Books & More
- Events & Activities
- Learning
- Research Resources
- About the Library
- Giving
- Kids
- Teens
Book Groups
Central | Bluford | North-East | Plaza | Ruiz | Sugar Creek
Trails West | Waldo | Westport | Other Book Groups
Central Library
Common Grounds
A focus on contemporary American authors of fiction and nonfiction who explore modern issues
Last Saturday of every other month at 11 a.m.
A lively mix of fiction, nonfiction, classics, and genres
Every Third Wednesday at Noon
Women Who Dare
Fiction and nonfiction by and about ordinary women experiencing extraordinary challenges
Every Second Tuesday at 6 p.m.
Bluford Branch
Black Classics
Devoted to reading and discussing works written by African or African American authors that can be considered great classics—these include outstanding works of fiction, poetry, drama and non-fiction
Second Saturday in: February, April, June, August, October, and December; at 2:30 p.m.
Heat of the Night
Reads and discusses mystery novels written by African American or African authors, or featuring an African-American or African detective
Second Saturday in: January, March, May, July, September, and November; at 2:30 p.m.
North-East Branch
North-East Book Group
Every First Sunday at 2 p.m.
Read, Quilt, Talk!
Discuss books and work on quilting projects. Beginners are welcome!
Second Tuesday of each month at 6 p.m.
Plaza Branch
Barista's Book Group
Every Third Wednesday at 7 p.m.
Readers for Social Justice
Second Wednesday of each month at 7 p.m.
Stranger Than Fiction
Sometimes humorous. Sometimes serious. Always nonfiction.
Every Fourth Wednesday at 7 p.m.
Friends of the Library Book Group
A book group for the Friends of the Kansas City Public Library
Fourth Monday of each month at 7 p.m.
Great Books KC
Classic literature that has stood the test of time
Plaza Branch, Small meeting room
Last Friday of each month, 7 p.m. (unless noted otherwise)
Contact: Bernard Norcott-Mahany, 816.701.3482
Reading Schedule available at greatbookskc.blogspot.com
Ruiz Branch
Ruiz Readers
First Thursday of the month at 6 p.m.
Sugar Creek Branch
After Lunch
Second and Fourth Thursdays at 1:30 p.m.
Sugar Creek Seniors
Every Fourth Wednesday at 12:15 p.m.
At the Fairmount Community Center, 217 South Cedar Avenue (Get directions »)
Trails West Branch
In Between Worlds
Every Fourth Monday at 6:30 p.m.
Trailblazers Book Group
Every Third Saturday at 2 p.m.
Waldo Branch
Fourth Tuesday
Literary and newsworthy fiction and nonfiction
Every Fourth Tuesday at 6 p.m.
Literature in Translation
Every Fourth Thursday at 6:30 p.m.
Mysterious Undertakings
Contemporary and classic mysteries
Every First Monday at 6:30 p.m.
Waldo Library Readers' Circle
A focus on in-depth discussion of selected short stories
Every Wednesday from 12-1:30 p.m.
Westport Branch
Between the Lines
First Friday of every month at 12 p.m.
KC Queer Readers
Featured works will focus on queer characters and queer authors. To participate, join the Goodreads group.
Other Book Groups That Meet at the Library
FYI Book Group
The Kansas City Public Library coordinates this book group for The Kansas City Star's FYI section. FYI Book Group discussions will be published in summary form in a later edition of The Star's FYI section. Dates, times, and locations of discussions vary. RSVPs are required.


text:
Online Banking Login
New User? Click Here
Forgot your user name or password? Click Here
Falcon International Bank Advances with Continued Employee Growth (May 6, 2008)
Falcon International Bank Advances with Continued Employee Growth (May 6, 2008)Adriana Ramirez Promoted to Assistant Vice President in Human Resources
Falcon International Bank congratulates experienced administrator Adriana Ramirez on her promotion to Assistant Vice President at the Laredo offices. In her new position in the human resources department, Ramirez is responsible for administering the employee benefit plans and monitoring employee relationship policies and procedures.
Ramirez joined Falcon in 2003, bringing with her 14 years of valuable financial experience. She supports her professional background in banking with continuing education courses in accounting, as well as with training courses such as United States Equal Employment Opportunity Commission Training, and State & Federal Personnel Laws Training. Formerly a human resource officer at Falcon, she also works with the human resources director in areas such as training, employee development, employee compensation and bank-wide communication activities.
Ramirez cites meeting new employees as one of the most significant challenges—and rewards—of her position, also noting how Falcon's unprecedented growth affects her job. "Traveling to our 17 branches and meeting new employees is always exciting," says Ramirez.
A native of Laredo, Ramirez is a volunteer for Junior Achievement. She is also a treasurer for the C. L. Milton Elementary Parent Teacher Association, member of Laredo Association for Human Resource Management and past member of Financial Women International. When she is not working, Ramirez enjoys spending time with her husband, Martin, and their eight-year-old son, Jacob.
Falcon International Bank is excited to congratulate Adriana Ramirez, and looks forward to her continued contributions!
Recent Articles
- June Banker of the Month
- Bankers of the Month 2016
- New Promotions
- Alfredo "Freddy" Gutierrez is Falcon's 2015 Banker of the Year!
- Shopping Online Securely - OUCH! SANS Monthly
- Cynthia Arredondo has been named Falcon Bank's Banker of the Month for October!
- Falcon Celebrates Teller Appreciation Week 2015
- Imelda Rodriguez has been named Falcon Bank's Banker of the Month for September!
- Jose Alfredo Toledo has been named Falcon Bank's Banker of the Month for August!
- A.A. Lic. Eduardo A. Garza Robles Awarded


text:
Apartments am Brandenburger Tor
Size100 m²
Floor No.0(with elevator)
- Kitchen
- Lockable room
- Elevator in building
- Baby cot
- Dishwasher
- Parking available
- Internet/WiFi
|10117 Berlin, Germany
|Property type
|Property ID
|Acceptance rate
|Response time
|A few hours
|Calendar updated
|Check-in after
|On arrangement
|Check-in before
|On arrangement
|Check-out before
|On arrangement
|Cancellation Policy
|View Details
The apartment is great, sparkling new and super central. The only thing is the WiFi did not work, otherwise great, we had a washing machine, hairdryer, towels, dishwasher, etc. And Metro and bus lines nearby. Not much celebration in the neighborhood but if unpub in the back street used to drink a beer
El apartamento es genial, limpísimo, nuevo y súper céntrico. Lo único que no funcionaba es el WiFi, lo demás genial, teníamos lavadora, secador de pelo,toallas, lavavajillas, etc. Y lineas de metro y bus cerca. No hay mucha fiesta en el barrio pero si unpub en la calle de atrás que sirve para tomarte unas cervezas
Contact with both the landlord and on site very friendly and uncomplicated, top location, apartment clean and well maintained. Unfortunately, it was very warm even though the heaters were off and the windows could not be tilted in the apartment - otherwise it would have been five stars!
Expectations - centrally located, clean, tidy.
Kontakt sowohl mit dem Vermieter als auch vor Ort sehr freundlich und unkompliziert, Lage Top, Wohnung sauber und gepflegt. Leider war es in der Wohnung sehr warm obwohl die Heizungen aus waren und die Fenster konnten nicht gekippt werden - ansonsten wären es fünf Sterne geworden!
Erwartungen erfüllt - zentrumsnah, sauber, ordentlich.
Perfect location - done no better. Near the Brandenburg Gate and Unter den Linden. Rental Office is very service memorial, and is otherwise in the same building. No noise (three layers of glass), estimates bakery 150 meters from the apartment. Large spacious and clean apartment. Here you get great value for money!
The only criticism was that the wifi was very unstable, but it is error reported.
Perfekt beliggenhed - det gøres ikke bedre. Tæt på Brandenburger Tor og Unter den Linden. Udlejningskontor er meget serviceminde, og ligger iøvrigt i samme bygning. Ingen støj (tre lags glas), skøn bager 150 m fra lejlighed. Stor rummelig og ren lejlighed. Her får du meget for pengene!
Eneste kritikpunkt var, at wifi var meget ustabilt, men det er fejlmeldt.
Highly recommend windu. We rented a super apartment in Berlin. We came fast in contact with the landlord and there was never a problem. Meets all deadlines, and so was the apartment just perfect and was much larger than expected.
Kan varmt anbefale windu. Vi lejede en super lejlighed i Berlin. Vi kom hurtig i kontakt med udlejer og der var aldrig problemer. Overholder alle tidsfrister, og så lå lejligheden bare perfekt og var meget større end forventet.
It was a nice apartment, it was light and clean, and was very central, right in the middle of Berlin so it is recommended to try it.
Det var en dejlig lejlighed, den var lys og ren, og lå meget centralt lige midt i Berlin
så det kan anbefales at prøve den.
We were in an apartment on the Behrenstrasses 1C: very good central location (near Brandenburg Gate), neat apartment, no noise from outside. Everything was perfectly arranged. Only bummer was that the promised WiFi hardly available, it was fighting for bandwidth.
Wij zaten in een appartement aan de Behrenstrasses 1C: zeer goede centrale ligging (vlakbij Brandenburger Tor), keurig appartement, geen geluidsoverlast van buiten. Alles was prima geregeld.
Enig minpuntje was dat de beloofde WIFI nauwelijks beschikbaar was, het was vechten om de bandbreedte.
An accommodation beneath contempt . Dirty , leaky shower stall , broken lamps and contacts that did not work . Wifi only worked if you sat out in the yard . We had ants in the kitchen and bathroom.
Fee for cleaning, towels and sheets.
To pay for cleaning when the apartment was so dirty known very irritant . Smaller service oriented staff made it known not worthwhile to go and complain. Would never recommend this accommodation !
Very nice, pieceful and relaxing house.
We really enjoyed the large rooms and terasses outdoor. It is great to have realy furniture inside and outside.
The house is big and especially with a great view but:
- There're no curtains or shutters on the windows
- The sheets are minimal (and not optional)
- The house was quite dirty despite the payment for the cleaning
- The manager of the property accused me to stole one (1) pillowcase the day after we left. The pillowcase has been obviously found after a while, it was left behind during the collecting.
I've enjoyed my stay in Stintino for the sea, the nature, the landscape, but, for a short stay of 4 days, too many thing that didn't work out with the house.
Nice place and great pool. BUT too expensive! Bad kitchenequipments. Expensive sheets and towels. Not value with the money!
- Quality assured accommodation
- Every host is verified by telephone
- Secure payment via SSL encryption


text:
I have it working on a test site. Its complicated yes but if i can get it going, anyone can...
One of the things i love about this plugin is the member search tool. Using taxonomy I have search set up for a number of fields such as location, type of membership, job type etc. it can probably be used for a number of other things such as products and service searches!
The layout of the members page is really good. Took me a while to get to grips with it, but I've really got something nice working.
If you persist with this plugin I am sure you'll get something good from it.
I tried to figure out how to activate it, asked for advice - no response, and doesn't work at all! Very disappointing!
If you wish to create an extensive directory of university staff, this is your plugin of choice. It has option for everything you can think of and is 100% adaptable.
However, the integration is completely useless for me. I basically want this as an extension to the existing user profiles, not as a standalone feature (which is actually is). The profiles behave just like blog posts and don't seem to be associated with existing user profiles at all, even if you link them.
You must log in to submit a review. You can also log in or register using the form near the top of this page.


text:
Seattle Parks and Recreation Jesús Aguirre, Superintendent
|Centers & Pools
|Reservations & Permits
|Projects & Planning
|A - Z Index
University Heights Open Space South Lot
University Way NE and NE 50th Street
The Pro Parks Levy provides $254,000 for planning, design and portion of construction costs.
The 2008 Parks and Green Spaces Levy Opportunity Fund provides $747,000 for construction.
Planning: January - March 2011
Design: April 2010 - Summer 2015
Construction: September - November 2015
Completion: December 2015
Create a multi-use community open space for public use on the south side of University Heights Center for the Community (UHCC), including a performance area/plaza, rain gardens to improve storm water quality, landscaped areas and other amenities. The design will incorporate the farmers market use on a portion of Parks property and the removal of parking from the Parks-owned portion of the site.
This project is one of fifteen community initiated projects that received Opportunity Funds, and combines $254,000 development funds from the 2000 Pro Parks Levy and $747,000 funding from the Parks and Green Spaces Levy Opportunity Fund. The application received from the community is a preliminary concept and the final design may be constrained by the actual project budget. All Opportunity Fund projects will go through Park�s public involvement procedure which includes public meetings and community input. They will also go through an internal Parks process to ensure the most effective implementation.
Public Meeting #1 06/06/11
Public Meeting #2 07/11/11
Landmarks Preservation Board Architectural Review Committee Meeting 08/26/11
*Note: To view a PDF, you must have Adobe Acrobat Reader. Download it for free at www.adobe.com.
Currently no project related public meetings or events are scheduled.
Kelly Goold
800 Maynard Ave S
Suite 300
Seattle, WA 98134
Design Development Plan
Select image to enlarge
|Home | Partnerships | Park Board | Volunteer | FAQ | Parkways | Facebook | @SeattleParks | Flickr


text:
Beach Fit Personal Training Newcastle – We'll Get You The Results You Want
When it comes to your health, fitness and performance, you deserve to train with Newcastle's best personal trainers!
Having your own personal coach overseeing your program and progress is the key to success. You will get a call if you don't show up for a session, you will be pushed to achieve more then you thought possible, you will be taught what to eat and questioned when your not eating right and you will be kept safe while training hard and having fun! You will get results you want in half the time and you keep those results for life. That's why our clients experience life-changing results.
Newcastle's Beach Fit Personal Training offers:
- Elite Personal Training,
- Fun and Effective Small Group Weightloss and Toning,
- Fast, Results Driven Small Group Bodybuilding and Strength Training,
- Personally Designed Take Home Training Programs,
- Toning Up and Bulking Up Nutritional Advice,
- Sport Specific Strength and Conditioning,
As professional trainers our only goal is to ensure you achieve your goals. So when you're ready to make some changes, you're sick and tired of paying for Newcastle gym memberships you never use or walking for hours on a treadmill for no results, and you realize you deserve to live your best life, it's time to call Beach Fit Personal Training. Nothing is going to change tomorrow if you don't make the changes today, Contact Beach Fit Personal Training Today!
Having an experienced personal trainer totally focused on your fitness goals is a great way to keep motivated and ensure results. Newcastle's Beach Fit Personal Training's sessions are designed in order to ensure maximum results in minimum time.
Beach Fit Personal Training is yours and Newcastle's fitness conditioning, weight-loss, body transformation and sport specific training specialist.
Want to know more about what Beach Fit Personal Training can do for you drop us an email or give us a call today.
Come in to Beach Fit Personal Training's Unique, fully equipped Newcastle based Studio located at 604/1b George Street Mayfield East to Get Results Today


text:
© 2002-2016
Encyclopaedia Metallum
Best viewed
without Internet Explorer,
in 1280 x 960 resolution
or higher.
|Band members
|Diego Bolis
|Roberto Previtali
|Diego Scudeletti
|Vocals, Guitars
|Miscellaneous staff
|Sandro Besana
|Engineering, Mixing
|Diego Bolis
|Roberto Previtali
|Diego Scudeletti
|Vocals, Guitars
|Sandro Besana
|Engineering, Mixing
Demo tape.
Recorded and mixed in 2-3-4 march 1991, in Bonate Sotto (Bergamo) by Sandro Besana
Produced by Rock Kontro Produzioni.
Music and lyrics by Krashing.
|Added by: Haayara_Boeret
|Modified by: dismember_marcin
|Added on: 2012-12-02 16:35:07
|Last modified on: 2013-01-15 09:27:25


text:
Did you mean?
Argentina Travel Guide: 10,605 reviews and 25,121 photos
Devil's Throat Falls, the incredible Iguazu falls in the Argentinian side.
This video was taken in May 2013, at "Devils Throat" at the Argentinian side of Iguazu Falls (Iguacu).
Here is the another video of the Iguazu waterfalls in the Argentina side. The Salto Bosseti and another small falls.
Foz de Iguazu May 2013
Live from Buenos Aires outside the Casa Rosada is a group from Medellin Columbia performing for us impromptu on the street us from Forestville Maryland and our friends from Cordoba Argentina
This is in the San Telmo neighborhood of Buenos Aires
Tango performers on la Calle Florida downtown Buenos Aires (Argentina) - September 2009
Tango performers on Calle Florida downtown Buenos Aires - March 2009
Protests in Buenos Aires. We were walking near the parliment area of the city where we were seeing police in riot gear everywhere on all streets nearby barracading the streets and turning away traffic. We made it to this street corner where I shot this short video and we saw the protests being set up and organized. ...Apparently these protests happen frequently and are in protest against different things including the government (including President Cristina Fern�ndez de Kirchner) and economic problems of the country. Just after the video had ended they were launching fireworks and began throwing firecrackers around and into the crowd of people. We got about 3 feet from a firecracker and then turned away and left.
The crash of ice falling into the lake!
The spectacular park of Talampaya and Villa Union
Penguins in the Beagle Channel
A beautiful trip to Salta, Cafayate, Purmamarca
A boat trip to the islands in Beagle Channel to visit the 6,000 penguins who rest there.
Salsa dancing in the Street where the tango dancers perform in Buenos Aires. Dancing to the melody of Africando. Bailando salsa en la esquina del Tango, en Buenos Aires a la melodia de la orquesta Africando.
Man asleep at Puerto Madero, Argentina
Streets and colored houses of El Caminito
March 13, 2009 - Celebration of the anniversary of the Cristo Redentor de Los Andes.
Tango dancers on Calle Florida in Microcentro
During a walk to the Carlos Gardel tomb, we met a carioca's fond of Carlos ...He came there for "singing" and smoking with the maestro...
Collection of buskers
Tango in Florida Street
Boat Ride
Street Tango longer version
Landing in Buenos Aires
Puerto Iguazu Down Town City
drinking chandone
Having fun at Tigre Buenos Aires Argentina
Nice Park
Train ride
Colourful corrugated shacks
Big Water Iguazu Falls
Talented Street Buskers
Modern Tango
Street Tango
Nice video of Buenos Aires
Boca Juniors' supporters during a game against river plate
Big Water
Have you been to Argentina?
VirtualTourist®© 1994-2016 VirtualTourist.com, Inc. All Rights Reserved.


text:
From Our Editors
At the Art Institute of Weston, master artist Conchita Firgau and her associate professors lead students of all ages in learning the classic style of European painting. Drawing on traditions of color, light, and composition practiced by Renaissance painters, Conchita and her staff give students the confidence and skill to develop their own style. But painting is not the only activity that goes on here. Photography classes help shutterbugs master digital cameras, and guitar classes use fun, easily digestible techniques to give more credibility to students' air-guitar performances. The friendly studio also hosts after-school programs and camps to hone kids' artistic talents.


text:
I love this plugin! However, even when I uncheck home page in Settings, the share buttons still show up on it. I was going to manually disable them on that page, but there isn't a "page" created for the home page with my theme. Any suggestions?
My url is http://clearairaz.com


text:
Showing stores near change
Reset Your Password
You're Almost Done
We've sent you an email with instructions on how to reset your password. Please check your email.Return to Sign-In
Create a New Account
It's not just an account. It's the first step to happier shopping and special benefits:
- • Exclusive Offers
- • Order History
- • Faster Checkout
Your Pier 1 Account
Date Ordered Order Number AmountSee All Your Orders
Contact Us
Call (800) 245-4595
Monday-Friday: 7am-9pm CST
Saturday: 8am-9pm CST
Sunday: 10am-6pm CST
Monday-Friday: 7am-9pm CST
Saturday: 8am-9pm CST
Sunday: 10am-6pm CST
We're sorry, this product is no longer available.
Details & Dimensions
Why the long face? Oh. No bar stool. Our exclusive Mason design will have you smiling again. This handcrafted, hand-finished stool includes a solid birch wood frame, cushy padding and bonded leather upholstery that offers superior durability and strength, all at a not-so-hide-leathering price.
- Avocado green
- Bar stool: 18"W x 22"D x 46"H
- Bar stool: Seat height 31.50"
- Birch, bonded leather, foam
Quick Links
See the most popular results in
View All
$5.56 - $6.36 SALE$6.95 - $7.95 Reg
$11.95 - $13.95More Like This
$7.95 - $8.95More Like This


text:
Oklahoma Wesleyan University women's basketball coach Mark Molder held no illusions about the test his Lady Eagles faced Saturday evening.
It wasn't Santa Claus coming to town but NAIA Division I powerhouse John Brown University to face the Lady Eagles.
The JBU ladies proved to live up their billing.
They ripped out to a 41-32 halftime lead and went to beat the Lady Eagles, 85-61, to send them below the .500 mark (5-6).
In reality, the Lady Eagles competed well — but when an opposing team shreds the cords with 20 three-pointers, it's hard to come up with an antidote. Yep. The JBU marksmen knocked down 20-of-35 three-pointers — which has got to be somewhere in the realm of a record.
In fact, JBU shot just 10-of-24 from two-point territory.
Kayla Morgan came off the bench to score a team-high 13 points for OKWU, followed by starting guard Megan Jones with 11.
Delaney Jones added seven points, while Kayla Oleman and Kelsey Jones scored six apiece.
Molder went deep into his bench, with 12 ladies garnering between seven-to-23-minutes of playing time.
Next up, the Lady Eagles play host Tuesday to Rogers State, at 6:30 p.m.


text:
New Preview and screens
A brand new EaW preview with some new screenshots can be found over at gamepro. Featuring some interesting new information about the game as excitement levels are raised even further
|All times are GMT -4. The time now is 01:57 PM.
Powered by vBulletin®
Copyright ©2000 - 2016, Jelsoft Enterprises Ltd.
LFNetwork, LLC ©2002-2015 - All rights reserved.


text:
Find information on common issues.
Ask questions and find answers from other users.
Suggest a new site feature or improvement.
Check on status of your tickets.
Meng Lu receive his B.Eng. in 2002 from the University of Science and Technology of China in Electrical Engineering. He later went on the obtain his M.S.(2004) and Ph.D.(2009) from the University of Illinois at Urbana-Champaign in Electrical and Computer Engineering. Dr. Lu's current research interests include the design and fabrication of optical sensory system with applications to the life science and environment, development of micro- and nano-scale fabrication process.


text:
After the death of Barry Letts, (the Producer of Doctor Who that created the character of Sarah Jane Smith) Elisabeth Sladen paid tribute to him in Doctor Who Magazine 417.
Elisabeth Sladen's first television role after moving to London was as a female terrorist in an episode of Doomwatch, coincidentally also playing a character called Sarah.
Elisabeth Sladen cannot whistle. She was required to do so for her departure scene in The Hand of Fear so director Lennie Mayne whistled for her while she mimed along.
Whilst filming The Seeds of Doom Elisabeth Sladen casually leant on the TARDIS prop, which promptly collapsed on top of her. She was not seriously injured but the prop had to be replaced.
On Elisabeth Sladen's final day of filming during her tenure on the original series of Doctor Who she rid the cast and crew of a persistent fly by inadvertently swallowing it during dialogue rehearsal.
Elisabeth Sladen was almost drowned on location of Doctor Who when the boat she was piloting lost control and she was forced to jump overboard to avoid smashing into a cavern wall.
When Elisabeth Sladen left Doctor Who in 1976 it made front page news, highlighting both popular and critical acclaim for her role as Sarah Jane, as previously only a change of Doctors had merited such attention.
Elisabeth Sladen's first film role was as an uncredited extra in the 1965 iconic movie Ferry Cross the Mersey.
When Elisabeth Sladen was 11 she appeared as a mouse in a Royal Ballet production of The Nutcracker.
Elisabeth Sladen was voted best Best Guest actress by readers of Doctor Who Magazine for School Reunion in 2006.
Elisabeth Sladen's first stage appearance was as a corpse. However, she was scolded for giggling on stage, thanks to a young actor Brian Miller; who she would marry three years later, whispering "Respiration nil, Aston Villa two" in her ear during her performance.
Elisabeth Sladen won the 2006 Cult TV Best Guest Appearance award for her reprisal of the role of Sarah Jane Smith in the Doctor Who episode School Reunion.
She was very saddened and heartbroken when Jon Pertwee died in 1996. She and Pertwee were close friends, and she cried for weeks after his death.
Sarah Jane Smith is probably best known as the companion to two Doctors (Jon Pertwee and Tom Baker) in Doctor Who. She later appears in 2006 alongside David Tennant, the 10th Doctor in School Reunion.
Elisabeth Sladen: (About her Sarah Jane Adventures co-stars) K-9 is good when he's used properly but it's difficult to work with an inanimate object. I know Tom [Baker] used to kick him across the studio. So to have the children instead, real flesh and blood, is better. I was worried because you look at the age group and they could have been spawn of the devil. But they are such lovely children.
Elisabeth Sladen: (About the first day filming School Reunion) I just wanted to go in and do the work, I had so many flowers in the trailer I thought I'd died! It really was not very low key.
Elisabeth Sladen: Occasionally hoodies will come up and I think 'Oh God, I'm going to be mugged',but they're so nice to me! 'Hello, Sarah', they'll say. At Charing Cross Station the other week, I was just sitting there with my coffee waiting for a connection, and this guy didn't stop walking, he just came up and said 'god bless you, Sarah', and walked off! It's sort of non-intrusive and I'm sure it's not what the Doctors get at all, but it's always very sweet, I like it.
Elisabeth Sladen: It is science fiction, but really Doctor Who is about relationships. It's about being made to look a fool every week if you're the assistant:- "Yes Doctor, No Doctor, but... I will look a fool to help my friend and I don't care how stupid I look, because he needs help."
Elisabeth Sladen: (About The Five Doctors) It was wonderful for what it was and it's Doctor Who and you open a can of beans and what have you got? Nothing really, you've got froth. But somewhere in there you've got a programme about heroes and there's still something in there that captures hold of people today, so in one way we shouldn't dismiss it. You've got good, you've got evil and good wins. It should scare, but it's a good sort of scared and the blood is tomato sauce.
Elisabeth Sladen: I did three years at the Aylesbury theatre, but no one really knows that. Maybe two people saw me do Desdemona, maybe 1000's did, but they'll never remember it. But they'll remember a massive spider being lodged on your back.
Elisabeth Sladen: (about the reaction to the Sarah Jane Adventures) I was very worried that all the kids would just be into Grange Hill and really wouldn't care about some silly old lady running about! But where we film Sarah Jane's house in Cardiff, the local school bus now does a free tour going past the house and they all wave. The local Brownies walking past to say hello too, it's lovely.
Elisabeth Sladen: (about the dangers of conventions) One of the funniest things was being at a convention and we were turfed out of our hotel in Philadelphia. The guy who organized it wasn't paying the bill. So we had to relocate to the Holiday Inn and Jon Pertwee's wife Ingebourg was going, "Jon, Jon." Out come the funny pills - valium or something. And we'd started in the morning on Bloody Marys - the hospitality was wonderful. Anyway, between the two things I don't remember anything about that convention whatsoever - probably my best performance ever, I woke up in the shower at 3am. I had no idea what happened in Philadelphia.
Elisabeth Sladen: (about The Sarah Jane Adventures) We finished School Reunion in the autumn of 2005 and I didn't know until early January that they wanted to see me for something else. Initially I thought it was Torchwood. I thought 'ooh I'm going to get pass the nine o'clock zone', but t'was not to be - but I'm really, really pleased.
Elisabeth Sladen: (about working with Tom Baker) I didn't see Tom socially. I once met him on Regent Street, and he asked me to have a Guinness, but I think it freaked us both out – the Doctor and Sarah-Jane drinking on Regent Street! The relationship worked so well that we didn't want to spoil it.
Elisabeth Sladen: Sarah Jane used to be a bit of a cardboard cut-out. Each week it used to be, 'Yes Doctor, no Doctor', and you had to flesh your character out in your mind — because if you didn't, no one else would.
User Score: 72
User Score: 5
User Score: 3
User Score: 2
User Score: 2
User Score: 2


text:
BEGIN:VCALENDAR VERSION:2.0 PRODID:-//10.1.99.125//NONSGML kigkonsult.se iCalcreator 2.16.1// CALSCALE:GREGORIAN METHOD:PUBLISH X-WR-CALNAME:Home X-WR-CALDESC:The Armed Services YMCA X-FROM-URL:http://www.asymca.org X-WR-TIMEZONE:America/New_York BEGIN:VTIMEZONE TZID:America/New_York X-LIC-LOCATION:America/New_York BEGIN:STANDARD DTSTART:20161106T020000 TZOFFSETFROM:-0400 TZOFFSETTO:-0500 TZNAME:EST END:STANDARD BEGIN:DAYLIGHT DTSTART:20170312T020000 TZOFFSETFROM:-0500 TZOFFSETTO:-0400 TZNAME:EDT END:DAYLIGHT END:VTIMEZONE BEGIN:VEVENT UID:http://www.asymca.org/?post_type=ai1ec_event&\;p=7259&\;instanc e_id= DTSTAMP:20160731T055217Z CONTACT: DESCRIPTION:
Military Family Month was established in 1993 b y the Armed Services YMCA\, with the U.S. Government formally recognizing the occasion every year since. In the 2009 proclamation\, President Barac k Obama called on all Americans to honor military families through private actions and public service for the tremendous contributions they make in the support of our service members and our Nation during Military Family M onth. Each November\, the Armed Services YMCA celebrates Military Family Month to demonstrate the nation's support and commitment to the families o f military personnel. With so many service members deployed throughout the world\, recognizing the daily sacrifices made by military families has ne ver been more important.\n
Each year during Military Family Month\, the Armed Services YMCA also announces the guidelines and opens entries to the Annual Student Art & Essay Contest. Stay tuned for Contest Rules\, e vents\, discounts and tips on how you can help recognize Military Families during Military Family Month.DTSTART;VALUE=DATE:20161031 DTEND;VALUE=DATE:20161130 RRULE:FREQ=YEARLY;BYMONTH=11 SUMMARY:November is Military Family Month URL:http://www.asymca.org/blog/ai1ec_event/november-is-military-family-mont h/?instance_id= END:VEVENT END:VCALENDAR


text:
The Doncaster Small Luxury Hotel, formerly the Doncaster Inn, Braidwood's first hotel was built in 1837 and quickly became the centre of social life in the Gold Fields. It was later purchased by the Catholic Church to accommodate the Good Samaritan O
The Mud Brick B&B. Stay in a hand & soul made mud brick home with traditional B&B service. Wander around the attractive gardens & 100 acres of bush with bird & wildlife. Watch the eagles soar from your private balcony. Pets welcome.
SURF BEACH COUNTRY RETREAT - a luxury hideaway -to rest, relax & revitalise. Large Bavarian-style Country Guest House on the hill above SURF BEACH, with excellent ocean views, on 90 acres of bush & rainforest. Resort & Health retreat facilities
Quiet and peaceful location, 4mins drive to CBD for restaurants, shops, Mt Panorama Racing Circuit, Museums and Art Gallery.
Blacktown City central location, selection of 2 & 3 bedroom serviced & furnished apartments accommodation for short and extended stay
One of Sydneys top B&Bs, Clean. Comfortable and close to the Heart of the city centre Ashfield Manor offersd you all the comforts of home.A short trip to Olympic Park.Transport by bus or rail at your door. Nightly and weekly rates available
Pensione Italia is Located in Leichhardt,the original "Little Italy"of Sydney close to the airport,the city and transport
Nestled away just 10 minutes from downtown Sydney, we offer superb budget accommodation that must be viewed to be believed. Cambridge lodge is new and in pristene condition, and we welcome you to experience what we have to offer.
situated in Leichhardt %km. from city/airport close to transport a house with 4 rooms & 2 bathrooms + 2 suits
Sydney South Central location, luxurious studio & 1 bedroom hotel apartments accommodation suitable for daily or extended stay. All our self contained hotel apartments include full kitchen,internal laundry and security car parking.
Select your destination in Canberra Australia. Browse thousands of listings for accommodations, adventures, tours and travel services.


text:
Star Tracks: Monday, May 16, 2016 42 years, 2,191 covers and 55,436 stories from PEOPLE magazine's history for you to enjoy
Latest News!
- Mary J. Blige Files for Divorce from Husband Kendu Isaacs After 12 Years of Marriage
- Read the Cover Story: George Turns 3: The Preschool Prince!
- Man in Army Fatigues Arrested in Pennsylvania Theater Allegedly Had Stolen Gun, Ammunition and Respirator
- JoJo Drops Wiz Khalifa Collab, Announces First Album Since Label Lawsuit: 'I Never Left' – But 'I Didn't Own My Voice' for 7 Years
- Tennessee Dad Drowns While Trying to Save Daughters from Rip Current – How to Stay Safe in the Ocean This Summer
On Newsstands Now
George Turns 3!: Little Prince Charming
People Top 5
LAST UPDATE: Tuesday February 10, 2015 01:10PM EST
PEOPLE Top 5 are the most-viewed stories on the site over the past three days, updated every 60 minutes
- October 03, 1988
- Vol. 30
- No. 14
Take One
Nearly two years after its scheduled release, Brooke Shields's Brenda Starr movie, based on the comic strip, just may open in early 1989. She plays the flame-haired reporter, and Timothy (The Living Daylights) Dalton is Basil St. James, her eye-patch-wearing knight in a shining serge suit. The release was held up by legal wranglings between the distributor, New World, and the producers. Now New World head Bob Rehme says, "We've resolved the differences." Director Robert Ellis (Reuben, Reuben) Miller says, "I forget what they were fighting about. But I really like the movie, and I want to see it out."
Henry Winkler, for whom the Fonz is but a dim memory, will direct Tom Hanks in Disney's Turner and Hooch, a movie about a detective and his dog. Shooting will start early next year. Winkler's maiden effort as a movie director, Memories of Me with Billy Crystal and Alan King, opens this week.
Both ABC and CBS could have saved a lot on those six-figure wardrobe budgets for their Liberace TV movies if they'd featured Liberace at home. His longtime publicist, Jamie James, says Liberace wore plain, often old, clothes and little jewelry when he wasn't performing. Sometimes he didn't change his pants for a week or would wear the same sweat suit for two weeks. James says Liberace's housekeepers had to sneak his clothes into the wash.
Shirley MacLaine, who doesn't play the piano, apparently didn't channel up the late Arthur Rubinstein's help for her role as an eccentric keyboard teacher in Madame Sousatzka, the Cineplex Odeon/Universal movie opening Oct. 14. Instead, classical pianist Yonty Solomon was asked to teach her to fake it convincingly as she fingered a dummy keyboard. "She picked it up quickly because she is a dancer," says Solomon. "Basically she choreographed her fingers to the music. It could take her 10 years to learn to play what she learned to look like she was playing in 10 hours."
Some cameo roles are louder than others. In the forthcoming film version of Tama Janowitz's Slaves of New York, occasional Late Show fashion commentator Diane Brill, mostly known for hanging out in New York nightclubs, shows up jogging in Central Park wearing black capri pants, leather wrestling boots and a fitted green T-shirt. "I'll probably be in 3-D," says the voluptuous Brill. In real life, she is taking time off from her perpetual party-going to write an advice book titled, not at all tentatively, Boobs, Boys and High Heels: Or How to Get Dressed in Under Six Hours.
More in the Archive
Today's Photos
Treat Yourself! 4 Preview Issues
The most buzzed about stars this minute!


text:
We have no history of twins on either sides of our families that we are aware of. What are the chances of conceiving twins the next pregnancy? I believe the doctor said they were fraternal.
We are lucky enough to have already been blessed with a very healthy boy. Having him to take care of is making all this a little easier.


text:
Flower backs England to respond
Watch session-by-session highlights of every Ashes Test on ecb.co.uk/video
Andy Flower is confident England will bounce back from their defeat in the third Ashes Test.
The tourists were beaten by 267 runs at the WACA - their first reverse since arriving Down Under - and must now regroup ahead of the Boxing Day Test at the MCG.
Flower, however, believes that will not be a problem and points to England's impressive displays prior to Perth as justification for his optimism.
"The cricket we've played on this tour so far should stand us in good stead," said the team director.
"The one defeat we've had on tour was here in Perth, and it was a bad defeat for us.
"But we are quite comfortable sticking to the principles we've used for the six weeks on this tour so far. They've served us well and will continue to do so."
Flower confirmed that England will therefore stick with a four-man attack in Melbourne.
"A five-Test series is hard on everyone, both physically and emotionally, and for the fast bowlers even more so," he continued.
"In the absence of a quality all-rounder we are sticking with a four-man attack. We have shown over the last 18 months that it has served us well."
England had been backed as clear favourites to win the series prior to their defeat in Perth, but Flower insists complacency has never been an issue for his side.
"This was always going to be a fight, and it would have been naive to think otherwise," he said.
"Coming to Australia to win is a huge challenge - we knew that at the start.
"We played some very good cricket in the first two Tests, but didn't here - and were outplayed.
"We've got to regroup after this defeat and come back hard in Melbourne."
Australia's man-of-the-match Mitchell Johnson and prolific middle-order batsman Mike Hussey were the two main reasons England faltered in Perth.
Hussey has proven a thorn in England's side throughout the series, amassing over 500 runs in just five innings, and the left-hander appears to be in 'bulletproof' form.
"Batsmen do (sometimes) feel that way, yes," Flower agreed. "But we all know how quickly things can turn around.
"We've just seen a very good example of it in a team sense between Adelaide and here.
"The same thing can happen with individuals. He'll be trying his darndest to keep that form going; we want to try to burst it."
However, Flower does not believe victory in Perth makes Australia invincible, stressing the significance of Hussey and Shane Watson in the series to date.
He added: "There's no doubt that everything is not rosy in their camp.
"One Test match does not create that, so yes we realise that. Watson and Hussey have been very good for them so far, and we will be looking to make the most of that in this next Test."
Off-spinner Graeme Swann, the world's number two Test bowler who enjoyed precious little assistance at Perth, will be seeking to limit Hussey and company in Melbourne.
"Without a doubt, he can come back," Flower insisted. "He got him in the first innings of this Test, and I'd be surprised if Swann got intimidated by Michael Hussey.
"We'd have expected a guy of his quality to affect the momentum a little more. But once we got on that pitch, we all noticed it was tricky facing the quicks and the bounce was aiding them - and there wasn't much turn there for him - so it was a difficult task.
"I don't blame him for that at all - it was a tough 'ask'. Melbourne is a different set of conditions."
Register for daily Ashes emails with match highlights, Swanny's video diary and exclusive updates throughout the Ashes!


text:
Universal Design for Learning:
Universal Design for Learning, UDL, is an instructional approach to learning that provides an opportunity for every student to enhance their learning and be successful. As educators we are aware of the varying levels of challenges that our curriculum poses to each individual student. The Universal Design for Learning provides guidelines, methodologies, and strategies for educators to utilize in order to create a flexible curriculum that can maximize individual student achievement.
The inspiration for UDL originated from the architectural field. Architects realized that in order for buildings to be accessible to every person, certain requirements must be in place. For example, while steps are a functional way of moving vertically for some people, they pose a challenge to others. Therefore structures such as ramps, elevators, and escalators are installed in addition to stairs to maximize the accessibility of buildings. There are many examples of Universal Design within our daily lives, from captions on televisions and movies, to Braille on ATM keys.
Just as architectures look for ways to maximize accessibility by all, as educators we must examine our curriculum and identify areas in which it can be adapted in order to make the learning objectives accessible to all learners.
Please take a moment to view this short video to learn more about UDL.
For more UDL related videos, follow this link, UDL Videos.
More great resources pertaining to UDL can be found through the following links. Please take a moment to check them out.
Other Websites:


text:
After creating a contest on a WP-page following error:
Warning: require_once(ABSPATHwp-settings.php) [function.require-once]: failed to open stream: No such file or directory in /htdocs/wordpress/wp-config.php on line 92
Fatal error: require_once() [function.require]: Failed opening required 'ABSPATHwp-settings.php' (include_path='.:/usr/lib/php5') in /htdocs/wordpress/wp-config.php on line 92
I'm using multisite option. Error displays in the mainblog, the plugin is only activated for the mainblog. Also i use the buddypress-plugin.
Can you help me ?


text:
|8. Apr. 2008
|21. Nov. 2002
|21. Nov. 2002
|Auch veröffentlicht unter
|Anindya Basu, Girija J. Narlikar, Francis X Zane
|Ursprünglich Bevollmächtigter
|Lucent Technologies Inc.
|Zitat exportieren
|BiBTeX, EndNote, RefMan
|Patentzitate (7), Nichtpatentzitate (13), Referenziert von (49), Klassifizierungen (20), Juristische Ereignisse (3)
|Externe Links: USPTO, USPTO-Zuordnung, Espacenet
The present invention relates generally to the field of packet-based data networks and more particularly to a method and apparatus for performing network routing (or other data packet categorization functions) with use of forwarding engines (or other lookup engines) based on power efficient TCAM (Ternary Content Addressable Memory) architectures.
Ternary Content-Addressable Memories (TCAMs) are becoming very popular for designing high-throughput forwarding engines on routers—they are fast, cost-effective and simple to manage. Specifically, TCAMs are fully associative memories that allow a "don't care" state to be stored in each memory cell in addition to 0s and 1. This feature makes them particularly attractive for packet classification and route lookup applications that require longest prefix matches. For example, when a destination address is presented to the TCAM, each TCAM entry may be looked up in parallel, and the longest prefix that matches the address is returned. Thus, a single TCAM access is sufficient to perform a complete route lookup operation. In contrast, conventional ASIC-based designs that use routing tries may require many memory accesses for a single route lookup. (As is well known to those skilled in the art, a routing trie is a tree-based data structure used to store routing prefixes for use in longest prefix matching.) Thus, routing latencies for TCAM-based routing tables are significantly lower than they are for ASIC-based tables. Moreover, TCAM-based tables are typically much easier to manage and update than tables implemented using tries.
Despite these advantages, routing vendors have been slow in adopting TCAM devices in packet forwarding engines for at least two reasons. First, TCAM devices have traditionally been more expensive and less dense compared to conventional ASIC-based devices. However, both the density and the cost of TCAMs have dramatically improved in the past few years, making them a viable alternative to ASIC-based designs in high-speed core routers. The second reason is that of high power consumption. Current high-density TCAM devices consume as much as 12 to 15 Watts each when all of the TCAM memory entries are enabled for search. Moreover, a single linecard may require multiple TCAMs to handle filtering and classification as well as IP lookups on large forwarding tables. This high power consumption number affects costs in two ways—first, it increases power supply and cooling costs that account for a significant portion of the operational expenses for an ISP (Internet Service Provider), and second, it reduces port density since higher power consumption implies that fewer ports can be packed into the same space (e.g., a router rack) due to cooling constraints. Therefore, it is important to significantly reduce the power requirements of TCAM-based forwarding engines (and other lookup engines) to make them economically viable.
Recently, certain TCAM vendors have begun to provide mechanisms for searching only a part of a TCAM device in order to provide for reduced power consumption during certain lookup operations. Specifically, these vendors have provided for the selective addressing of separate portions of the TCAM (referred to as "sub-tables"), and have suggested that each sub-table (or groupings thereof) might be used for different lookup/classification applications, such as, for example, IPv4 lookups, IPv6 lookups, flow classification, etc. (IPv4 and IPv6 represent Internet Protocol versions 4 and 6, respectively, and are each fully familiar to those of ordinary skill in the art.) However, we have realized that a novel TCAM-based architecture for IP (Internet Protocol) lookup tasks (such as routing, classification, etc.) can be advantageously obtained by taking further advantage of this selective addressing feature to thereby provide more power efficient forwarding engines (and other lookup engines) than were heretofore possible.
Specifically, in accordance with the principles of the present invention, a TCAM is advantageously divided into a plurality of partitions, each partition comprising one or more TCAM sub-tables, and packet-based lookups are performed with use of a multi-stage (e.g., two-stage) lookup process. In particular, when a lookup is to be performed (based on information contained in the packet header of a given packet), a first stage of the lookup is performed (e.g., within a first one of these TCAM partitions, with a separate memory lookup device, or with a separate logic module), and then, the results of the first stage lookup are advantageously used to selectively search one of the (other) TCAM partitions during a subsequent stage of the lookup process. Illustratively, the packet header information comprises a packet destination, and the result of the second stage lookup comprises packet routing information (such as, for example, "next-hop" information).
In accordance with certain illustrative embodiments of the present invention, a subset of the destination address bits are advantageously used in the first lookup stage to hash to a TCAM partition for use in the second stage. This approach provides for a very simple hardware implementation and will be referred to herein as the "bit-selection" architecture. The selected bits may be advantageously fixed based on the contents of a routing table.
In accordance with other illustrative embodiments of the invention, a partitioning algorithm may be advantageously employed to segment a routing trie into a plurality of partitions for use with the two-stage lookup process. In particular, a small trie—advantageously implemented using either a separate, small TCAM or one of the partitions (e.g., sub-trees) of the partitioned TCAM—is used to map a prefix of the destination address to one of the TCAM partitions for use by the second stage. These approaches, referred to herein as the "trie-based" architectures, add some design complexity, but advantageously result in significantly better worst-case power consumption.
And in accordance with certain ones of those illustrative embodiments in which a "trie-based" architecture is employed, novel partitioning algorithms are provided whereby a routing trie is advantageously partitioned based on a post-order traversal of the routing trie such that each of the aforementioned second stage partitions comprises a set of prefixes associated with one or more corresponding trie nodes encountered during said post-order traversal, together with one or more covering prefixes thereof. (As is well known to those of ordinary skill in the art, a "post-order traversal" of a tree is a depth-first traversal in which descendant nodes precede ancestor nodes in the ordering. In addition, for any node u in a routing trie, the prefix of the lowest common ancestor of u, including u itself, that is in the routing table, is referred to herein as the "covering prefix" of node u.) In particular, two of these novel partitioning algorithms, as provided in accordance with each of two illustrative embodiments of the present invention, are described in detail below and are specifically referred to herein as the "subtree-split" partitioning algorithm and the "postorder-split" partitioning algorithm, respectively.
Summary Review of TCAM Use in Forwarding Engine Address Lookups
A Ternary Content Addressable Memory (TCAM) is a fully associative memory that allows a "don't care" state for each memory cell, in addition to a "0" and a "1". A memory cell in a "don't care" state matches both a "0" and a "1" in the corresponding input bit. The contents of a TCAM can be searched in parallel and a matching entry, if it exists, can be found in a single cycle (i.e., using a single TCAM access). If multiple entries match the input, the entry with the lowest address in the TCAM is typically returned as the result.
The characteristics described above make TCAMs an attractive technology for packet-based network lookup operations, such as IP route lookups in which the destination address of an incoming packet is matched with the "longest matching prefix" in a routing table database in order to obtain "next-hop" routing information. In particular, TCAMs can be illustratively used to implement such routing table lookups as follows. If the maximum prefix length is W, then each routing prefix of length n≦W is stored in the TCAM with the rightmost W−n bits as "don't care" bits. For example, the IPv4 prefix "192.168.0.0/15" will have "don't care" bits in the last 17 bit positions. To ensure that the longest prefix match is returned, the prefixes in the TCAM may be advantageously sorted in order of decreasing prefix length. (Note that even though such a sorting requirement may make it more difficult to update the routing table, recent developments have provided innovative algorithms for performing such TCAM updates simply and efficiently.)
However, as pointed out above, the power consumption issue has heretofore remained unresolved. Note that the main component of power consumption in TCAMs is proportional to the number of searched entries. For example, a typical 18 Mbit TCAM device can consume up to 15 Watts of power when all of the entries are searched. And growth trends in the routing tables in the Internet core have prompted routing vendors to design routing engines capable of scaling up to 1 million entries. And since an 18 Mbit TCAM can store up to 512K 32-bit prefixes, this translates to using at least 2 TCAM devices for IPv4 forwarding alone. After adding more TCAM devices for flow classification and IPv6 forwarding, it can be seen how TCAM power consumption on a linecard can become a major cost overhead.
TCAM vendors today have started providing mechanisms that can reduce power consumption by selectively addressing smaller portions of the TCAM. Each portion (typically called a "sub-table" or database) is defined as a set of TCAM blocks. A TCAM block is a contiguous, fixed-sized chunk of TCAM entries, usually quite a bit smaller than the size of the entire TCAM. For example, a 512K entry TCAM might, for example, be divided into 64 blocks containing 8K entries each. The sub-tables can then be defined as (possibly overlapping) subsets of the 64 blocks by using a 64-bit mask. When a search command is issued, a sub-table identifier (ID) may be specified along with the input—only the blocks in the specified sub-table are then advantageously searched. Typically, these TCAMs support a relatively small number of sub-tables (such as, for example, 8 sub-tables addressed by a 3-bit ID), but the same mechanism could be used to support a larger number of sub-tables as well. Typically, as pointed out above, each sub-table is intended for use in a different lookup/classification application, such as, for example, IPv4 lookups, IPv6 lookups, flow classification, etc.
As explained above and according to the principles of the present invention, this mechanism may be advantageously exploited to reduce power consumption for individual lookup applications such as, for example, route lookups, in accordance with various illustrative embodiments of the present invention. Given that the power consumption of a TCAM is proportional to the number of searched entries, we will herein use this number as a measure of the power consumed. Clearly, if the TCAM is partitioned into, say, K equally-sized sub-tables, it is possible in principle to reduce the maximum number of entries searched per lookup operation to as low as 1/K of the TCAM size.
A First Set of Illustrative Embodiments—the Bit Selection Architecture
In accordance with a first set of illustrative embodiments of the present invention, a "bit selection" architecture for TCAM-based packet forwarding engines is employed to perform two-stage routing. Specifically, the entire routing table is stored in the TCAM device split into multiple sub-tables "buckets", wherein each bucket is laid out over one or more TCAM blocks. Each route lookup is a two-stage operation where a fixed set of bits in the input is advantageously used to hash to one of the buckets. The selected bucket is then searched in the second stage. The hashing may, for example, be illustratively performed by some simple glue logic placed in front of the TCAM device (which will be referred to herein as the "data TCAM"). Illustratively, the hash function may be such that it simply uses the selected set of input bits (which will be referred to herein as the "hashing bits") as an index to the appropriate TCAM bucket.
It has been noted that a very small percentage of the prefixes in typical core routing tables are either very short (for example, less than 16 bits) or very long (for example, greater than 24 bits). Therefore, in accordance with the first illustrative embodiment of the present invention, an architecture is advantageously employed wherein very short and very long prefixes are grouped into the minimum possible number of TCAM blocks. These blocks are then searched for every lookup. The remainder of the prefixes that are, for example, between 16 and 24 bits long are then advantageously partitioned into buckets, one of which is selected by hashing for each lookup.
The resulting match from TCAM 15 may then be used as an index into SRAM 16 in order to retrieve the "next hop" information for use in routing the given data packet. As illustratively shown in the figure, the 3 hashing bits are selected from the 32-bit destination address by setting the appropriate 5-bit values for b0, b1 and b2. (In other words, the set of hashing bits can be advantageously changed over time by reprogramming the multiplexers.)
For purposes of the discussion herein, the following assumptions will be made (although it will be obvious to those of ordinary skill in the art that the illustrative embodiments described herein may be easily extended to remove such assumptions). First, we will only consider the set of 16 to 24 bit long prefixes (referred to herein as the "split set") for partitioning. Second, it is possible that the routing table will span multiple TCAM devices, which would then be attached in parallel to the bit selection logic. However, each lookup would still require searching a bucket in a single TCAM device. Thus, for simplicity, we will assume that there is only one TCAM device. Third, we will assume that the total number of buckets K=2k is a power of 2. Thus, the bit selection logic advantageously extracts a set of k hashing bits from the packet header and selects a prefix bucket. This bucket, along with the TCAM blocks containing the very short and very long prefixes, are then searched.
The two main issues now are how to select these k hashing bits, and how to allocate the different buckets among the various TCAM blocks. (Recall that the bucket size may not be an integral multiple of a TCAM block size.) The first issue leads to our final assumption—we will restrict ourselves to choosing the hashing bits from the first 16 bits, which is the minimum length of a prefix in the split set. (Otherwise, if, say, k′ of the hashing bits are in bit positions longer than the length of a prefix, the prefix would need to be replicated in 2k′ buckets.)
Note that the "best" (i.e., most desirable) hash function—that is, set of hashing bits—is one that minimizes the size of the biggest resulting bucket, since this will, in turn, minimize the worst-case power consumption (since the worst-case power consumption of a TCAM is directly proportional to the size of the largest bucket). However, in general, the designer of a forwarding engine typically predetermines a "power budget," which comprises the maximum amount of power consumption that is to be permitted. Then, the hashing bits need to be chosen so that given such a power budget and a routing table, the set of selected hashing bits will produce a split that does not exceed the power budget. Such a split will be referred to herein as a "satisfying split."
In accordance with various illustrative embodiments of the present invention, any one or more of at least three different heuristics for choosing the set of hashing bits may be employed. After describing each of these three heuristics, it will be shown how they can be combined in an attempt to ensure a satisfying split in accordance with another illustrative embodiment of the present invention. Note that this methodology may be repeatedly applied when route updates occur.
In accordance with one illustrative embodiment of the present invention, a first heuristic, which will be referred to herein as the "simple" heuristic, requires no computation and merely uses the rightmost k bits from the first 16 bits. It has been (experimentally) determined that this often may be used to provide a satisfying split. In accordance with another illustrative embodiment of the present invention, a second heuristic uses a "brute force" search to check all possible subsets of k bits from the first 16 bits, with the first hashing set that satisfies the given power budget being selected.
Specifically, the brute force method operates as follows. Since only the first 16 bits of all prefixes are considered, each 16-bit combination found in the table is advantageously given a weight representing the number of 16 to 24 bit prefixes that share those first 16 bits. Note that the total number (say E) of such 16-bit weighted entries is at most 216. To find the best k bits using brute force, all of the combinations (of k out of 16) may be examined. Each combination involves one pass over all of the E 16-bit entries.
Finally, in accordance with another illustrative embodiment of the present invention, a third heuristic comprises a "greedy" algorithm that falls between the brute force heuristic and the simple heuristic in terms of computation as well as accuracy. Specifically, in order to select the k hashing bits, the greedy algorithm performs k iterations, selecting one hashing bit per iteration. Thus, the number of buckets (i.e., partitions of the routing table) doubles in each iteration. The goal in each iteration is to select a bit that minimizes the size of the biggest bucket produced by the 2-way split in that iteration.
In accordance with one illustrative embodiment of the present invention, a scheme that advantageously combines each of these three heuristic approaches to performing the bit-selection procedure is provided. Specifically, the following steps are performed:
1. The routing prefixes are split using the last k of their first 16 bits. If this produces a satisfying split, stop.
2. Otherwise, the greedy heuristic is applied to find a satisfying split using k hashing bits. If this produces a satisfying split, stop.
3. Otherwise, the brute force heuristic is applied to find a satisfying split using k hashing bits.
Note that in accordance with these illustrative embodiments of the present invention, each of these above-described techniques for performing the split are advantageously re-applied whenever route updates change the prefix distribution in the routing table such that the size of the largest bucket exceeds the desired amount (i.e., the amount that results from the specified power budget). Note that for typical routing tables, it is expected that such re-computations will not be necessary very often.
Finally, the buckets that have been determined by the above-described techniques (corresponding, for example, to a satisfying split) are laid out on the TCAM blocks in accordance with one illustrative embodiment of the present invention as follows. First, the blocks containing the very long prefixes (e.g., those greater than 24 bits) and those containing the very short prefixes (e.g., those less than 16 bits) are placed at the beginning of the TCAM and at the end of the TCAM, respectively. Doing so ensures that the longest prefix is selected in the event of multiple matches, assuming that the TCAM selects the first match found (as is typical). Then, in accordance with this illustrative embodiment of the present invention, the buckets containing the intermediate length prefixes (e.g., those containing between 16 and 24 bits) are laid out sequentially (in any order) in the TCAM, advantageously ensuring that all the prefixes in one bucket are in contiguous locations.
A Second Set of Illustrative Embodiments—the Trie-Based Architecture
In accordance with a second set of illustrative embodiments of the present invention, a "trie-based" architecture for TCAM-based packet forwarding engines is employed to perform two-stage routing. Specifically, these embodiments advantageously make use of a routing tree (i.e., a "trie") data structure for partitioning the routing table into TCAM buckets. In accordance with at least two of these illustrative embodiments, one of two novel partitioning schemes—the "subtree-split" algorithm and the "postorder-split" algorithm (each of which is described in detail below)—is employed for partitioning the trie in an advantageous manner for use by the illustrative TCAM-based forwarding engine.
In accordance with the illustrative forwarding engine shown in
In accordance with the illustrative embodiment of the present invention shown in
Note that as with the bit-selection architecture, a large routing table can in general be laid out across multiple data TCAMs connected in parallel, in which case each address lookup involves searching exactly one bucket in one of these data TCAMs. For the purposes of the illustrative embodiments described herein, it shall be assumed (for purposes of simplicity) that there is only one data TCAM. It will be obvious to those of ordinary skill in the art that the embodiments described herein can be easily extended to the case where there are multiple data TCAMs.
Each of the illustrative trie-based partitioning schemes presented herein advantageously operate in two steps. First, a binary routing trie (also known as a "1-bit trie") is constructed using the routing table. Then, in the second step, subtrees or collections of subtrees of the 1-bit trie are successively carved out and mapped to individual TCAM buckets. This will be referred to herein as the "partitioning step". The two novel partitioning schemes presented herein differ in their partitioning step.
We will first present a brief overview of 1-bit tries and some of their properties, all of which is well known to those of ordinary skill in the art. A 1-bit trie may be advantageously used for performing longest prefix matches. It consists of a collection of nodes, where a routing prefix of length n is stored at a node in level n of the trie. When presented with an input, the typical lookup process starts from the root, scans the input from left to right and descends the left or the right branch whenever the next bit in the input is a 0 or a 1, respectively, until a leaf node, representing a prefix, is encountered. This process thereby traces a path from the root node to the longest prefix that matches the input. For any node v, the prefix denoted by the path from the root to v is referred to herein as the "prefix" of v, and the number of routing table prefixes in the subtree rooted at v is referred to herein as the "count" of v.
Note that every node in the 1-bit trie will necessarily have a non-zero count, since a node appears in the trie only if the subtree rooted at that node contains at least one prefix. Therefore, the prefix of a leaf node will necessarily be in the routing table. However, on the other hand, the prefix of an intermediate node may not be in the routing table. For any node u, the prefix of the lowest common ancestor of u (including u itself) that is in the routing table will be referred to herein as the "covering prefix" of u. The covering prefix of a node will be defined to be "nil" if there are no nodes in the path to the root whose prefix is in the routing table.
A First Illustrative Trie-Based Partitioning Technique—the Subtree-Split Algorithm
In accordance with one illustrative embodiment of the present invention, a trie-based partitioning method—referred to herein as the "subtree-split" algorithm—is provided for use with the illustrative trie-based architecture of
During the partitioning step, the entire trie is advantageously traversed in post order looking for what will be referred to herein as a "carving node". In particular, a carving node is a node v whose count is at least ┌b/2┐ and whose parent exists and has a count greater than b. Each time a carving node v is encountered, the illustrative subtree-split algorithm carves out the entire subtree rooted at v and places it in a separate TCAM bucket. Next, the prefix of v is placed in the index TCAM, and the covering prefix of v is added to the TCAM bucket. Finally, the counts of all the ancestors of v are decreased by the count of v. In other words, once the subtree rooted at v is carved out, the state of the rest of the tree is advantageously updated to reflect that fact. When there are no more carving nodes left in the trie, the remaining prefixes (if any) are put in a new TCAM bucket with an index entry of "*" in the index TCAM. Note that the size of this last TCAM bucket is in the range [1, b].
Given a selected node, decision block 505 checks to see if the "subtree count" of the given node is within the required range (i.e., between ┌b/2┐ and b), and if it is not, control returns to block 503 to select and test the next node. If, on the other hand, decision block 505 determines that the "subtree count" of the given node is within the required range, block 506 carves out the entire subtree (rooted at the given node) as one partition; block 507 puts all of the prefixes included in the carved-out subtree into level two of the TCAM (i.e., in the given level two partition); block 508 updates the "subtree count" values (to account for the removed prefixes); and control returns to block 503 to search for the next partition.
When all nodes have been processed (as determined by decision block 504), block 510 selects one of the generated partitions, unless all of the partitions have been processed (as is tested by decision box 511). Then, block 512 puts the root of the subtree (carved out as the given partition) into level one of the TCAM, and block 513 adds the "covering prefix" of the subtree to the level 2 TCAM partition built by block 507 above. When all partitions have been processed (as determined by decision box 511), the procedure is complete.
Note that the index (root) for a carved subtree need not hold a prefix from the routing table. Hence the index TCAM may include prefixes not in the original routing table. In such a case, they merely serve as pointers to the buckets in the data TCAM that contains the corresponding routing table prefixes. Therefore an input address that matches an entry in the index TCAM may have no matching prefix in the corresponding subtree. The addition of the covering prefix to a bucket ensures that a correct result is returned in such a case. For example, for the partitioning shown in
Since the algorithm performs a post order traversal of the trie, the subtree indices are advantageously added to the index TCAM in the order that the corresponding subtrees were carved out. In other words, the first subtree index advantageously has the highest priority (i.e., the lowest address) in the index TCAM, while the last subtree index advantageously has the lowest priority. Finally, each bucket can be laid out in the data TCAM as described above in connection with the illustrative bit-selection architecture embodiments of the invention.
A Second Illustrative Trie Partitioning Method—the Postorder-Split Algorithm
One disadvantage of the subtree-split algorithm described above is that the smallest and largest bucket sizes may vary by as much as a factor of two. In accordance with another illustrative embodiment of the present invention, another trie partitioning algorithm—the postorder-split algorithm—is provided in which the bucket sizes are advantageously of a constant size. Once again, let N be the total size of a routing table, and let b be the desired size of a TCAM bucket. The postorder-split algorithm advantageously partitions the routing table into buckets that each contain exactly b prefixes (except possibly the last bucket). However, a larger number of entries in the index TCAM may result, as compared to the subtree-split algorithm described above. (Note that to split N prefixes of maximum length W into K buckets, the illustrative algorithm may be advantageously executed with parameter b set equal to ┌N/K┐.)
Specifically, the postorder-split algorithm is similar to the subtree-split algorithm, in that it takes as its input a 1-bit trie (constructed from a routing table) and then traverses the trie in post-order, carving out subtrees to put in TCAM buckets. However, since it is possible that the entire trie does not contain ┌N/b┐ subtrees with exactly b prefixes each (and since each resulting TCAM bucket is to be of size b), a bucket here is constructed from a collection of subtrees which together contain exactly b prefixes, rather than from a single subtree (as in the case of the illustrative subtree-split algorithm described above). Consequently, the corresponding entry in the index TCAM may, in general, have multiple indices that point to the same TCAM bucket in the data TCAM. Each such index is the root of one of the subtrees that constitutes the TCAM bucket.
Given a selected node, decision block 805 checks to see if the "prefix count" is yet equal to the partition size b, and if it is not, block 807 increments "prefix count" if the given node is, in fact, a prefix node, and control returns to block 803 to possibly add in the next node. If, on the other hand, decision block 805 determines that the "prefix count" has reached the value b, block 806 carves out the entire accumulated node sequence (since the last partition was carved out) as one partition; block 808 puts all of the prefixes included in the set of carved-out nodes into level two of the TCAM (i.e., in the given level two partition); block 809 updates the "subtree count" values (to account for the removed prefixes); and control returns to block 802 to reset "prefix count" and to build the next partition.
When all nodes have been processed (as determined by decision block 804), block 810 selects one of the generated partitions, unless all of the partitions have been processed (as is tested by decision box 811). Then, block 812 puts the root or roots of each subtree carved out as part of the given partition into level one of the TCAM, and block 813 adds "covering prefixes" of each such subtree to the level 2 TCAM partition built by block 808 above. When all partitions have been processed (as determined by decision box 811), the procedure is complete.
As can be seen from the illustrative program code of
Note that the postorder-split algorithm may, in general, add more than one index (and covering) prefix per TCAM bucket. Note that the number of prefixes added to the index TCAM for any given TCAM bucket is equal to the number of times the carve-exact procedure is called recursively to create that bucket. It is possible to show that each time carve-exact is called for this bucket, we descend one level down in the 1-bit trie (except, possibly, for the last invocation of carve-exact). Therefore, the maximum number of times that the carve-exact procedure can be called is W+1, where W is the maximum prefix length in the routing table. Thus, for each bucket in the data TCAM, the postorder-split algorithm adds at most W+1 entries to the index TCAM. In addition, the algorithm adds at most W covering prefixes to each bucket in the data TCAM.
Addendum to the Detailed Description
It should be noted that all of the preceding discussion merely illustrates the general principles of the invention. It will be appreciated that those skilled in the art will be able to devise various other arrangements, which, although not explicitly described or shown herein, embody the principles of the invention, and are included within its spirit and scope.
For example, although the illustrative embodiments of the present invention which have been described herein describe a two-level lookup process, it will be obvious to those skilled in the art that the principles of the present invention can be easily extended to providing a multi-level lookup process for any number of levels greater than one. In addition, although the illustrative embodiments of the present invention described herein are focused on IPv4 address lookups, other illustrative embodiments of the invention will be obvious to one of ordinary skill in the art for application to other protocols such as, for example, IPv6 address lookups, as well.
Furthermore, all examples and conditional language recited herein are principally intended expressly to be only for pedagogical purposes to aid the reader in understanding the principles of the invention and the concepts contributed by the inventors to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions. Moreover, all statements herein reciting principles, aspects, and embodiments of the invention, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. It is also intended that such equivalents include both currently known equivalents as well as equivalents developed in the future—i.e., any elements developed that perform the same function, regardless of structure.
Thus, for example, it will be appreciated by those skilled in the art that the block diagrams herein represent conceptual views of illustrative circuitry embodying the principles of the invention. Similarly, it will be appreciated that any flow charts, flow diagrams, state transition diagrams, pseudocode, and the like represent various processes which may be substantially represented in computer readable medium and so executed by a computer or processor, whether or not such computer or processor is explicitly shown. Thus, the blocks shown, for example, in such flowcharts may be understood as potentially representing physical elements, which may, for example, be expressed in the instant claims as means for specifying particular functions such as are described in the flowchart blocks. Moreover, such flowchart blocks may also be understood as representing physical signals or stored physical data, which may, for example, be comprised in such aforementioned computer readable medium such as disc or semiconductor storage devices.
The functions of the various elements shown in the figures, including functional blocks labeled as "processors" or "modules" may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software. When provided by a processor, the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared. Moreover, explicit use of the term "processor" or "controller" should not be construed to refer exclusively to hardware capable of executing software, and may implicitly include, without limitation, digital signal processor (DSP) hardware, read-only memory (ROM) for storing software, random access memory (RAM), and non-volatile storage. Other hardware, conventional and/or custom, may also be included. Similarly, any switches shown in the figures are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the implementer as more specifically understood from the context.
|Zitiertes Patent
|20. März 1997
|4. Jan. 2000
|Washington University
|Method and apparatus for fast hierarchical address lookup using controlled expansion of prefixes
|17. Apr. 1998
|24. Juli 2001
|Effnet Group Ab
|Fast routing lookup system using complete prefix tree, bit vector, and pointers in a routing table for determining where to route IP datagrams
|13. Dez. 1999
|23. März 2004
|Ascend Communications, Inc.
|Route lookup engine
|21. Mai 2001
|21. Febr. 2006
|Cisco Technology, Inc.
|Method and apparatus for using ternary and binary content-addressable memory stages to classify packets
|30. Aug. 2002
|15. Mai 2007
|Netlogic Microsystems, Inc.
|Search parameter table in a content addressable memory
|4. Apr. 2001
|10. Okt. 2002
|Pankaj Gupta
|Compact data structures for pipelined message forwarding lookups
|22. Apr. 2002
|23. Okt. 2003
|Accton Technology Corporation
|Method and apparatus for constructing and searching IP address
|A. Gallo, "Meeting Traffic Demands With Next-Generation Internet Infrastructure", Lightwave, 18.5:118-123. May 2001. Available at http://www.siliconaccess.com/news/Lightwave<SUB>-</SUB>may<SUB>-</SUB>01.html.
|A.J. McAuley, et al., "Fast Routing Table Lookup Using CAMs", in Proceedings of Infocom '93, pp. 1382-1391, Mar. 1993.
|D. Shah et al., Fast Updating Algorithms for TCAMs, IEEE Micro, 21 (1): 36-47, Jan.-Feb., 2001.
|G. Huston, "Analyzing the Internet BGP Routing Table", The Internet Protocol Journal, 4, 2001.
|H. Liu, "Routing Table Compaction in Ternary CAM", IEEE Micro, 22(1):58-64, Jan.-Feb., 2002.
|J. P. Wade et al., "A Ternary Content Addressable Search Engine", IEEE Journal of Solid-State Circuits, 24(4):1003-1013, Aug. 1989.
|J. van Lunteren et al., "Multi-Field Packet Classification Using Ternary CAM", Electronics Letters, 38(1):21-23, 2002.
|M. Kobayashi, et al, "A Longest Prefix Match Search Engine For Multi-Gigabit IP Processing" in Proceedings of the International Conf. On Communications (ICC 2000), pp. 1360-1364, 2000.
|Panigrahy, Rina, Sharma, Samar "Reducing TCAM Power Consumption and Increasing Throughput" Proceedings of the 10<SUP>th </SUP>Symposium on High Performance Interconnects Hot Interconnects (Hotl'02) Publication date: Aug. 20, 2002.
|R. Mahajan et al., "Understanding BGP Misconfiguration" in Proceedings of SIGCOMM '02, Aug., 2002.
|U.S. Appl. No. 10/175,461, filed Jun. 19, 2002, Basu et al.
|U.S. Appl. No. 10/246,204, filed Sep. 18, 2002, Basu et al.
|V. Srinivasan et al., "Fast Address Lookups Using Controlled Prefix Expansion", ACM Transactions on Computer Systems, 17(1): 1-40, Feb. 1999.
|Zitiert von Patent
|12. Sept. 2006
|23. Dez. 2008
|Alcatel Lucent
|Method and system for character string searching
|17. Dez. 2004
|3. Febr. 2009
|Samsung Electronics Co., Ltd.
|Apparatus and method for searching trie trees using masks with non-symbol boundaries and flooding default routes in a massively parallel router
|18. März 2004
|7. Apr. 2009
|Intel Corporation
|Method and apparatus to support a large internet protocol forwarding information base
|28. Juli 2009
|Samsung Electronics Co., Ltd.
|Apparatus and method using vector table indirection to maintain forwarding tables in a router
|24. Aug. 2006
|30. März 2010
|Cisco Technology, Inc.
|Content addressable memory entry coding for error detection and correction
|6. Febr. 2007
|27. Apr. 2010
|Alcatel Lucent
|System and method of fast adaptive TCAM sorting for IP longest prefix matching
|14. Sept. 2010
|Juniper Networks, Inc.
|Methods and apparatus for range matching during packet classification based on a linked-node structure
|16. Nov. 2010
|Juniper Networks, Inc.
|Methods and apparatus for packet classification based on policy vectors
|7. Dez. 2010
|Oracle America, Inc.
|Multi-level packet classification
|15. Febr. 2011
|Juniper Networks, Inc.
|Methods and apparatus for packet classification based on multiple conditions
|30. Sept. 2008
|14. Juni 2011
|Juniper Networks, Inc.
|Methods and apparatus related to packet classification associated with a multi-stage switch
|3. Jan. 2012
|University Of Florida Research Foundation, Inc.
|Low power ternary content-addressable memory (TCAMs) for very large forwarding tables
|31. Dez. 2008
|7. Febr. 2012
|Juniper Networks, Inc.
|Methods and apparatus for packet classification based on multiple conditions
|2. Sept. 2010
|20. März 2012
|Juniper Networks, Inc.
|Methods and apparatus for range matching during packet classification based on a linked-node structure
|4. Sept. 2012
|Alcatel, Lucent
|System and method of fast adaptive TCAM sorting for IP longest prefix matching
|31. Dez. 2008
|16. Juli 2013
|Juniper Networks, Inc.
|Methods and apparatus for indexing set bit values in a long vector associated with a switch fabric
|4. Juni 2010
|29. Okt. 2013
|Juniper Networks, Inc.
|Methods and Apparatus Related to Packet Classification Based on Range Values
|29. Apr. 2011
|29. Okt. 2013
|Juniper Networks, Inc.
|Methods and apparatus related to packet classification associated with a multi-stage switch
|10. Juni 2010
|5. Nov. 2013
|Juniper Networks, Inc.
|Dynamic fabric plane allocation for power savings
|30. Sept. 2008
|18. März 2014
|Juniper Networks, Inc.
|Methods and apparatus for compression in packet classification
|4. Juni 2009
|1. Apr. 2014
|Cisco Technology, Inc.
|Dynamically right-sizing prefixes for network and application performance
|30. Sept. 2008
|5. Aug. 2014
|Juniper Networks, Inc.
|Methods and apparatus to implement except condition during data packet classification
|30. Sept. 2008
|12. Aug. 2014
|Juniper Networks, Inc.
|Methods and apparatus for producing a hash value based on a hash function
|12. Dez. 2011
|28. Okt. 2014
|Texas Instruments Incorporated
|Method and apparatus for packet switching
|8. Jan. 2009
|9. Dez. 2014
|Juniper Networks, Inc.
|Methods and apparatus for power management associated with a switch fabric
|28. Okt. 2009
|10. Febr. 2015
|Juniper Networks, Inc.
|Methods and apparatus related to a distributed switch fabric
|20. Dez. 2012
|1. März 2016
|Marvell Israel (M.I.S.L.) Ltd.
|Parser and modifier for processing network packets
|15. Dez. 2010
|8. März 2016
|Juniper Networks, Inc.
|Methods and apparatus for dynamic resource management within a distributed control plane of a switch
|26. Sept. 2012
|5. Apr. 2016
|Alcatel Lucent
|Securing software defined networks via flow deflection
|30. Jan. 2015
|31. Mai 2016
|Juniper Networks, Inc.
|Methods and apparatus related to a distributed switch fabric
|27. Nov. 2002
|30. Okt. 2003
|Yuichi Uzawa
|Data search system
|18. März 2004
|22. Sept. 2005
|Naik Uday R
|Method and apparatus to support a large internet protocol forwarding information base
|17. Dez. 2004
|20. Okt. 2005
|Samsung Electronics Co., Ltd.
|Apparatus and method for searching trie trees using masks with non-symbol boundaries and flooding default routes in a massively parallel router
|17. Dez. 2004
|1. Dez. 2005
|Samsung Electronics Co., Ltd.
|Apparatus and method using vector table indirection to maintain forwarding tables in a router
|20. Juli 2006
|24. Jan. 2008
|Sun Microsystems, Inc.
|Multi-level packet classification
|12. Sept. 2006
|13. März 2008
|Method and system for character string searching
|6. Febr. 2007
|7. Aug. 2008
|Alcatel Lucent
|System and method of fast adaptive TCAM sorting for IP longest prefix matching
|7. Dez. 2007
|11. Juni 2009
|University Of Florida Research Foundation, Inc.
|Low power ternary content-addressable memory (tcams) for very large forwarding tables
|30. Sept. 2008
|1. Apr. 2010
|Ramesh Panwar
|Methods and apparatus for packet classification based on policy vectors
|1. Apr. 2010
|Tyco Healthcare Group Lp
|Compression Device with Wear Area
|9. März 2010
|24. Juni 2010
|Alcatel Lucent
|System and method of fast adaptive tcam sorting for ip longest prefix matching
|4. Juni 2009
|9. Dez. 2010
|Pritam Shah
|Dynamically right-sizing prefixes for network and application performance
|28. Apr. 2011
|Gunes Aybay
|Methods and apparatus related to a distributed switch fabric
|9. Juni 2011
|Ramesh Panwar
|Methods and Apparatus Related to Packet Classification Based on Range Values
|18. Aug. 2011
|Juniper Networks, Inc.
|Methods and apparatus related to packet classification associated with a multi-stage switch
|26. Sept. 2012
|27. März 2014
|Krishna P. Puttaswamy Naga
|Securing software defined networks via flow deflection
|11. Okt. 2013
|22. Juni 2016
|Nec Corp
|Communication node, control device, communication system, packet processing method, and program
|22. März 2012
|27. Sept. 2012
|Texas Instruments Incorporated
|Method and apparatus for packet switching
|22. März 2012
|6. Dez. 2012
|Texas Instruments Incorporated
|Method and apparatus for packet switching
|370/392, 370/395.31, 370/428, 370/254, 370/389, 370/256, 370/429
|Internationale Klassifikation
|Europäische Klassifikation
|21. Nov. 2002
Owner name: LUCENT TECHNOLOGIES INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BASU, ANINDYA;NARLIKAR, GIRIJA J.;ZANE, FRANCIS X.;REEL/FRAME:013521/0107
Effective date: 20021120
|22. Sept. 2011
|Fee payment
Year of fee payment: 4
|21. Sept. 2015
|Fee payment
Year of fee payment: 8


text:
86 lives saved in DuPage County with heroin overdose drug naloxone | Senator Tom Cullerton highlights importance of improving naloxone access
Jul 21, 2016 4:53 PM - VILLA PARK, IL -- The DuPage Narcan Project recently announced that 86 lives have been saved in DuPage County by the heroin overdose drug naloxone since the beginning of the year. Tom Cullerton spoke on the importance of improving naloxone access. Cullerton sponsored the bipartisan Heroin Crisis Act (HB 1), which expands access to naloxone and overdose-response training programs. "As the Narcan Project numbers show, naloxone is critical in overdose emergencies to save lives. The Heroin Crisis Act is an important step in expanding access to this drug and helping combat Illinois' serious opioid epidemic," Tom Cullerton said. "In addition to expanding access to life-saving drugs, the bill lowers civil liabilities for administering naloxone in emergencies, allowing bystanders to help save a life without fear of legal trouble."


text:
SDCC: Marvel's "Doctor Strange" Combats "Death and Pain" in New Trailer
Comic Books, Film
Showing results 1-2 of 2
WonderCon in San Francisco was "Green Lantern" central Friday evening as DC Entertainment CCO Geoff Johns took to the stage with stars Ryan Reynolds & Blake Lively to show off new footage and discuss the upcoming feature film.
Following their appearance at Comic-Con International, the cast and crew of "Green Lantern" spoke with CBR News. They discussed their characters, director Martin Campbell and the GL uniform.
Archives: All | Comic Books | TV/Film | Video Games | Web Comics


text:
Ski & Board
GREAT DEALS and NEWS
Sign up for 2016-17 notifications
RMSP+ On Sale Now!
2016-17 Rocky Mountain Super Pass Plus!
RMSP+ On Sale Now!
2016-17 Rocky Mountain Super Pass Plus!
Equipment Storage
Storage: all day or all season.
Season Lockers
Season lockers let you store your stuff right at the base of the mountain to make skiing or boarding anytime you want easier. No equipment to lug to and from your car. Perfect for keeping extra clothing, sunscreen and other things you need handy when the weather changes.
The 12" wide by 18" deep lockers easily accommodate skis, poles, boots, jackets, snowboards and water bottles.
Basket Check
The Basket Check is located in the Indian Peaks Lodge. Perfect when you just need to leave your shoes, light clothing, a hat, sunscreen and other smaller items for the day. You can check and re-check your basket with our full-time attendant as many times as you'd like during the day. And it's only $10 per basket.


text:
What do we mean by "Strategy" and why is it important?
When it comes to planning any sort of strategy for your organisation, it's important to start at the beginning of the process by ensuring you know what a strategy is and why you need one. This is often a stumbling block as few people know what strategy really is. What is strategy? Strategy can often [...] more>