text:
University of Louisville sports update - Louisville - Scout
University of Louisville sports updateJody Demling10/03/2012Here's a look at some sports activities coming up at the University of Louisville, including basketball scrimmages and updated records of Olympic Sports. Cardinal Authority has all your coverage for U of L sports.MEN'S BASKETBALL UPDATES
Less than two weeks from the start of practice, the men's basketball program has several events on tap in the coming weeks. The tipoff luncheon is slated for Oct. 11 and the 1,400 seats have already been sold out. The event is held at noon in the Downtown Marriott's Grand .
The Cardinals will hold the first practice of the season on Oct. 12 and then hold a Red-White scrimmage on Oct. 13 at 4 p.m. in the KFC Yum! Center. Tickets are on sale for $10 and $5 at the U of L ticket offices. There will also be Red-White scrimmages on Oct. 24 at 4 p.m. and Oct. 27 at 2 p.m. Tickets are also on sale for both of those games. Big East media day will be held Oct. 17 and U of L's media day is Oct. 24. The first scrimmage is Nov. 1 against Pikeville at 7 o'clock.
Second-year coach Anne Kordes has the U of L volleyball team at 14-2 after beating South Florida and Pittsburgh on the road last weekend.
The Cardinals are ranked No. 17 and boast a school-record high of No. 4 in the NCAA's RPI. Only Penn State, Stanford and Nebraska are ranked higher. The Cards have six wins over top-50 teams in the RPI, including Purdue (No. 10), Kentucky (No. 17), Miami (No. 23), Western Kentucky (No. 31), Duke (No. 37) and Illinois (No. 43). U of L has three games this weekend at home. The Cardinals will play Seton Hall on Saturday at noon in Cardinal Arena before hosting Rutgers on Sunday at noon in the KFC Yum! Center. On Monday, the Cardinals host No. 15 RPI Texas at 7 in the Yum! Center. WOMEN'S SOCCER UPDATES
The Cardinals are now 7-3-2 on the season heading into a pair of home games this weekend. U of L tied South Florida 1-1 on Sunday.
U of L will host Villanova on Friday at 7 o'clock before hosting No. 11 Georgetown (11-1-1) on Sunday at 1 p.m. Both games are at Cardinal Park.
U of L has outscored opponents 27-12.
With a 5-4 record on the season, Louisville has a home game and a road game this week before finishing the season with four of six home games. The Cardinals will host DePaul on Wednesday night at 7 o'clock in Cardinal Park before traveling to Syracuse for a game on Saturday evening. U of L will then play Indiana at home on Oct. 10.
The U of L field hockey team will try to snap a two-game losing streak this weekend with a pair of home games in Trager Stadium.
After losing to Syracuse and Albany, the Cardinals will host Connecticut on Saturday at noon and Iowa on Sunday at 1 p.m.
The Cardinals baseball team has finished four weeks of fall workouts and had two scrimmages last weekend that coach Dan McDonnell called "by far the best baseball we played all fall."
Leading the way for the Cardinals offensively in the two scrimmages last weekend were junior infielder Ty Young, who had a home run and two doubles among four hits. Junior outfielder Adam Engel finished with five hits, five runs scored and four stolen bases.
U of L is scheduled for scrimmages on Thursday and Friay at 3 p.m.
Share on Facebook Share on TwitterTrending on Scout5 Takeaways - Bobby Petrino interviewTop U of L women's target to make pickJackson adapting to life in the spotlightLouisville ready for the 'big stage' againVideo: Yankees Fan Proposes, Loses RingLouisville ready for the 'big stage' again Full StoryCardinal Authority Top StoriesLouisville ready for the 'big stage' againThe University of Louisville football team will play on the 'big stage' for the second time in three weeks on Saturday night when the Cardinals face Clemson in Death Valley. U of L…by Jody DemlingCardinal AuthorityYesterday at 9:05 PMBreaking NewsU of L lands nations' No. 3 women's prospectUniversity of Louisville women's basketball coach Jeff Walz and his staff have landed another prized recruit - No. 3 2017 prospect Dana Evans. She is a point guard from Gary, Ind.by Jody DemlingCardinal AuthorityYesterday at 5:28 PMPitino on the road recruitingUniversity of Louisville basketball coach Rick Pitino is back on the road recruiting. Pitino is seeing three prospects in a 24-hour period in Nashville, Tenn., Houston and Phoenix.by Jody DemlingCardinal AuthorityYesterday at 11:36 AMJackson adapting to life in the spotlightUniversity of Louisville sophomore quarterback Lamar Jackson has accounted for 25 total touchdowns in four games, is the Heisman Trophy frontrunner and is adjusting to life in the…by Jody DemlingCardinal AuthorityMonday at 10:33 PMTop U of L women's target to make pickGary, Ind., West High School point guard Dana Evans will make a college decision on Tuesday night. Evans is one of the top 10 players in the country and will pick between…by Jody DemlingCardinal AuthorityMonday at 10:22 PMLouisville Football: Recruiting UpdateThe University of Louisville football program has 20 verbal commitments in the Class of 2017 and five in the Class of 2018. Here’s a look at how those prospects fared this weekend:by Jody DemlingCardinal AuthorityMonday at 9:43 PM'18 forward Kevin Easley to visit LouisvilleIndianapolis Lawrence North 2018 forward Kevin Easley will make an unofficial visit to Louisville on Oct. 12.by Jeff RabjohnsPeegs.comMonday at 1:19 PMInside the Matchup: Louisville vs ClemsonIt's a top 5 matchup from Death Valley.by Jonathan KahnScout CFBYesterday at 2:00 PMJoseph Scates Is Midwest Top 2018 WR ProspectWide receiver Joseph Scates has everything college coaches are looking for in a wide receiver, including size, speed and athleticism. He is the top ranked wideout in the Midwest.by Bill GreeneScout FootballYesterday at 7:35 AMVideo: Petrino, players preview ClemsonLouisville head coach Bobby Petrino, along with defensive tackle DeAngelo Brown and receiver Jaylen Smith visited with the media on Mondayby Michael McCammonCardinal AuthorityMonday at 11:38 AMTwo Schools Inch Ahead for Miguel EdwardsCOCONUT CREEK, Fla. --- Schools representing the Big 12 and ACC are sitting in a good place with 2018 three-star cornerback, Miguel Edwards.by Corey BenderScout FootballMonday at 11:37 AM5 Takeaways - Bobby Petrino interviewHere are 5 takeaways from the weekly news conference for Louisville football coach Bobby Petrino. The Cardinals are 4-0 and will play Clemson on Saturday night at 8 o'clock in…by Jody DemlingCardinal AuthorityMonday at 10:35 AMLoad More


text:
Amazon.co.uk: 3 Stars & Up - Italian or Russian / Biographies / Film: Books Amazon Try Prime Your Amazon.co.uk Today's Deals Gift Cards Sell Help Shop by Department Hello. Sign in Your Account Try Prime Basket Wish List Search Film Biographies Film Biographies All Departments Amazon Instant Video Apps & Games Baby Beauty Books Car & Motorbike CDs & Vinyl Classical Clothing Computers & Accessories Digital Music DIY & Tools DVD & Blu-ray Electronics & Photo Garden & Outdoors Gift Cards Grocery Health & Personal Care Jewellery Kindle Store Kitchen & Home Large Appliances Lighting LOVEFiLM by Post Luggage Musical Instruments & DJ PC & Video Games Pet Supplies Shoes & Bags Software Sports & Outdoors Stationery & Office Supplies Toys & Games VHS Watches Books
Sell Your Books 4 results for Books : Music, Stage & Screen : Film : Biographies : 3 Stars & Up : Italian or Russian
Format Hardcover (2) Paperback (2) Author James Kaplan (1) James Spada (1) Language Clear English (3,687) French (1) German (1) Spanish (2) Welsh (3) Italian Russian Delivery Option (What's this?) FREE Super Saver Delivery Avg. Customer Review Clear 4 Stars & Up& Up (3) 3 Stars & Up& Up 2 Stars & Up& Up (4) 1 Star & Up& Up (4) Price Under £5 (2) £5 - £10 (1) £10 - £20 (1) £ to £ International Shipping (What's this?) AmazonGlobal Eligible (1) Availability Include Out of Stock Unlimited One-Day Delivery and more Prime members enjoy unlimited One-Day Delivery and exclusive access to movies, TV shows and Kindle books. > Get Started There's a problem loading this menu at the moment. Learn more about Amazon Prime. Amazon Instant Video

type: global

value: This website is an American multinational technology company which focuses on e-commerce, cloud computing, digital streaming, and artificial intelligence.


text:
Zoo Junction - Wikipedia
Zoo Junction in 1977. The Northeast Corridor line is seen along the right side of the photo. The Schuylkill River is in the background and the Philadelphia Zoo is on the right.
Zoo Junction is an important junction on Amtrak's Northeast Corridor in Philadelphia, Pennsylvania where the Northeast Corridor meets the Keystone Corridor (ex-Pennsylvania Railroad main line).[1]
Zoo Junction is a flying junction, where multiple tracks cross one another by bridges to avoid conflict with other trains.[1]
In 1870 the Pennsylvania Railroad built the Connecting Railway from Frankford Junction to Zoo to bypass congested street running in Philadelphia.[2] Instead of reaching the city directly from the north, the Connecting Railway turned west, crossed the Schuylkill River on the Connecting Railway Bridge (a stone arch viaduct) and then turned south to join the PRR's Main Line at Mantua Junction. Mantua was a wye junction controlled by three manual signal boxes; there was also an engine house in the center of the wye.
By 1888 the Mantua Junction was at capacity. In 1910 the PRR built two duck-under tunnels to allow trains to reach the Connecting Railway without blocking the Main Line. In 1935 the interlocking reached its final form in conjunction with electrification and the construction of 30th Street Station and Suburban Station.
In the crescent shaped pocket between the junction and the river was the Philadelphia Zoo, which gave the interlocking its name. The former Zoological Garden station was located adjacent to the interlocking to serve visitors to the Zoo.
^ a b "Zoo tower". Signalbox.org. Retrieved 2015-11-24.
^ * Netzlof, Robert T. (2001-03-28). "Corporate Genealogy: The Connecting Railway". PRR Corporate History. Retrieved 2016-04-30.
Coordinates: 39°58′06″N 75°11′42″W / 39.9684°N 75.1951°W / 39.9684; -75.1951
Retrieved from "https://en.wikipedia.org/w/index.php?title=Zoo_Junction&oldid=743621653"

value: This website is the English-language edition of the free online encyclopedia Wikipedia. It was founded on 15 January 2001 as Wikipedia's first edition and, as of October 2021, has the most articles of any edition, at 6,412,521.


