text:
Archive for the 'vista' tag
Cruise & Travel VIP / Vista Tanning, 506 Gervais Street: 2014 (moved) 1 comment
As I was driving out to West Columbia the other week, I happened to glance left while I was a the Huger stoplight and noticed a real estate sign in the window of one of the storefronts in the little strip there.
At the time, I couldn't quite make it out and it wasn't until I uploaded the pix from my camera that I coudl see it was a Travel and Tanning center. That's not a combination that I've ever thought of before, but I can see it might make sense to get ready and look good on your vacation..
Behind the real estate sign is a note that they have moved, but I can't quite make out where to.
City Market Antique Mall, 709 Gervais Street: December 2014 12 comments
I stopped at City Market a number of times over the years (though probably not in the last decade), usually to visit the book shop. My memory is hazy about actual purchases, but I think I found a Saint book there once. These are largely forgotten now as even the Roger Moore TV series falls out of the popular memory, but the early ones were a lot of fun: The Saint was always on the side of Right, but rarely on the side of Law...
A set of 19th century warehouse buildings in the Vista could get a facelift and join the growing number of restaurant, retail, office and residential spaces downtown.
A local architect and developer who has rehabilitated a number of historic properties in Columbia wants to purchase the buildings housing Carolina Imports furniture store and City Market Antiques Mall on Gervais Street.
The article is from June 2014 though, and is phrased as "wants to purchase", so I'm not sure if that is what happened in the end or not.
Carolina Imports, 705 Gervais Street: 23 November 2014 (moved) 5 comments
As commenter Justin noted some time back, Carolina Imports furniture has left Gervais Street and the Vista and have moved out of downtown.
Their new location is at 2965 North main, in the Trestle Building:
(Hat tip to commenter Justin)
Bluestein's Wholesale Dry Goods, 933 Gervais Street: April 2014 7 comments
The date was, I think, 1983, at about this time of year, and pretty much everything was right with the world. The Carter years were over, I was at USC and had, after a bit of flailing around, found something I liked and was was good at that I figured I could spend the forseeable future doing. It was springtime and I was taking a fun elective, "Introduction to Cinema", or some such course title.
I can't now recall the professor's name, but he was quite entertaining and well versed in the material. I remember in particular one of his theories, probably not 100% serious, that people in the first few decades of the 20th century lived their lives much more dramatically than we do now. This would explain, he said, why silent movies look so over-acted to us, but yet when he went back to the original period newspaper reviews of the features, he invariably found praise for the naturalness of the performances. At any rate, we screened many of those silent classics as well as more modern flicks into the French New Wave period and beyond. The kicker for the course was that for the final project, we would split into groups and make our own short films.
Well, as it happened, one of my Computer Science friends was in the course with me, so we formed a group of two for the project. I had, from somewhere, a Super-8 camera with an attached flood, so we were good on the technical side -- all we needed was an idea and script.
Now, one of the films we had screened was Ingmar Bergman's The Seventh Seal. I don't know what I would think of it now, but at the time, I believe we both thought it a bit pretentious, and more importantly, a good subject for parody (which could only be helped by the fact that everybody in the audience would have seen the film recently too). I recall very few of the details, but the key fact is that a robed avatar of DEATH was going around taking lives with visual metaphor of a candle going out. We figured that with modern medical technology and life support, HIS job might be a bit less easy. We kicked it around a bit and figured we could get a usable 10 minutes from the idea easily.
Since I had the camera, and there were only two of us, it was obvious that my friend was going to have to be DEATH. It was a bit of a problem that she didn't look at all spooky or dangerous, but she had some ideas for that. Now, she was from North Augusta, so I have no idea how she knew more about this piece of Columbiana than I did (other than I rarely paid attention to anything outside of a book in those days), but she walked us down to the Vista (which was not called that at the time) and into Bluestein's Dry Goods. I had only a vague idea what a "dry goods" store was and certainly would not have automatically included sheets in that category, but she easily found a good sized, inexpensive sheet, and we were out the door. Next we stopped at the grocery for some black Rit dye, and mixing that up in my mother's washer (I have no idea how the next load of clothes came out), we dyed the sheet black.
Wound in black sheets, and with a bit of white makeup, my friend was a perfect DEATH. Next we made some cardboard signs saying "Life Support", and got some trick birthday candles. We put the signs up over the end of hall double doors in LeConte College (the CSCI building at the time), and our tracking shots had DEATH wafting through the corridors of that building and through the doors into the "Life Support" ward. At that point, the idea is that we would cut to the trick candles, and that everytime DEATH would snuff one out, it would re-light. Finally, he would be so frustrated he would break the 7th Seal (on a bottle of Seagrams 7..) We planned the shoot for well after hours (there was no building security in those days) and everything went perfectly without a soul present to ask what in the world we were doing. We got enough footage that we figured we were golden and wrapped up.
Next, I had the film developed, and it was time to edit the movie together. At that point I was suddenly stricken with pollen season allergies like never before and never since. It was non-stop sneezing, and my eyes were watering so badly I literally could not see to use the Moviola. In the end, my friend had to take it and set it up in the downstairs computer remote in the (as we called it at the time, Physical Sciences building) and she edited the movie together completely on her own during her late night shifts as the computer operator there. She did a great job of it, and the film was a hit with the class, we got good grades and moved on to the next semester. As far as I know, she still has the reel somewhere, but I'm sure it's better in memory that it would be watching it again now...
And that's my Bluestein's story!
(The Gallery At) Nonnah's, 930 Gervais Street: Winter 2013 (moved) 11 comments
Art gallery, coffee house and dessert venue, Nonnah's has moved almost directly across the street from it's original Gervais Street location at 930, to 923 Gervais. Somehow I never became a regular at this place. I guess in part that's because I want it to be Kaminsky's and it's not. Every time I've stopped there, it has seemed very cake-oriented to me, and I want pie, cheesecake, tiramisu, mousse and creme brule..
Here is the new location:
Bella Vista Bridal & Wedding Botique, 929 Gervais Street: August 2013 no comments
According to WIS, Bella Vista closed their doors in late August filing for Chapter 7 bankruptcy.
An update to the story notes that the owner plans to sell the inventory during the bankruptcy procedings. Unfortunately it seems that this inventory includes already spoken-for (and deposit-paid-on) wedding dresses for soon-to-be-brides. Certainly not a good situation. When I took these pictures on 8 September 2013, that sale had apparently yet to take place (though signs for it were in place), as the store, while closed, looked fully stocked.
The adjacent bakery, Lady Antoinette's, is apparently associated and also involved in the bankruptcy.
(Hat tip to commenter Tom)
Subway, 701 Gervais Street #140: Late July 2013 1 comment
This Subway was in The Vista Lofts on Gervais Street just above the train cut, a building which lost another restaurant Mezza fairly recently.
I'm guessing that they closed shop at the end of July as that is a logical time as far as leases and bills go, but I don't know for sure. At any rate, all the signage is down and the interior is stripped. The only clue that it was a Subway is the drink cup on the floor.
(Hat tip to commenter Joe)
UPDATE 17 July 2014 -- It's now Black Bean Co.:
Mezza Lebanese Bistro & Hookah Lounge, 110 Gervais Street: 24 December 2012 5 comments
I like some Lebanese food quite well, but I never got around to trying Mezza perhaps partly because of the location and partly because of the Hookah Lounge aspect, which I was afraid might put me in a smoking section, something I have less and less tolerance for as the years go on.
At any rate, that's not an option anymore as they closed up shop on Christmas Eve and the place's site proclaims that the space has already been sold.
(Hat tip to commenter Justin)
UPDATE 16 October 2013 -- It's now open as Le Peep:
Carolina Wings & Rib House, 600 Gervais Street: 9 December 2012 16 comments
The Carolina Wings at the corner of Gervais & Pulaski is the latest location of this local chain to close. (You can see other stores here, and here).
There was an article in The State about it. I didn't save the link, but the gist as I recall it was that the chain went into bankruptcy, and that as part of their reorganization to come out of it, they were closing stores where the rent was too high and the margin too low to make sense in their current status.
As of a few weeks ago, at least, their Pawleys Island location (really Litchfield, but everybody tries to say they're Pawleys nowadays..) was still open, so they still do have a bit of a non-Midlands presence.
(Hat tip to commenter MB)
UPDATE 14 July 2014 -- As mentioned by commenter Andrew, this building has now been sold:
The F-Stop Camera Shop, 1224-B Huger Street: 16 July 2011 10 comments
When I was around 10, I semi-inherited a bunch of darkroom equipment, and drove the guys at Jackson Cameras to distraction with all my questions, and my mother to distraction with all the chemical stains (still there today) on her kitchen countertops. Given that, and the number of film cameras I have salted away in storage somewhere (including a Kodak 616 format box camera that worked the last time I tried it..), I always figured I would drop by film haven The F-Stop Camera Shop someday. I noted when it moved here from Five Points, and somehow still didn't get around to it.
Hard to believe I haven't been in a darkroom since 1976..
UPDATE 12 September 2012: Added two pictures of the place in operation that I forgot to copy over.


text:
Peruvian Glacier Has Lost Half Of Its Ice
"Recent scientific studies indicate that between June 1983 and August 2006, a glacier on Peru's Huaytapallana Mountain has lost 50 percent of its surface ice," Erasmo Meza, manager of natural resources and the environment in the central Andean region of Junin, told the official Andina news agency.
Losing the ice in just 23 years, officials warned of concerns of climate change's growing threat to fresh water resources in the Andes mountains. Meza continued, telling AFP the 1.9 square miles of ice shrinkage on Huaytapallana was caused by global warming and increases concerns about agriculture, health, fresh water resources and disaster mitigation in the region.
To prevent further deterioration on the 18,230-foot mountain, whose steep, jagged glacier and breathtaking lakes are popular tourist draws, the regional government of Junin is developing a project to declare Huaytapallana a natural conservation area — a move Meza says should stave off damage from a mining company doing a feasibility study in the area.
The study of Huaytapallana shows a sharper rate of glacial melt than other major findings. A 2009 World Bank-published report said that Peru's glaciers have shrunk by 22 percent in the last 35 years, leading to a 12 percent loss in the amount of fresh water reaching the coast, where most of Peru's population reside. Perhaps the most threatened is Huascaran Mountain, Peru's highest point at 22,200 feet.
The Andes are the scene of many glacier studies. Called the "Roof of the Americas", this region comprises more than 100 peaks taller than 16,500 feet.
The study also warned that Andean glaciers and the peaks' permanent snow caps could disappear in 20 years if nothing is done to alleviate climate change, echoing the findings of Peruvian agencies.

subset: commoncrawl


text:
Sort by:
Discussions | Replies | Latest Activity |
Jessica Alba Talks HypnobirthingCheck out this story on Jessica Alba and why Hypnobirthing is for her. http://wonderwall.msn.com/tv/jessica-alba-why-hypnobirthing-is-rig… Started by MyBestBirth Admin |
0 | May 20, 2011 |
Looking for a Midwife in Southern California that accepts Blue Shield!!!Hello All, I am 5 months pregnant with my first child and I want to have a waterbirth either at home or in a birthing center using hypnobi… Started by Natalie Sanchez |
5 |
Aug 10, 2010 Reply by Melissa Keil, CD (DONA) Doula |
Preparing to hypnobirth?I read Marie Mongan's hypnobirthing book and have been using the cd that came with the book and the rainbow relaxation cd. I've been practi… Started by Sara Furlong |
5 |
Dec 30, 2009 Reply by Rachael Fichtner |
An OB & his wife have an amazing HypnoBirth!Encinitas (San Diego-N. County), CA OB, Dr. Nick Capetanakis, D.O./OB/GYN & his wife took my HypnoBirthing classes after he saw so many… Started by Carol Yeh-Garner |
2 |
May 31, 2009 Reply by Carol Yeh-Garner |
© 2015 Created by MyBestBirth Admin.


text:
New Range of HondaView and compare our entire range of Honda motor vehicles. From the compact Honda Jazz through to the luxury of the Honda Legend, the is a car that will suit the most discerning buyer.
Pre Owned and Demo Search The Alan May Group carries over 70 quality used vehicles in stock at all times. Search our pre-owned and demonstrator stock and drive away with confidence.
Service DepartmentAlan May Honda Servicing is not just for Hondas - any vehicle can be serviced, and it doesn't affect your warranty. Our service division is open from 7.30 am until 5.00pm and offers fixed price servicing.
Genuine Parts & AccessoriesOur highly experienced and knowledgeable staff manage all Genuine Honda body and mechanical vehicle parts. If the part or accessory you require is not on hand, it will be to you the next business day
Motor Vehicle Finance & Insurance Our highly trained and experienced business managers tailor the most suitable finance package for our Honda customers whether for private or business purchases.
New & Quality Pre Owned Prestige CarsLocated in Batemans Bay - South Coast - NSW.
The team at Alan May Honda takes pride in offering you a first class experience at every point of contact at our new ultra modern showroom & state of the art service facilities located on the South Coast of NSW in Bateman's Bay.
Whether you are looking to purchase a new Honda, servicing your existing Honda or purchasing a quality used vehicle, Alan May Honda is the only place to visit.


text:
Culture Shock
Dates 2 Jun '14 to 22 Aug '14
Flexible? Yeah, sure
Est. Cost 3,000 - 4,500 EUR (EUR Euro)
Type Travel Partners Wanted
Name Backpacking South America 2014
I am planning a trip of a lifetime to South America throughout the summer of 2014, i have a very rough itinerary which is as follows
June 2014
Arrive Buenos Aires, do some urban biking and explore what the city has to offer stay for two weeks
Travel to Santiago in Chile and do some Scubadiving and check out the beaches (stay for a week)
Travel back and take in Ignazu Falls on the border
July 2014
Arrive in Sao Paulo Soak up the world cup atmosphere and do some skydiving
Arrive in Rio and travel to Corcovado
Do an Amazon Backpacker Tour and some white river rafting possible stay in eco-lodge
August 2014
Travel back to Buenos Aires do some sight-seeing
fly home mid August
Backpacking South America 2014
Still looking for flights? You can have flight experts compete against one another to find you the absolute best and cheapest flights.


text:
Stamford, Ct
My current drink of choice:
Vodka tonic
I really wish I could:
travel and eat my way around the world...and get paid for it!
My favorite comfort food:
Mashed potatoes or mac and cheese.
My top 5 favorite restaurants:
Mona Lisa, Napa & co., Duo
People Reading Me


text:
- Filed Under
After all these years, the Tigers have found a quarterback of the future that will lead them into the postseason for the next few years.
Cocoa High freshman Bruce Judson made an impression with his breakout performance in a 54-7 district win at home against Cocoa Beach. The first-year starter threw for 181 yards and rushed for 81 more with five total touchdowns in the first half.
"The routes were open and I just hit them in perfect timing. We kept scoring every drive we had. Our offensive line blocked well," Judson said. ...


text:
Any one up for a trip to the seeps lakes this weekend if the wether and wind cooperate? I'm off on Fri and may take Thur off also. Its been a while since I fished them but some good fishing can be had in most of them with the added chance to catch some nice holder-overs. I plan to camp there and hit 5 or 6 of them if possible. Coyote hunting and gun shooting could also be added to this trip. A good place for bird watching and hiking. I know we talked about this in another thread but now its time to shit or get off the Pot, so to speak. I would love to have Bill Warner show us how to fish these lakes, he knows that area real well. I may have room for a fellow fishermay to share this rare adventure. Powerbait and cheap whiskey tolerated. Bob
It will have to be towards the end of April before I can get free. Heart/ Windmill Lake will have a large accessible (free) camping area with an outhouse.
I am up for at least a day of it, if not overnight, with the variable "depending on which weekend." I would love to learn about those lakes. Wayne
Wayne, It looks like the weather will be iffy this weekend, windy with a chance of rain. I'l be up for it on another weekend for sure.
The weather is a little "breezy" today and not my idea a good time fishing. Good call on canceling out.
It started not breezy but the wind is much worse than yesterday here in the Tri. Planned on going to Lenice, glad I bagged that idea. Wayne
Bass, That could work for me. Need to check if my neighbors will watch my dogs and what the weather will be like Fri-sun. I live real close to you, thrashers corner area.
im down, as of right now i talked to peyton00 who is another user and he was down for lenice and camping. i have never fished seeps before other than moses for bass, but im sure we could make the drive there instead if he is cool with it
Daughter has volleyball north of Spokane on Sunday. Talked her and wife into going on Sunday morning instead of the night before, leaving me Sat to fish. Today I found out my son has tennis tournament on Fri and Sat. So I am out this weekend. This should be the end of weekend sports for this school year. Wayne
Bass, I can't take this Fri off but I have the next one off, so 19-21 looks good for me if the weather is good. Breezy is a bad word in E. WA. Spent too many days watching white caps from the truck. Breezy and rain sucks even more especially with the cost of gas to get there. The weather this weekend is a little iffy. I still want to fish these lakes so hopefully the weather will cooperate.
im bagging the trip, supposed to be highs of 50 with lows in the 20-30's at night. fugghgedaboutit. just probably go play hockey all weekend


text:
Accoring to the US Census Bureau, Lovegrove ranked #30,753 in frequency out of 151,671 surnames for which statistics were released from the 2000 Census. 715 people, or approximately 1 in every 377,290 individuals in the US had this surname in 2000.
Source: "Genealogy Data: Frequently Occurring Surnames from Census 2000", US Census Bureau.
Histopolis currently has 10 grave(s) with the surname Lovegrove.
Search the Histopols Grave Index for the surname Lovegrove.
The surname Lovegrove has a Soundex code of L126. The following 67 surname(s) may sound similar to Lovegrove since they share the same Soundex code.


text:
Previous Events
Reasoning with real people: lessons from fiction
13th Annual Steven Humphrey Student Philosophy Colloquium keynote address by Eileen John, University of Warwick
"Pharoah Sanders and the Music of Double Consciousness"
Michael Coyle, Professor of English at Colgate University will discuss the work of Pharoah Sanders.
13th Annual Steven Humphrey Student Philosophy Colloquium
Sponsored by the Philosophy Department
It's a Movement Not a Market: Creating an Ethical Food System through Fair Trade
This presentation explores the Fair Trade Towns movement in which fair trade advocates and retailers are collaborating to 'grow the fair trade market' one community at a time by bringing together schools, places of worship, retailers and community organizations. These campaigns attempt to root fair trade consumption in local places--a critical turn in the fair trade movement which opens up a politics of possibility for the promotion of alternative economic practices.
Restoring Woodlands in Louisville's Olmsted Parks
An Ecotour with Biology Professor Margaret Carreiro
Faculty Research Forums Fall 2013
Benjamin Hufbauer, Art History, "America's Pyramids: Presidential Libraries in the 20th and 21st Centuries"
In God's Land
Film Screening with director Pankaj Rishi Kumar
Celebrating Fifty Years of Peace: Diplomacy in Action on UofL's Belknap Campus
How after two World Wars FRANCE and GERMANY found a NON-VIOLENT resolution to conflict. A public forum with Paul Graham, French Consul General and Dr. Christian Brecht, German Consul General.
The Hero's Journey: A Blueprint for Personal, Professional & Cultural Evolution
A free, public talk by 2013 A&S Alumni Fellow David 'Jelly' Helm
"THINK AGAIN: A Day with A&S" - Cancelled
This event has been cancelled
Faculty Research Forum
Hosted by the Commonwealth Center for the Humanities and Society
Film and Film Making in Kentucky
One-day conference at UofL on October 4, 2013
"New Light on the Bronze Age" talk by John Hale
Presented by the Kentucky Society of the AIA


text:
US 7689224 B2 Abstract A method and apparatus for generating connectivity is described. The method includes a server broadcasting a beacon including the server's address. The method further includes each client that receives the beacon rebroadcasting the beacon. The result is that each client receiving the beacon knows a way to reach the server.
Claims(17) 1. A routed wireless network comprising:
a plurality of wired access points;
a plurality of clients, each client belonging to a cluster of clients administered by a single server and such that membership in a cluster is elected by the client through a selection of a beacon to rebroadcast; and
one path identified by the beacon designated as the optimal path, setting a default gateway as identified in the optimal path, and rebroadcasting only the beacon representing the optimal path by a client selecting the beacon, wherein the optimal path provides a complete path to the single server, and the beacon includes addresses of all clients included within the complete path to the single server.
2. The network of
3. The network of
4. The network of
5. The network of
6. The network of
7. The network of
8. The network of
9. The network of
10. The network of
11. The network of
12. The network of
13. The network of
14. The network of
15. The network of
determining if there is a previous default gateway identified; and
deleting the previous default gateway from memory.
16. A routed wireless network comprising:
a plurality of wired access points;
a plurality of clients, each client belonging to a cluster of clients administered by a single server and such that membership in a cluster is elected by the client through a selection of a beacon to rebroadcast;
wherein the beacon broadcast by the server includes a hop-count set to zero;
each client that receives the beacon rebroadcasting the beacon with the hop-count incremented by one;
each client that receives the beacon rebroadcasting the beacon with an address of the client; and
such that each client receiving the beacon knows a complete path to reach the server and the number of hops in the complete path to the server, and the beacon includes addresses of all of the clients included within the complete path to the server.
17. A routed network comprising:
a plurality of wired access points;
a plurality of clients, each client belonging to a cluster of clients administered by a single server and such that membership in a cluster is elected by the client through a selection of a beacon to rebroadcast;
wherein each client that receives the beacon rebroadcasting the beacon with an address of the client added to the beacon; such that each client receiving the beacon has a complete path to the server, and the beacon includes addresses of all of the clients included within the complete path to the server.
Description The present patent application is a Divisional of application Ser. No. 09/751,262, filed Dec. 29, 2000 now U.S. Pat. No. 6,704,301. This invention is concerned with the area of wireless systems, and more particularly with routing data between a server and a client in a wireless environment. The use of wireless devices to access the Internet is becoming more prevalent. However, accessing the data generally requires either intelligent clients, or high bandwidth as the size of the network expands. One prior art protocol that is used is the SURAN class of protocols, developed under the aegis of DARPA. This set of algorithms comprises hierarchical as well as non-hierarchical algorithms. The non-hierarchical algorithms lack scalability�as the size of the network grows (N=number of nodes in the network), the bandwidth needed to perform routing grows like N or N^2. This means that for a given required data communications bandwidth, the possible size of the network is heavily constrained. Hierarchic algorithms are complex, difficult to implement, have overheads associated with the establishment and maintenance of hierarchies, and suffer from management costs associated with network monitoring, route-maintenance, tracking and addressing of roaming nodes, etc. Another prior art set of protocols is the MANET suite of protocols, which was developed within the IETF. The MANET suite of protocols makes inefficient use of bandwidth. One prior art mechanism, illustrated in Therefore, a better protocol for interconnecting a wireless network would be advantageous. It is an object of this invention to provide an improved wireless protocol. A method and apparatus for generating connectivity is described. The method includes a server broadcasting a beacon including the server's address. The method further includes each client that receives the beacon rebroadcasting the beacon. The result is that each client receiving the beacon knows a way to reach the server. Other features and advantages of the present invention will be apparent from the accompanying drawings, and from the detailed description, which follows below. The present invention is illustrated by way of example and not limited by the figures of the accompanying drawings in which like references indicate similar elements and in which: Overview The present invention provides a scalable routing solution that uses bandwidth efficiently, adapts quickly to changes in network topology and connectivity, is self-administering, easily deployable, automatically partitions the network in order to optimally exploit available wired connections and is easy to implement. The network architecture includes one or more wired-access points (Servers), which are simultaneously members of the wireless network and the (wired) Internet, and a large number of Clients that are members of the wireless network and have access to the wired Internet only through the Servers. For one embodiment, the number of Servers will be limited (perhaps 1 Server for every 100 Clients) and the Clients will wish to gain access to a Server that will provide them with Internet access, email, etc. This system also permits, for one embodiment, client-to-client communication. The server periodically sends out a beacon to the clients, who rebroadcast the beacon. This permits each client to determine its path to the server. For one embodiment, a reverse beacon is sent by the clients, to the server. Thus, the server has a full path to each client, and each client has a path to its nearest neighbors, and knows which of those paths leads to the server. Therefore, the client and server can communicate. For one embodiment, if a client wishes to connect to the Internet via the server, it sends a request to the next client upstream from it, its request asking that it be passed along to the server. The server is able to send a message to any client as well. For another embodiment, when a client wishes to connect the server, it sends a connection request, through the known path to the server. This connection request includes the known path to the server. When the server receives the request, it becomes aware of the path to the requesting client, as well as all intervening nodes. The server uses this information to respond to the request, and add the data to its routing table/client tree. In this system, each client elects to be part of a separate set of clients served by a single server. These sets of clients are referred to as Clusters. Thus, the network automatically partitions itself into multiple Clusters, one for each server. This is advantageous, since each server need only address a subset of the clients. This optimizes server capacity among the dusters, and decreases response delay experienced by the clients. Clients 230A-230E are coupled to the servers 220A-B, either directly or indirectly, through connections 250, 260. For one embodiment, connections 250, 260 are wireless connections. For another embodiment, the connections may be wired connections, or other types of connections. For one embodiment, there are a certain number of first level clients 230, which are coupled directly 250 to servers 220. Other clients 230 are coupled to the server 220 through one or more intermediate clients. When a server 220 broadcasts a beacon, it is received by all first-level clients. The beacon is used to establish a route from each client to the server. First level clients are defined by the fact that they receive data directly from the server. The first level clients re-broadcast the beacon data, attaching their own data to it. This indicates to the second level clients that the path to the server includes the first level client. This will be described in more detail below. For one embodiment, the link quality of the beacon received determines whether that beacon is rebroadcast by the system. If the quality of the beacon is good, it is rebroadcast. Otherwise, it is not. For one embodiment, link quality is determined by persistence, i.e. the number of times in the last several routing cycles that the particular beacon was received. For one embodiment, the link quality�reliability that a path to the server shown by the beacon will be available for a reasonable time�is built up as the beacon is received in every cycle. Whenever the beacon is not received in a cycle, the link quality associated with that path is decreased. The beacon is only transmitted if its link quality is sufficiently high. For another embodiment, the depth of re-broadcast is determined for the system. Thus, for example, a client may rebroadcast a beacon only if there are 5 or fewer hops between the client and the server. For another embodiment, other link quality factors, such as traffic congestion, battery status of upstream clients, thickness of the pipeline, backend (i.e. server) capacity, latency, or other factors may be used to determine whether the beacon should be rebroadcast. After a beacon is received by every client, every client has the address of an upstream client, which leads to the server. For one embodiment, each client also has a path to the server. A reverse beacon is then sent out through the clients, up to the server. The reverse beacon permits the server to establish a full client tree, enabling the server to access all clients. Furthermore, the reverse beacon informs each client what downstream nodes access the server through this client. Each client has at least one upstream node, and may have a plurality of downstream nodes. Upstream nodes are the nodes that are between the client and the server. For a Level One client, there is only one upstream node, the server. For a Level Four client, there are four upstream nodes, which define the client's path to the server. Downstream nodes are nodes that receive the beacon from a particular client, and define their path to the server through that client. Thus, for example, in a single branch that is: Server-A-B-C-D-E-F-G, for client D, the upstream nodes are C, B, A, Server, while the downstream nodes are E, F, and G. For another embodiment, the reverse beacon need not be sent. Not sending the reverse beacon means that the server can not initiate sending a message to a client. Rather, the server must wait for a request from the client. That request includes a path to the client. Also, the only method of client-to-client communication in such a system is by sending the message through the server. In some wireless systems this is sufficient because access to the server�which provides access to the general Internet�is the primary use. Although only a limited number of servers 220 and clients 230 are shown in The Server plays a central role in the discovery of routes by the Clients. At periodic intervals, the Server originates a �Beacon� which is broadcast to all Clients within hearing range of the Server. The time interval between successive broadcasts of the Beacon defines a routing cycle. The Beacon is a routing packet�a short data packet that contains the address of the server. For one embodiment, the Beacon includes the following information: (1) a sequence number which identifies which routing cycle it initiates, 2) the address (MAC or IP) of the Server, 3) a Traffic Monitoring Code (TMC). The use of the TMC will be described in more detail below. For one embodiment the TMC may be omitted. For one embodiment, the address of the Server may be included only in the Ethernet header or IP header of the beacon message. For one embodiment, the Server may add a hop-count counter set to 0. This hop counter is incremented by each client that rebroadcasts the beacon. This permits the receiving client to determine how many hops from the server it is. For one embodiment, the Beacon may contain only the sequence number of the message. All other relevant information may be captured in the Ethernet-level header and/or IP headers of the message. The Beacon is received by all Clients within direct hearing range of the Server. For one embodiment, in On receipt of the Beacon, each Level One Client 310, 330 has a path to connect to the server 300. For one embodiment, each of the Level One clients 310, 330 has the following data: (1) its connectivity to the Server, (2) a means to gain access to the Server (since it now knows the address of the Server and can direct transmissions to it), 3) the TMC of the Server. After a small delay, each Level One client 310, 330 rebroadcasts the Beacon, after appending to the Beacon its own address and TMC. For one embodiment, the delay is a random delay, such that not all Level One Clients broadcast at the same time. For one embodiment, the TMC data may be omitted. For one embodiment, the client may only increment a hop-count counter of the received beacon before rebroadcasting it. For another embodiment, the client may rebroadcast the Beacon unaltered. For one embodiment, the rebroadcast Beacon now contains (1) the sequence number, (2) the address of the server and its TMC, (2) the address of the Level One Client and its TMC. Alternatively, the beacon may only include a hop-count, and/or a sequence number. This Beacon is now received by all Clients that are two hops from the Server (Level Two Clients) 330, 360. On receipt of the Beacon, each Level Two Client 315, 335 now knows, for one embodiment, (1) that it has connectivity to the Server, (2) an explicit route to the next upstream client (the Level One Client whose broadcast it received), 3) the full path to the server through the upstream Level One Client and 4) the TMCs of the Server and the Level One Client from whom the broadcast was received. For one embodiment, each Level Two Client now knows (1) that it has connectivity to the Server and (2) an explicit route to the next upstream client. For one embodiment, each Level Two Client knows the number of hops to the Server 300 through the next upstream client. It may happen that a Level Two Client 315, 335 may receive Beacon rebroadcast from two or more Level One Clients. In this case, it will select one of the two proffered routes, and reject the other(s). For one embodiment, the route that has the best link quality is selected. As described above, the link quality, for one embodiment, includes the persistence of the beacon. For one embodiment, it may further include other link quality factors. For another embodiment, the route selected will be the one corresponding to the first heard rebroadcast, so that this scheme may be named �First-Heard Path Routing�. In another embodiment, described in more detail below, the TMC may be used to evaluate expected latency, and the path with the lowest latency may be selected. It may also happen that one of the Level One Clients (say A) 310 may receive the broadcast of one of the other Level One Clients (say H) 330. Client A 310, because it is at Level One, already knows a route to the server. On examining the sequence number of the transmission it receives from H 330, it knows to ignore this routing update, as it already has a current route with that sequence number. Each Client at Level Two now rebroadcasts the Beacon. For one embodiment, it rebroadcasts the Beacon after having appended its address and TMC to the Beacon. For one embodiment, it rebroadcasts the Beacon after having incremented the hop-count of the path back to the Server. For another embodiment, it rebroadcasts the Beacon unaltered. As discussed above, this optimal path or optimal Beacon may be selected based on link quality, priority in receiving the beacon, or based on another evaluation. By iteration of this process at each Level, each Client that has connectivity to the Server (i.e., that can link to the server through functional links potentially mediated by other Clients) becomes aware of its own connectivity to the server. For one embodiment, each Client knows a complete path to the Server. For another embodiment, each Client knows only the next upstream Client on way to the Server. For one embodiment, the clients only rebroadcast the beacons up to a specified Level. Thus, for example, a client that has more than ten hops to the server would not rebroadcast. In this instance, if a client is outside of the acceptable latency range of a server, it may not receive a path to the server. This may be indicated to the user, such that the user can either use an alternative means, or move the client. Since these systems are for wireless broadcast, this is the equivalent of being out of range. A mobile device may be moved back into range. Since the beacons are rebroadcast periodically, the next time that the wireless device is within range of a Beacon, it would again receive a path to the server. For one embodiment, each Client stores its discovered path to the Server in a temporary memory. For one embodiment, each Client only stores the address of its default gateway, the next upstream Client, in memory. When the reverse beacon is received, the client further learns all of the downstream clients whose routes to the server pass through this particular client. For one embodiment, the client also stores this information. For one embodiment the upstream and downstream paths are stored in a temporary memory. For one embodiment, the temporary memory is a route table. For another embodiment, the temporary memory may be a cache. It is to be noted that the size of the temporary memory is of the order of the number of clients connected to a particular client downstream, and the data of the upstream client which leads the client to the server. For another embodiment, the data in the memory is the actual path to the server, and the size of the memory is of the order of the length of the path to the server (number of hops to the Server). This is very small compared with traditional distance-vector protocols, link-state protocols, or their variants where the length of the routing table is of the order of the number of nodes (Clients) in the network. For instance, assuming a uniform density of nodes, the size of the path that needs to be stored in a Client's memory is of the order of the square root of N, where N is the number of nodes. The above-described method illustrates how nodes in the network (Clients) receive up-to-date information about their connectivity to the Server and a means to reach the Server. In the system of In one embodiment, the client, in response to the dummy reverse beacon, when it wishes to initiate communication, or upon receiving the beacon, initiates a downstream route setup procedure (DRS). The DRS will request that the server setup routes in its own routing table. The client node initiates a downstream route setup packet, for one embodiment, to its default gateway, asking it to forward the packet to the server. The default gateway is the next upstream node from the client. The default gateway for a Level One client is the server. The default gateway is the next upstream Client that the client uses to communicate with the server. It can be reset every time a beacon is received. The default gateway, upon receiving this DRS packet appends its IP address to the DRS packet, forwards it to its gateway, and sets up a route to the downstream clients whose addresses were included in the DRS in its routing table. This process continues, until the packet reaches the server. This path is used by the server to set up downstream routes to reach the clients along the path. For another embodiment, instead of sending only IP addresses, the reverse beacon includes a list of links, i.e. the relationship between the various clients in the branch. This will be discussed in more detail below. For another embodiment, each node periodically initiates a reverse beacon broadcast. This period is the KEEPALIVE period. For one embodiment, the timing of the start of the period is jittered, such that not all nodes initiate the reverse beacon at the same time. The reverse beacon includes a From address, the address of the initiating node, and a To address, which is the address of the node's default gateway. The node's default gateway, on receiving this reverse beacon adds the route to the initiating node to its routing table. It then passes on the reverse beacon after having added its address to it, as described above. Each client sends a single reverse beacon in each cycle, and aggregates other reverse beacons in the interim. Thus, if a client receives three reverse beacons, when it is time for the client to send its reverse beacon, it sends a single beacon to its default gateway, including all of the data from the three reverse beacons it received. Client F sends an Initiation Request (IR) to Client G. For one embodiment, the IR is a data packet that contains the path (F->G->H->S) in addition to a request addressed to the Server S to initiate a connection. Client G uses the path information contained in the IR to figure out whom to forward this packet to. In this example, Client G forwards the packet without change to Client H. Client H then forwards it to the Server S. On receipt of the IR, the Server knows how to get back to Client F, since it received the path F->G->H->S. The Server acknowledges receipt of the IR to Client F via the path (S->H->G>F). A two-way connection can be set up at this point. It should be emphasized that, at the end of a routing cycle, each Client that is currently part of the network knows its default gateway, which leads to the server. The client further is aware, for one embodiment, of all clients downstream from it that use this client to reach the server. For another embodiment, the client may know its entire route. For example, Client X's route might read (X->B->L->D->S). Furthermore, for one embodiment, Clients only know their own branch, i.e. its default gateway to the server, the path to the server, and the nodes downstream from it that use this client to access the server. This is to be viewed as a strength of the proposed routing protocol�in a network architecture wherein Clients seek to communicate with a server that controls access to a wired Internet, peer-to-peer connectivity is generally unnecessary. The larger the number of links or paths that need to be maintained by each Client, the more complex and harder to implement the protocol becomes, and the more wasteful it is of bandwidth. Thus, the advantage of reduced bandwidth and memory requirements outweighs the disadvantage of not having each client have a routing table that includes every other client. For one embodiment, as will be described in more detail below, the Server has a path to each of the Clients. Thus, client-to-client connectivity may be established through the Server. Block Diagrams The data processing system illustrated in The system may further be coupled to a display device 470, such as a cathode ray tube (CRT) or a liquid crystal display (LCD) coupled to bus 445 through bus 465 for displaying information to a computer user. An alphanumeric input device 475, including alphanumeric and other keys, may also be coupled to bus 445 through bus 465 for communicating information and command selections to processor 440. An additional user input device is cursor control device 480, such as a mouse, a trackball, stylus, or cursor direction keys coupled to bus 445 through bus 465 for communicating direction information and command selections to processor 440, and for controlling cursor movement on display device 470. Another device, which may optionally be coupled to computer system 430, is a communication device 490 for accessing other nodes of a distributed system via a network. The communication device 490 may include any of a number of commercially available networking peripheral devices such as those used for coupling to an Ethernet, token ring, Internet, or wide area network. Note that any or all of the components of this system illustrated in It will be appreciated by those of ordinary skill in the art that any configuration of the system may be used for various purposes according to the particular implementation. The control logic or software implementing the present invention can be stored in main memory 450, mass storage device 425, or other storage medium locally or remotely accessible to processor 440. Other storage media may include floppy disks, memory cards, flash memory, or CD-ROM drives. It will be apparent to those of ordinary skill in the art that the methods and processes described herein can be implemented as software stored in main memory 450 or read only memory 420 and executed by processor 440. This control logic or software may also be resident on an article of manufacture comprising a computer readable medium having computer readable program code embodied therein and being readable by the mass storage device 425 and for causing the processor 440 to operate in accordance with the methods and teachings herein. The software of the present invention may also be embodied in a handheld or portable device containing a subset of the computer hardware components described above. For example, the handheld device may be configured to contain only the bus 445, the processor 440, and memory 450 and/or 425. The handheld device may also be configured to include a set of buttons or input signaling components with which a user may select from a set of available options. The handheld device may also be configured to include an output apparatus such as a liquid crystal display (LCD) or display element matrix for displaying information to a user of the handheld device. Conventional methods may be used to implement such a handheld device. The implementation of the present invention for such a device would be apparent to one of ordinary skill in the art given the disclosure of the present invention as provided herein. The beacon logic 520 in server 510 periodically sends out a beacon, including the server's server ID 528. The server ID 528 is stored in memory 526. The beacons are timed by timer 524. For one embodiment, beacons are sent out periodically. In an alternate implementation, the periodicity of beacon broadcasts might be dynamically determined. For example, the periodicity may be determined based on network stability, or network age. For example, for a network in which the nodes are constantly moving, like a cellular telephone based network, the period may be shorter than the period for a network in which the nodes are generally stable, like generally stationary laptops. The period between beacons may be as little as a fraction of a second, or as long as many minutes. For one embodiment, the beacons are sent out every minute. The beacon is broadcast by wireless transceiver 515 to all clients within range of the broadcast. For one embodiment, the server 510 also receives a reverse beacon from the clients, indicating a path to each of the clients. The reverse beacon is used to generate a routing table. The routing table provides the server 510 with a known path to all clients. For one embodiment, the reverse beacon includes not only the addresses of each of the clients, but the links between the clients. Thus, instead of receiving merely addresses, the server 510 receives a path structure for each of the branches. The server 510 uses this to construct a client tree 540. The client tree 540 illustrates the entire network layout. Network monitoring logic 537 may use the client tree 540 construct a visual image of the cluster controlled by server 510, as well as of the relationship between nodes. This permits the network monitoring logic 537 to evaluate connectivity and quality as well. For one embodiment, the reverse beacon is initiated by the server 510, using dummy reverse beacon logic 522. A dummy reverse beacon is an indicator to a Level One client that the client should, within a preset period, respond with an actual reverse beacon. In general, the reverse beacon for a client at any level is initiated upon receipt of the overheard reverse beacon from its default gateway (in the case of level one clients, the default gateway is the server). For one embodiment, the dummy reverse beacon is used to synchronize timing, such that reverse beacon signals are not sent out at the same time by all clients. The server 510 is designed to receive requests from various clients. These requests, for one embodiment, include the path to the client. Thus, a temporary memory 543 stores the IP address of a client requesting something from the server. The request is fulfilled by request fulfillment logic 530, by accessing the wired network through wired network connection 535, using data within the server 510, or by forwarding the request to the appropriate client. When the server 510 receives a response to the request, it uses the path 546 from memory 543 to forward the response to the client 550 that requested the data. In this way, the server provides data to the clients 550, as well as a periodic beacon to permit a client 550 to determine its path to the server 510. Client 550 is coupled to the server 510 through network, either directly or through other clients. The network may be a wireless network, a switch-to-wired network, or another type of network. Client 550 includes a transceiver 555 for transmitting and receiving data over the network. For one embodiment, in a wireless network, transceiver 555 is a wireless transceiver. For another embodiment, client 550 may be coupled to server through a wired connection, in which case the logic illustrated as a wireless transceiver 550 may be a wired connection, such as a modem, Ethernet card, DSL connection, etc. Client 550 receives the beacon from the server 510, either directly or through other clients, and passes this data to server path logic 570. Server path logic 570 determines whether the path should be stored and rebroadcast. The client 550 may receive multiple beacons, but only rebroadcasts one beacon, in general. The matter of multiple servers and multiple beacons will be discussed in more detail below. Server path logic 570 determines which beacon to select as the path to the server. For one embodiment, this determination is made based on the link quality. Beacon quality evaluation logic 580 evaluates the link quality of each beacon received. For one embodiment, beacon quality evaluation 580 tracks all beacons received by the client 550, and determines reliability (number of times the beacon is heard within a period), link quality (signal-to-noise ratio), the level of congestion on the path, and possibly other features of the link. Each of these features is taken into consideration by server path logic 570 to determine which route 567 to store. For one embodiment, server path logic 570 evaluates data from previous routing cycles. The reliability of the beacon, i.e. how many times out of the last X times a beacon was sent was this beacon received, is used to determine whether this is the beacon that should be stored for this routing cycle. For another embodiment, an alternative criterion may be used by the server path logic 570 to determine whether to select this particular path. When the server path logic 570 identifies the beacon, the routing data associated with that beacon is stored in memory 565, in routing table 567. For one embodiment, within a preset period of time, only a single path to server is stored and rebroadcast. For another embodiment, each beacon is stored, and information is added to the routing table 567, but only a single beacon is rebroadcast. For yet another embodiment, for each server from whom a beacon is received, a path is stored, and the beacon is rebroadcast. This permits the client to have paths to multiple servers, which may be advantageous if a server becomes unavailable. Memory logic 575 then adds the client's own address and TMC to the beacon, and passes this data back to rebroadcast logic 560. The rebroadcast logic 560 passes the modified beacon to the wireless transceiver 555 after a delay. For one embodiment, delay is generated by random delay logic 562. For one embodiment, the delay is preset to a certain value, for each client 550. For another embodiment, the delay is randomly generated by random delay logic 562, for each rebroadcast. For another embodiment, random delay logic 562 may not be present. For one embodiment, client 550 further includes reverse beacon logic 585. Reverse beacon logic 585 broadcasts the path upwards to the client. For one embodiment, reverse beacon logic 585 is triggered when the reverse beacon is received from the default gateway of the client. The reverse beacon provides a list of all clients whose routes to the server pass through the client that broadcasts the reverse beacon to the server. Thus, the server receives a reverse beacon that contains routes to all of the clients, transmitted to the server only through the Level One clients. This provides a full path to all of the clients to the server, and permits the server to have a complete routing table, including all clients that are in its partition. For one embodiment, the clients only include in their routing table the default gateway toward the server, and the downstream clients on the same branch. Therefore, the memory and routing overhead requirements are limited, compared to a non-partitioned network. For another embodiment, the reverse beacon may be replaced by a downstream route setup (DRS) or an initiation request. Both of these processes are described in more detail below. The client 550 further includes logic to perform the standard client functions 590. These client functions depend on the individual client. For example, for a telephone, the standard client functions 590 may include dialing functions, address book functions, etc. Beacon Selection At block 620, the traffic monitoring code (TMC) of the server is calculated. The TMC indicates how timely requests were served from that server. For one embodiment, the TMC is simply an indication of the time between the receipt of a request and the response being sent, e.g. the delay of the server. For another embodiment, the TMC may indicate traffic load, e.g. how many requests were received over a period of time. For one embodiment, the TMC is a single number, which indicates a relative load and delay. For another embodiment, the TMC may not be calculated. At block 625, the server broadcasts the beacon to all the clients. The beacon includes the server's own address and the server's TMC, if appropriate. At block 630, a client determines whether it has received a beacon. For one embodiment, the client generally watches for all broadcasts, either directed to it, or directed to all clients. In this case, if the client detects the beacon, it continues to block 640. Otherwise, it continues waiting for a broadcast. At block 640, the client determines whether other beacon(s) have been received in this cycle. For one embodiment, the cycle is indicated by a sequence number. For one embodiment, each server has a sequence that it runs through. For one embodiment, if a client receives beacons from multiple servers, it stores both beacons, and selects the server to use for its requests based on the number of hops to the server and the TMC of the path. For another embodiment, the cycle is identified by time, and if multiple beacons from multiple servers are received, they are all compared, and only a single path is stored. In either case, only a single beacon is rebroadcast. This automatically partitions the network into distinct clusters administered by distinct servers. If there have been no other beacons in this cycle, the process continues to block 645. For one embodiment, this determination is only made after a sufficient amount of time has elapsed to collect all available beacons. At block 645, the client stores the path to the server, along with the TMC. For one embodiment, the client identifies as its default gateway the next upstream node, which leads to the server. At block 650, the client's own data is appended to the beacon. For one embodiment, the data includes the client's address and the client's own TMC. For another embodiment, only the client's address is included. At block 655, after a delay, the modified beacon is rebroadcast by the client. The client now has a valid path to the server, and also has passed on its data to all other clients within its broadcast range. At this point, the client can await the next beacon. If the client has requests for the server, the stored path may be used to send this request. This process is discussed in more detail below. If, at block 640, it was found that more than one beacon was received for a cycle, the process continued to block 660. At block 660, the paths are compared. For one embodiment, the first level of comparison is the number of hops between the client and the server. Thus, preference is given to Level One beacons, compared to Level Two, etc. For one embodiment, the TMC of the path is further compared. Thus, for example, having a Level Two beacon through an extremely busy client is not more useful than having a Level Three beacon through two underutilized clients. Therefore, for one embodiment, the TMC is considered, in addition to the level of the beacon. For one embodiment, the beacon reliability is further considered. Reliability indicates how often the beacon is heard. If a beacon is not heard regularly, e.g. fades out, it may not be reliable. Such a reliability rating may also be used in evaluating which beacon to select. For one embodiment, the link quality may further be used to evaluate the beacon. The link quality for one embodiment is the signal-to-noise ratio of the link. All of these factors, and additional factors that may be useful, may be taken into consideration when choosing a path. At block 665, the �optimal path� is chosen, based on preset criteria. There are several possible criteria for the selection of a beacon. For one embodiment, the criterion might be the reliability of the beacon (i.e., how many times a beacon was received on this path in the last N periods). For another embodiment, the criterion might be the strength of the link (which could be characterized, for instance, by the sum of the signal-to-noise ratios on each link in the path). For another embodiment, the criterion for the selection of a beacon might be the congestion experienced in the recent past along the path indicated by the beacon (for instance, this could be measured by the sum of the TMC bits for each node along the path from the Server). For another embodiment, this criterion might be the number of hops on the path to the Server. For one embodiment, this criterion might include a consideration of the amount of backhaul present at the Server originating the beacon, so that a Client might elect to belong to a Cluster wherein the Server has a larger back-end capacity. For one embodiment, this criterion might be the number of Clients in the Cluster, so that a Client may elect to join a Cluster that has the fewest member Clients. It will be apparent to one skilled in the art that any or all or a combination of the above proposed criteria could be used in a system. It will also be apparent that the above-mentioned criteria would apply to the selection by a Client of a beacon either in the context of a network with a single Server or one with multiple Servers. The process then continues to block 645. The process starts at block 670. This is a monitoring state. At block 672, a beacon is received. The routing number of this beacon is stored, along with the identity of the originating server. At block 674, the process determines whether the beacon is from the current default gateway. If the beacon is from the current default gateway, the process continues to block 676. At block 676, the time stamp on the current default gateway is updated. At block 678, the link quality data of the current default gateway is updated as well. Note that this is the beacon that will be rebroadcast, unless before it is time to rebroadcast, a new default gateway is set up. In that case, the new default gateway is the beacon that is rebroadcast. The process then returns to block 672, to await the receipt of another beacon. If, at block 674, it was found that the beacon was not from the default gateway, the process continued to block 680. At block 680, the process determines whether the link quality of the new beacon is better than link quality of the current default gateway. If it is not, the process continues to block 682. At block 682, the process determines whether the path indicated by the beacon is already in the database of paths. For one embodiment, all paths received via a beacon are stored. For one embodiment, periodically, the database is purged of beacons that have not been received in a preset period of time. If, the path has not yet been received, the process continues to block 684. At block 684, the new path is stored in the database. For one embodiment, the new path is stored including the number of hops to the server, as well as other parameters associated with the beacon. At block 686, the link quality of the beacon is stored with a time stamp. If the path is already in the database, at block 684, the process continues directly to block 686, where the link quality for the path is updated. For one embodiment, at block 686, if the beacon was from another server, the path identified by the beacon is set as an alternative default gateway. This permits the node to switch to the alternative server, if the server to whom the default gateway is connected becomes unavailable. The process then returns to block 672, to await the receipt of a new beacon. If, at block 680 the link quality is found to be better than that of the currently stored default gateway, the process continues to block 688. At block 688, the new route, as indicated by the beacon, is set in the route table. At block 690, the new default gateway is set up. The process then returns to block 672. Note that this new default gateway is rebroadcast by the client, the next time the client does a beacon rebroadcast. If the same default gateway's beacon was received, that default beacon is rebroadcast, the next time the client does the beacon rebroadcast. At block 710, a first client at the lowest tier sends a reverse beacon to its default gateway, including its address. The reverse beacon is directed to the server. For one embodiment, the client broadcasts this data, addressed to its default gateway. Thus, all other nodes receiving the message would discard it, while the default gateway would actually evaluate the message. For one embodiment, reverse beacons are special messages, and are sent addressed to a special port. This is what identifies a message as a reverse beacon. For one embodiment, the message is acknowledged by upstream client, the default gateway. At block 712, the default gateway, or current node, receives the reverse beacon. At block 715, the node that received the reverse beacon adds the links to the downstream client(s) to its routing table. For one embodiment, the links are first verified. This may be done by sending a message, and receiving acknowledgement, for each of the downstream clients. Thus, the downward branches of the tree on which the client resides are accessible from the client. At block 720, the process determines whether the current node is the target server. If the current node is not the server, the process returns to block 725. At block 725, the node sends the reverse beacon to its default gateway. The reverse beacon includes the client's own address, and the links to the downstream clients that are accessible through it, again addressed to the server. This constitutes, in effect, a full network diagram of the portion of the network below the current client. The process then returns to block 712, and the next node receives the reverse beacon, and the process continues. For one embodiment, each client collects the reverse beacons received from its downstream clients in one cycle, and sends up the combined list. In this way, clients successively higher up the chain send larger and larger messages, but each client still only sends one reverse beacon during each Reverse Beacon Period. For another embodiment, the client waits for a preset period of time before sending the messages. Not all downstream clients may have sent their reverse beacons. However, the additional data is included in the subsequent reverse beacon. If the node was the server at block 720, the process continues to block 730. At block 730, the server adds the data from the reverse beacon to its routing table. The server receives reverse beacons from all Level One clients. For one embodiment, the server constructs a client tree of all downstream clients. The client tree is a structure that shows the connections between the nodes in the entire cluster served by the particular client. The client tree uses the link data from the reverse beacon to construct this tree. Note that each branch is only aware of itself, however, the server receives reverse beacons from all branches. In other words, clients are aware of the full tree downstream, and only one client upstream. The server is also aware of the full client tree downstream. At block 735, the server stores the client tree. At this point, the server knows the path to all of the clients that have received its beacon. This permits client-to-client communications through the server. It also permits the server to address any client in its cluster, without having to wait for a request from the client. The process then ends at block 740. At block 760, the process determines whether the RBB is addressed to client A. If it is, then the process continues to block 792. At block 792, the links in the RBB�which were collected by the downstream client as explained above�are added to client A's buffer. This buffer will be used to construct the RBB sent upstream. At block 794, the connection to the downstream client that originated the RBB is refreshed. For one embodiment, the address of the client is added to the routing table of client A. The process then continues to block 784, where the system waits to send its reverse beacon broadcast, now including this link. Note that the process shown in blocks 755, 760, 792, and 794 occurs every time a new RBB is received by client A. If, at block 760, it was found that the RBB was not addressed to client A, the process continues to block 765. At block 765, the process determines whether the RBB was sent by the default gateway of client A. If not, the process continues to block 770, and the RBB is dropped without any further action. The process then ends at block 796. If, at block 765, it was found that the RBB was originated by A's default gateway, the process continues to block 780. At block 780, the dock is reset. This type of overheard RBB is used to synchronize the clock of client A. The benefit of performing clock synchronization is that information about changes to the network propagates up to the server much faster than otherwise. This reduces the convergence time of the protocol, which is advantageous. At block 782, client A sets the time for sending the reverse beacon broadcast to KEEPALIVE-�. The value of � indicates the changing time until the reverse beacon is sent. Client A will not originate a reverse beacon broadcast until the timer is started by the overheard RBB from client A's default gateway. At block 784, the process determines whether it is time for the client to send the RBB. If not, the process continues to block 786. At block 786, downstream RBB's are collected. This process is described with respect to blocks 792 and 794. Client A continues receiving RBB's and establishing connections, and adding links to its buffer. If, at block 784, the timer has expired, and its time to send the RBB, the process continues to block 788. At bock 788, client A sends the RBB addressed to its default gateway, with a request to pass the RBB to the server. The process then ends, at block 796. For one embodiment, the Level One client receives a dummy reverse beacon broadcast from the server, to initialize its dock. For one embodiment, the KEEPALIVE period for each client is varied by a small jitter factor, to prevent all clients at the same level from broadcasting at the same time. In this way, the reverse beacon is propagated up through the clients, and each client only sends a single reverse beacon broadcast in a single cycle. The length of the cycle may be set arbitrarily. For one embodiment, the reverse beacon cycle corresponds to the length of the beacon cycle. For another embodiment, the reverse beacon cycle may be set to another value. For example, in a largely stable system, the reverse beacon cycle may be one hour, while in an unstable system, the reverse beacon cycle may be considerably less than a minute. Using Alternative Methods to Set Up Path from Server to Client At block 815, the client sends a packet to its default gateway, addressed to the server, including its full path. If this is a DRS method, this occurs in response to receiving a beacon. For one embodiment, if the client is set up to communicate its data using a DRS, a preset period of time after it receives the beacon, it sends this DRS packet addressed to the server. If this is an IR method, this occurs in response to a client having a request for the server. This request includes the full path to the client, as well as any request, if appropriate. At block 820, the upstream node receives the packet. At block 825, this node refreshes its route to the client from whom it received the packet, or sets up a new link, if the client was not in its routing table yet. The client also adds any intermediate clients that were included in the full path from the client. At block 830, the process determines whether the current node is the server. If not, the process continues to block 835. At block 835, the node sends on the packet to its default gateway, including its own information. This process is repeated, until the server receives the packet. If the node is the server, the process continues to block 840. At block 840, the server creates a client tree, indicating the structure of its cluster. The server further performs any appropriate actions, if the packet was an IR packet, and there is a client request in this packet. At this point, the server has a full path to the client that originated the packet. As such packets are received, more and more of the routing table can be filled in. The process ends at block 845. The process starts at block 850. At block 855, the client receives its beacon. The beacon includes the full path from the server to the client, including all intermediate nodes. At block 860, the client determines that it has a request for the server. For one embodiment, this is a standard request. At block 865, the client sends a standard data packet to its default gateway. This data packet includes the full route from the client to the server. At block 870, the default gateway of the client receives the data packet, and examines it to determine whether it is the destination. If the current node is the ultimate destination of the data packet, the process continues to block 875. Otherwise, the current node examines the data packet, and sends it to the next indicated node in the route, which is its default gateway. The process then returns to block 870. At block 875, the ultimate destination, which in general is the server, receives the data packet, and processes it, as appropriate. The processing of data packets is known in the art. For one embodiment, the destination node returns data requested by the client. Other processes requested by the client may be performed, as appropriate. The process then ends, at block 880. Note that in this system, the intermediate clients do not set up routing tables, adding the links indicated by the data packet. Thus, each individual data packet must include the full route to the server. For one embodiment, the server does set up a client tree and routing table. For another embodiment, the server need not set this up, since the reply path is specified in each data packet. Broadcast range 920 is illustrated for client C17. As can be seen, the broadcasts of client C17 are received by many clients, including some clients that are on other branches. However, the clients who are on other branches, i.e. C23 and C14, ignore the broadcast from C17, since they already have a shorter path to the server. The three clients that have C17 as their default gateway are all reached by the broadcast. Routing tables 930, 940 further illustrate the reduction in communication resulting from dividing the system into independent branches. As can be seen, terminating client C3 (a client with no downstream clients coupled to it), has only a single entry in its routing table 930, it's default gateway. Upstream client C2 has all of its downstream clients, i.e. C3-C6 in its routing table 940, in addition to its default gateway, C1. For each downstream client, C2 has in its routing table 940 a first hop address. Accordingly, the largest routing table at a client in the example shown is the table of C1. C1 has as its default gateway the server S. C1, however, also has downstream routes to clients C2-C6. Therefore, the largest routing table, including default gateway, is six addresses. Compare this to a standard system in which each client has an entry for each other client, i.e. each routing table for each client includes 23 entries in this example. By significantly reducing the routing table size at the clients, considerable bandwidth is saved in this system. Note that certain clients, for example, client I, receive beacons from multiple servers. For one embodiment, each client determines which single beacon to rebroadcast. However, for one embodiment, the clients store the beacons from each of the servers. For one embodiment, this permits a client that has an alternative path available to use that alternative path, if the first chosen path does not work. This property of the network of auto-partitioning itself into Clusters to optimally use the available backhaul at the Servers also has the added benefit of making the network more scalable and easier to manage. The network is more scalable because each Cluster is effectively a separate routing domain. The clients of a single Cluster do not need to exchange routing packets with those of other Clusters. This means that the routing overhead in terms of bandwidth is capped, leading to a more efficient utilization of the capacity of the network. Simultaneously, the creation of Clusters means that each Server is only responsible for the small number of Clients within its Cluster, so that the network management problem associated with administering and coordinating the Clients is broken up into bite-sized chunks that each Server can handle. This is especially advantageous if the Servers have limited processing capabilities. For one embodiment, each server in this architecture performs one or more of the following functions: client authentication, billing, network monitoring, bandwidth provisioning, and guaranteeing a certain level of Quality of Service (QoS) for the Clients in its Cluster. Client Authentication is the process whereby a Server verifies the identity and access privileges of a new Client that joins its Cluster. Billing includes the tracking of network usage by each Client. For example, for billing the server may maintain a table of its Clients and the amount of the data they have uploaded/downloaded in the last billing period. Network monitoring includes maintaining, in real-time, a map of the network that displays the Clients currently in the Cluster and their mutual connectivity. The Client Tree/Client Database maintained by the Server may be used to generate a map that shows the state of the network in real-time. This would be useful for monitoring the status and activity of the network and the traffic flows within it and would be valuable to a service-provider managing a network of customers. It would also serve a role in fault-isolation�if a node were to crash or a link were to fail, thereby resulting in loss of service to one or more customers, the service-provider may consult the map to locate the source of the outage. It is readily seen that each of these functions performed by the Server increases in complexity as the size of the network administered by the Server grows. An advantage of the network architecture and routing protocol presented herein lies in the observation that the creation of Clusters leads to a reduction in the workload of each Server. For instance, in a situation with one Server and 100 Clients, if an additional Server is introduced into the network, the workload of each Server is halved, since each is now only managing 50 Clients. This, of course, assumes that the servers have the same capacity. Since each individual client evaluates which server to select, if one server has a higher capacity than the others, then one cluster would be larger than the other. A further advantage of this network architecture is the support it provides for roaming of users within the coverage area. If a Client system that is mobile wanders around within the area of a single Cluster, its path to the Server (hence its route table) undergoes changes on the time scale set by the routing period. If the routing period is sufficiently small, say 1 second, the change of route will not lead to a noticeable drop in performance as measured by speed of downloads or latency of transfers, etc. At block 1120, the client stops receiving beacons from server X. This occurs when the client is out of the reach of the beacons of Server X. For one embodiment, the client need not actually stop receiving beacons. Rather, the beacons from server X may be of inadequate quality for use. At block 1130, the client starts receiving beacons from server Y, either directly or relayed through clients in cluster Y. The client may have received beacons from cluster Y previously, but has selected server X as its primary route to the network. Therefore, since at this point the client is no longer receiving beacons from server X, server Y is selected as the primary server. At block 1140, the route to Server X and to all Clients in Cluster X expires or becomes stale. For one embodiment, this occurs after a preset period of time. For example, this may occur after three beacon cycles, in which no beacon is received from server X. For one embodiment, the client may delete these routes from its routing table, when they expire. For another embodiment, the client may store these routes for a period of time beyond their expiration date, for link quality evaluation purposes. At block 1150, the client generates a new route table based on the routing packets received while in Cluster Y. This route table comprises direct and indirect routes to Server Y and to certain Clients in Cluster Y as determined by the routing protocol. This process of acquiring data to fill in the routing table was discussed in more detail above. At this point, the client again has connectivity to the server. The process then ends at block 1160. The process described above need not occur in this order. Rather, each of the steps may occur in any order, after the client moves from an area where server X is the primary selected server, to an area where that is not the case. In this way the routing protocol results in the generation of a new routing table in the Client as it moves from one Cluster to another. Since the sequence of steps outlined can be made to happen arbitrarily fast, there may be no consequent disruption in the user experience. The routing protocol therefore supports roaming, in much the same fashion as is common in cellular telephone networks, the key difference being that this is achieved here in the context of a multi-hop data network. Roaming of a Client from one Cluster to another is one situation in which the membership of a Cluster may change. Another situation in which this might happen occurs when a new Server is added to the network. In this case the added Server starts its own Cluster and some of the Client members of the old Cluster now form associations with the new Server, thereby resulting in two Clusters where only one existed previously. The way in which the network reconfigures itself through the creation of new Clusters and fragmentation of old ones in response to the addition of new Server or backhaul points is a feature of this routing protocol. This feature has the advantage that it enables the network to quickly adjust itself to optimally make use of the available backhaul. Backhaul is the bandwidth and data processing capability of the server, with which the client communicates. This is of obvious benefit to a service-provider seeking to increase the capacity of the network. Another situation in which the membership of Clusters might change is one where a Client radio is connected to a wired connection so that it now has both a wired and a wireless connection. This means that the Client in question becomes a Server and can start advertising its service through beacons. This will lead to a Cluster forming around this new Server in a way analogous to that outlined in the previous paragraph. The utility of this is that a service-provider in a dense urban area with a large number of customers can, for instance, choose to upgrade one or more of the customers to Servers by giving them, in addition, a wired connection such as a DSL line or a T1 line. The network then readjusts itself to take advantage of the newly introduced wired backhaul. This is a convenient way for a service-provider to increase network capacity. The ability to seamlessly add additional capacity�either through the introduction of new Servers/Access Points, or through upgrading a Client to a Server by provisioning a wired connection at their home�is of obvious benefit to a service-provider providing wireless internet access to a population of customers. It gives the service-provider a way to easily increase the capacity of the network in proportion to the demand by adding new backhaul points wherever desired in the network. In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from broader spirit and scope of the invention as set forth in the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather a restrictive sense. Patent Citations
Non-Patent Citations
Referenced by
Rotate |


