sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: QoS-aware Directional Flooding-based Routing for Underwater Wireless Sensor Networks Junhwan Park, S. Lee, Dongkyun Kim School of Computer Science and Engineering, Kyungpook National University, Daegu, Korea dongkyun@knu.ac.kr ABSTRACT Previously, we proposed the Directional Flooding-based Rout­ing (DFR) protocol where the .ooding area is updated ac­cording to link quality to provide reliable packet transmis­sions in loss-prone underwater wireless sensor networks (U-WSNs).
Sentence 2: since the original DFR was designed to have static system parameters to consider a QoS require­ment, it cannot meet the QoS requirement if the network condition changes dynamically which is inherent in UWSNs.
Relationship: contrasting
Domain: Networks
Sentence 1: The past several years have seen a lot of research e.orts devoted to capacity analysis [4, 6, 9, 10, 11, 12, 15, 16] since the seminal workof Gupta and Kumar [5].
Sentence 2: there is still limited knowledge regarding the e.ect that transmitting power has on the capacity of wireless ad hoc networks.
Relationship: contrasting
Domain: Networks
Sentence 1: 3a, the packet.lter thatprotects V6 contains four rules to separatelypermitV5, V8, V9andV10.
Sentence 2: iftwo aggregatable pre.xes (say10.0.1/24and10.0.2/24)are assigned to V5 and V8, then the two VLANs can be permitted together in one rule that permits the aggregated pre.x 10.0.1/23.
Relationship: contrasting
Domain: Networks
Sentence 1: Intheliterature(see Sec.2foranoverview), severalpro­posals aim at reducing the overall network power consump­tion by turning o. nodes and links, and re-routing tra.c to save energy [8, 9, 10, 11].
Sentence 2: these policies can be applied to transit nodes/links only, since at the network access, nodes and links cannot be turned o. to avoid dis­connecting users.
Relationship: contrasting
Domain: Networks
Sentence 1: Designing an Inter-Cloud Messaging Protocol for Content Distribution as a Service (CoDaaS) over Future Internet Yonggang Wen School of Computer Engineering Nanyang Technological University Nanyang Avenue, Singapore 639798 +65 6790 6562  ygwen@ntu.edu.sg ABSTRACT User-generated content (UGC) has become one of the dominant media formats.
Sentence 2: current approach to distribute UGC adds two middlemen (e.g., content aggregator and content distributor) in the value chain, resulting in a higher cost for media consumers.
Relationship: contrasting
Domain: Networks
Sentence 1: Most mail de­livery software can now be enhanced with .ltering products, for example, ProcMail [21] and SpamAssassin [27] can be used with Sendmail, Post.x and qmail mail servers to add .ltering extensions like blacklists and bayesian .lters, distributed checksums, realtime blocklists etc.
Sentence 2: such extensions are done in a rigid, inex­tensible manner and may not cater to the needs of a particular site.
Relationship: contrasting
Domain: Networks
Sentence 1: Even when the rate of a .ow traversing this path increases by one packet per second, a transmission on the link C-D will contend with all the other four packet transmissions on the path.
Sentence 2: decrease phase: when the feedback rate is smaller than the current rate, the sender performs the de­crease phase (lines 14-15) merely adjusting its current rate to the feedback rate.
Relationship: contrasting
Domain: Networks
Sentence 1: Speci.cally, depending on various param­eters, users of an onion-routing network who choose paths entirely out of highly trusted routers can sometimes min­imize their risk of deanonymization via the correlation at­tack [31].
Sentence 2: if other users are concerned about adver­saries with a di.erent trust distribution, using only highly trusted routers would lead to di.erent users preferring dif­ferent routers for their paths and the choice of routers itself may identify the user.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.1 Scaling and Isolation To quantify the scaling and isolation aspects of HLP and compare them with BGP, we need a mechanism to analyze the routing dynamics of both protocols given the precise location and type of a routing event.
Sentence 2: given the complexity and generality of BGPpolicies, a precise mod­eling of BGP s routing dynamics is a challenging problem.
Relationship: contrasting
Domain: Networks
Sentence 1: In particular, the parameter p shows an interesting ef­fect on security: if the number of authenticated messages sent by the sender per time interval is low, p = 10, 12 pro­vides better security than p =6, 8.
Sentence 2: as the number of authenticated messages sent by the sender increase, a bet­ter choice would be to set p to values lower than p = 10, 12.
Relationship: contrasting
Domain: Networks
Sentence 1: We note that since the monitoring system is uni-directional, TIMO cannot cancel its signal at potential video receivers; hence, we observe thatinterferencedegrades the monitoring system sper­formance at nearby locations.
Sentence 2: in contrast to the current mode of operation, where 802.11 loses connectivity in most loca­tions due to interference, TIMO is an improvement over the status quo because it reduces the range of interference to close-by loca­tions.This moves the system to a scenario where the two technolo­gies enjoy somelevel of coexistence, whichdespitebeing farfrom optimal,is more acceptable than the current situation.
Relationship: contrasting
Domain: Networks
Sentence 1: Sociocentric Egocentric Node betweenness betweenness w1 3.75 0.83 w2 0.25 0.25 w3 3.75 0.83 w4 3.75 0.83 w530 4 w60 0 w7 28.33 4.33 w8 0.33 0.33 w9 0.33 0.33 s1 1.5 0.25 s20 0 s40 0 i10 0 i30 0 Figure 2: Bank Wiring Room network sociocentric and egocen­tric betweenness [25] The betweenness centrality CB(pi)based on the egocentric mea­sures does not correspond perfectly to the sociocentric measures.
Sentence 2: it can be seen that the ranking of nodes based on the two measures of betweenness are identical in this network.
Relationship: contrasting
Domain: Networks
Sentence 1: However, .ooding based algorithm is ine.cient and not suitable for a large scale network because it signi.cantly in­creases the network tra.c as the number of the nodes on P2P network increases.
Sentence 2: retrieving and forwarding on struc­tured P2P networks are very e.cient because struc­tured P2P networks have address structure in contrast with unstructured P2P networks.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.1 Studies of BitTorrent s incentives Cohen began the study of his BitTorrent protocol s incentives by demonstrating that tit-for-tat-based incentives make BitTorrent robust to strategic gaming [5].
Sentence 2: cohen later found strict tit-for-tat to come at too high a cost [4], and weakened the proto­col s incentives to achieve better performance.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, sources 1,2,3, and 10 all talk only to destination a, while sources 4 and 6 talk only to destination c. This pattern suggests some common purpose to the traf.c in each of the two subsets of corresponding .ows, and hence suggests in turn that some notion of community may apply to these two sets of sources.
Sentence 2: while source 9 also talks to destination a and source 7 also talks to destination c, they each talk as well to destination b.
Relationship: contrasting
Domain: Networks
Sentence 1: This wisdom is mainly due to an assumption that performing route computation at the edges of the network (as opposed to within the network) requires awareness to very short-term changes in the rout­ing state of the network.
Sentence 2: through (possibly in-band) end­to-end measurements, cooperating endpoints can obtain up-to-date routing state of the relevant parts of the topology and can respond to short-term changes in routing state.
Relationship: contrasting
Domain: Networks
Sentence 1: A .rst interpre­tation of these results could be that existing routing protocols need to be extended or new routing protocols need to be de.ned to sup­port the identi.ed properties.
Sentence 2: this implies that every time a new operational need were identi.ed, a new extension to the ex­isting protocols or a new protocol would need to be created, which could be a very lengthy process.
Relationship: contrasting
Domain: Networks
Sentence 1: These systems are however de­signed for uplink communication from the backscatter device to an RFID reader, and do not enable decoding on a low power backscat­tering device.
Sentence 2: we present µcode, the .rst coding mech­anism that provides the bene.ts of CDMA and can be decoded on a backscattering device; we also show that µcode can enable con­current transmissions in a network of battery-free devices.
Relationship: contrasting
Domain: Networks
Sentence 1: Of course, simply not retrying ACKs would not reduce the overall number of ACKs, as the tag will remain active and the retry ACK will e.ectively end up in the next round.
Sentence 2: as retries generally do not provide a signi.cant bene.t, a more appropriate response would be to not waste time on retries, but instead change the physical layer pa­rameters used in the next round.
Relationship: contrasting
Domain: Networks
Sentence 1: The main advantage of this technique is that it relies on the clock skews between machines, which are relatively stable and do not deviate much over time.
Sentence 2: this technique was designed for wired networks and it actually requires some co-operation from the fingerprintee machine both the TCP timestamp option and response to ICMP timestamp requests can be disabled and even on Windows machines, TCP timestamps are not enabled by default.
Relationship: contrasting
Domain: Networks
Sentence 1: To evaluate the ability of a network to cope with catastrophic failures and recover network services while in a disconnected state, several network resilience measures have been proposed such as the probability that all operative node pairs can communicate, the expected number of node pairs communicating, the expected number of operative nodes communicating [2,4, 9,10,15,17].
Sentence 2: unlike connectivity-based reliability measures, network resilience measures have not been previously used in the literature as network design criteria.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, a 10Gbps network with a 500µs round-trip time (RTT)ne­cessitates that switches have 625 Kbytes of bu.ering per priority per port.
Sentence 2: the amount of bu.ering that can be providedinadatacenterswitchis limitedbycost(at10Gbps lineratesthelowaccess timeallowedperpacketnecessitate that expensive SRAMs be used to build switch bu.ers)and latency (having shallow bu.ers bounds the worst-case la­tency of a packet through a switch and, hence, end-to-end).
Relationship: contrasting
Domain: Networks
Sentence 1: Recentwork hasarguedthat pre-processing signals at the senders in a manner that aligns interference at the receiversincreases the total capacity of wireless networks[3, 6, 9, 21].
Sentence 2: to the best of our knowledge, this paperis the .rst to present a system design and an implementation of interference alignment, showing that such idea works in practice.
Relationship: contrasting
Domain: Networks
Sentence 1: Table1 reports theprobability to loose the information detected by our simulationsfordi.erent settings of ß and a (n = 100, while theresultsareaveraged over1,000trials).Once .xed ß, withoutthe knowledge ofLemma3.2, one couldhaven choose the minimum a greater than ß: For example, the values reportedin the columnsin­dicatedwith a1 or a2 couldhavebeen chosen.
Sentence 2: this would havenotbeenagood choice.Indeed,choosing valuesfrom a1 im­plies to loose the information with probability 1, in contradiction with the prediction of the SIS model.
Relationship: contrasting
Domain: Networks
Sentence 1: Thebasicideaistohave adedicated virtualAPfor each PSMclientin orderto completely avoid any contentionfromtraf.c due to other PSM clients.
Sentence 2: onelimitation with virtualiza­tion supportisthat only alimited number of virtualAPs canbe cre­ated with onephysicalAP.For example, theAtheros chipset allows uptofour virtualAPs.
Relationship: contrasting
Domain: Networks
Sentence 1: 3.1 Optimum HA selection in Global HAHA networks As mentioned above, DHAAD is de.ned as one way of .nding the topologically closest HA by the MR.
Sentence 2: it only considers the topologically closeness of MR and HA whichis not optimumif weconsider end-to-end communica­tion.
Relationship: contrasting
Domain: Networks
Sentence 1: Several priority-based QoS mech­anisms have been proposed as extensions to DCF over the last few years, including an extension to IEEE 802.11 called IEEE 802.11e, to provide service di.erentiation among dif­ferent tra.c classes.
Sentence 2: it has been reported in the literature [1 4] that priority-based mechanisms su.er from degradation of service di.erentiation of high priority tra.c, starvation of low priority tra.c, high throughput variation and a lack of fairness.
Relationship: contrasting
Domain: Networks
Sentence 1: For low­data-rate services, restoration times are on the order of milliseconds.
Sentence 2: no restoration is usually avail­abletodayforfullwavelengthcapabilities.Therearetwo alternativesforprivate-line customers: eitherbuy expen­sive1+1protection whereif aprimary connectionfails, traf.cis re-routed to a backup, or wait for the carrier to manually restore connectionswhich meanslong outage times(4 to12hourstypically).
Relationship: contrasting
Domain: Networks
Sentence 1: ß being platform dependent, can be calibrated by the client and fed back to the Central Con­troller for its appropriate estimation of I N R. Further, note that when SINR is directly measured, there is only one feedback value from the client.
Sentence 2: when SINR is estimated from SNR and multiple INRs, then each of the SNR feedback (correspond­ing to INR) introduces an offset that needs to be compensated.
Relationship: contrasting
Domain: Networks
Sentence 1: After that, for each ac- I l (11) n ( - wf (t0 ),ndrop ) := 2 log2 - 0 ) knowledgment received, the congestion window is increased wf (t - ndrop 1+by one.
Sentence 2: and until the .rst retransmission suc­ceeds, the number of outstanding packets is not decreased 2 round-trip times.
Relationship: contrasting
Domain: Networks
Sentence 1: Although group creation is a interesting problem, in this paper, wefocusprimarily on role-based orgeographic-based groups where nodes initially know which groups they are in and group membership does not change.
Sentence 2: our al­gorithmsdo supportdynamicgroups where members might notinitially know all othermembers of thegroup and where group membership changes over time.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.3.1 Macrocell Model (EBS) Hando.s between two EBS are always permitted, and over.ows from a CBS to EBS are always allowed.
Sentence 2: if a call connects to a CBS, and the mobile user initiating the call moves out of a picocell, then that call may be handed over to another CBS if the new location is within the hotspot region, or treated as a privileged over.ow call to the EBS otherwise.
Relationship: contrasting
Domain: Networks
Sentence 1: Some use a second source of information to prevent additional nodes from re­transmitting(asinthe counterbased andpowerbased al­gorithms)or to ensure a minimal number of retransmissions (as in GOSSIP3(p,k,m)).
Sentence 2: byusing randomness as a key criteria, these algorithms run the risk of privileging nodesproviding a negligible contribution atthe expense of other,betterlocated, ones.
Relationship: contrasting
Domain: Networks
Sentence 1: The current de-facto standard routingprotocol used for externaldestinations is theBor­derGatewayProtocol(BGP)[17].
Sentence 2: therearetwo .avors of BGP.One is used to spread information externally(eBGP), and the other the Internal Border Gateway Protocol (iBGP) is responsible for spreading information about external destinations inside the AS.
Relationship: contrasting
Domain: Networks
Sentence 1: Without coding, 8 transmissions are necessary for each .ow to send one packet to its destination.
Sentence 2: assuming perfect overhear­ing (n4 and n5 can overhear n1 and n3, and vice versa), n2 can XOR 4 packets in each transmission, thus reducing the number of trans­missions from 8 to 5, producing a coding gain of 85 = 1.6.
Relationship: contrasting
Domain: Networks
Sentence 1: Code Division Multiple Access (CDMA) cellular phone networks have long used macrodiversity to improve per­formance and to provide seamless hando.
Sentence 2: between base sta­tions [28].Both [21] and [33] applied the idea to use macro­diversity and frame combining on frames received from ad­jacent access points to improve uplink WLAN performance in the same way as MRD.[21] presents simulated results based on a capture model and ignores protocol level issues such as ARQ.The contributions of [33] lie in the the­oretical performance evaluation in the context of a WLAN based on Bluetooth [11] radios.In contrast, our contribu­tions lie in the design of a macrodiversity system that works well in CSMA-based WLANs and in conducting a perfor­mance study of a fully implemented receiver macrodiversity system on a real testbed.
Relationship: contrasting
Domain: Networks
Sentence 1: More nodes are available within longer transmission range as candidates for relaying and thus rout­ing protocols may exploit this to achieve load balancing, which in turn results in better delay performance and en­ergy savings.
Sentence 2: long range relaying might require higher trans­mission power levels for successful reception, and increase interference, possibly compromising network capacity, since more nodes are a.ected by the associated higher power lev­els this is particularly the case in dense networks.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, at low network throughputs when the PPE CPU is not well-utilized, the network processing e.ciency of the ETA+AIO system is considerably worse than the base­line con.gurations.
Sentence 2: at high network loads the PPE CPU is e.ectively utilized enabling ETA+AIO to have We compared a 2.6 kernel s networking to the 2.4.18 kernel and saw only a small performance increase.
Relationship: contrasting
Domain: Networks
Sentence 1: Again, the causal connections are the intuitive ones: tuples never existed because they never appeared, they never ap­peared because they were never inserted, derived, or received, etc.
Sentence 2: note that, unlike their positive counterparts, all negative vertices are annotated with time intervals: un­like positive provenance, which can refer to speci.c events at speci.c times, negative provenance must explain the ab­sence of events in certain intervals.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, we get hmin = k. Denote the input rate at each source by ., then the num­ber of bits arriving at these n nodes in an interval [0,T ] is .T n. Thus, the total number of transmissions of all bits to their destinations is at least .T nhmin.
Sentence 2: the total number of possible transmissions at any timeslot is upper bounded by that of the cells containing at least two users, which is no more than c. Hence, .T nk = Tc (8) i.e., .
Relationship: contrasting
Domain: Networks
Sentence 1: theMACpacketispartofthenewPLCPpacket,legacystationswillnotreceivethecorrectedNAVsetting(legacyNICsdiscardthe802.11DYNPLCPframeafterdecodingawrongRate.eld).Therefore,theframeexchangeafterthepayloadtransmissionhastobemodi.edsuchthatallstationscan.nallysettheNAVtothecorrectvalue.WesuggestthatafterthedynamicOFDMpayloadtransmission,theACKframeresetstheNAVtoavaluejustlongenoughtocoveranewCTSframeaddressedto(andtransmittedby)theinitiatoritself.This.nallysetstheNAVtozero,releasingtheWM,andensuresthattheNAVissettothecorrectvalueforall listeningstations.
Sentence 2: furthermore,letusfocushereontwospeci.cissues:Thegener­ationofmodulationtypespersub-carrierandtheexactlayoutofthesignaling.eld.Animportantissuerelatedtothegenerationofthemodulationtypespersub-carrieristheexecutiontime.NotethatoncethePLCPpreambleofthe(.rst)CTSframeisreceived,thetransmitterhastogeneratetheassignmentstogetherwiththePLCPheaderwithin36 µs (theremainingCTSframerequires20 µs,thenfollowsaSIFS,whichhasadurationof16 µs).Ifthegenerationofthesub-carrierassignmentsrequiresmorethan54 µs (whichcon­tainstheremainingCTSframeplusaDIFS),otherstationsmaystartacquiringthechannelastheymightbelievethemediumisidle(nothinghasbeentransmittedduringatimespanofaDIFSfromtheendofthelastCTSframesymbol,assumingthesestationshavenotreceivedtheNAVsettingpreviously).Ifthisisthecase,abusytonecouldpreventthisevent.thereisevidencethatthemodulationtypescanbegeneratedwithinthe36 µs usingstandardhardware[29].Certainly,ifonlyadaptivemodulationisappliedwhilethetransmitpoweriskept.xed,themodulationtypescanbedeterminedwithintheabovetimespan.
Relationship: contrasting
Domain: Networks
Sentence 1: We note that, for unilateral identi.cation, this pro­cess only needs to be one-directional, that is Alice trans­mits to Bob and Bob maintains the veri.cation chain.
Sentence 2: for full mutual identi.cation (as opposed to two separate unilateral identi.cations), the exchanges must be both bidirectional and it is necessary that they have the same channel with which to base their veri.cation chains upon.
Relationship: contrasting
Domain: Networks
Sentence 1: At higher loads, as the load approaches the saturation point, SOTA outperforms CON-NECT 32, due to its higher clock frequency.
Sentence 2: notice that in all cases CONNECT 128, which occupies about the same FPGA resources as SOTA, can eas­ily outperform all other networks by a wide margin across all tra.c patterns and regardless of frequency adjustments; it consistently o.ers three to four times higher saturation throughput and more than three times lower latency.
Relationship: contrasting
Domain: Networks
Sentence 1: If we call finalA and final B the labels attached toA's and B's final action, respectively, then the property might be expressed by finaiA({X}g) t-" finale({x},g), for x a variable.
Sentence 2: in practice, all forms of authentication in Lowe's hierarchy [15] are captured by the scheme ct ¢--- [3. except the most demanding one that requires one-to-one bijection between ct's and 13"s. our scheme can be easily adjusted to include this stronger form, The scheme also permits expressing secrecy, in the style of [2].
Relationship: contrasting
Domain: Networks
Sentence 1: In summary, it appears that RapidShare uses simple load bal­ancing rules, allocating more upload requests to more recently de­ployed servers, and assigning more download requests to servers that do not also act as the indexing server of the group.
Sentence 2: it seems that RapidShare does not try to control which ISP will be used for each download request (if they were doing so, the distribution in Figure 13 among the 10 download servers would not be uniform).
Relationship: contrasting
Domain: Networks
Sentence 1: This is quite clear since in these cases transmis­sion is either always suspended (low SNR regime) or always the highest available modulation scheme is used (high SNR regime).
Sentence 2: as the gain from imposing an average instead of an instantaneous BER constraint is generally rel­atively small, it is questionable whether the additional com­plexity involved with this approach is worthwhile in practice.
Relationship: contrasting
Domain: Networks
Sentence 1: As can be seen, with SafeGuard the path stretch smoothly reduces to 1 during convergence, indicating that the forwarding paths gradually shift to the new shortest paths as routers update their states independently.
Sentence 2: under vanilla IP forwarding, one can observe path stretch surges during routing convergence because of micro-loops: some packets reach their des­tinations after a micro-loop is resolved but have looped for dozens of times.
Relationship: contrasting
Domain: Networks
Sentence 1: This improvement is brought by the femtocells that can reuse the frequency re­sources of the macrocell.
Sentence 2: while this frequency reuse does not result in signi.cant throughput loss for low femtocell density, it leads to lower throughput converging to that of the macrocell-throughput under denser femtocell de­ployments.
Relationship: contrasting