text:
Autogiro lands and takes off from Capitol plaza skip navigation
link: "//www.loc.gov/pictures/item/94507488/",
url :"//cdn.loc.gov/service/pnp/cph/3c10000/3c11000/3c11300/3c11347_150px.jpg",
http://hdl.loc.gov/loc.pnp/cph.3c11347
Autogiro lands and takes off from Capitol plaza
Title: Autogiro lands and takes off from Capitol plaza
Underwood & Underwood., Date Created/Published: 1931 July 9.
Autogiro airplane, piloted by James Ray, of the Autogiro Corporation of America, with Senator Hiram Bingham as a passenger, takes off from the east plaza of the Capitol.
Reproduction Number: LC-USZ62-111347 (b&w film copy neg.)
No. 75308 RU.
Autogiro Company of America--Products--1930-1940.
Autogiros--Washington (D.C.)--1930-1940.
Spectators--Washington (D.C.)--1930-1940.
http://www.loc.gov/pictures/item/94507488/

value: This website is the research library that officially serves the United States Congress and is the de facto national library of the United States. It is the oldest federal cultural institution in the United States.


text:
Amazon.co.uk: Advanced Search - Songs / Country: Digital Music Amazon Try Prime Your Amazon.co.uk Today's Deals Gift Cards Sell Help Shop by Department Hello. Sign in Your Account Try Prime Basket Wish List Search Country Country All Departments Amazon Instant Video Apps & Games Baby Beauty Books Car & Motorbike CDs & Vinyl Classical Clothing Computers & Accessories Digital Music DIY & Tools DVD & Blu-ray Electronics & Photo Garden & Outdoors Gift Cards Grocery Health & Personal Care Jewellery Kindle Store Kitchen & Home Large Appliances Lighting LOVEFiLM by Post Luggage Musical Instruments & DJ PC & Video Games Pet Supplies Shoes & Bags Software Sports & Outdoors Stationery & Office Supplies Toys & Games VHS Watches Digital Music
MP3 Basket You have exceeded the maximum number of items in your MP3 Basket. added to MP3 Basket #title# added to your music library #title# added to your music library #title# added to your music library Digital Music › Country › Songs › Advanced Search MP3 Songs
51-100 of 5,881 results for Previous Play all Next Play all samples MP3 Now Playing Paused Loading ...... Unavailable Loading ...... Volume slider Mute/Unmute To stream samples, javascript must be enabled.
Song Title Artist Album Time Download Play ?????????? ???? ????????? ??????????????, Vol. 2 4:06 In MP3 Basket Buy: £0.59 Play ????????????? ???? ????????? ?????????????????? 7:50 In MP3 Basket Buy: £0.59 Play ??????????? ?????? ?????? ???????????? 3:45 In MP3 Basket Buy: £0.59 Play ??????????????? ???? ???????????? ???????????????, Vol. 8 3:28 In MP3 Basket Buy: £0.59 Play ????????????? ??? ??????? ???????? ??????? 4:24 In MP3 Basket Buy: £0.59 Play ??????????????? ??? ??????? ???????? ??????? 2:07 In MP3 Basket Buy: £0.59 Play ???????? ??????? ????? ??????? ???????, Vol. 9 3:44 In MP3 Basket Buy: £0.59 Play ???????????????? ???? ????????? ??????????????, Vol. 3 3:47 In MP3 Basket Buy: £0.59 Play ???????? ???? ????????? ??????????????, Vol. 3 3:13 In MP3 Basket Buy: £0.59 Play ???????????? ??????? ????????? ???????????????? 3:08 In MP3 Basket Buy: £0.59 Play ??????????? ??????? ????? ??????? ???????, Vol. 9 3:22 In MP3 Basket Buy: £0.59 Play ?????????????? ??????? ????? ??????? ???????, Vol. 9 3:14 In MP3 Basket Buy: £0.59 Play ??????????? ???? ????????? ??????????????, Vol. 3 2:41 In MP3 Basket Buy: £0.59 Play ?????????? ??????? ?????????? ?????????????? ?????????????? 2:31 In MP3 Basket Buy: £0.59 Play ???????????? ???? ????????? ??????????????, Vol. 2 3:26 In MP3 Basket Buy: £0.59 Play ????????????????? ???? ???????????? ???????????????, Vol. 8 3:14 In MP3 Basket Buy: £0.59 Play ????????? ??????? ????????? ?????????????? ?????????? 3:31 In MP3 Basket Buy: £0.59 Play ?????????? ??????? ????????? ???????????? 4:29 In MP3 Basket Buy: £0.59 Play ?????? ???? ????????? ??????????????, Vol. 3 3:34 In MP3 Basket Buy: £0.59 Play ???????????????? ????? ??????? ???????????? 4:00 In MP3 Basket Buy: £0.59 Play ???????????????? ???? ????????? ??????????????, Vol. 2 3:30 In MP3 Basket Buy: £0.59 Play ?????????????????? ??????? ????????? ?????????????? ?????????? 4:12 In MP3 Basket Buy: £0.59 Play ??????????????? ???? ????????? ??????????????, Vol. 3 3:25 In MP3 Basket Buy: £0.59 Play ???????????????? ?????? ?????? ???????????? 3:49 In MP3 Basket Buy: £0.59 Play ??????????????? ??????? ????? ??????? ???????, Vol. 4 2:46 In MP3 Basket Buy: £0.59 Play ????????????? ??????? ?????????? ?????????????? ?????????????? 3:46 In MP3 Basket Buy: £0.59 Play ??? - ????? ?????? ?????? ?????????????????? 3:53 In MP3 Basket Buy: £0.59 Play ????????????????? ??????? ????? ??????? ???????, Vol. 9 3:22 In MP3 Basket Buy: £0.59 Play ???????????? ?????? ?????? ???????????? 3:34 In MP3 Basket Buy: £0.59 Play ???????????????????? ??????? ????? ??????? ???????, Vol. 9 3:42 In MP3 Basket Buy: £0.59 Play ???????????? ???? ????????? ??????????????, Vol. 2 3:40 In MP3 Basket Buy: £0.59 Play ???????? ?????????? ??????? ???????????? 3:18 In MP3 Basket Buy: £0.59 Play ?????????? ??????? ????? ??????? ???????, Vol. 9 3:36 In MP3 Basket Buy: £0.59 Play ?????????? ???? ?????? ???????????? 3:19 In MP3 Basket Buy: £0.59 Play ?????????? ????????? ?????????? ?????????????????? 3:35 In MP3 Basket Buy: £0.59 Play ???? ??????????? ???????? ??????? ???????????????? 2:57 In MP3 Basket Buy: £0.59 Play ?????????????????? ??????? ????? ??????? ???????, Vol. 10 3:23 In MP3 Basket Buy: £0.99 Play ?????????????????? ??????? ????? ??????? ???????, Vol. 9 3:24 In MP3 Basket Buy: £0.59 Play ?????????? ??????? ????? ??????? ???????, Vol. 4 4:26 In MP3 Basket Buy: £0.59 Play ???????????? ???? ????????? ??????????????, Vol. 3 3:41 In MP3 Basket Buy: £0.59 Play ??????????????? ??????? ????? ??????? ???????, Vol. 10 3:27 In MP3 Basket Buy: £0.59 Play ????????????? ?????? ????????? ?????????????? ????????????? 3:56 In MP3 Basket Buy: £0.59 Play ?????????????????? ???? ???????? ?????? ?????????, Vol. 3 4:05 In MP3 Basket Buy: £0.59 Play ?????????????? ??????? ????? ??????? ???????, Vol. 12 2:21 In MP3 Basket Buy: £0.59 Play ???????????????????? ??????? ????????? ???????????? 3:31 In MP3 Basket Buy: £0.59 Play ???????????? ???? ????????? ??????????????, Vol. 3 3:13 In MP3 Basket Buy: £0.59 Play ????????? ???? ?????? ???????????? 3:34 In MP3 Basket Buy: £0.59 Play ???????? ??????? ????? ??????? ???????, Vol. 12 4:25 In MP3 Basket Buy: £0.59 Play ????????????? ???? ????????? ??????????????, Vol. 3 3:30 In MP3 Basket Buy: £0.59 Play ?????? ?.?. ?????? ????????? ?????????????? ????????????? 3:08 In MP3 Basket Buy: £0.59 Previous Page 1 2 3 ... 118 Next Page Search powered by Show results for
Category Any Category Songs New Releases Last 30 days (5,881) Last 90 days (5,881) Digital Music Country Refine by
Genres Alt-Country & Americana (261) Bluegrass (79) Contemporary Country (12) Outlaw & Progressive Country (25) Traditional Country (502) Artist Nashville Cast (5) Carrie Underwood (22) Toby Keith (83) Brad Paisley (120) Bobby Bare (12) Big Joe Williams (1) Buddy Guy (1) + See more Price £0.70 to £0.79 (903) £0.80 and Above (4,212) £ to £ Unlimited One-Day Delivery and more Prime members enjoy unlimited One-Day Delivery and exclusive access to movies, TV shows and Kindle books. > Get Started There's a problem loading this menu at the moment. Learn more about Amazon Prime. Amazon Instant Video


text:
Words that end in etropharyngeal | Words ending in etropharyngeal
Words that end in etropharyngeal | Words ending in etropharyngeal http://www.thefreedictionary.com/words-that-end-in-etropharyngealPrinter Friendly
9,429,229,616 visitors served
Words that end in etropharyngeal
Found 1 words that end in etropharyngeal. Browse our Scrabble Word Finder, Words With Friends cheat dictionary, and WordHub word solver to find words that end with etropharyngeal. Or use our Unscramble word solver to find your best possible play! Related: Words containing etropharyngeal
15-letter words that end in etropharyngealSee also15-letter words that end in etropharyngealretropharyngealSee also:Words with all vowelsWords that start with vWords that end in iWords that start with kWords that start with bWords that start with m

value: This website is an American online dictionary and encyclopedia that aggregates information from various sources.


text:
BEAR GRILLZ - HOUSTON Tickets, Fri, Nov 17, 2017 at 9:00 PM | Eventbrite
Share BEAR GRILLZ - HOUSTON
Have questions about BEAR GRILLZ - HOUSTON? Contact Disco Donnie Presents and NightCulture

value: This website is an American event management and ticketing website. The service allows users to browse, create, and promote local events.


