close Warning: Can't use blame annotator: 
No changeset 2259 in the repository

source: source/ariba/overlay/modules/chord/Chord.cpp@ 6835

Last change on this file since 6835 was 6832, checked in by Christoph Mayer, 15 years ago

-kleine fixes
File size: 14.2 KB
RevLine 
1// [License]
2// The Ariba-Underlay Copyright
3//
4// Copyright (c) 2008-2009, Institute of Telematics, UniversitÀt Karlsruhe (TH)
5//
6// Institute of Telematics
7// UniversitÀt Karlsruhe (TH)
8// Zirkel 2, 76128 Karlsruhe
9// Germany
10//
11// Redistribution and use in source and binary forms, with or without
12// modification, are permitted provided that the following conditions are
13// met:
14//
15// 1. Redistributions of source code must retain the above copyright
16// notice, this list of conditions and the following disclaimer.
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// THIS SOFTWARE IS PROVIDED BY THE INSTITUTE OF TELEMATICS ``AS IS'' AND
22// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
24// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE ARIBA PROJECT OR
25// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
26// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
27// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
28// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
29// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
30// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
31// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32//
33// The views and conclusions contained in the software and documentation
34// are those of the authors and should not be interpreted as representing
35// official policies, either expressed or implied, of the Institute of
36// Telematics.
37// [License]
38
39#include "ariba/overlay/BaseOverlay.h"
40#include "ariba/overlay/messages/OverlayMsg.h"
41
42#include "Chord.h"
43#include "detail/chord_routing_table.hpp"
44
45#include "messages/Discovery.h"
46
47namespace ariba {
48namespace overlay {
49
50enum signalMessageTypes {
51 typeDiscovery = OverlayMsg::typeSignalingStart + 0x01,
52 typeLeave = OverlayMsg::typeSignalingStart + 0x02,
53};
54
55typedef chord_routing_table::item route_item;
56
57use_logging_cpp( Chord );
58
59Chord::Chord(BaseOverlay& _baseoverlay, const NodeID& _nodeid,
60 OverlayStructureEvents* _eventsReceiver, const OverlayParameterSet& param) :
61 OverlayInterface(_baseoverlay, _nodeid, _eventsReceiver, param) {
62
63 // create routing table
64 this->table = new chord_routing_table(_nodeid, 4);
65 orphan_removal_counter = 0;
66 discovery_count = 0;
67 stabilize_counter = 0;
68 stabilize_finger = 0;
69}
70
71Chord::~Chord() {
72
73 // delete routing table
74 delete table;
75}
76
77/// helper: sets up a link using the base overlay
78LinkID Chord::setup(const EndpointDescriptor& endpoint, const NodeID& remote ) {
79
80 // check if we already have a connection
81 for (int i=0; i<table->size(); i++)
82 if ((*table)[i]->ref_count > 0 && (*table)[i]->id == remote && !((*table)[i]->info.isUnspecified()))
83 return LinkID::UNSPECIFIED;
84
85 // check if we are already trying to establish a link
86 for (size_t i=0; i<pending.size(); i++)
87 if ( pending[i] == remote ) {
88 logging_debug("Already trying to establish a link to node "
89 << remote.toString() );
90 return LinkID::UNSPECIFIED;
91 }
92
93 // adding node to list of pending connections
94 pending.push_back( remote );
95
96 logging_info("Request to setup link to " << endpoint.toString() );
97
98 // establish link via base overlay
99 return baseoverlay.establishLink( endpoint, remote,
100 OverlayInterface::OVERLAY_SERVICE_ID );
101}
102
103/// helper: sends a message using the "base overlay"
104seqnum_t Chord::send( OverlayMsg* msg, const LinkID& link ) {
105 if (link.isUnspecified()) return 0;
106 return baseoverlay.send_link( msg, link );
107}
108
109/// sends a discovery message
110void Chord::send_discovery_to(const NodeID& remote, int ttl) {
111 LinkID link = getNextLinkId(remote);
112 if ( remote == nodeid || link.isUnspecified()) return;
113 if ( table->size() == 0 ) return;
114 ttl = 2;
115
116 OverlayMsg msg( typeDiscovery );
117 msg.setRegisterRelay(true);
118 Discovery dmsg( Discovery::normal, (uint8_t)ttl, baseoverlay.getEndpointDescriptor() );
119 msg.encapsulate(&dmsg);
120
121 // send to node
122 baseoverlay.send_node( &msg, remote );
123}
124
125void Chord::discover_neighbors( const LinkID& link ) {
126 uint8_t ttl = 1;
127 {
128 // send predecessor discovery
129 OverlayMsg msg( typeDiscovery );
130 msg.setRegisterRelay(true);
131 Discovery dmsg( Discovery::predecessor, ttl,
132 baseoverlay.getEndpointDescriptor() );
133 msg.encapsulate(&dmsg);
134 send(&msg, link);
135 }
136 {
137 // send successor discovery
138 OverlayMsg msg( typeDiscovery );
139 msg.setSourceEndpoint( baseoverlay.getEndpointDescriptor() );
140 msg.setRegisterRelay(true);
141 Discovery dmsg( Discovery::successor, ttl,
142 baseoverlay.getEndpointDescriptor() );
143 msg.encapsulate(&dmsg);
144 send(&msg, link);
145 }
146}
147
148
149void Chord::createOverlay() {
150}
151
152void Chord::deleteOverlay() {
153
154}
155
156void Chord::joinOverlay(const EndpointDescriptor& boot) {
157 logging_info( "joining Chord overlay structure through end-point " <<
158 (boot.isUnspecified() ? "local" : boot.toString()) );
159
160 // initiator? no->setup first link
161 if (!boot.isUnspecified())
162 bootstrapLinks.push_back( setup(boot) );
163
164 // timer for stabilization management
165 Timer::setInterval(1000);
166 Timer::start();
167}
168
169void Chord::leaveOverlay() {
170 Timer::stop();
171 for (size_t i = 0; i < table->size(); i++) {
172 route_item* it = (*table)[i];
173 OverlayMsg msg( typeLeave );
174 send( &msg, it->info );
175 }
176}
177
178/// @see OverlayInterface.h
179const EndpointDescriptor& Chord::resolveNode(const NodeID& node) {
180 const route_item* item = table->get(node);
181 if (item == NULL || item->info.isUnspecified()) return EndpointDescriptor::UNSPECIFIED();
182 return baseoverlay.getEndpointDescriptor(item->info);
183}
184
185/// @see OverlayInterface.h
186bool Chord::isClosestNodeTo( const NodeID& node ) {
187 return table->is_closest_to(node);
188}
189
190/// @see OverlayInterface.h
191const LinkID& Chord::getNextLinkId( const NodeID& id ) const {
192 // get next hop
193 const route_item* item = table->get_next_hop(id);
194
195 // returns a unspecified id when this is itself
196 if (item == NULL || item->id == nodeid)
197 return LinkID::UNSPECIFIED;
198
199 /// return routing info
200 return item->info;
201}
202
203OverlayInterface::NodeList Chord::getKnownNodes(bool deep) const {
204 OverlayInterface::NodeList nodelist;
205
206 if( deep ){
207 // all nodes that I know, fingers, succ/pred
208 for (size_t i = 0; i < table->size(); i++){
209 if ((*table)[i]->ref_count != 0
210 && !(*table)[i]->info.isUnspecified())
211 nodelist.push_back((*table)[i]->id);
212 }
213 } else {
214 // only succ and pred
215 if( table->get_predesessor() != NULL ){
216 nodelist.push_back( *(table->get_predesessor()) );
217 }
218 if( table->get_successor() != NULL ){
219 OverlayInterface::NodeList::iterator i =
220 std::find( nodelist.begin(), nodelist.end(), *(table->get_successor()) );
221 if( i == nodelist.end() )
222 nodelist.push_back( *(table->get_successor()) );
223 }
224 }
225
226 return nodelist;
227}
228
229/// @see CommunicationListener.h
230/// @see OverlayInterface.h
231void Chord::onLinkUp(const LinkID& lnk, const NodeID& remote) {
232 logging_info("link_up: link=" << lnk.toString() << " remote=" <<
233 remote.toString() );
234 for (vector<NodeID>::iterator i=pending.begin(); i!=pending.end(); i++)
235 if (*i == remote) {
236 pending.erase(i);
237 break;
238 }
239
240 if (remote==nodeid) {
241 logging_warn("dropping link that has been established to myself (nodes have same nodeid?)");
242 baseoverlay.dropLink(lnk);
243 return;
244 }
245
246 route_item* item = table->insert(remote);
247
248 // item added to routing table?
249 if (item != NULL) { // yes-> add to routing table
250 logging_info("new routing neighbor: " << remote.toString()
251 << " with link " << lnk.toString());
252 // replace with new link
253 if (item->info!=lnk && item->info.isUnspecified()==false)
254 baseoverlay.dropLink(item->info);
255 item->info = lnk;
256
257 // discover neighbors of new overlay neighbor
258 showLinks();
259 } else { // no-> add orphan entry to routing table
260 logging_info("new orphan: " << remote.toString()
261 << " with link " << lnk.toString());
262 table->insert_orphan(remote)->info = lnk;
263 }
264
265 // erase bootstrap link
266 vector<LinkID>::iterator it = std::find(bootstrapLinks.begin(), bootstrapLinks.end(), lnk);
267 if( it != bootstrapLinks.end() ) bootstrapLinks.erase( it );
268}
269
270/// @see CommunicationListener.h or @see OverlayInterface.h
271void Chord::onLinkDown(const LinkID& lnk, const NodeID& remote) {
272 logging_debug("link_down: link=" << lnk.toString() << " remote=" <<
273 remote.toString() );
274
275 // remove link from routing table
276 route_item* item = table->get(remote);
277 if (item!=NULL && item->info==lnk) {
278 item->info = LinkID::UNSPECIFIED;
279 table->remove(remote);
280 }
281}
282
283/// @see CommunicationListener.h
284/// @see OverlayInterface.h
285void Chord::onMessage(const DataMessage& msg, const NodeID& remote,
286 const LinkID& link) {
287
288 // decode message
289 OverlayMsg* m = dynamic_cast<OverlayMsg*>(msg.getMessage());
290 if (m == NULL) return;
291
292 // handle messages
293 switch (m->getType()) {
294
295 // discovery request
296 case typeDiscovery: {
297 // decapsulate message
298 Discovery* dmsg = m->decapsulate<Discovery> ();
299 logging_debug("Received discovery message with"
300 << " src=" << m->getSourceNode().toString()
301 << " dst=" << m->getDestinationNode().toString()
302 << " ttl=" << (int)dmsg->getTTL()
303 << " type=" << (int)dmsg->getType()
304 );
305
306 // add discovery node id
307 bool found = false;
308 BOOST_FOREACH( NodeID& value, discovery )
309 if (value == m->getSourceNode()) {
310 found = true;
311 break;
312 }
313 if (!found) discovery.push_back(m->getSourceNode());
314
315 // check if source node can be added to routing table and setup link
316 if (m->getSourceNode() != nodeid)
317 setup( dmsg->getEndpoint(), m->getSourceNode() );
318
319 // delegate discovery message
320 switch (dmsg->getType()) {
321
322 // normal: route discovery message like every other message
323 case Discovery::normal: {
324 // closest node? yes-> split to follow successor and predecessor
325 if ( table->is_closest_to(m->getDestinationNode()) ) {
326 logging_debug("Discovery split:");
327 if (!table->get_successor()->isUnspecified()) {
328 OverlayMsg omsg(*m);
329 dmsg->setType(Discovery::successor);
330 omsg.encapsulate(dmsg);
331 logging_debug("* Routing to successor "
332 << table->get_successor()->toString() );
333 baseoverlay.send( &omsg, *table->get_successor() );
334 }
335
336 // send predecessor message
337 if (!table->get_predesessor()->isUnspecified()) {
338 OverlayMsg omsg(*m);
339 dmsg->setType(Discovery::predecessor);
340 omsg.encapsulate(dmsg);
341 logging_debug("* Routing to predecessor "
342 << table->get_predesessor()->toString() );
343 baseoverlay.send( &omsg, *table->get_predesessor() );
344 }
345 }
346 // no-> route message
347 else {
348 baseoverlay.route( m );
349 }
350 break;
351 }
352
353 // successor mode: follow the successor until TTL is zero
354 case Discovery::successor:
355 case Discovery::predecessor: {
356 // reached destination? no->forward!
357 if (m->getDestinationNode() != nodeid) {
358 OverlayMsg omsg(*m);
359 omsg.encapsulate(dmsg);
360 omsg.setService(OverlayInterface::OVERLAY_SERVICE_ID);
361 baseoverlay.route( &omsg );
362 break;
363 }
364
365 // time to live ended? yes-> stop routing
366 if (dmsg->getTTL() == 0 || dmsg->getTTL() > 10) break;
367
368 // decrease time-to-live
369 dmsg->setTTL(dmsg->getTTL() - 1);
370
371 const route_item* item = NULL;
372 if (dmsg->getType() == Discovery::successor &&
373 table->get_successor() != NULL) {
374 item = table->get(*table->get_successor());
375 } else {
376 if (table->get_predesessor()!=NULL)
377 item = table->get(*table->get_predesessor());
378 }
379 if (item == NULL)
380 break;
381
382 logging_debug("Routing discovery message to succ/pred "
383 << item->id.toString() );
384 OverlayMsg omsg(*m);
385 omsg.encapsulate(dmsg);
386 omsg.setDestinationNode(item->id);
387 omsg.setService(OverlayInterface::OVERLAY_SERVICE_ID);
388 baseoverlay.send(&omsg, omsg.getDestinationNode());
389 break;
390 }}
391 delete dmsg;
392 break;
393 }
394
395 // leave
396 case typeLeave: {
397 if (link!=LinkID::UNSPECIFIED) {
398 route_item* item = table->get(remote);
399 if (item!=NULL) item->info = LinkID::UNSPECIFIED;
400 table->remove(remote);
401 baseoverlay.dropLink(link);
402 }
403 break;
404 }}
405}
406
407void Chord::eventFunction() {
408 stabilize_counter++;
409 if (stabilize_counter < 0 || stabilize_counter == 2) {
410
411 // reset counter
412 stabilize_counter = 0;
413
414 // clear pending connections
415 pending.clear();
416
417 // get number of real neighbors
418 size_t numNeighbors = 0;
419 for (size_t i = 0; i < table->size(); i++) {
420 route_item* it = (*table)[i];
421 if (it->ref_count != 0 && !it->info.isUnspecified()) numNeighbors++;
422 }
423 logging_info("Running stabilization: #links="
424 << table->size() << " #neighbors=" << numNeighbors );
425
426 // updating neighbors
427 logging_debug("Discover new ring neighbors");
428 for (int i=0; i<table->size(); i++) {
429 LinkID id = (*table)[i]->info;
430 if (!id.isUnspecified()) discover_neighbors(id);
431 }
432
433 // sending discovery
434 logging_debug("Sending discovery message to my neighbors and fingers");
435 stabilize_finger = ((stabilize_finger+1) % table->get_finger_table_size() );
436 const NodeID disc = table->get_finger_table(stabilize_finger).get_compare().get_center();
437 if (disc != nodeid)
438 send_discovery_to(disc);
439
440 // remove orphan links
441 orphan_removal_counter++;
442 if (orphan_removal_counter <0 || orphan_removal_counter >= 2) {
443 logging_info("Discovered nodes: ");
444 BOOST_FOREACH( NodeID& id, discovery )
445 logging_info("* " << id.toString());
446 discovery.clear();
447 logging_info("Running orphan removal");
448 orphan_removal_counter = 0;
449 for (size_t i = 0; i < table->size(); i++) {
450 route_item* it = (*table)[i];
451 if (it->ref_count == 0 && !it->info.isUnspecified()) {
452 logging_info("Dropping orphaned link " << it->info.toString() << " to " << it->id.toString());
453 table->insert(it->id);
454 if (it->ref_count==0) {
455 LinkID id = it->info;
456 it->info = LinkID::UNSPECIFIED;
457 baseoverlay.dropLink(id);
458 }
459 }
460 }
461 }
462 }
463}
464
465void Chord::showLinks() {
466 logging_info("--- chord routing information ----------------------------------");
467 logging_info("predecessor: " << (table->get_predesessor()==NULL? "<none>" :
468 table->get_predesessor()->toString()) );
469 logging_info("node_id : " << nodeid.toString() );
470 logging_info("successor : " << (table->get_successor()==NULL? "<none>" :
471 table->get_successor()->toString()));
472 logging_info("----------------------------------------------------------------");
473}
474
475}} // namespace ariba, overlay
Note: See TracBrowser for help on using the repository browser.