text:
India's relaxation of foreign investment rules, aimed at drawing funds needed to turn around slowing economic growth and support a crumbling rupee, barely lifted markets on Wednesday due to doubts whether long-term inflows would materialise anytime soon.
Prime Minister Manmohan Singh eased FDI rules late on Tuesday for several industries, including insurance and telecoms, although some of the liberalisation measures fell short of expectations or came with caveats.
The long-pending move to increase the foreign direct investment (FDI) cap in insurance from 26 to 49 percent, for example, still needs approval from parliament, where a bill has been stuck for months.
The measures came a day after the central bank mounted a defence of the rupee by tightening liquidity and lifting short-term interest rates, in order to make speculation against the currency more difficult.
Those moves helped to slightly steady a currency that has lost 9 percent against the dollar since the start of May, making it the worst performer among emerging Asian currencies tracked by Reuters.
But they also sent bond yields soaring and raised worries that the increased costs to borrowers will crimp growth already at a decade low of 5 percent.
"FDI easing only makes it easier for foreign investors to put their money in India, but it doesn't change the fundamentals that determines whether it is a good idea to put money in India in the first place," said Nizam Idris, head of fixed income and currency strategy at Macquarie in Singapore.
Worryingly for investors, Singh's weak coalition government has struggled to push through reforms and has limited firepower for further measures as it faces elections by May.
Among the steps announced on Tuesday, the foreign investment cap in telecoms, which stood at 74 percent, was removed. But the measure was not expected to draw fresh entrants as the cut-throat industry is already crowded, and plagued by regulatory uncertainty.
Instead, existing foreign operators such as Vodafone Group Plc, Telenor ASA and Sistema may opt eventually to buy out their local partners.
"I'm not aware that there are any foreign companies who have said that they are hindered because the country doesn't allow 100 percent FDI," said Mahesh Uppal, director at telecoms consulting firm Com First (India).
"I think resolution of regulatory issues would be far more important for any investor, foreign and Indian," he said.
Indian stocks were up about 0.6 percent on Wednesday, but Bharti Airtel and Idea Cellular gave up initial gains to fall later in the session, although Reliance Communications Ltd was up 1 percent.
Having opened steadier than Tuesday's close of 59.31/32 per dollar, the rupee went on to ease slightly to 59.40/41.
It hit a record low of 61.21 to the dollar on July 8, as a sea-change in global investment trends over the past few months has seen funds flow out of emerging markets, rendering those with high current account deficits, like India, particularly vulnerable.
The 10-year bond yield, however, continued to rise, gaining 5 basis points to 8.12 percent after yields surged 52 bps on Tuesday.
The RBI's tightening measures also led to a surge in redemption requests for mutual funds, forcing the central bank to provide a special funding facility for them in a move last taken during the financial crisis in 2008.
Although the government hopes its latest reforms attract long term capital flows, previous measures have had mixed results, and FDI fell to $36.9 billion in the fiscal year ending in March from $46.6 billion the previous year.
A move last September to allow foreign direct investment in supermarkets has not attracted a single proposal, as rules continue to be ironed out.
Liberalisation of the aviation sector, on the other hand, has yielded investment plans from Malaysia's AirAsia and Etihad of Abu Dhabi. Etihad's planned investment in India's Jet Airways has been bogged down by the concerns of Indian regulators over specifics of the deal.
If Singh's government loses the election next year, some reforms, such as supermarket liberalisation, could be reversed.
"There are plenty of sectors where limit is still not exhausted, and it is not that FDI is waiting at the door to get in as soon as rules change," Jyotheesh Kumar, executive vice president at HDFC Securities, wrote in a note.
"There are also doubts that measures taken by this government may be rolled back or reversed if the next government with a different mind-set comes to power."