text:
$10 Off & Free Shipping Code - Online & In-Store
Find exclusive Charming Charlie deals at Groupon! Enter this promo code at checkout when shopping online to get $10 off your order of $60 or more, plus get free shipping! To shop in store just print out the coupon and present it when checking out. Some restrictions may apply. 1. Copy this promo code: GR61710 to use online. 2. or Tap "Use Coupon" button below to view In-Store Coupon and follow directions on coupon to use in-store.
1. Copy this promo code: GR61710 to use online. 2. or Tap "Use Coupon" button below to view In-Store Coupon and follow directions on coupon to use in-store. Merchant is solely responsible to purchasers for the care and quality of the advertised goods and services.

value: This website is an American global e-commerce marketplace connecting subscribers with local merchants by offering activities, travel, goods and services in 15 countries. Based in Chicago, Groupon was launched there in November 2008, launching soon after in Boston, New York City and Toronto.


text:
After the crackdown, the number of performers who left the Philippines to work overseas dropped to 4,050 in 2006, from 43,818 in 2004. The figure now hovers around 1,500 to 2,000 a year, government statistics show, with Japan remaining the top destination, followed by Malaysia, South Korea and China.“We only allow musicians and entertainers to work in legitimate establishments such as cruise ships and major hotels,” said Yolanda E. Paragua, a senior official with the Philippine Overseas Employment Administration. “Not in honky-tonk type places.”The musicians are among the millions of people from the Philippines who work overseas and help power the country’s economy with remittances. And the Philippine economy is indeed thriving: in 2012, gross domestic product grew 6.6 percent, surpassing the government’s forecast for growth of 5 percent to 6 percent, data released Thursday showed. The country had the second-highest growth rate in the world in 2012, after China, according to Reuters.Government expenditure in the Philippines jumped nearly 12 percent in 2012, while private spending, which was bolstered by remittances from abroad, was up 6.1 percent, Reuters reported.In the past, the Philippine Overseas Employment Administration held auditions to verify the legitimacy of musicians seeking to work overseas, said Celso J. Hernandez, the head of the agency’s operations and surveillance division.After the Japanese crackdown, however, the Philippine government discontinued the practice. These days, the government relies on vetting by licensed recruitment agencies, although it still examines the musicians’ paperwork.The Philippines has a rich music scene, with bands playing hard rock, reggae, jazz, blues and nearly every other form of music each night in numerous clubs around the country. Musicians in the country, as elsewhere, often dream of writing their own works, signing a deal with a major recording label and achieving fame and fortune. But many of those who do not succeed on that path can still find regular work overseas.Domingo Mercado Jr., who goes by the stage name Jojo, wrote and performed original music when he left high school, as part of a nine-piece band called Music and Imagination. Some of his friends have had a taste of fame, but he went in another direction.
“I resigned from the band and took a job in Korea,” said Mr. Mercado, 45. “I gave up on my dream.”Mr. Mercado has performed across Asia as a singer and guitarist since 1994. He recently returned from a six-month job on a cruise ship.
Although singers and musicians from the Philippines can be found performing in many hotel lounges around Asia, the field is actually quite specialized and highly competitive. “A hotel might need many waiters, cooks and housekeepers,” Mr. Hernandez of the overseas employment agency said. “But they only need one or two musicians.”According to the employment agency, about 1.6 million people left the Philippines in 2011 to work overseas. About 369,000 of them went to work on ships, with the remainder employed in a range of fields, including as nurses, waiters, welders, plumbers and caregivers.But the sector that draws the most people from the Philippines overseas is, by far, household services. In 2011, 142,486 people left the country to work as domestic helpers. Nurses made up the second-largest group, at 17,198.The Middle East draws the largest number of workers from the Philippines, with Saudi Arabia and the United Arab Emirates as the top two destinations. But there is no guarantee of what awaits employees at any destination. “We experience a lot of problems with domestic workers going overseas, particularly to the Middle East,” Mrs. Paragua said. “They are vulnerable to exploitation.”The Philippine government began helping workers go abroad as a stopgap measure to address high unemployment in the 1970s. Today, it continues to say that the phenomenon is a temporary one. “We are not promoting overseas employment. We are managing it,” Mrs. Paragua said. “It would be best if workers could just stay here and earn a good salary.”The robust growth in the Philippines last year has not translated into significant job growth, according to government figures released Thursday. Unemployment was at 6.8 percent in October, up from 6.4 percent a year earlier, and the number of unemployed in the country rose to 2.76 million from 2.64 million.A person with a relatively basic education who comes from a rural area in the Philippines can earn the equivalent of about $400 a month, plus room and board, working overseas as a domestic helper. That amounts to a comfortable income in the Philippines that could put several children through private schooling in a rural part of the country.
Musicians, meanwhile, can make as much as $2,000 a month working in five-star hotels, or $800 to $1,500 a month working on a cruise ship, according to performers and government officials. But they are also vulnerable to exploitation, Mrs. Paragua said, and some earn $400 per month.The money sent home by overseas workers is an important driver of economic growth in the Philippines. According to a report released by the central bank on Dec. 17, remittances from overseas reached $17.5 billion between January and October of 2012, up 5.8 percent from the year-earlier period.The movement of workers from the Philippines is not driven merely by unemployment in the country, however, and thus by a large supply of applicants. “There is a strong demand for Filipino workers,” Mrs. Paragua said. Employees from the country generally have a good command of English and a comparatively high level of education, and they have a reputation for maintaining good work relationships with their employers.Musicians from the Philippines are also in demand, said Maria Victoria Kinpanar, a booking agent. But she noted that the improved economy in the Philippines had created some lucrative options for musicians who wanted to stay or return home.“Overseas work is short-term contract work. It’s not stable,” Ms. Kinpanar said. “Some high-quality musicians are now able to find long-term work here in the Philippines.”Indeed, after spending 30 years working across Asia, Mr. Acaylar now has a regular job playing the piano in the lounge of the Hyatt Hotel & Casino in Manila. But he is still uncomfortable with the suggestion that he is a traveling lounge musician.“I don’t categorize myself as a lounge singer or lobby pianist,” he said. “That requires formal training. I just play the piano and sing songs.”

value: This website is an American daily newspaper based in New York City with a worldwide readership. Founded in 1851, the Times has since won 132 Pulitzer Prizes, the most of any newspaper, and has long been regarded within the industry as a national "newspaper of record".


text:
What Can We Expect from BYU Football in 2003? - Byu - Scout
What Can We Expect from BYU Football in 2003?Lee Tanner08/24/2003Part 1 of 2

I cannot hesitate any longer. As a BYU fan of nearly 45 years and season ticket holder for 10 years, I have some objective views of BYU football. Yeah, right!When it comes to BYU sports, it's difficult for me to be totally objective. Anytime a sports reporter, or any writer for that matter, says he or she can is totally objective about anything, they really aren't. Everyone has an opinion that is molded by perception, experience or bias – whether they admit it or not.
So here goes. Here is what one "objective" observer projects for BYU football in 2003.
BYU wins every game this year 75-0 and beats the Miami Hurricanes in the BCS national championship game. OK, I'll get serious. Out-of-conference games first. The early betting line has BYU by three over Georgia Tech. Some are saying BYU fans should jump all over that in a flash; that the Cougars are a lock to make the spread. I agree with that.
Georgia Tech main strength is its offensive line that has a ton more experience, though this writer believes BYU's has more talent. The Cougars are a relatively young line and may have as many as three freshmen starters by the end of the season – Eddie Keele, Jake Kuresa and Ofa Mohetau. They have molded and melded together as a unit much earlier that normal. BYU's starting quarterback Matt Berry has six games of experience as a starter, a full spring, summer-long off-season workout with other starters and the confidence and support of his players.
On the defensive side, BYU has a great defensive scheme installed by defensive coordinator Bronco Mendenhall. If Georgia Tech goes with true freshman Reggie Ball, the Cougar defense will be all over him. There is no way that Tech coach, Chan Gailey, can get a true freshman ready for the BYU/Mendenhall defense.
BYU 23 - Georgia Tech 17.
BYU at USC: Short and simple. BYU loses this game by 13, at the least.
Stanford at BYU: This is an easy one to pick. The Cardinal return eight starters on defense and only three on offense, and two of them are quarterbacks. More than 45 Cardinal players are either true freshmen or redshirt freshman. BYU 27 - Stanford 10.
Boise State at BYU: These two teams are tied for 35th place ranking in the preseason ESPN/USA Today Coaches Poll – along with Fresno State, Boston College and Minnesota. Boise State has recently emerged as a WAC powerhouse and has been Utah's nemesis in recent years.
I'm concerned this will be an emotional letdown game for BYU. I know, I'm on an island on this one…
BSU 27 - BYU 25. BYU at Notre Dame: Will second-year coach Tyrone Willingham experience have the same second year slump that hit BYU's Gary Crowton? Not likely. Willingham will have eight starters returning from the nation's 13th ranked defense and five starters returning on offensive.
One of those starters is QB Carlyle Holiday. It will be his second year as a starter. He is on the Davey O'Brien Award watch list. Ryan Grant rushed for 1,085 yards as a sophomore. He was only the seventh Notre Dame player to rush for more than 1,000 yards in a season.
Notre Dame 23 - BYU 19.
Part 2: BYU vs. MWC Opponents
(c) copyright by TotalBlueSports.com Share on Facebook Share on TwitterTrending on ScoutKendall Milton Talks First Offer ImportanceWho are Highest Paid Coaches in NCAA FootballChaz Ah You Has BYU Near Top of His ListWhen good rumors go badDaily Dr. Roto: Thursday Night PreviewChaz Ah You Has BYU Near Top of His List Full StoryTotal Blue Sports Top StoriesKendall Milton Talks First Offer ImportanceFirst offer to collegiate football prospects make impressions that can last a long time and pay dividends. Clovis, CA athlete Kendall Milton received an offer from BYU as an eighth…by Kacey RobbinsTotal Blue SportsYesterday at 5:11 PMChaz Ah You Has BYU Near Top of His ListThe number one safety in the state of Utah, Chaz Ah You, with multiple PAC-12 offers from Stanford, UCLA, Utah, Oregon, and Washington, along with others from Wisconsin, Virginia,…by Talo StevesTotal Blue SportsTuesday at 5:58 PMKeenan Ellis Breaks Down His BYU CommitmentBYU recently received a commitment from Bonita Vista High School (CA) wide receiver Keenan Ellis. Ellis is a versatile athlete, who also runs track, and can play either wide…by Talo StevesTotal Blue SportsMonday at 11:20 AMNew Head Coaches Mid-Season ReportThere were a lot of college football head coaching changes before this season. Let's take a look at how a few have fared so far this season.by Jonathan KahnScout10/19/2016Ty Detmer Talks BYU's OffenseBYU offensive coordinator Ty Detmer talked to the media on Wednesday morning about his offense's outburst in their shootout win over the Toledo Rockets. He also talked about their…by Talo StevesTotal Blue Sports10/05/2016Tanner Jacobson Happy to be a CougarBYU defensive back Tanner Jacobson has a last name that's familiar to BYU football fans thanks to his older brother McKay Jacobson. He talked one-on-one with Jake Hatch about his…by Jake HatchTotal Blue Sports10/04/2016Jaren Kump Reaffirms BYU CommitmentHerriman (UT) offensive lineman Jaren Kump committed to BYU early in the recruiting process stating that BYU was his dream school. However, he was recently offered by Utah, which…by Talo StevesTotal Blue Sports2:29 PMBYU Commit Reacts to Pac-12 OfferRecruiting interest has ramped up for 2018 defensive end Cameron Latu after he made an early decision to commit to BYU this past summer...by Blair AnguloScout FootballYesterday at 10:55 AMHighly Coveted DT Impressed With MichiganThe No. 1-rated defensive tackle in the West region took his first official visit over the weekend and appears to have returned home with a new leader...by Blair AnguloScout FootballSunday at 3:10 PMTBS Flash Sale Today OnlyBYU heads on the road for a date with Boise State tonight in Albertson's Stadium in Boise, ID. In anticipation of the rivalry game, Scout and Total Blue Sports are running a one…by Jake HatchTotal Blue Sports10/20/2016Watson Back On The Market, Planning StopsAfter backing off a commitment to Washington State, three-star defensive back Charles "Moku" Watson has been sorting through his options and looking into visits...by Blair AnguloScout Football10/19/2016J.L. Lavea thankful for first offer from BYUThere are a lot of firsts going on for Orem High School middle linebacker J.L. Lavea, who is a long ways from home. In his first year of playing high school football, he received…by Talo StevesTotal Blue Sports10/19/2016Load More

