home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.dcom.cell-relay
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!saimiri.primate.wisc.edu!sdd.hp.com!spool.mu.edu!umn.edu!csus.edu!netcom.com!netcomsv!butch!iscnvx!news
- From: myoung@force.ssd.lmsc.lockheed.com
- Subject: Path Building
- Message-ID: <1992Dec17.211811.6553@iscnvx.lmsc.lockheed.com>
- Sender: news@iscnvx.lmsc.lockheed.com (News)
- Reply-To: myoung@force.ssd.lmsc.lockheed.com
- Organization: LMSC, Sunnyvale, California
- Date: Thu, 17 Dec 92 21:18:11 GMT
- Lines: 23
-
- OK, I have a problem here:
-
- I am a migrating process, and am currently sitting at memory
- associated with a file containing objects of a certain class.
- I have arrived here via a series of exploratory hops from data node
- to data node, moving at each step when the local data met some
- condition (I am a query moving through data).
-
- Now, having found the data I desire, I want to link this data directly
- back to the location in memory where I started, thus building a memory
- to memory VCI to satisfy my query. Hence, I need to build a virtual path
- back to the locations from whence I came, but I have no global knowledge
- about where I am, I have only a series of traces taking me from information
- node to information node back to the source of my travels.
-
- Problem: I want to traverse back over my path, closing out any
- loops appearing along the way back, possibly performing some local
- optimization between hops looking for shorter paths. This backward
- path I traverse, takes me back through switches, processors, and files
- contained at processors, updating the virtual path along the way.
-
- Don't tell me that a hidden hand in the network management will do this
- for me, as that just begs the question.
-