text:
The feeling of friendship is like that of being comfortably filled with roast beef; love, like being enlivened with champagne.
Samuel Johnson
To feel valued, to know, even if only once in a while, that you can do a job well is an absolutely marvelous feeling.
Barbara Walters
The biggest disease today is not leprosy or tuberculosis, but rather the feeling of being unwanted.
Mother Teresa
Friends can help each other. A true friend is someone who lets you have total freedom to be yourself - and especially to feel. Or, not feel. Whatever you happen to be feeling at the moment is fine with them. That's what real love amounts to - letting a person be what he really is.
Jim Morrison
Feeling sorry for yourself, and your present condition, is not only a waste of energy but the worst habit you could possibly have.
Dale Carnegie
A man who has been the indisputable favorite of his mother keeps for life the feeling of a conqueror.
Sigmund Freud
If a man has been his mother's undisputed darling he retains throughout life the triumphant feeling, the confidence in success, which not seldom brings actual success along with it.
Sigmund Freud
We conceal it from ourselves in vain - we must always love something. In those matters seemingly removed from love, the feeling is secretly to be found, and man cannot possibly live for a moment without it.
Blaise Pascal


text:
Quality CareFind out why Mayo Clinic is the right place for your health care. Make an appointment.
Meet the StaffFind a directory of doctors and departments at all Mayo Clinic campuses. Visit now.
Research and Clinical TrialsSee how Mayo Clinic research and clinical trials advance the science of medicine and improve patient care. Explore now.
Visit Our SchoolsEducators at Mayo Clinic train tomorrow's leaders to deliver compassionate, high-value, safe patient care. Choose a degree.
Professional ServicesExplore Mayo Clinic's many resources and see jobs available for medical professionals. Get updates.
Give to Mayo ClinicHelp set a new world standard in care for people everywhere. Give now.
The specific aim of this project is to use high-resolution magnetic resonance elastography acquisition, including improved algorithms for processing magnetic resonance elastography data, to characterize meningioma stiffness.
Studies at Mayo Clinic and elsewhere have demonstrated that magnetic resonance elastography is a reliable method for diagnosing hepatic fibrosis and offers a safer, more comfortable, less expensive and potentially more accurate alternative to liver biopsy for many patients.
Recently, magnetic resonance elastography has shown promise for diffuse brain diseases. The investigators have determined that 3-D magnetic resonance elastography of the brain can be performed reproducibly and demonstrates significantly reduced brain tissue stiffness in people with Alzheimer's disease.
The goal of this project is to further test the hypothesis that magnetic resonance elastography stiffness measurements of myofascial taut bands are repeatable and that magnetic resonance elastography is sensitive to changes resulting from manual therapies.
A preliminary study by the investigators has, for the first time, imaged myofascial taut bands based on their stiffness values. This was accomplished using magnetic resonance elastography. If the magnetic resonance elastography technique is repeatable and sensitive, it can be used to assess the efficacy of manual therapies in future studies.