value: This website is an integrated sports publishing company that produces Internet content covering hundreds of professional and college teams across America. The company was founded in 2001 and was acquired by Fox Sports in 2005.


text:
Bloomberg Wins Asia Risk 2013 Technology Vendor of the Year | Bloomberg L.P.
Bloomberg Wins Asia Risk 2013 Technology Vendor of the Year
October 17, 2013	Asia Risk, the region’s go to source for news and analysis on financial risk management, has named Bloomberg the 2013 Technology Vendor of the Year for our development of the ASEAN Bond Portal. This is testament to the rising influence and importance of ASEAN and the significance of the platform in opening up the region’s bond markets to regional and global investors.
By any number of macro-economic measures Southeast Asia or ASEAN is on the fast track. ASEAN regulators have developed a “road map” for integration of the region’s capital markets by 2015 – with the aim of providing new sources of cross-border investment. Bonds will be increasingly important in that mix.
A key part of the ASEAN road to financial integration is ensuring greater openness, transparency and liquidity in capital markets. While investor interest in the ASEAN bond market has been growing, accessing cross-border bond prices and availability has remained challenging. We saw an opportunity to address this and make a difference to the ASEAN bond market by developing the Bloomberg ASEAN Bond Portal this year. We were not alone in tackling this – our portal is based on collaboration with leading banks in each of the five key ASEAN nations – Bank Negara Indonesia (BNI), Maybank in Malaysia, Security Bank of the Philippines, Kasikorn Bank of Thailand and Oversea-Chinese Banking Corporation in Singapore. The value of outstanding local currency bonds in these five countries, plus Vietnam, is over $1.1 trillion.
For the first time, our ASEAN Bond Portal now aggregates bond prices across Southeast Asia on a single, online platform, injecting transparency into the marketplace.
Prices are distributed through the Bloomberg Professional service, making it possible for regional banks and sell-side firms to generate trade ideas and find out which markets they should be investing in. They can carry out name and price discovery, communicate by chat with their chosen partner bank and negotiate the trade through a single, online platform. And this is just the beginning. If, as I believe is inevitable, this new platform plays into regional bond trading then it will be a strong spur for ASEAN’s growth path and eventual capital markets integration.
For more information on the ASEAN bond portal visit http://www.bloomberg.com/professional/markets/fixed-income/ or go to ASEAN<go> on the Bloomberg Professional service.
Contributed by Nitin Jaiswal, Head of Sales for ASEAN and South Asia, Bloomberg More Posts

value: This website is an international news agency headquartered in New York City and a division of Bloomberg L.P. Content produced by Bloomberg News is disseminated through Bloomberg Terminals, Bloomberg Television, Bloomberg Radio, Bloomberg Businessweek, Bloomberg Markets, Bloomberg.com, and Bloomberg's mobile platforms. Since 2015, John Micklethwait has served as editor-in-chief.


text:
Chinese Restaurants Near Usf, San Francisco | eBay Please enable JavaScript Our new search experience requires JavaScript to be enabled. Please enable JavaScript on your browser, then try again.
Skip to main contenteBayShop by categoryEnter your search keywordAll CategoriesAntiquesArtBabyBooksBusiness & IndustrialCameras & PhotoCell Phones & AccessoriesClothing, Shoes & AccessoriesCoins & Paper MoneyCollectiblesComputers/Tablets & NetworkingConsumer ElectronicsCraftsDolls & BearsDVDs & MovieseBay MotorsEntertainment MemorabiliaGift Cards & CouponsHealth & BeautyHome & GardenJewelry & WatchesMusicMusical Instruments & GearPet SuppliesPottery & GlassReal EstateSpecialty ServicesSporting GoodsSports Mem, Cards & Fan ShopStampsTickets & ExperiencesToys & HobbiesTravelVideo Games & ConsolesEverything ElseAdvanced or register':' style="margin-right:3px">Hi -User-!'.replace(/-User-/,escape(a)))+"")}catch(b){document.write("")}})();Hi (Sign in to bid or buy)Daily DealsGift CardsSellHelp & ContactMy eBayExpand My eBaySummaryBids/OffersWatch listWish listAll listsPurchase historySellingMy CollectionsFollowed searchesMessagesNotification Refine your search for Chinese Restaurants Near Usf, San Francisco
results for Chinese Restaurants Near Usf, San Francisco
Follow Chinese Restaurants Near Usf, San Francisco to get e-mail alerts and updates on your eBay Feed.
Unfollow Chinese Restaurants Near Usf, San Francisco to stop getting updates on your eBay Feed.
Yay! You're now following Chinese Restaurants Near Usf, San Francisco in your eBay Feed.You will receive email alerts for new listings. Dont send me e-mail alerts.
Chinese Restaurants Near Usf, San Francisco: Items in search results
More items related to Chinese Restaurants Near Usf, San Francisco
The Golden Pavilion Chinese Restaurants San Francisco California CA Postcard
USED (LN) Recipes from San Francisco's great Chinese restaurants by Jinx Morgan

value: This website is an American multinational e-commerce corporation based in San Jose, California, that facilitates consumer-to-consumer and business-to-consumer sales through its website.


text:
Words containing droxycinchoni | Words that contain droxycinchoni
Words containing droxycinchoni | Words that contain droxycinchoni http://www.thefreedictionary.com/words-containing-droxycinchoniPrinter Friendly
9,756,970,526 visitors served
Words containing droxycinchoni
Found 1 words containing droxycinchoni. Browse our Scrabble Word Finder, Words With Friends cheat dictionary, and WordHub word solver to find words that contain droxycinchoni. Or use our Unscramble word solver to find your best possible play!
17 letter words containing droxycinchoniSee also17 letter words containing droxycinchonihydroxycinchonineSee also:2-letter words with ZWords with the letter xWords that end in qWords that start with jWords that start with uWords that start with sWords containing droxycincWords containing droxycincho


text:
2005 2009 FORD MUSTANG FACTORY 5 SPEED SHIFTER ASSEMBLY ORIGINAL KNOB | eBay Please enable JavaScript Our new search experience requires JavaScript to be enabled. Please enable JavaScript on your browser, then try again.
View: Gallery view 2005 2009 FORD MUSTANG FACTORY 5 SPEED SHIFTER AS...: 2005 2009 FORD MUSTANG FACTORY 5 SPEED SHIFTER ASSEMBLY ORIGINAL KNOB0 results. You may also like
OEM 2005-2010 Ford Mustang GT manual 5 speed shifter assembly with Shifting knob
2010 - 2013 FORD MUSTANG FACTORY 6 SPEED OEM ORIGINAL SHIFTER KNOB AR3Z-7213-AA
Roush Performance 401584 5-Speed Shifter Knob 2005-10 Ford Mustang
Ford Mustang Mercury Cougar VINTAGE 4 SPEED HURST SHIFTER WOOD GRAIN KNOB
NEW OEM 2009 2010 MUSTANG 5 SPEED SHIFTER KNOB
Roush Performance 401585 5-Speed Shifter Knob 2005-10 Ford Mustang
Roush Performance 401427 5-Speed Shifter Knob 2005-10 Ford Mustang
2005 Ford Mustang 5 Speed Shifter
94 95 96 97 98 Ford Mustang Genuine OEM 5 Speed Manual Shifter Knob Black $26.24
2005-2010 Ford Mustang ROUSH White 5 Speed Shift Knob w/ Boot Retainer 401584
83-04 Mustang Ford Racing 03-04 Cobra Style Leather Shift Knob 5 Speed Pattern $68.49
1999-2004 Ford Mustang 5 Speed Leather Shifter Knob Ball New OEM $51.29
Manual Trans Shifter Assembly-Mustang Shifter Hurst fits 11-12 Ford Mustang
Part# 3910204
FORD MUSTANG HURST MANUAL SHORT SHIFTER 4.6 V8 2005 - 2009 OEM
1965 1966 1967 1968 Mustang Fstbck Cpe Conv Cougar ORIG 3 SPEED M/T SHIFTER KNOB
Vintage Bakelite 1965 66 67 Ford Mustang Three 3 Speed Shifter Gear Shift Knob $19.99
NOS 1983 - 1993 FORD MUSTANG SALEEN STYLE 5 SPEED SHIFTER KNOB ASSEMBLY VINTAGE
Competition Plus(R) Manual Trans Shifter Assembly fits 2005-2010 Ford Mustang H
3 Speed Shifter Knob 1965 1966 1967 Ford Mustang Coupe/Convertible/Fastback 67
2005-2010 Ford Mustang V6 & GT Short Throw Black 5 Speed Shift Knob


text: Master Your Metabolism: The 3 Diet Secrets to Naturally Balancing Your Hormones for a Hot and Healthy Body! by Jillian Michaels, Mariska van Aalst | | NOOK Book (eBook) | Barnes & Noble®

value: This website is an American bookseller. It is a Fortune 1000 company and the bookseller with the largest number of retail outlets in the United States.


