sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: With the knowledge of the exact version of the TCP source and the round trip time from the RNC to the source, it is possible to compute an exact estimate of AckReleaseCount.
Sentence 2: since we would like to be agnostic to TCP version as far as possible and also be robust against varying round trip times on the wired network, our algorithm tries to main­tain a conservative estimate of AckReleaseCount.
Relationship: contrasting
Domain: Networks
Sentence 1: In this work, we establish the capacity of general multi­channel networks wherein the number of interfaces, m,may be smaller than the number of channels, c. We show that the capacity of multi-channel networks exhibits di.erent bounds that are dependent on the ratio between c and m. When the number of interfaces per node is smaller than the number of channels, there is a degradation in the network capacity in many scenarios.
Sentence 2: one important exception is a random network with up to O (log n) channels, wherein the network capacity remains at the Gupta and Kumar bound (.)
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION Recent advances in hardware and wireless communication technologies have led to an increasing interest in ad hoc net­works that are temporarily constructed by only nodes with a wireless communication facility, e.g., mobile hosts and sen­sors.
Sentence 2: tDMA (Time Division Multi­ple Access), which is a conventional wireless communication technique, has the ability to provide collision-free packet transmission regardless of the tra.c load.
Relationship: contrasting
Domain: Networks
Sentence 1: On alarge scale,it is notclearthat such node-centric supportis needed when nodes are far apart.
Sentence 2: instead, supportforgeographicallydistributednodes may bebetteroff relying on3G-orhot-spot-based solutions.content-centric applications, which rely onprobabilisticdissemina­tion ofdatabetween clusters, match well with existingDTN-based communication.
Relationship: contrasting
Domain: Networks
Sentence 1: Our model of export policies is based on the Gao-Rexford condition GR2: GR2 AS b will only announce a path via AS c to AS a if at least one of a and c are customers of b. GR2 captures the idea that an AS should only be willing to load his own network with transit tra.c if he gets paid to do so.
Sentence 2: because GR2 does not fully specify the export policies of every AS (for instance, an AS could decide to export paths to only a subset of his customers), it does not su.ce for our purposes.
Relationship: contrasting
Domain: Networks
Sentence 1: Category Failure LDNS Non-LDNS Error 100count timeout timeout PL 191168 83.3% 9.7% 7.0% BB 10792 76.0% 24.0% DU 899 77.7% 22.3% 80 60 Table 4: Breakdown of DNS failures Cumulative Percentage of Failures 40 20  4.1.3 Packet Loss and Transaction Failures Several previous studies have considered packet loss rate of TCP connections [24, 33].
Sentence 2: we only .nd weak correlation between packet loss rate and the failure rate of end-to-end transactions in our data set (the coe.cient of correlation is 0.19).
Relationship: contrasting
Domain: Networks
Sentence 1: [11, 31], then FS-BGP-PD with no PKI is just as good as with fully de­ployed PKI with respect to such an adversary.
Sentence 2: the only provably secure accountability protocols that are known to date require nodes to deploy a PKI or have shared keys, so having no PKI for FS-BGP-PD would yield no practical gains if the Inter­net does deploy a provably secure accountability protocol.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, it is assumed that the integrated behavior of the installed .l­ters will globally implement these policies.
Sentence 2: the following con.icts become apparent: (1) the semantic gap between the controller platform (e.g., NOX [13]) and the .lter tables in the data processing units, (2) the distribu­tion of access control that supports aggregate .ows (wild­cards) and many di.erentactions,(3) theability of sharing one controller by di.erent users, and (4) the ability of us­ing multiple controllers in the same domain.
Relationship: contrasting
Domain: Networks
Sentence 1: SUMMARY: HOW TO APPLY VCM IN PRACTICE In practice, to apply VCM, we startfrom a set of sensor nodes arranged as atwo-dimensionallattice(identi.edbytheirinteger coordinates).
Sentence 2: in an actual wireless network, the set of neighbors may notbeexactlygivenby theset of nodeswithina .xed range R.noticethatavalid h-hop coloringforagiven R,isalso a valid h-hop coloring for R ' < R (although likelynon-optimal).
Relationship: contrasting
Domain: Networks
Sentence 1: The IPHC mechanism as described in (RFC 2507) is a hop-by-hop Header Compression (HC) mechanism intended for point-to-point links.
Sentence 2: applying hop-by-hop HC scheme to achieve end­to-end HC is undesirable as the packet path then includes several compression-decompression cycles in the intermediates nodes in the core network and therefore increases the end-to-end delay.
Relationship: contrasting
Domain: Networks
Sentence 1: We are planning to do a trial installation of such a network in Malawi using commercial TV white spaces devices for Internet access in a joint collaboration venture among the Malawi Communications Regulatory Authority (MACRA), the Chancellor College of the University of Malawi and the International Centre for Theoretical Physics (ICTP).
Sentence 2: the heatmap and the graphs of maximum measured power versus frequencies also identified certain frequencies, like the ones centered in the TV channel at 546 MHz that warrant further investigation to find out if they correspond to spectrum usage without the local regulator approval or just random noise peaks.
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION AND QUALIFICATION OF THE PROBLEM Beekeeping has been identified as a sustainable alternative of income generation for communities who work on family agriculture [18] as well as increase the flow of pollinators in agroforestry areas like the cerrado (biome similar to savanna), and contribute to the production of fruits [12].
Sentence 2: most of the creators and producers have suffered heavy losses in off-season periods (when the highest temperatures are recorded) due to swarming by abandonment, which occurs more frequently and Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: contrasting
Domain: Networks
Sentence 1: They use the idea of probabilistic key sharing [6] to establish trust be­tween two nodes, with di.erent emphasis on enhanced secu­rity protection [2], .exibility of security requirements [27], high probability of key establishment and reduced overhead [12], or utilization of deployment knowledge [4].
Sentence 2: they are not designed to handle insider attacks, such as event fabrication, launched by compromised nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: When the attacker power is matched to the legitimate transmit­ter s power, correlated jamming results in an error rate of 0.5 (i.e., no information due to complete cancellation of the transmitted signal) while coded jamming results in an error rate of 0.25 (since coded jamming sends random symbols imitating the physical-layer chain of the source transmitter and since the source transmitter uses BPSK with alphabet size of two, there is 0.5 chance of coded jammer sending con­.icting symbols and, when that happens, there is a condi­tional probability of 0.5 for the event that the receiver tunes into and decodes the symbol that coded jammer sent; thus, 0.5 ·0.5 = 0.25).
Sentence 2: the legitimate user per­forms very well against transmission-independent Gaussian jamming since we incorporate redundancy at the physical­layer and the receiver uses soft-decoding to use the informa­tion of multiple samples to decode a symbol (as described in Section 2.3) and thus e.ectively mitigates transmission­independent noise; coded and correlated jamming, on the other hand, knows the MMSE-based receiver strategy and customizes its signal injection accordingly.
Relationship: contrasting
Domain: Networks
Sentence 1: As ICN decouples content name (and how it is accessed) from the location it is stored, it would stand to reason that mobility, both for the content provider as well as consumer, would be relatively easy to achieve.
Sentence 2: as pointed out in [12], content provider mobility still remains one of the biggest research challenges in almost all ICN proposals [1, 7, 10, 11].
Relationship: contrasting
Domain: Networks
Sentence 1: This makes mobile users accountable for the bad channel conditions due to their mobility, while not a.ecting the static users (in Figure 2(b), static user s throughput is not a.ected).
Sentence 2: slot fairness adversely impacts static users at cell edge, users with shadowing such as due to build­ings and trees even while static, users in a building basement as opposed to higher .oors with better signal reception, etc.
Relationship: contrasting
Domain: Networks
Sentence 1: On the other hand, for request probabilities p = o(1/n), our model correctly predicts the asymptotic behavior of the load on the users and the load on the server, as seen in -2 System Size 5 x 10 Figures 10 and 11.
Sentence 2: we note that we overestimate the behavior for low values of n and that our bounds are not as close as the ones obtained for the same probabilities underthe randomwalk(Figures4 and5, respectively).
Relationship: contrasting
Domain: Networks
Sentence 1: Network Management Architecture Toward Universal Communication Yoshihiro Kawahara, Ahmad Kamil Abdul Hamid, TaeYoung Song, Kei Wada and Tohru Asami Graduate School of Information Science and Technology, The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo, 113-8656 Japan {kawahara, kamil, t-y-song, kay-wada, asami}@akg.t.u-tokyo.ac.jp ABSTRACT Ubiquity of networked devices is one of the first steps toward realization of universal communication services.
Sentence 2: not much attention has been paid to the management architecture of the mashed-up services provided across the network domains.
Relationship: contrasting
Domain: Networks
Sentence 1: In case of embedding over wired networks, the problem is known as requiring computationally intractable complex­ity (i.e., NP-hard) for achieving optimality, and thus various heuristics have been proposed, see e.g., [1, 2].
Sentence 2: due to various features unique in wireless networks, e.g., link interference, the embedding problem becomes much more complex and harder.
Relationship: contrasting
Domain: Networks
Sentence 1: Hence, 7 http://www.cs.cmu.edu/~healthline it allows decision-makers and supervisors to quickly analyze and respond to program information.
Sentence 2: uganda s Rakai Center and others are utilizing similar systems to enhance information management and treatment provided to HIV/AIDS patients.8 none of these systems have explored methods for reporting information in settings where phone calls are cost­prohibitive.
Relationship: contrasting
Domain: Networks
Sentence 1: Hence, for energy e.ciency, the lower bound of |G| in (13) is selected as the minimum number of spectrum sensing sensors of group G: &#38; log(1 -Q¯d) |G|.
Sentence 2: (14) Pmin log(1 - d ) this formulation does not mean that the size of G is optimal in terms of minimizing the total sensing en­ergy consumption for cooperative spectrum sensing.
Relationship: contrasting
Domain: Networks
Sentence 1: Seoul National University tkkwon@snu.ac.kr Seoul National University jychoi@mmlab.snu.ac.kr Seoul National University escho@mmlab.snu.ac.kr Yanghee Choi Computer Science and Eng.
Sentence 2: seoul National University yhchoi@snu.ac.kr  ABSTRACT The DNS has performed the resolution for quasi-static hosts sofar.mappingfromthe namesof mobile hoststo their locators is increasingly important.
Relationship: contrasting
Domain: Networks
Sentence 1: Asummary ofthe issues in thissectionaregiven inTable3.
Sentence 2: 4.1 Overall traf.c considerations Overall, asILNPv6does not use aHomeAgent(HA) andFor­eignAgent(FA) con.guration, noextrasignallingtraf.cisrequired inorder toupdatetheHA,asisthecaseforIPv6.ILNPv6 generates DNS traf.c which Mobile IPv6 does not.
Relationship: contrasting
Domain: Networks
Sentence 1: gorithms that depend upon the values each sensor wants to transmit can be devised (note that unlike in a traditional EbT based scheme where sensors have to look out for overlapping packet durations, in CtS sensors have to look out only for overlapping start-stop­intermediate signals, the positions of which are directly determined by the values), WSNs being resource constrained environments, such algorithms can turn out to be highly resource intensive.
Sentence 2: a unique characteristic of CtS might allow for a relatively simple contention resolution scheme to be used very effectively.
Relationship: contrasting
Domain: Networks
Sentence 1: In this sense, and based onpreviousmeasurements[5], wecharacterizethedu­ration of o.oading periods as heavy-tailed.
Sentence 2: [8] and referencesthereinpresentwell-knownmodels of the behavior of single .ow tra.c, which describe tra.c burstiness in terms of long-range dependence and heavy­tails.
Relationship: contrasting
Domain: Networks
Sentence 1: The .rst set of constraints represents balance equations so that at every node, and for every destination d, the total number of received credits should be no less than the to­tal number of credits assigned to next-hop nodes that can reach destination d. For example, in Fig.
Sentence 2: 1(a), node s can split the credits it has between nodes v1 and v2 because all of {d1,d2,d3} are reachable from both v1 and v2.in Fig.
Relationship: contrasting
Domain: Networks
Sentence 1: f1 f1 Researchers have proposed several worst case end-to-end de­lay analyses for the traf.c in an ARINC 664p7 network, includ­ing analyses based on NetworkCalculus [14, 13], Finite State Ma­chine [32], Timed Automata [6] or Trajectory Approach [11, 12].
Sentence 2: none of these analysis methods are applicable to TTEth­ernet, since theydo not consider the impact of TT messages on the schedulability of RC messages.
Relationship: contrasting
Domain: Networks
Sentence 1: In the case of asymmetric chan­nels, solutions proposed [5] include ack congestion control and ack .ltering (dropping of acks), reducing source bursti­ness by sender adaptation and giving priority to acks when scheduling inside the network.
Sentence 2: the magnitude of asymmetry in 3G networks is not large enough and can be tolerated by TCP without ack congestion control or ack .l­tering according to [12].
Relationship: contrasting
Domain: Networks
Sentence 1: This, in turn, can result in some unsuitable computation being mapped to the embedded processor in the sensor node (which is typically much less powerful than the one in the central base station), thereby reducing overall performance (i.e., increasing application execution time) and impacting energy consumption behavior negatively.
Sentence 2: a very large c value can be overly conservative and can result in a code mapping that does not make use of the processor in the sensor node at all.
Relationship: contrasting
Domain: Networks
Sentence 1: However, the LP solution may contain fractional placement of some of the content with the corresponding xjk variables set to fractional values between 0 and 1.
Sentence 2: in our exper­iments only about 20% of the variables in the optimal LP solution were set to fractional values between 0 or 1, and the rest took integral values of 0 or 1.
Relationship: contrasting
Domain: Networks
Sentence 1: Since retransmissions are not necessarily useful for these time­sensitive applications, they have a great deal to gain from the use of Explicit Congestion Noti.cation [35], which lets congested routers mark packets instead of dropping them.
Sentence 2: eCN capability must only be turned on for .ows that react to congestion, which requires a negotiation between the two endpoints to establish.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.3 Effect of L2 Cache Size Varyingthecachesizesofeachnodehasadirecteffectontheimprovementthatnetworkmigrationhasoverthebaselineprivatecachecon.guration.Sincethebene.tofNMcomesfromtheabil­itytoretaincachelineson-chipwhentheywouldotherwisebeevicted,itfollowsthatNMshouldperformbestwhenresourcesareconstrained.WedemonstratethisbehaviorbyvaryingthesizeoftheL2cachesforthebarnes benchmarkinan8x8CMP.
Sentence 2: figure7showsthatindeedtheperformanceofNMrelativetoL2PdecreasesasthesizeoftheL2increases.ThisisbecauseastheL2sizeincreases,therearefewerandfewerevictions,whichinturnmeansthattheopportunity forimprovementshrinksdramatically.asmentionedpreviously,webelievethatasthenumberofcoresperCMPincreases,itwillbedif.culttofeasiblyimplementL2cachesontheorderof1MBpernode.
Relationship: contrasting
Domain: Networks
Sentence 1: Hence, for generating the numerical results from the v analysis, the upper limit used is Ninstead of 8.
Sentence 2: this doesn t take care of the edge e.ects that will arise in the simulations, which causes deviations from the analytical results, especially for small k. 4.1 Simulation Set-up We consider .ve networks of size 49, 121, 225, 361 and 5293 .
Relationship: contrasting
Domain: Networks
Sentence 1: To satisfy the .rst requirement, i. e., obtaining a wide coverage of popular hosting infrastructures in terms of traf.c volume, one approach is to sample all possible hostnames.
Sentence 2: due to the sheer size of the Web an estimated 92 million active domains only for the .COM top-level domain [6] querying all host names in the Internet would be way too cumbersome from a measurement perspective.
Relationship: contrasting
Domain: Networks
Sentence 1: Assume that the data items Ri, 1 = i = 6, are of the same size and Figure 1a shows a .at broadcast program, where data items are evenly allocated tothe twobroadcast disks and the speeds of two broadcast disks in the broadcast disk array are the same, meaning that the expected delays for all data items are equal from one to another.
Sentence 2: figure 1bshows another broadcast program with its channel allocation tree (or abbreviatedly as allocation tree).
Relationship: contrasting
Domain: Networks
Sentence 1: The worst case discrep­ancy for a queue of Quantum 10000, after 100 rounds of schedul­ing, would be 150000 bytes.
Sentence 2: as we have shown in the Chernoff bounds, the probability of discrepancy greater than 30000 bytes is less than 0.13 for the randomized de.cit round robin.
Relationship: contrasting
Domain: Networks
Sentence 1: The meanpathdurationand thepathpersistencewritten as expectations of functionals of the multihop path process are the unique solutions of a system of integro-di.erential equations.
Sentence 2: any direct method to solve them is quite problematic and depends very much on the speci.c characterization of the multihop path process (number of nodes,deterministic motion,jump rate,transition measure).
Relationship: contrasting
Domain: Networks
Sentence 1: If A broadcasts OI Da and B broadcasts OI Db, A will not receive OI Db from B and B will not receive OI Da from A.
Sentence 2: since E can snoop on and broadcast to A and B, it can receive both OI Da and OI Db and then replay those messages such that A receives OI Db and B receives OI Da.If A and B then exchange resolutions, they will be under the false impression that they were co-located.
Relationship: contrasting
Domain: Networks
Sentence 1: The SP -power algorithm that minimizes the total communication energy of a packet is obtained by applying Dijkstra s shortest path algorithm with the weight of the edge as ada + C, where a, a, and C are constants that depend on the radio models.
Sentence 2: the SP -cost algorithm, which maximizes the node s lifetime, can be obtained by applying Dijkstra s shortest path algo­rithm with an edge-weight of f(ni)= 1/gi.
Relationship: contrasting
Domain: Networks
Sentence 1: 80000 60000 40000 20000 0 23:00 23:30 24:00 24:30 25:00 25:30 26:00 26:30 27:00 Time [min] collected trace highlights that the UDP stream is quite reg­ular, hence assuring some QoS requirement, while the TCP .ows with lower priorities tend to have a higher oscillation.
Sentence 2: on average, nodes have the bandwidth obtained via the PRIMUS system guaranteed.
Relationship: contrasting
Domain: Networks
Sentence 1: (7) The situation for the messages in Min(S) is almost symmetric.
Sentence 2: the messages are sent from the random intermediate destination (xr,yr)to a position inside S. the actual node sending the message might be at distance rcov from (xr,yr), therefore we must accordingly adjust the angles for which there is congestion at node v. Instead of the value obtained in (6), the probability of rcov +(.pad +1)rI Cm,v can now be upper bounded by P(Cm,v)= p·s .
Relationship: contrasting
Domain: Networks
Sentence 1: 15b 93040 Regensburg, Germany dominik.herrmann 93055 Regensburg, Germany hannes.federrath @wiwi.uni-r.de rw@jondos.de @wiwi.uni-r.de ABSTRACT Privacy enhancing technologies like OpenSSL, OpenVPN or Tor establish an encrypted tunnel that enables users to hide content and addresses of requested websites from external observers This pro­tection is endangered by local traf.c analysis attacks that allow an external, passive attacker between the PET system and the user to uncover the identity of the requested sites.
Sentence 2: existing pro­posals for such attacks are not practicable yet.
Relationship: contrasting
Domain: Networks
Sentence 1: In most of the envisioned applications, there is a clear relationship between the objective of the application and Jens Mittag Karlsruhe Institute of Technology, Germany jens.mittag@kit.edu its requirements.
Sentence 2: there is one example which on the one hand aims to improve tra.c e.ciency, but on the other hand su.ers from the same time-critical requirements as safety applications: dynamic intersection tra.c manage­ment based on virtual tra.c lights (VTL).
Relationship: contrasting
Domain: Networks
Sentence 1: Thereinto, the ALOHA system proposed in 1970[1], is an attractive option because of its simplicity and .exibility.
Sentence 2: in such kind of traditional medium ac­cess control (MAC) layer random multiple access protocols, * Zhejiang Provincial Key Laboratory of Information Net­work Technology, Hangzhou, 310027, China Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.
Relationship: contrasting
Domain: Networks
Sentence 1: These sub-spaces do not provide an accurate representa­tion, and hence may match events that do not belong to the original subscription (sub1) resulting in the dissemina­tion of unnecessary events in the switch network.
Sentence 2: if another decomposition step is performed on dimension d2, then sub1 can be accurately mapped by the newly generated sub-spaces, i.e., {0000, 0010, 1000, 1010}.
Relationship: contrasting
Domain: Networks
Sentence 1: node and networkinitiated) requiretwo roundtrip time(RTT): one RTT for context transfer exchange and one RTT for MOBIKE SA address update which is the same as the new IKE/IPsec SA establishment.
Sentence 2: in case multiple CHILD SAs are already created then our proposal will pro­vide better performance since it is always restricted to two RTTs withoutconsideringthe number ofCHILD SAs.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.3 Observations At a glance, our Stackelberg game for CCRN is sim­ilar to the Stackelberg game for CRN in [1].
Sentence 2: there are di.erent characteristics which need to discuss more deeply including: Since some SUs increase spectrum resource pro­duction in the spectrum market by cooperation, the number of SUs n has more impact on pricing and investment.
Relationship: contrasting