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 INSTITUTE OF TELEMATICS 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 "SideportListener.h"
|
---|
40 |
|
---|
41 | #include "ariba/overlay/BaseOverlay.h"
|
---|
42 |
|
---|
43 | namespace ariba {
|
---|
44 |
|
---|
45 | SideportListener SideportListener::DEFAULT;
|
---|
46 |
|
---|
47 | SideportListener::SideportListener() : overlay(NULL) {
|
---|
48 | }
|
---|
49 |
|
---|
50 | SideportListener::~SideportListener(){
|
---|
51 | }
|
---|
52 |
|
---|
53 | string SideportListener::getEndpointDescription( const LinkID& link ) const {
|
---|
54 | if( overlay == NULL ) return "";
|
---|
55 | return overlay->getEndpointDescriptor(link).toString();
|
---|
56 | }
|
---|
57 |
|
---|
58 | string SideportListener::getEndpointDescription( const NodeID& node ) const {
|
---|
59 | if( overlay == NULL ) return "";
|
---|
60 | return overlay->getEndpointDescriptor(node).toString();
|
---|
61 | }
|
---|
62 |
|
---|
63 | const NodeID& SideportListener::getNodeID( const LinkID& link ) const {
|
---|
64 | if( overlay == NULL ) return NodeID::UNSPECIFIED;
|
---|
65 | return overlay->getNodeID(link);
|
---|
66 | }
|
---|
67 |
|
---|
68 | vector<LinkID> SideportListener::getLinkIDs( const NodeID& node ) const {
|
---|
69 | if( overlay == NULL ) return vector<LinkID>();
|
---|
70 | return overlay->getLinkIDs( node );
|
---|
71 | }
|
---|
72 |
|
---|
73 | //******************************************************
|
---|
74 | //
|
---|
75 | // JUST EXPERIMENTAL WITH RANDOM RESULTS
|
---|
76 | //
|
---|
77 |
|
---|
78 | // 0 = normal node --> directly accessible
|
---|
79 | // 1 = relaying node --> node that is relaying for us (must also be 0)
|
---|
80 | // 2 = relayed node --> node that we cannot access directly
|
---|
81 | static map<NodeID,short> relayingnodes;
|
---|
82 |
|
---|
83 | bool SideportListener::isRelayingNode(const NodeID& node){
|
---|
84 |
|
---|
85 | map<NodeID,short>::iterator i = relayingnodes.find(node);
|
---|
86 | if(i != relayingnodes.end()) return (i->second == 1);
|
---|
87 |
|
---|
88 | relayingnodes.insert( std::make_pair( node, rand()%3 ) );
|
---|
89 | }
|
---|
90 |
|
---|
91 | bool SideportListener::isRelayedNode(const NodeID& node){
|
---|
92 |
|
---|
93 | map<NodeID,short>::iterator i = relayingnodes.find(node);
|
---|
94 | if(i != relayingnodes.end()) return (i->second == 2);
|
---|
95 |
|
---|
96 | relayingnodes.insert( std::make_pair( node, rand()%3 ) );
|
---|
97 | }
|
---|
98 |
|
---|
99 | //
|
---|
100 | //
|
---|
101 | //******************************************************
|
---|
102 |
|
---|
103 | void SideportListener::configure( overlay::BaseOverlay* _overlay ) {
|
---|
104 | overlay = _overlay;
|
---|
105 | }
|
---|
106 |
|
---|
107 | void SideportListener::onLinkUp(const LinkID& lnk, const NodeID& local, const NodeID& remote, const SpoVNetID& spovnet){
|
---|
108 | }
|
---|
109 |
|
---|
110 | void SideportListener::onLinkDown(const LinkID& lnk, const NodeID& local, const NodeID& remote, const SpoVNetID& spovnet){
|
---|
111 | }
|
---|
112 |
|
---|
113 | void SideportListener::onLinkChanged(const LinkID& lnk, const NodeID& local, const NodeID& remote, const SpoVNetID& spovnet){
|
---|
114 | }
|
---|
115 |
|
---|
116 | void SideportListener::onLinkFail(const LinkID& lnk, const NodeID& local, const NodeID& remote, const SpoVNetID& spovnet){
|
---|
117 | }
|
---|
118 |
|
---|
119 | } // namespace ariba
|
---|