text:
danster10 on Scribd
Featured by danster10x1z131 pagesReport this userHelp us keep Scribd spam free.Thank you for reporting this user.Block this userChoose who you interact with on Scribd.Unblock this user
danster10Uploads1Readcasts0Reads228Followers0Following0Recent ActivityLOAD MOREENDRecent ActivityAboutAbout ScribdTeamBlogJoin our team!Contact UsPremiumPremium ReaderScribd StoreAdvertise with usGet startedAdChoicesSupportHelpFAQPressPartnersDevelopers / APILegalTermsPrivacyCopyright© Copyright 2013 Scribd Inc.Language:Choose the language in which you want to experience Scribd:English中文EspañolالعربيةPortuguês日本語DeutschFrançaisTurkceРусский языкTiếng việtJęzyk polskiBahasa indonesiaUse your Facebook login and see what your friends are reading and sharing.Other login optionsLogin with FacebookSign up without Facebookemail address (required)create username (required)password (required)

value: This website is an American e-book and audiobook subscription service that includes one million titles.


text:
Loving Jesus Audiobook | Audible.com
SAMPLE PLAY AUDIO SAMPLE http%3A%2F%2Fsamples.audible.com%2Fbk%2Freco%2F007543%2Fbk_reco_007543_sample.mp3+flashcontentRATYQ3RRGZ44G3QFQNDY0
Length: 3 hrs and 10 mins Unabridged Audiobook Release Date:02-04-14 Publisher:
Sheila K Reno says:
Overall(73)Performance(57)Story(60)
"Do yourself a favor. This writing is for everyone"
Awarded the Nobel Peace Prize in 1979, Mother Teresa humbly accepted it on behalf of the poorest of the poor to whom she joyfully dedicated her life. Truly a saint for the 20th century, she taught compassion not only for the sick and destitute, but also for the lonely, neglected, and unappreciated who surround us every day. Among Mother Teresa’s concerns were those that plague modern Christians everywhere: abortion, child abuse and neglect, the lack of love in modern family life, and AIDS, which she called “the leprosy of the West.” She gave strength and inspiration to her Missionaries of Charity, and through them her joyful commitment to Christ continues on. The dual narration by Ruth Ann Phimister and George Guidall, as fervent as a prayer, inspires listeners with Mother Teresa’s simple yet profound message about the value and meaning of life. This diminutive, self-effacing nun’s call to love is a bright beacon of hope in an increasingly self-centered world. ©1991 José Luis González-Balado and Missionaries of Charity (P)2001 Recorded Books

value: This website is an American online audiobook and podcast service that allows users to purchase and stream audiobooks and other forms of spoken word content. This content can be purchased individually or under a subscription model where the user receives "credits" that can be redeemed for content monthly and receive access to a curated on-demand library of content.


