sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: The resultant qi,h(r)is proportional to the link quality between the BTS i .Dh and the SHO user h [3].
Sentence 2: qi,h(r)= qh(r) ×wi,h,where wi,h is the weighting factor of required transmission power a wi,h for the link between BTS i and user h. is designed as wi,h = Li,h/ Li,h.
Relationship: entailment
Domain: Networks
Sentence 1: The provision for upstream communications during SMTP hand­shake in [15] is inadequate for the purpose of providing policies Figure 2: Service Level Agreement Policy (SLAP) The choice of selecting between one of the above transmission schemes is entrusted to SLAP.
Sentence 2: sLAP must .rst eval­uate the trustworthiness of a sender and its SESP and accordingly grant them the desired service level, as pictured in .gure 2.
Relationship: entailment
Domain: Networks
Sentence 1: Therefore, after local defects are turned off by breaking the links between state 0 and state 1 nodes, the degree on a cycle which makes a nonzero class in .rst homology of the Rips complex Rr(X) is determined by the number of wavefronts already generated and their directions of propagation.
Sentence 2: degree on all cycles is determined absolutely by the number and directions of the waves they pass through.
Relationship: entailment
Domain: Networks
Sentence 1: Given that past studies of the Internet peering ecosystem assumed exactly the opposite of what our .ndings sup­port, there is a need for a major overhaul of the mental picture that our community has about the AS-level Internet, not only in terms of local and overall structure, but also with respect to its evolution in response to often rapidly changing business conditions locally at an IXP or within the larger Internet.
Sentence 2: we argue that assess­ing the standing of a network within the Internet s ecosystem has to account for network-speci.c features (e.g., business type) and some notion of traf.c that this network is responsible for, either as a source, sink, or transit entity.
Relationship: entailment
Domain: Networks
Sentence 1: We do this by considering the Jaccard distace of the label sets L(x) and L(x ' ), which is de.ned as follows: ` ' ´ |L(x) nL(x ' )| J x,x |L =1 - .
Sentence 2: |L(x) .L(x ' )| the Jaccard distance captures the extent to which two label sets overlap, as a fraction of the total number of labels in both sets.
Relationship: entailment
Domain: Networks
Sentence 1: To see why, notice that while Tier 1s are more central (and thus have short paths to most ASes in the internetwork), they are also more expensive.
Sentence 2: a Tier 1 is always a provider/peer of its neighbors, so even if those neighbors learn a short path through the Tier 1, they will prefer to route over a (potentially longer) path through one of their own customers.
Relationship: entailment
Domain: Networks
Sentence 1: For each TCP connection in our traces, we compute the through­ put for every 50 Kbytes sent.
Sentence 2: we .lter out very short con­ nections, where throughput has not stabilized (e.g., the connection Percentage of hosts 70 60 50 40 30 20 10is in the TCP slow start phase [13]).
Relationship: entailment
Domain: Networks
Sentence 1: Fortunately, depending on the extent of the dataset that is collected and the nature of what-if scenario, machine learning al­gorithms can reveal the dependencies among the variables and use the dependency structure to intelligently re-weigh and re-sample the different parts of the existing dataset to perform this transfor­mation.
Sentence 2: if the what-if scenario is expressed in terms of the changes to values of the variables that are observed in the dataset and the changed values or similar values of these variables are observed in the dataset even with small densities in the origi­nal dataset, then we can transform the original dataset to one that is representative of the what-if scenario as well as the underlying principles of the system, while requiring minimal input from the network designer.
Relationship: entailment
Domain: Networks
Sentence 1: INTRODUCTION In wireless networks, node selection among competing nodes has been widely adopted in various applications such as coopera­tive communication schemes [2,4], medium access control (MAC) layer scheduling schemes [6], forwarding algorithms in wireless sensor networks (WSNs) [7], and vehicular ad hoc networks (VANETs) [5].
Sentence 2: a distributed and fast relay selection is an essen­tial operation for data routing in mobile networks with dynamic topology changes and short lived links [3].
Relationship: entailment
Domain: Networks
Sentence 1: We observe that the ordering of .ow assignment affects the performance.
Sentence 2: we .nd that assigning .ows in order of descending Di.Perf (f)*vf [i] performs very well, where Di.Perf (f) is the predicted performance difference between the best performing ISP and the worst performing ISP, and vf [i] is .ow f s volume during time interval i.
Relationship: entailment
Domain: Networks
Sentence 1: i ii j=1 In the former case the user is said to be blocked, in the latter to be dropped.
Sentence 2: we de.ne Pi(drop instant k)= k-1 « Y (0) (j) (j-1) (k) (k-1) = Ai(r)Ai(r|r) 1 -Ai(r|r) iii ii j=1 which is the probability that the user is dropped at the kth evaluation.
Relationship: entailment
Domain: Networks
Sentence 1: Delivering any MSG message to A ' , C ' also includes the message identi.er into the message.
Sentence 2: a ' can send an MSG message to C ' with a di.erent format; it only contains an identi.er id and an energy level e.Upon the reception of such a message, C ' searches for the original message which is associated with identi.er id in its internal store, and delivers this stored message using the energy level e. Although A ' also receives the original message with its associated identi.er from C ' , he is not able to modify that, since C ' only accepts a message identi.er issued by himself andanenergylevel from A ' .A ' can only delete messages, since A ' can also send special DEL and JAM ' '' messages to C .
Relationship: entailment
Domain: Networks
Sentence 1: These two problems are solved separately and coordinated by the pricing vector .. 4.2.1 The multipath opportunistic routing problem (SUB1) It is straightforward to see that problem SUB1 is decom­posable with respect to each player.
Sentence 2: both the objective and the constraint can be decoupled, thus each player performs an individual optimization: X max ln(.k)- .k · x k (17) ij ij k x (i,j).Ek subjectto: constraint(7) and(8).
Relationship: entailment
Domain: Networks
Sentence 1: (1) The number of POPs found for HE in Table 3 is 23 but in Table 5 the number of POPs found for HE is 24.
Sentence 2: pOPsicle deployed at Equinix Chicago saw an extra node in Calgary, Canada (YYC) which is veri­.ed with Datahive IX.
Relationship: entailment
Domain: Networks
Sentence 1: While previous studies have measured how quickly and thoroughly administrators patch software vulnerabilities [25, 27, 35], we are, to the best of our knowledge, the .rst to study admin­istration of certi.cates in the wake of a vulnerability.
Sentence 2: figure 6: Fraction of domains that have at least one host that was ever vulnerable to Heartbleed as a function of Alexa rank, as well as domains that continued to be vulnerable at the end of the study.
Relationship: neutral
Domain: Networks
Sentence 1: 618­622, Taipei, Taiwan, 15-18 October 1996.
Sentence 2: 2 i=1 the mean data delay is given by ~ ~~ ~ ~ E[Td ] =E[D1] +E[D2] +E[D3] +E[D7] , (30) ~ ' =T +E[D ] 7 '3 where T = T +NT .
Relationship: neutral
Domain: Networks
Sentence 1: For each relay group path, Cashmere incurs computational cost that in­cludes encryption cost of L· Ce at the source, decryption cost of 2Cd at relay group root, decryption cost of Cd at each relay group member, and additional operations to refresh caches after relay group root failures.
Sentence 2: if Cash­mere is being used for one-way communication (anony­mous message) the attacker infers the .rst relay group root on the chain (which includes the destination s re­ 1 lay group) as the source with probability if the L-n+1 .rst root is non-malicious, where n is the length of the chain.
Relationship: neutral
Domain: Networks
Sentence 1: With the help of the previous work [4], we can get the information of .ow setup time for three di.erent control plane cases: NOX, Beacon, and Maestro.
Sentence 2: an attacker will still face two challenges: (i) how to collect T 1 and T 2 values, and (ii) how to know whether T 1 values are di.erent from T 2 when considering random noises.
Relationship: neutral
Domain: Networks
Sentence 1: 5.2 Fuzzy-logic network self-organization In order to improve NORA s performance, we propose the in­corporation of fuzzy logic to the decision process, which is where NORIA (Network self-Organization Rule-based Intelligent Algo­rithm) comes into play.
Sentence 2: in Engineering Self-Organising Systems, pages 1 19.
Relationship: neutral
Domain: Networks
Sentence 1: Algorithm 1 SCA congestion avoidance window increase Require: ca increase thresh is the SCA parameter ca increase is initialised to 0 1: if ca increase =0 then 2: cwnd .
Sentence 2: previous research has shown that the discrepancy between a 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: neutral
Domain: Networks
Sentence 1: We consider a WLAN with an AP; each mobile node has a two-way conversation through the AP with a CN out­side of the WLAN, and all the downlink .ows are aggre­gated at the AP.
Sentence 2: correspond­ i=1 i ingly, we obtain the optimal contention windows for all the other classes [CW* ,CW* ] and the 2,min,CW3* ,min,··· S,min maximum admission region [N1 *,N2 * ,··· ,N*] S  4.3 Multiplexing at AP The contention window and admission region joint solu­tion can be applied to analyze the statistical multiplexing at AP.
Relationship: neutral
Domain: Networks
Sentence 1: A database or archive might also be valuable for people who did not participate in the es­tablishment of it, and publishing the data of a large survey usually does not mean that all the work is done.
Sentence 2: a scenario is feasible where one turns to an nmVO to get, let s say the average loss of a link on Mon­days between 2 and 3 o clock or the fastest path between two nodes.
Relationship: neutral
Domain: Networks
Sentence 1: A class-k-customer who arrives exogenously is allocated to an idle server in Jk and starts his service immediately, if he .nds any idle server in Jk upon the arrival.
Sentence 2: ¯Choose d> 0 such that ¯ Derivation of (28): Suppose that Zk(t) > 0 and CnCk = f. Zk(t) ¯ Zk(u) > for all u .
Relationship: neutral
Domain: Networks
Sentence 1: A recent work is proposed in [5] to study two competition problems between service providers with asymmetric information by applying the signaling game approach.
Sentence 2: how should be player II s reaction to the infor­ si and sj are computed as function of player I s belief, namely {{ 1, if b1 E [0, th1] and H1 = HG; 2, if b1 E [th1, 1] and H1 = HG.
Relationship: neutral
Domain: Networks
Sentence 1: 3.1 Middleware architecture OppStore is structured as a federation of clusters, with each clus­ter containing a Cluster Data Repository Manager (CDRM), which manages several Autonomous Data Repositories (ADR), one on each cluster node.
Sentence 2: if the system organized all grid machines in a single peer-to-peer overlay network, the constant changes in machine availability, which typically occur in opportunistic envi­ronments, would have to be treated as node joining and departure operations, which are expensive operations.
Relationship: neutral
Domain: Networks
Sentence 1: C 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0  1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0  1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0  aaa Figure5: COVERAGE:THE PROPORTIONOF CORRECTLY IDENTIFIED BADLINKS,ASFUNCTIONOFFRACTIONOFGOODLINKS.
Sentence 2: the transmission probabilities from the server at node 0 to the clients at nodes 2 and 3 are the products p2 = f1f2 and p3 = f1f3 re­spectively.
Relationship: neutral
Domain: Networks
Sentence 1: Each source initiates a session with a heavy-tailed distribution, in particular a Pareto distribution whose density is given by -d-1 g(r) =dbdr , r > b where d is related to the Hurst parameter by H = (3 - d) / 2 .
Sentence 2: we 1234 1234 will analyze only the first one in detail; the others follow similarly.
Relationship: neutral
Domain: Networks
Sentence 1: These probabilities must be multiplied by the probability P(ci)that a node is currently in its home cell and the probability P(cj)that a node is currently in cell cj, respectively: pij = P(cj|ci)* P(ci)+P(ci|cj)* P(cj).
Sentence 2: there has been a long discussion on the nature of contact and inter-contact times [8] [16] [9] [20].
Relationship: neutral
Domain: Networks
Sentence 1: use statistics to estimate the main and side lobes values for size and po­sition, while in [7], Gharavi and Bin propose a 2D model, consisting of a pie-wedge pattern shape with circular con­stantgain forsideandbacklobes.
Sentence 2: the ChannelAccess mustprovide meansforthe radiotoaccessthatinformation, since it is the entity that connects both sides.
Relationship: neutral
Domain: Networks
Sentence 1: The objec­tive is to determine how well LoadSense can be used to detect the presence or absence of synthetic background traf.c at different lo­cations inside a cell.
Sentence 2: loadSense uses a support vector machine generated classi.er that works with a set of readily-available features, including link quality, power ra­tio, and the observed variation in the power ratio, to make a binary prediction of the availability of low or high throughput for the cel­lular client.
Relationship: neutral
Domain: Networks
Sentence 1: To overcome this and other limitations, we plan to collaborate with the University of Oregon in the design of a next generation Route Views project which should greatly alleviate measure-ment problems by putting measurement probes di- rectly at a few critical peenng points (to remove the eBGP multi-hop problem), and collecting full, as opposed to partial, views from their peers.
Sentence 2: they still constitute less than 3% of the routing ta- ble and contributed to 61.8% of the total DPATH implicit withdrawals.
Relationship: neutral
Domain: Networks
Sentence 1: ; r) e. d., (3) 0 where e. is the unit vector in direction .. Wenotethatforagivendestinationr thed-.owintensityJ(x, r) correspondstoavector.eldinR2.Moreover,e.g.,inameshnet­workwithasinglegatewaynodethereisessentiallyonlyonedes­tinationinthenetwork,andthusitissuf.cienttoconsiderd-.owintensitytowardsthelocationofthegateway.Fromtheloadbal­ancingpointofview,thisscenario,however,istrivial.
Sentence 2: heat.owinaunitdiskcanbesolvedbythewell-knownmeth­odsofcomplexanalysis,see,e.g.,[13].Letthepositionofapoint(x, y) onthediskberepresentedbythecomplexnumberz = x + iy.Letw(z)= f(z)+ i.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 12 shows the number of authority switches needed under vary­   0 2 4 6 8 10 1 1.5 2 3 4 5 No.
Sentence 2: with wildcard rule caching in DIFANE, the cache miss rate is only 0.1% 0.001 0.0001 Cache size per switch (TCAM entries) Figure 14: Cache miss rate.
Relationship: neutral
Domain: Networks
Sentence 1: Fortunately, a popular ROM for the community (Cyanogenmod) incorporated early features into its active build allowing us to leverage the in.nite Bluetooth discov­erability at the cost of installing a custom ROM on each handset in the study.
Sentence 2: we would like to thank Sandy Pentland from the MIT Reality Mining group for his invaluable insight while we were beginning our study, Trish Smithwick and Kara Worman from Sprint for their invaluable support, Christine Broadbent for assisting with the day-to-day operations of managing the study, Margaret Pickard for serving as the undergraduate contact, numer­ous participants in the ERWiN REU site, and .nally Dirk Van Bruggen, Chris Miller, Nikhil Yadhav, and Salvador Aguinaga for their technical expertise in development.
Relationship: neutral
Domain: Networks
Sentence 1: We have presented results on the reconfigurable WCDMA Rake core and its supporting compiler that prove that C-programmable coarse-grained reconfigurable processors with a computational efficiency approaching that of ASICs at a modest area cost have finally become reality.
Sentence 2: each finger stores symbol dumps in a deskew buffer (random access FIFo buffer) from which they can be accessed for channel correction and maximum ratio combining after all multipath symbol dumps are available [3, 4].
Relationship: neutral
Domain: Networks
Sentence 1: MEASUREMENT RESULTS In terms of performance, the 3G UMTS standard is posi­tioned in between the 2.5G standards GPRS and EDGE and advanced 3G standards like HSDPA and HSUPA.
Sentence 2: we have measured UMTS uplink and downlink one-way delay for IPv4 ICMP packets, con.g­uring the loss limit which discriminates between losses and delay singletons according to RFC 2679 to be 5 seconds.
Relationship: neutral
Domain: Networks
Sentence 1: 3.2 Design of Dynamic-TEDI ( D-TEDI) TEDIwas originallyproposedfor webgraphs anddoes notwork with weighted ordynamicgraphs.Prior work[4]presents an algo­rithmdesigntohandle edge weight updates onatreedecomposi­tion, but no preexisting algorithm can handle edge insertions and deletions.
Sentence 2: 2.2 Interface Design There are two main functionalities that NetGraph will need to implement: a)query networktopologyincluding node andlink sta­tus to maintain an updated network graph, and b) compute graph queries andreturnquery resultsin aformthat canbe consumedby otherNaaS modules.
Relationship: neutral
Domain: Networks
Sentence 1: [14] TS C H U D I N , C., GO L D , R., RE N S F E LT, O., A N D WI B L I N G , O. LUNAR: a Lightweight Underlay Network Ad-hoc Routing Protocol and Implementation.
Sentence 2: before a selector can be sent back to the destination, the XRP resolution request has to be processed.
Relationship: neutral
Domain: Networks
Sentence 1: At low density the simulation performs similarly to the experi­ments on the motes; rateless Deluge has near optimal perfor­mance while ACKless and original Deluge perform similarly.
Sentence 2: we chose a .eld of size q =28 (corresponding to byte-length elements), which requires 256 bytes of memory to store inverses and has a probability of decoding failure of ~ 0.00392.
Relationship: neutral
Domain: Networks
Sentence 1: In each iteration, one in­formed node is adopted into the backbone; GK greedily chooses that informed node for adoption with the most uninformed neigh­bors (variations of that have as well been described in Guha and Khuller [8]).
Sentence 2: whether or not a message is correctly received depends on the instantaneous SNR at the receiver (assumed to be constant per packet).
Relationship: neutral
Domain: Networks
Sentence 1: Categories and Subject Descriptors C.2.1[Computer-CommunicationsNetworks]: Network Architecture and Design-Wireless Communications * Thisworkwascarried out whenH.Cui wasa researchintern at Microsoft Research Asia.
Sentence 2: we transmit 720 bit blocks in parallel pipeline style and need to maintain a 36KB bu.er at both sender and receiver end.
Relationship: neutral
Domain: Networks
Sentence 1: The BCE at the LMA contains a unique HNP per HIT_MN, which is notified to all MN s interfaces, resulting in a per-MN-prefix scheme and not a per-interface-prefix approach as in PMIPv6.
Sentence 2: i1 is routed by LMA to the correct MAG using the information in the BCE as in the PMIPv6 scheme.
Relationship: neutral
Domain: Networks
Sentence 1: Algorithm Run1 Run2 Run3 Average DFS 100 15.06 19.88 16.86 17.27 DFS 500 9.64 8.43 12.05 10.04 SLF 2.4 4.82 4.82 4.01  Table 1: Missed Contact Percentage in VMT from DOME Scenario InTable1,thepercentage of contact misses,fortheVMT results, are shown.
Sentence 2: we use two traces:  gps logs : These logs contain time stamped GPS loca­tions for every bus and for each day during the collection period.
Relationship: neutral
Domain: Networks
Sentence 1: Shortly after removing the address mapping from the table, a device broadcasts an ARP request for the recently removed address mapping, removing another entry prematurely when storing the result in the already full ARP table and triggering yet another ARP request.
Sentence 2: un­bound/unallocated addresses and pre.xes), and that drops, as well as possibly logs, any tra.c it receives.
Relationship: neutral
Domain: Networks
Sentence 1: @cs.umanitoba.ca Vojislav B. Mi .sic´ Department of Computer Science University of Manitoba Winnipeg, Manitoba, Canada  vmisic@cs.umanitoba.ca ABSTRACT The problem of admission control at the sensor cluster coordina­tor is considered in a beacon enabled 802.15.4 network.
Sentence 2: we will focus on calculating or approximating the packet service time as the main indicator of the cluster operating regime.
Relationship: neutral
Domain: Networks
Sentence 1: Based on those aspects, we introduce also the system architecture of our solution approach focusing on its communication layers that support shared connectivity for ubiquitous services.
Sentence 2: one may have to register a special data package at the personal mobile service provider, which will offer then the possibility to use e.g., the Wireless Application Protocol (WAP) or Enhanced Data Rates for GSM Evolution (EDGE).
Relationship: neutral
Domain: Networks
Sentence 1: {0, 1}l0 satis.es that the random variable (µ, H(µ, w)) has .1 statistical distance from (µ, u) that is uniformly distributed over R×{0, 1}l0 and w distributed according to RA conditioned on RC .
Sentence 2: we in­troduce two methods for key generation based on: (1) error­correction and key-veri.cation-information, and (2) the new primitive of fuzzy information reconciliators that we intro­duce.
Relationship: neutral
Domain: Networks
Sentence 1: (b) Camera I: Uncertainty of P when d increases in the worst scenario: 0.5 prob­ability that P is an attacker and all V sarefarfrom P , and (c) Camera II: Uncertainty of P when d in­creases in the worst scenario: 0.5 probability that P is an attacker and all V s are far from P distance to the authority, the veri.er can rescan the declared position.
Sentence 2: se­curity vulnerabilities must be considered when the system infers rights based on the UAV s location.
Relationship: neutral
Domain: Networks
Sentence 1: 4.2 Mobility models analysis Mobility models determine the way nodes move in a vehicle­based network and, as a consequence, the connectivity properties of the resulting system.
Sentence 2: for very low link durations (less than 5 s, as evidenced by the black line in the .gure), the two major contribu­ Probability Density Function 0.6 0.5 0.4 0.3 0.2 0.1 0 5 10 40 35.v (m/s) 15 30 20 2520 1525 10 5Link duration (s) 30 0 Figure 12: Speed difference PDF evolution over link duration 11 11 00 11 00 1 1 00 1 1 1 00 11 11 11 00 00 00 00 11111 1 11111 1 11111 1 11111 1 11 11 (a) (b) (c) Figure 13: Driving situations in.uencing the link duration tions come from neighbors traveling at relative speeds around 15 m/s and 5 m/s, corresponding to the driving situations depicted in Fig.
Relationship: neutral
Domain: Networks
Sentence 1: The following publish to a certain distance without updating LP t i .
Sentence 2: 8(1 + max(ß, ßT )) j=0 v <T1 + d.2.+2 8(1 + max(ß, ßT )) v v = d ·.2.+2(3 2(1 + max(ß, ßT )) + 8 5) .O(d) constant  8.2 Maximum Node Speed While proving the lemmas in the previous section, we for­ node mulated constraints on the value of vmax and TTLi.In this section, we collect all of these constraints and present the maximum node speed for which MLS is proven to work.
Relationship: neutral
Domain: Networks
Sentence 1: 1 Hop 2 Hops 4 Hops 20 vehicles/km 0.00 4.32 9.57 60 vehicles/km 0.00 6.44 19.38 Table 5: Average number of retransmission per beacon message for single-hop and multi-hopbeaconing, a pay­load size of 172 Bytes and di.erent vehicle densities.
Sentence 2: un­like TM, each reachable node is a relay in TC.
Relationship: neutral