text:
Patent US7835393 - System and method for converting multichannel time division multiplexed data ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA system and method are provided for converting multichannel serial data streams into packets. The method accepts a plurality of serial data streams in a corresponding plurality of channels. In a time domain multiplexed (TDM) fashion, groups with an undetermined number of data bits are packed from each...http://www.google.com/patents/US7835393?utm_source=gb-gplus-sharePatent US7835393 - System and method for converting multichannel time division multiplexed data into packetsAdvanced Patent SearchPublication numberUS7835393 B2Publication typeGrantApplication numberUS 12/015,130Publication dateNov 16, 2010Filing dateJan 16, 2008Priority dateJan 16, 2008Fee statusPaidAlso published asUS8571062, US20090180494Publication number015130, 12015130, US 7835393 B2, US 7835393B2, US-B2-7835393, US7835393 B2, US7835393B2InventorsXingen (James) Ren, Ravi SubrahmanyanOriginal AssigneeApplied Micro Circuits CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (8), Referenced by (2), Classifications (6), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetSystem and method for converting multichannel time division multiplexed data into packets
US 7835393 B2Abstract
A system and method are provided for converting multichannel serial data streams into packets. The method accepts a plurality of serial data streams in a corresponding plurality of channels. In a time domain multiplexed (TDM) fashion, groups with an undetermined number of data bits are packed from each data stream, into an associated channel segment queue, where each segment includes a predetermined number of bits. In a TDM fashion, segments are loaded into an associated channel payload queue, where each payload includes a predetermined number of segments. Once a payload is filled, an associated pointer is created in a pointer queue. The method selects a pointer from the pointer queue, creates a packet from the payload associated with the selected pointer, and transmits the packet via a packet interface. The packet overhead may include information stored in the pointer, a packet header, or a cyclic redundancy check (CRC) checksum.
1. In a data communication interface, a method for converting multichannel serial data streams into packets, the method comprising:
accepting a plurality of serial data streams in a corresponding plurality of channels;
in a time domain multiplexed (TDM) fashion, packing groups with an undetermined number of data bits, from each data stream, into an associated channel segment queue, where each segment includes a predetermined number of bits;
in a TDM fashion, loading segments into an associated channel payload queue, where each payload includes a predetermined number of segments;
in response to filling a payload, creating an associated pointer in a pointer queue;
selecting a pointer from the pointer queue;
using the payload associated with the selected pointer, creating a packet; and,
transmitting the packet via a packet interface.
2. The method of claim 1 wherein creating the packet includes creating packet overhead with information selected from a group consisting of information stored in the pointer, a packet header, and a cyclic redundancy check (CRC) checksum.
3. The method of claim 1 wherein accepting the plurality of serial data streams includes:
accepting a Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) frame; and,
demapping the frame into a plurality of TDM data steams.
4. The method of claim 3 wherein demapping the frame into the plurality of TDM data streams includes forming a plurality of TDM data streams with an associated plurality of TDM channel clocks;
wherein loading segments into the associated channel payload queue includes writing segments in accordance with the corresponding TDM channel clocks; and,
wherein creating the packet using the payload associated with the selected pointer includes reading the payload in accordance with a packet interface clock.
5. The method of claim 1 wherein accepting the plurality of serial data streams includes accepting the plurality of serial data streams on channels having a corresponding plurality of data rates; and,
wherein creating the packet includes creating packets for each channel at a rate responsive to the corresponding channel data rate, and greater than the combined plurality of channel data rates.
6. The method of claim 1 wherein packing groups from each data stream into the associated channel segment queue includes forming channel segment queues, each having a width of greater than 1 segment; and,
wherein loading segments into the associated channel payload queue includes forming channel payload queues, each having a width of greater than 1 payload.
7. The method of claim 1 wherein loading segments into the associated channel payload queue includes loading, segments into a first-in first-out (FIFO) memory; and,
wherein creating the associated pointer in the pointer queue includes storing information in the pointer selected from a group consisting of a FIFO address of the associated payload, the channel of the payload, and channel alarms.
8. The method of claim 1 wherein selecting the pointer from the pointer queue includes using criteria chosen from a group consisting of:
pointer position in the pointer queue;
channel payload queues having a threshold number of payloads;
the channel payload queue having the largest number of payloads; and,
pre-defined channel numbers.
9. The method of claim 1 wherein loading segments into the associated channel payload queue includes loading segments using a round robin polling process.
10. A data communication system for converting multichannel serial data streams into packets, the system comprising:
a data packer hardware module with channel segment queues, having an input to accept a plurality of serial data streams in a corresponding plurality of channels, the data packer module packing groups with an undetermined number of data bits in a time domain multiplexed (TDM) fashion from each data stream into an associated channel segment queue, and supplying segments from each channel segment queue at an output, where each segment includes a predetermined number of bits;
a multichannel first-in first-out (FIFO) with channel payload queues, having an input to accept segments from the data packer module in a TDM fashion and loading segments into associated channel payload queues, and having an output to supply payloads from each channel payload queue, where each payload includes a predetermined number of segments;
a pointer queue having an input to accept pointers with payload information in response to filling an associated payload in the multichannel FIFO, and having an output to supply pointers;
a pointer selector having an output to select a pointer from the pointer queue; and,
a packet interface module having an input to accept the payload from the multichannel FIFO associated with the selected pointer, creating a packet from the accepted payload, and transmitting the packet via a packet interface.
11. The system of claim 10 wherein the packet interface module has a pointer input connected to output of the pointer queue, the packet interface module creating the packet with packet overhead from information stored in a pointer associated with the packet payload.
12. The system of claim 10 wherein the packet interface module has a packet header input, the packet interface module creating the packet with packet overhead information selected from a group consisting of a packet header and a cyclic redundancy check (CRC) checksum.
13. The system of claim 10 wherein the data packer module includes a demapper having an input to accept a Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) frame and an output to supply the plurality of serial data streams as a plurality of TDM data streams demapped from the frame.
14. The system of claim 13 wherein the demapper forms a plurality of TDM data streams with an associated plurality of TDM channel clocks;
wherein the multichannel FIFO writes segments into the channel segments queues in accordance with the corresponding TDM channel clocks; and,
wherein the packet interface module creates the packet by reading the payload from the multichannel FIFO in accordance with a packet interface clock.
15. The system of claim 10 wherein the data packer module accepts the plurality of serial data streams on channels having a corresponding plurality of data rates; and,
wherein the packet interface module creates packets for each channel at a rate responsive to the corresponding channel data rate, and greater than the combined plurality of channel data rates.
16. The system of claim 10 wherein each data packer module channel segment queue has a width of greater than 1 segment; and,
wherein each multichannel FIFO channel payload queue has a width of greater than 1 payload.
17. The system of claim 10 wherein pointer queue accepts pointers with information selected from a group consisting of a FIFO address of the associated payload, the channel of the payload, and channel alarms.
18. The system of claim 10 wherein the pointer selector selects the pointer from the pointer queue using criteria chosen from a group consisting of random selection, pointer position in the pointer queue, a threshold number of payloads in an associated channel payload queue, the largest number of payloads in an associated channel payload queue, and predefined channel numbers.
19. The system of claim 10 wherein data packer module supplies segments from the channel segment queues using a round robin polling process. Description
This invention generally relates to digital communication systems and, more particularly, to a system and method for converting multichannel serial data streams into packet network communications.
Conventionally, voice has been carried over Time Division Multiplexed (TDM) networks, such as E1/T1/E3/T3 and SDH/SONET networks. The emergence of packet data communications, such as Internet Protocol (IP) networks, has led to the convergence of TDM traffic into the IP networks. Packet networks, which were initially designed to carry time-insensitive data traffic, are not designed to address the concerns of real-time services like voice and video, which are conventionally carried over TDM networks.
Digital transport networks evolved as isolated links connecting analog switching systems for analog Public Switched Telephone Networks (PSTNs). Originally, digitized voice channels were multiplexed onto serial streams, framed, and line coded with completely unsynchronized clocks. Digital communications evolved to Plesiochronous Digital Hierarchy (PDH), which permits clock rates of interfacing streams to vary from a nominal value with a given tolerance. The variance is resolved by elastic stores and, in higher multiplexing rates, by bit stuffing. There are three closely related standards for digital trunks of primary rate, E1-E3 (Asia and Europe), the T1-T3 (North America), and J1-J3 (Japan). In a PDH transmission chain, a plurality of lower level digital signals are bit-wise, or bit and byte-wise time division multiplexed together to form a higher level signal, with the bit rate of the higher level signal being greater than the sum of the rates of the tributary signals to account for overhead functions in the higher rate signal, such as framing, parity, error detection, alarms, maintenance, and timing adjustment.
The bits of each lower level digital signal are written into an input buffer (one buffer per input tributary), with the write frequency equal to the incoming tributary instantaneous bit rate. The tributary bits are then read, according to a local system clock, and multiplexed by bit-interleaving or byte-interleaving. To take care of deviation in the rates between different tributaries and the multiplex signal, certain bit positions within the output multiplex frame (justification or stuffing opportunity bits) can carry either tributary or dummy bits. The justification decision (i.e., if the stuffing opportunity bit should carry information or be a dummy) is made frame-by-frame on the basis of a buffer threshold mechanism. Therefore, the actual number of tributary bits in the output multiplex frame varies dynamically and the transmission capacity gets adapted to the actual bit rate of the incoming tributary.
In a TDM format, data is transported in small chunks at a regular rate. The data stream is at a more or less uniform rate, with only small perturbations, which occur due to rate adaptation mechanisms within the network, or due to impairments in the network. Within such a network transport, applications must maintain the uniformity of the data rate to within tight specifications, which is generally done using a phase conditioning circuit in the transmit path. Such a phase conditioning circuit works by storing data in a buffer and playing it out to a mapper at a regulated rate. In order to maintain low latency requirements, the buffer is small (of the order of several bytes).
Since PDH networks work on independent clocking mechanisms, the differences in clock rates result in buffer slips, whose effect is negligible in voice conversations, but detrimental to data and video traffic. To address this problem, network architectures (SDH/SONET) have been adopted where all the network elements are synchronized and running at the same average frequency. Transient variations are accommodated by a mechanism called pointer adjustments.
In SONET, the base signal is referred to as Synchronous Transport Signal level-1 (STS-1), which operates at 51.84 Mb/s. Higher-level signals are integer multiples of STS-1, creating the family of STS-N signals, for N=1, 3, 12, 48, 192, & 768. An STS-N signal is composed of N byte-interleaved STS-1 signals. The optical counterpart for each STS-N signal is designated as OC-N (Optical Carrier level-N). TDM traffic is mapped onto an SPE (SONET) or a virtual container (SDH), which in turn is associated with Path Overhead (POH) to form an Administrative Unit in SDH. The pointer mechanism is used to take care of the asynchronous phase of the SONET/SDH traffic and also to compensate for frequency offsets between transmission systems.
FIG. 1 depicts a single channel device for converting a TDM stream into packets (prior art). The TDM data are available as a bit-serial data stream. This data stream can be an incoming data stream (e.g., a DS-1 or E-1 stream of data), or it can be demapped from a multiplexed format. Here, a demapper is not shown. The data stream may also be desynchronized from the mapped structure. In this case, there may be a �smooth� clock accompanying the data stream at the rate of the data. If the data are only demapped and not desynchronized, the data may be carried by the clock of the multiplexed format, with gaps to accommodate the different rate.
The bit serial stream is packed into bytes by data packer 100, which are put into a byte FIFO 102. When a sufficient number of bytes are accumulated to form a packet payload, the payload is transmitted by the packet interface logic 104, which also adds a suitable header to the data to form the entire packet. The header information may include cycle redundancy check (CRC) checksum information. Alternately, the packet interface logic 104 may calculate the CRC as the packet is transmitted. In the system of FIG. 1, it is possible to transmit the packet immediately after a payload full of bytes is accumulated.
FIG. 2 depicts a system for packing a multichannel stream of TDM data into a packet format (prior art). The TDM stream containing many channels is demapped by demapper 200 into individual bit-streams. Each stream is then packed into bytes by a corresponding packer 202 and the bytes are put into byte FIFOs 204, one per channel. Each FIFO 204 is typically larger than just one packet-payload. A scheduler 206 is then used to poll each FIFO to see if it has accumulated a packet-payload worth of bytes. Typically, a round-robin scheme may be used to poll the channels. If the FIFO for a channel has enough bytes when it is polled, control is passed to the packet interface logic 208, which adds a header and transmits the packet. The next channel is then polled.
The scheme of FIG. 2 works because the overall available bandwidth on the packet interface is much larger than the bandwidth of any one TDM stream, and is also larger than the combined bandwidth of all the TDM streams being packed. In fact, the bandwidth on the packet interface is typically greater than the combined bandwidth of all the TDM streams being packetized, plus the bandwidth needed for any overhead that is added to the payloads to form the packet. Therefore, despite the pauses associated with the polling routine, overall, the round robin scheme is able to keep up with the accumulation of packet-payloads from the various TDM streams.
A multichannel TDM stream (e.g., an STS-3 or STS-12 SONET stream containing many DS-1s and/or E-1s) may contain an arbitrary distribution of rates in the different channels. The rates of the different channels are generally not known a-priori. Therefore, it is not possible to set up a polling schedule which favors higher-speed channels or chooses channels in some other manner. It is therefore common to pick a straightforward round-robin scheme. Alternately stated, if a stream carries higher-rate data, it should be given more polling chances. However, a system such as the one shown in FIG. 2 cannot poll a higher-rate channel more often unless the rates in the various channels are precisely known beforehand.
As a result, some of the timing information inherently contained in the TDM streams may be lost in the process of packetizing. For example, if a first channel is only 1 byte short of a packet payload worth of data when it is polled, the scheduler can go on to the next channel, and will only service the first channel when it comes back around to it in rotation. Depending on the number of channels and the specific polling scheme, this process imposes a �waiting-time� on the packet transmission. This waiting time depends on the interaction between the polling schedule and the TDM rates. This waiting time can result in a phenomenon similar to waiting time jitter, or more generally, phase deviation. As used herein, the term jitter refers to phase-deviation at all frequencies. Jitter is a problem commonly associated with the bit-stuffing mechanisms for mappers, but in this scenario the magnitude of the jitter is greater as compared to bit-stuffing, because of the multi-byte packets. The timing of each TDM stream is impaired by this process.
It would be advantageous if a system could packetize multichannel serial data streams or TDM streams while better preserving the timing of the various streams.
As noted above, the conventional method for converting a data stream (e.g., a DS-1 or E-1 channel) into packet format packs the data into a payload and then transmits it as a packet. When a TDM data stream (e.g., multiple DS-1s or E-1s in a SONET payload) is converted into packets and transmitted, as is done in circuit-emulation, the method of packing the data can result in loss of timing information. For data termination applications, this loss of timing information is not important. But for timing-sensitive applications, it is important to retain as much of the timing information as possible for eventual recovery. This present invention describes a method for converting multichannel TDM data into packets, better preserving the timing information individually for each channel.
Accordingly, a method is provided for converting multichannel serial data streams into packets in a data communication interface. The method accepts a plurality of serial data streams in a corresponding plurality of channels. In a TDM fashion, groups with an undetermined number of data bits are packed from each data stream, into an associated channel segment queue, where each segment includes a predetermined number of bits. For example, a segment may be a byte. In a TDM fashion, segments are loaded into an associated channel payload queue, where each payload includes a predetermined number of segments. Once a payload is filled, an associated pointer is created in a pointer queue. The method selects a pointer from the pointer queue, creates a packet from the payload associated with the selected pointer, and transmits the packet via a packet interface. Typically, the packet includes overhead, which may be information stored in the pointer, a packet header, and/or a cyclic redundancy check (CRC) checksum.
More explicitly, the segments may be loaded into a first-in first-out (FIFO) memory, and the pointers may include information such as the FIFO address of the associated payload, the channel of the payload, and channel alarms. Advantageously, if the plurality of serial data streams is accepted on channels having a corresponding plurality of data rates, then packets can be created for each channel at a rate responsive to the corresponding channel data rate.
Additional details of the above-described method and a data communication system for converting multichannel serial data streams into packets are provided below.
FIG. 1 depicts a single channel device for converting a TDM stream into packets (prior art).
FIG. 2 depicts a system for packing a multichannel stream of TDM data into a packet format (prior art).
FIG. 3 is a schematic block diagram depicting a data communication system for converting multichannel serial data streams into packets.
FIG. 4 is a schematic block diagram depicting a TDM variation of the system of FIG. 3.
FIG. 5 is a diagram depicting a multichannel TDM data stream (prior art).
FIG. 6 is a schematic block diagram depicting a second variation of the system of FIG. 3.
FIG. 7 is a schematic block diagram depicting a jitter attenuator for converting serial data streams into a multichannel TDM stream.
FIG. 8 is a flowchart illustrating a method for converting multichannel serial data streams into packets in a data communication interface.
Various embodiments are now described with reference to the drawings. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. It may be evident, however, that such embodiment(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing these embodiments.
As used in this application, the terms �processor�, �processing device�, �component,� �module,� �system,� and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal).
Various embodiments will be presented in terms of systems that may include a number of components, modules, and the like. It is to be understood and appreciated that the various systems may include additional components, modules, etc. and/or may not include all of the components, modules etc. discussed in connection with the figures. A combination of these approaches may also be used.
The various illustrative logical blocks, modules, and circuits that have been described may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The methods or algorithms described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. A storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in the node, or elsewhere. In the alternative, the processor and the storage medium may reside as discrete components in the node, or elsewhere in an access network.
FIG. 3 is a schematic block diagram depicting a data communication system for converting multichannel serial data streams into packets. The system 300 comprises a data packer module 302 with channel segment queues. Shown are channel segment queues 304 a through 304 n, where n is not limited to any particular number. The data packer module 302 has an input to accept a plurality of serial data streams on lines 306 a through 306 n in a corresponding plurality of channels A through n. The data packer module 302 packs groups with an undetermined number of data bits in a time domain multiplexed (TDM) fashion from each data stream into an associated channel segment queue. That is, only one data stream is serviced in any particular time interval. A �group� is the collection of a non-predetermined number of valid data bits accepted in a predetermined number of clock cycles. A data stream or channel does not necessarily supply a regular or consistent number of valid data bits in a predetermined period of time. The data packer module 302 supplies segments from each channel segment queue at an output on line 308, where each segment includes a predetermined number of bits.
For example, a segment may be a unit of one byte or two bytes. Typically, the data packer module channel segment queues 304 a through 304 n each have a width of greater than 1 segment. That is, each channel segment queue can �hold� more than 1 segment.
In one aspect, the data packer module 302 supplies segments from the channel segment queues 304 a through 304 n using a round robin polling process (see FIG. 6). Alternately, the data packer module supplies segments triggered in response to the channel segment queues being filled or partially filled to a threshold level.
A multichannel first-in first-out (FIFO) 310 includes channel payload queues 312 a through 312 n, having an input on line 308 to accept segments from the data packer module 302 in a TDM fashion. The FIFO 310 loads segments into associated channel payload queues 312. The FIFO 310 has an output on line 314 to supply payloads from each channel payload queue 312, where each payload includes a predetermined number of segments. Typically, the multichannel FIFO channel payload queues 312 a through 312 n each have a width of greater than 1 payload. The FIFO 310 has an output on line 315 to supply pointer information, so that pointers may be created, which are associated with the stored payloads.
A pointer queue 316 has an input on line 318 to accept pointers with payload information in response to filling an associated payload in the multichannel FIFO 310. The pointers may include information such as the FIFO address of the associated payload, the channel of the payload, and channel alarms. The pointer queue 316 has an output to supply pointers on line 320. A pointer selector 322 has an output on line 324 to select a pointer from the pointer queue 316. Various criteria may be used for selecting a pointer from the pointer queue 316. A pointer may be randomly selected or selected based upon the pointer position in the pointer queue. Or, a specific channel number may be given priority by selecting pointers from that channel when they are available. For example, the pointer at the head of the queue may be selected. As another alternative, a pointer may be selected based upon the fact that a threshold number of payloads exist in an associated channel payload queue. As another example, a pointer may be selected with the largest number of payloads in an associated channel payload queue.
A packet interface module 326 has an input on line 314 to accept the payload from the multichannel FIFO 310, associated with the selected pointer. The packet interface module 326 creates a packet from the payload accepted on line 314, and transmits the packet via a packet interface on line 328. For example, the packet interface on line 328 may be a SPI4.2 interface. However, other packet protocols are known in the art and the system is not limited to any particular protocol.
In one aspect, the packet interface module 326 accepts the selected pointer on line 320, and the pointer information is used by the packet interface module to access and load the appropriate payload from FIFO 310. Alternately but not shown, some other mechanism or module may accept the pointer information on line 320. This alternate mechanism then accesses the appropriate payload from FIFO 310, and directs the accessed payload to packet interface module 326 for packetization. In another aspect, the packet interface module 326 has a pointer input connected to output of the pointer queue 316 on line 320, as shown, and the packet interface module 326 creates a packet with packet overhead using information stored in a pointer associated with the packet payload.
In a different aspect, the packet interface module 326 has a packet header input on line 330. Then, the packet interface module 326 creates the packet with packet overhead information such a packet header or a cyclic redundancy check (CRC) checksum, as supplied on line 330. As another alternative, the packet header or CRC may be generated by the packet interface module.
FIG. 4 is a schematic block diagram depicting a TDM variation of the system of FIG. 3. In this aspect, the data packer module 302 includes a demapper 400 having an input on line 402 to accept a Synchronous Optical Network/Synchronous Digital Hierarchy (SONET/SDH) frame, and an output on lines 306 a through 306 n to supply the plurality of serial data streams as a plurality of TDM data streams demapped from the frame.
In one aspect, the demapper forms a plurality of TDM data streams on lines 306 a through 306 n with an associated plurality of TDM channel clocks. That is, each TDM stream may possibly have a different clock. In other aspects, multiple SONET streams may be accepted, each carrying some TDM channels with their own clock rates. The multichannel FIFO 310 writes segments into the channel segments queues 312 a through 312 n in accordance with the corresponding TDM channel clocks. However, the packet interface module 326 creates the packet by reading the payload from the multichannel FIFO 310 in accordance with a packet interface clock on line 404.
Generally, the packet interface module 326 transmits packets on line 328 at a data rate greater than the combined plurality of channel data rates. Referencing either FIG. 3 or FIG. 4, in some aspects the data packer module 302 accepts the plurality of serial data streams associated with lines 306 a through 306 n on channels having a corresponding plurality of data rates. The packet interface module 326 creates packets for each channel at a rate responsive to the corresponding channel data rate. For example, the channel associated with line 306 b may have a data rate that is greater than the data rate of the channel associated with line 306 a. In this example, the packet interface module 326 generally supplies packets associated with channel B at a proportionally greater rate than the data rate of channel A packets.
Although the system shown in FIGS. 3 and 4 has been defined in terms of hardware circuitry, it should be understood that some elements of the system may be enabled as microprocessor instructions stored in memory and executed by a microprocessor or logic-coded state machine.
FIG. 5 is a diagram depicting a multichannel TDM data stream (prior art). The system shown in FIGS. 3 and 4 can be better appreciated with an understanding of the format of a multichannel TDM data stream. Shown are a TDM data stream with channels A, B, and C. The TDM interface includes at least the following parts: a clock, a data bus, and a channel address. As is shown, the channel address and data are synchronized, and change together on clock edges. In this example, the bus first carries data for channel A, then for channel B. There is then a dead period of 2 cycles during which the bus does not carry any valid data. In this example, the periods of invalid data are indicated by an invalid address. The clock cycle after the dead periods carries data for channel C. Therefore, in any clock cycle, only data for one channel is carried in the TDM stream.
Returning to FIG. 4, a multichannel TDM stream is first demapped and packed using a multichannel packer or data packer module 302. The multichannel packer may be enabled in a random access memory (RAM), to keep track of remaining bits from the incoming TDM stream. The RAM can be thought of as an M1xN1 array where M1 is the number of channels and N1 is the depth of each channel-storage in bits. In one implementation, N1 is 15 bits. Since the TDM data carries data from a single channel in any one clock cycle, that channel number is used as the row index M1. A transformation may be applied to the channel number to go from the normally sparse range of channel addresses to a continuous range of addresses to make efficient use of the RAM. If the incoming data from the demapper 400 is a full segment (e.g., a byte), then that byte is written into the packer RAM and a byte's worth of data is taken out from the packer and written into the multichannel FIFO 310 that follows the packer. If the data coming from the demapper 400 has some bits (less than a byte), that information is tracked and added to the existing count of bits. When the count of bits reaches a byte, then that packed byte is read out from the packer RAM and written into the multichannel FIFO.
The data packer module 302 is followed by a RAM-based structure which implements a multichannel FIFO 310. The FIFO may be implemented as a circular buffer. The FIFO RAM can be thought of as an M2xN2 array where M2 is the number of channels and N2 is the depth of each FIFO in bytes. Since the TDM data carries data from a single channel in any one clock cycle, that channel number is used as the row index M2. Generally, M2=M1, though that is not necessary. A transformation may be applied to the channel number to go from the normally sparse range of channel addresses to a continuous range of addresses to make efficient use of the RAM. As discussed above, in any clock cycle, a particular channel is processed, and a packed byte is either available or not available for that channel. If a byte is available, it is written into the row (one of M2) represented by that channel address.
The RAM width N2 is a multiple of the packet payload size in bytes. In one aspect, the channel payload queues in the FIFO 310 are 4 payloads wide. Typically, the channel payload queues are at least 2 payloads wide, but may be wider without loss of timing information. The additional storage can be used to increase the latency if needed. The width of the channel payload queues also depends on the speed of the packet bus compared to the speed of the TDM bus. In the clock cycle in which a byte is written into the FIFO from the packer side, a determination is also made as to whether at least one payload worth of data is available in that FIFO. Alternately, a holdoff threshold can be set. For example, a channel payload queue may be checked to determine if 2 or more payloads worth of data are available for that channel in the FIFO. If the threshold is met, then some packet pointer information is written into a packet pointer queue 316 in that same clock cycle. The packet pointer information may include the channel number and position of the packet payload in the FIFO, as well as status information, including alarms for that TDM channel. The write position in the channel payload queue is then incremented for the next packet payload. Then, in the next clock cycle, the next channel is processed.
The packet interface module 326 may be used to determine if there is an entry in the channel payload queue, or if a holdoff value is set, whether there are sufficient entries available in the queue. The packet interface module 326 then reads the packet pointer information from the queue. In this aspect, the packet interface module 326 acts as the pointer selector 322. In a simple implementation, the first packet pointer in the pointer queue is selected. The first pointer contains information to determine the position of the associated payload in the FIFO 310. A packet worth of data (i.e., a payload) is read from that channel address in the FIFO. After adding a header, the packet is transmitted. The packet interface module then reads the next address from the channel payload queue and processes that channel.
Since only one TDM channel is processed in a clock cycle, only one channel can complete in the packer, and only one channel can reach the threshold of having sufficient payloads in the FIFO. In one aspect, as soon as any given channel reaches a threshold, its packet pointer information is written into the pointer queue 316. Therefore, by transmitting packets in the order in which they are written into the pointer queue, channels are automatically processed in the order in which they complete�reaching the threshold of having a packet-payload worth of data. In this aspect, channels automatically get packet transmission chances in the exact proportion of their data rate relative to other channels. A faster channel will complete more packet-payloads faster, and will therefore get more transmission chances relative to a slower channel. The relative rates of the channels are therefore maintained and are not convolved with the timing of a polling scheme as in the conventional implementation of FIG. 2. As a result, the system of FIG. 4 maintains the timing of the original TDM streams in the transmission order of the packets.
Another benefit of the system of FIG. 4 is that port bandwidth utilization is automatically monitored by the number of entries in the channel payload queue. If a channel payload queue overflows, the implication can be drawn that the packet bandwidth cannot keep up with the aggregate line TDM rate. Also, by dynamically adjusting the channel payload queue holdoff threshold, more or fewer entries can be stored in the payload FIFO, which allows instantaneous adjustments to be made to the transmitted packet bandwidth. This holdoff adjustment mechanism is useful as a packet bandwidth management tool at the system level.
FIG. 6 is a schematic block diagram depicting a second variation of the system of FIG. 3. The system 300 of FIG. 6 is useful in the case of serial data streams that are not necessarily TDM data, but which have been demapped from a higher-order structure. As shown, the serial data streams 306 a through 306 n may be packed into the multichannel FIFO 310 using a polling scheme. For example, a round robin polling scheme may be used. In this case, there will be some waiting time jitter introduced by the polling scheme. However, since the number of channels is usually low due to limitations on the number of line interfaces supported on a device, that waiting time is likely to be small. In addition, the waiting time is also reduced in this case because the round-robin polling in the case of FIG. 6 is at the byte-level, as compared to the packet-level round-robin shown in FIG. 2.
FIG. 7 is a schematic block diagram depicting a jitter attenuator for converting serial data streams into a multichannel TDM stream. In this aspect, multiple streams on lines 700 a through 700 n can be packed into a multichannel TDM stream on line 402 using a jitter attenuator. The jitter attenuator need not necessarily use conventional bit-asynchronous mapping, as alternate mapping schemes with different waiting time jitter characteristics may be used. This system may advantageously be used to improve the timing of an incoming TDM stream. Even if the incoming TDM stream is perfectly timed, it can be mapped into the TDM stream on line 402 with, at most, up to one bit time of waiting time jitter. The data, in TDM format, can then be processed using the system depicted in FIG. 4.
Generally, the systems depicted in FIGS. 3, 4, and 6 have the advantage of automatically handling the timing-domain crossover from the TDM clock domain to the packet-interface clock domain. From the data writing perspective, the multichannel FIFO and pointer queue operate in the TDM clock domain. From the data reading perspective, the multichannel FIFO and the pointer queue operate in the packet-interface clock domain. By defining a holdoff threshold of greater than 1 payload in the FIFO, it is guaranteed that the payload being read from the packet side is not the same as the one being written from the TDM side. This issue is important because the two clock domains are asynchronous and there is otherwise no guarantee that the address being processed from the packet side is not the same as the one being written to from the TDM side. This present invention, therefore, automatically manages the clock domain crossing.
It is not necessary to read the channel payload queues in the FIFO in the order in which the payloads are written in. In some cases, it may be advantageous to randomize the order of transmission, or impose some other order. Although such an alternate ordering scheme may not maintain the timing as well as a scheme where packets are sent in the order in which they accumulate in the FIFO, there may be other advantages to such an ordering.
FIG. 8 is a flowchart illustrating a method for converting multichannel serial data streams into packets in a data communication interface. Although the method is depicted as a sequence of numbered steps for clarity, the numbering does not necessarily dictate the order of the steps. It should be understood that some of these steps may be skipped, performed in parallel, or performed without the requirement of maintaining a strict order of sequence. The method starts at Step 800.
Step 802 accepts a plurality of serial data streams in a corresponding plurality of channels. Step 804 packs groups with an undetermined number of data bits in a TDM fashion, from each data stream, into an associated channel segment queue, where each segment includes a predetermined number of bits. In a TDM fashion, Step 806 loads segments into an associated channel payload queue, where each payload includes a predetermined number of segments. In response to filling a payload, Step 808 creates an associated pointer in a pointer queue. Step 810 selects a pointer from the pointer queue. Using the payload associated with the selected pointer, Step 812 creates a packet. In one aspect, creating the packet in Step 812 includes creating packet overhead with information such as information stored in the pointer, a packet header, or a CRC checksum. Step 814 transmits the packet via a packet interface.
In one aspect, accepting the plurality of serial data streams in Step 802 includes substeps. Step 802 a accepts SONET/SDH frame. Step 802 b demaps the frame into a plurality of TDM data steams. Further, the TDM data streams formed in Step 802 b may each have an associated (and different) TDM channel clock. Then, loading segments into the associated channel payload queue (Step 806) includes writing segments in accordance with the corresponding TDM channel clocks. However, when the packet is created in Step 812, the payload is read in accordance with a packet interface clock.
In another aspect, Step 802 accepts the plurality of serial data streams on channels having a corresponding plurality of data rates. Then, creating the packet in Step 812 includes creating packets for each channel at a rate responsive to the corresponding channel data rate, and greater than the combined plurality of channel data rates.
In a different aspect, packing groups from each data stream into the associated channel segment queue (Step 804) includes forming channel segment queues, each having a width of greater than 1 segment. Likewise, loading segments into the associated channel payload queue in Step 806 includes forming channel payload queues, each having a width of greater than 1 payload. In one variation Step 806 loads segments into the associated channel payload queue using a round robin polling process.
In one aspect, Step 806 loads segments into a FIFO memory. Then, creating the associated pointer in the pointer queue (Step 808) includes storing information in the pointer such as the FIFO address of the associated payload, the channel of the payload, and channel alarms.
In another aspect, selecting the pointer from the pointer queue in Step 810 includes using criteria such as pointer position in the pointer queue, channel payload queues having a threshold number of payloads, random selection, the channel payload queue having the largest number of payloads, and predefined channel number.
A system and method are presented for converting multichannel serial data streams into packets. Examples of particular circuit blocks and logical steps have been given to illustrate the invention. However, the invention is not limited to merely these examples. Other variations and embodiments of the invention will occur to those skilled in the art.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS6631130 *Nov 21, 2000Oct 7, 2003Transwitch CorporationMethod and apparatus for switching ATM, TDM, and packet data through a single communications switch while maintaining TDM timingUS6701088 *Aug 14, 2000Mar 2, 2004Nippon Telegraph And Telephone CorporationIP packet transmission equipmentUS20030227906 *Jul 26, 2002Dec 11, 2003Litchfield Communications, Inc.Fair multiplexing of transport signals across a packet-oriented networkUS20030227943 *Jul 26, 2002Dec 11, 2003Litchfield Communications, Inc.Communicating synchronous TDM signals across a packet-oriented networkUS20040047367 *Sep 5, 2002Mar 11, 2004Litchfield Communications, Inc.Method and system for optimizing the size of a variable bufferUS20040190548 *Mar 24, 2003Sep 30, 2004Corrigent Systems Ltd.Efficient transport of TDM services over packet networksUS20050135398 *Dec 22, 2003Jun 23, 2005Raman MuthukrishnanScheduling system utilizing pointer perturbation mechanism to improve efficiencyUS20090097853 *Oct 12, 2007Apr 16, 2009Sasak Anthony LSharing value of network variables with successively active interfaces of a communication node* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS8571062 *Oct 8, 2010Oct 29, 2013Applied Micro Circuits CorporationMultichannel data conversion into packetsUS8707080 *Jul 12, 2011Apr 22, 2014Emc CorporationSimple circular asynchronous clock domain crossing technique for digital data* Cited by examinerClassifications U.S. Classification370/466International ClassificationH04J3/16Cooperative ClassificationH04L49/901, H04J2203/0025, H04J2203/0098European ClassificationH04J3/06B6Legal EventsDateCodeEventDescriptionMay 16, 2014FPAYFee paymentYear of fee payment: 4Jan 16, 2008ASAssignmentOwner name: APPLIED MICRO CIRCUITS CORPORATION, CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:REN, XINGEN JAMES;SUBRAHMANYAN, RAVI;REEL/FRAME:020373/0199Effective date: 20080111RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services

value: This website is a search engine provided by Google. Handling over 3.5 billion searches per day, it has a 92% share of the global search engine market.


text:
Movies Comedy Drama > Comedy of Manners Lawless Heart Media Condition: New
Douglas Henshall, Tom Hollander, Bill Nighy, Cl�mentine C�lari�, Josephine Butler
This second feature from Boyfriends' directors Neil Hunter and Tom Hunsinger explores intertwined relationships in a sleepy seaside resort in the U.K., broken up into three segments. The film centers around the funeral of Stuart (David Coffey), the gay partner of Nick (Tom Hollander), who owns a local restaurant. Stuart's brother-in-law Dan (Bill ...
Dominic Hall, Sally Hurst, Stuart Laing, Josephine Butler, Sukie Smith, Ellie Haddington, Cl�mentine C�lari�, Bill Nighy, Tom... New. 2001 Run time: 100. Buy with confidence-Satisfaction Guaranteed! Delivery Confirmation included for all orders in the US.
13291563002
13461976826
Douglas Henshall; Tom Hollander; Bill Nighy; Cl�mentine C�lari�; Josephine Butler. New. Run time: 86 mins. NEW ITEM. SHIPS WITH DELIVERY CONFIRMATION WORLDWIDE.
Starting at $1.45	Twice Upon a Yesterday
Starting at $0.99	Fast Food
Starting at $20.45	Collision
Starting at $3.99	The Jane Austen Book Club

value: This website is is an online store that sells new books, used books, out-of-print books, rare books, and other media through an online network of independent booksellers.


text:
Elmer Geer - Find A Grave Memorial
24106064 · View Source
WITH W.A. & MARY GEER
Find A Grave Memorial 24106064
Find A Grave, database and images (https://www.findagrave.com : accessed ), memorial page for Elmer Geer (unknown–unknown), Find A Grave Memorial no. 24106064, citing Fairview Cemetery, Simpson, Olmsted County, Minnesota, USA ; Maintained by K. Pike (contributor 46787693) .
Add Photos for Elmer Geer
Fulfill Photo Request for Elmer Geer
your computer for Elmer Geer memorial.
I thought you might like to see a memorial for Elmer Geer I found on Findagrave.com.

value: This website is a website that allows the public to search and add to an online database of cemetery records. It is owned by Ancestry.com.


text:
Three things: Chiefs vs. Rams1275dBill WilliamsonThree things: Chiefs vs. RamsEmailcommentAug 18, 2012Bill WilliamsonESPN Staff Writer CloseCovered AFC West for five seasons for ESPN.com
Also covered Vikings, Packers, SeahawksEmailprintcommentThe following are three things to watch during Kansas City's game at St. Louis on Saturday night. Kickoff is set for 8 p.m. ET.1. Brian Daboll’s momentum: It was a great start for the new offensive coordinator of the Chiefs. Kansas City’s first-team offense scored touchdowns on both of its series in the preseason opener against Arizona last week. The unit was clicking on all cylinders, and players gave much credit to Daboll. Let’s see it continue.2. Jon Baldwin: The promising receiver didn’t have any catches last week. It’s not a big deal. Baldwin has been a training camp star, but it would be nice to see him make an impact in a preseason game.3. Dontari Poe: The rookie received some praise from coach Romeo Crennel. Poe, the No. 11 overall pick, is going to be a work in progress, and needs to make some noise in the preseason.

value: This website is the official website of ESPN. It is owned by ESPN Internet Ventures, a division of ESPN Inc.


text:
P. 1Pla c e a n a d in T hPla c e a n a d in T hRatings: (0)|Views: 30
|Likes: 0Published by Kim CarlyleMore info:Published by: Kim Carlyle on Nov 10, 2009Copyright:Attribution Non-commercialAvailability:Read on Scribd mobile: iPhone, iPad and Android.download as PDF, TXT or read online from ScribdFlag for inappropriate content|Add to collectionSee moreSee lesshttps://www.scribd.com/doc/22367034/Pla-c-e-a-n-a-d-in-T-h12/07/2009pdftextoriginal Activity (1)FiltersAdd to collectionReview Add NoteLikeShowingAllMost RecentReviewsAll NotesLikesYou've already reviewed this. Edit your review.Rating 0/5Post notePost reviewPost replyPost note and like1 hundred readsLoad more