sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Experiments with email and news reader ap­plications show that IMP provides predictable usage of budgeted resources, while lowering application response time compared to the oblivious strategies used by current applications.
Sentence 2: additionally, recent work [25] has identi.ed personal patterns in different users battery recharge behaviors, which suggests it may be possible to predict the budget period for the available battery energy.
Relationship: neutral
Domain: Networks
Sentence 1: Infat,pakettailgatinganworkwithoutaknowledg­mentsatallfromthedestination,althoughoururrentim­plementationdoesnothavethisfeature.Bydeployingsoft­wareatthedestinationhost,weanmeasuretheone­way delayofpakets.Thetailgatingsoureanontinuetosend latertailgaterpaketswithoutknowingthedelayofearlier tailgaterpakets.Iftheearlierdelaysanbeoasionally transmittedbaktothesoure,thenthesoureanadap­tivelydeidewhentofnishthetwostages,butthisisanop­timization.Otherwise,thetailgatersoureanjustsenda fxednumberofpaketsineahstage.Eventuallythesoure anddestinationmustommuniatesothatthesourean speifywhihtailgatedpaketswereprematurelydropped.
Sentence 2: wedesribeamulti­paketmodelinSetion3thatisableto detetmulti­hannellinksandtouseintra­fowpakets(i.e., fromthesamesoureandtothesamedestination)forbetter measurement.themodelsharestheassumptions thattransmissiondelayislinearwithpaketsizeandthatno extra­fowpaketsinthepathwillausethemeasurement paketstoqueue.
Relationship: neutral
Domain: Networks
Sentence 1: Interestingly, we demonstrate that the allowance of certain data forwarding loops can actually reduce end-to-end data delivery delay.
Sentence 2: delaywith and withoutOpportunisticLooping   6 ImplementationandEvaluation We have implemented a complete version of the DSF for- it should be emphasized that although opportunistic looping reduces end-to-end delay, it introduces additional communication overhead.
Relationship: neutral
Domain: Networks
Sentence 1: From Lemma 2, each Slave-designate belongs to exactly one cluster.
Sentence 2: let Y = ~-~T=I 1~, where 1~ E {0, 1,..., N} We set E[Y] = k Let Z = ~--~i~1 Zi, where Zi e {0, 1} P[Z -~ >_ e]  n# + he] < e -2"~2 = ~~i:l E[Zi] where n = T, Zi E [0, 1], and Zi = -~ E[Z] = n# P[Y/N > k/N + Te]  k + N ] < e -2~=/T
Relationship: neutral
Domain: Networks
Sentence 1: To produce Weighted Max Min Fairness instead of Max Min Fairness, a core router replaces the sum of IE .ows, N, in Eq.
Sentence 2: the router at link A-B issues feedback such that the traf- Used for load balancing PATH_UTILIZATION POSITIVE_FEEDBACK NEGATIVE_FEEDBACK WEIGHT Explicit feedback to prevent oscillations Used to prefer shorter paths Figure 2: Probe Packet.
Relationship: neutral
Domain: Networks
Sentence 1: Entropy estimation: The entropy of traf.cdistributions(e.g.,dis­tribution ofpktsperdstport) is usefulfor anomalydetection[29] and traf.cclassi.cation[43].Inparticular,entropy-based analysis captures .ne-grainedpropertiesthatcannotbeobtained withjust volume-based analysis.
Sentence 2: for example, to obtain the network-wide FSD, we takeeachper-ingressFSD and normalizeitby thenumberof .ows originating atthatingress.
Relationship: neutral
Domain: Networks
Sentence 1: VR smainadvantageoverL2SisthatmanyoftheL1evictionsareretainedbythelocalL2,andthereforemanyfutureaccesseswillhitinthelocalL2ratherthaninaremoteL2.However,itsmaindrawbackisthattherearemanyredundantL2copiesinthenetwork.Evenifalineofdataisnotsharedbymorethanonenode,itwillexistintwonodes(unlessthesharernodeisthesameasthehomenode).Thus,theeffectivetotalL2capacityisalmosthalved,whichleadstomorecon.ictsandhencemoreoff-chipmemoryaccesses.InSection4,weseethatwithamodestlysizedL2cachepernode,VRactuallysuffersa32%memoryaccesslatencypenaltyascomparedtoL2P.
Sentence 2: categories and Subject Descriptors: C.2.1[NetworkArchitec­tureandDesign]:Packet-SwitchingNetworks;C.2.2[NetworkPro­tocols]:ProtocolArchitecture(OSIModel) General Terms:Design,Theory Keywords:Chip-multiprocessor,CMP,Interconnectionnetwork,NoC,Migration,Network-drivencomputing 1.
Relationship: neutral
Domain: Networks
Sentence 1: By projecting the locations onto a grid-like struc- ture, and assigning local rebroadcast algorithms to those locations, we induce an SDS that directly represents the communication system at a point in time.
Sentence 2: 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: neutral
Domain: Networks
Sentence 1: Consider the following BS warp_drive console output: D2D slot 7 direct-mode measurements: =>Rx SN: 112 113 114 115 116 117 118 119 120 121 =>RSSI : 188 180 186 183 174 190 192 180 187 181 D2D_CTRLMSG_RPT_MEAS received from Node 9 @ FID=59 D2D slot 7 direct-mode measurements: =>Rx SN: 113 114 115 116 117 118 119 120 121 122 =>RSSI : 296 300 286 305 297 281 299 293 301 293 In this experiment we see that the RSSI values of the direct link from SAMPLE RIGHT , averaging around 300, is signi.cant stronger than the SAMPLE BS values of approx­imately 180.
Sentence 2: at this point the node hasn t been assigned any uplink or downlink data timeslots yet.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 1: Daily variation in DNS replies from authoritative nameservers to local resolvers Figure 2 shows the number of the three DNS errors.
Sentence 2: categories and Subject Descriptors C.2.0 [Computer Communication Networks]: Gen­eral General Terms Measurement, Management, Security Keywords DNS, Classi.cation, DNS error, Mis-con.guration 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: SOME BASIC GRAPH THEORY With this network model, we can represent an ad hoc net­work at each time instant as an undirected graph G.A graph G = G(V,E) consists of a set of n nodes (vertices) and a set of m node pairs (edges, links).
Sentence 2: if (k- 1) nodes fail, the graph is guaranteed to be still connected.
Relationship: neutral
Domain: Networks
Sentence 1: In order to achieve the Self-Powered WSN paradigm, the limited energy storage of the nodes leads to the necessity of harvesting the available energy which can be found in the close environment of a sensor node.
Sentence 2: having an average harvesting power PS, and a certain communication rate, R in packets per second units, the needed storage capacity to achieve a certain ploss is di­rectly given by: P C = f-1(ploss).
Relationship: neutral
Domain: Networks
Sentence 1: Based on predicted trajectory and pre­vious encounters with vehicles in other paths, A decides to relay the message to B instead of carry-and-forward it to E. After B takes the message, it relays it to C because the de­lay for C to carry-and-forward the message en route is less than B (due to delay of passing construction area).
Sentence 2: (aT exp (s)+(1-a)Texp (s))+(1-.
Relationship: neutral
Domain: Networks
Sentence 1: In the low-load, 40pps, scenarios, LDR maintains a very high delivery ratio at all mobility speeds.
Sentence 2: (2) Feasible Distance Condition (FDC): Node I must set rrD# = 1 in a relayed solicitation for destination D that it forwards if snXD---- SUb ~ and fdXD _> fdD #.
Relationship: neutral
Domain: Networks
Sentence 1: Poster: INPRESS -Indoor Climate Prediction and Evaluation System for Energy Ef.ciency using Sensor Networks  Jae Yoon Chong1 Jinwook Baek1 Sukun Kim2 jaeyoon.chong@alumni.cmu.edu nujabes8@alumni.cmu.edu sukunkim@sinbinet.com 1Independent Research Initiative in Sensor Networks (IRISEN) 2Sinbinet Abstract Modern buildings include an indoor climate control sys­tem, installed and operated to maintain a comfortable en­vironment for the building occupants.
Sentence 2: each subplot shows a large error value only at zero, which indicates that the prediction errors were uncorrelated in time.
Relationship: neutral
Domain: Networks
Sentence 1: In practice, the interesting regions for the four effective SNRs do not overlap be­cause at a particular effective SNR value only one modulation will be near the transition from useless (BER 0.5) to lossless (BER 0).
Sentence 2: they may implement soft Viterbi decoders with more or fewer soft bits for their internal state, or indeed might do hard de­coding instead.
Relationship: neutral
Domain: Networks
Sentence 1: Moving from a game-specific model to a wide range of existing online games (including console based games)  Using a number of users for subjective testing in line with accepted test models used in telecommunications based scenarios recommended by ITU-T  Expecting a level of correlation in excess of 95%.
Sentence 2: model Calibration To make the proposed model applicable and usable a calibration process was carried out.
Relationship: neutral
Domain: Networks
Sentence 1: (Projectnumber: 0421010012 -M47020012) 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.
Sentence 2: transparency to changes in IP address is achieved by ensuring that the original IP addresses of a packet is restored to the instant when the connection is established.
Relationship: neutral
Domain: Networks
Sentence 1: 6.2.2 Lookup, insert and delete performance Subsequently, we measure the PIT access (lookup, insert and delete) performancebyENPT.Wedonot measurethe update perfor­mance, because updating PIT means appending interfaces to a spe­ci.c PIT entry, whose performance it very close to that of lookup.
Sentence 2: then the code series areusedtolookup, deleteandupdatethePIT,asshownbyFigure6.
Relationship: neutral
Domain: Networks
Sentence 1: 8, when we vary the duration of t3 - t2 from 0 s (the neighboring node re­sponds to the REF beacon right after it .nishes receiving thepacket) to 25s(theneighboring noderesponds 25s af­ter it receives the REF), the synchronization error of the MU-Sync increases with the duration of t3 - t2 .
Sentence 2: typically, each clock may have slight di.erences in angular frequency due to the manufacturing process.
Relationship: neutral
Domain: Networks
Sentence 1: (Thismayinvolvecon­fguringstaticroutesfortheseprefxesintheedgerouters thatterminatetheaccesslinks.Alternatively,thecustomer mayannouncetheseroutestotheISPusingaroutingpro­tocolsuchasRIPorBGP.
Sentence 2: collectingpacket-leveltracesateachingresslink wouldbeprohibitivelyexpensive.Inaddition,trafcengi­neeringdoesnotnecessarilyneedtooperateatthesmall timescaleofindividualpackets.Instead,weproposethat .ow-levelstatisticsshouldbecollectedateachingresslink.
Relationship: neutral
Domain: Networks
Sentence 1: One of Reaching a Concave Node the .rst works in this area was Compass Routing II [12], also called Face Routing , proving that Delaunay triangu­lations of point sets on the plane support compass routing Y[km] 1 0.8 and guaranteeing delivery.
Sentence 2: we intend to study the e.ect of snapping , nodes quick change of virtual place­ment after losing a dominant neighbor, on the routing and repositioning algorithm.
Relationship: neutral
Domain: Networks
Sentence 1: [1] dealt with the switching of sensor state between active and idle mode, while Zhang et al.
Sentence 2: the wireless sensor network platform is considered to be a linear two-dimensional grid structure; moreover, our communication restoration model considers a disjoint group of base stations and it employs meta-heuristic approach [14][15] to relocate the alternate base station to restore the communications with minimal energy consumption.
Relationship: neutral
Domain: Networks
Sentence 1: [24] B. Parno and A. Perrig, Challenges in securing vehicular net­works, in Workshop on Hot Topics in Networks (HotNets-IV), 2005.
Sentence 2: for a proces­sor with equivalent performance to our Core 2 machine, inserting all of the 25,000 certi.cates of a revoked vehicle could be done in less than 100 ms.
Relationship: neutral
Domain: Networks
Sentence 1: Inordertoavoidhighomputationintheroot,theom­putationisondutedonebasedonthelatestpiggybaked neighborinformationofpartiipatingnodeswhenaRREQ messageisreeived.Itisintuitivelylearthattheomputa­tionproessisrelativelysimpleandonsumeslessompu­tationpowerfortheroot.
Sentence 2: [4]PartII:WirelessLANmediumaessontrol(MAC) andphysiallayer(PHY)speifations,ANSI/IEEE Standard802.II-I999.
Relationship: neutral
Domain: Networks
Sentence 1: When best equates to shortest paths, the algorithm is guaranteedto converge.
Sentence 2: itcomprises: a set of labels L;  a set of signatures S;  a set of weights W;  afunction f that maps signaturesinto weights;  a total order :on W;and  abinary operation .thatmapspairs of alabel and a signature into a signature,i.e.,.
Relationship: neutral
Domain: Networks
Sentence 1: On the other hand, each phase in the distribution stage consumes O(i) slots to be com­pleted and, hence, the distribution stage consumes O(ilogiN) slots.
Sentence 2: although the linear SL scaling law still persists under two-phase cooperation, Table 1 shows that varying the parameter i from 1 to N varies the scaling laws between the two extreme strategies.
Relationship: neutral
Domain: Networks
Sentence 1: INTRODUCTION Small-cell (loosely referred to as femtocells) overlay ar­chitectures hold the promise of signi.cantly increasing the available wireless broadband capacity, especially in highly­tra.ced public indoor spaces (such as shopping malls, sub­way stations and college/o.ce buildings).
Sentence 2: in this study, we assume that we know the transmit power Pi (=100 mW) and 3-D location for each FAP and the true distances for each (UE, AP) combination.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 5: Mean of daily relative speed of the two main Chilean ISPs in December 2011 for Movistar and VTR plans  4.2 Defending the users rights As we stated before, Adkintun started monitoring and gathering data since September 2011, but it was in January 2012 when we presented the data to the users and started to publish it via social media and Internet forums.
Sentence 2: they have di.erent objectives than our work, e.g.
Relationship: neutral
Domain: Networks
Sentence 1: [30] ZHANG,L., TIWANA,B., QIAN,Z., WANG,Z., DICK, R. P., MAO,Z.M., AND YANG, L. Accurate online power estimation and automatic battery behavior based power model generation for smartphones.
Sentence 2: after the Always IMP: energy 4 IMP: data  IMP: both 2 user reads an article, the benchmark pauses for a random think time uniformly distributed between 30 and 60 seconds, then moves on to the next article in the feed, continuing until the feed is exhausted.
Relationship: neutral
Domain: Networks
Sentence 1: The percentage of 6to4 was higher for FA-tests, whereas the percentage of native IPv6 was higher for JS­tests.
Sentence 2: our method not only measures the fraction of clients that prefer IPv6 over IPv4, but also the fraction of clients that are IPv6-capable (including latent Teredo [16] capabilities), or use an IPv6-capable DNS server for query resolution.
Relationship: neutral
Domain: Networks
Sentence 1: Ifthe SINRperformance arequite the same for the proposed game and the SA, on the contrary we can observe a great di.erence in terms of power alloca­tions.
Sentence 2: usersthat causehighinterference transmittingathighpower will obtain high value of pricing, due to the fact that O(p) is strictly increasing with p. The pricing function is written as follows: .
Relationship: neutral
Domain: Networks
Sentence 1: However, they have an impact on the network-level cluster­ing, and thus their presence cannot be neglected;  lane changes do not have any noticeable effect on the net­work topology: urban scenarios, with roads whose length is in the order of the hundreds of meters, do not leave a lot of chances to perform overtakings, as it would instead happen in highway traf.c.
Sentence 2: 4.2.3 Discussion The results of the network connectivity analysis shown before invite to re.ect upon two issues in particular: the need for realism in vehicular networking, and the opportunities that a topological study offers to network protocols evaluation and development.
Relationship: neutral
Domain: Networks
Sentence 1: To copyotherwise, torepublish, to post on servers or to redistribute to lists, requires prior speci.cpermission and/or a fee.ACM CoNEXT 2010, November 30 December 3 2010, Philadelphia,USA.
Sentence 2: ourexperimentsshowthat ACORN (i) outperformsprevious approaches that are agnostic to CB constraints; itprovidesper-APthroughputgainsfrom 1.5xto 6x and (ii) inpractice, its channel allocation module achieves an approxi­ 1 mation ratio much better than O().
Relationship: neutral
Domain: Networks
Sentence 1: Let T RA =tr | tr is a trace for S' and tr has the same system input as observed on T r} (2) be the set of possible system traces for S' when rerunning the system S' with the same system input.
Sentence 2: rerunning may not always be feasible in practice given the time, .nan­cial cost or the potential impact on patients [14, 3].
Relationship: neutral
Domain: Networks
Sentence 1: 8 (..) .. (.. + ..) - .. (..) = ..(...., .. (.. + ..)) - .. 8 .. (.. + ..) - .. (..)+ - .. ' (..) .. 8 <2...
Sentence 2: for example, the packet arrival process in this paper is only required to be mutually independent and temporally i.i.d., while the packet arrival processes in [4, 5, 6] have to meet additional conditions.
Relationship: neutral
Domain: Networks
Sentence 1: To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior speci.c permission and/or a fee.
Sentence 2: eNSURING CORRECTNESS IN SmartRE As we saw in the previous section, there are three key features in SmartRE: (1) it allows a packet to be decoded multiple hops downstream from the ingress where it was encoded, (2) it splits caching (and decoding) responsibilities along the RE elements on a path, and (3) it uses a network-wide approach for allocating caching responsibilities.
Relationship: neutral
Domain: Networks
Sentence 1: The maximum variation of the average RSS in a cluster is found between two sensors located at (R - Rcluster) and (R + Rcluster) meters away from the PT, respectively, where R is the distance between the PT and the center of a clus­ter, and Rcluster is the radius of a cluster.
Sentence 2: figure 8: Performance comparison (in PMD) of en­ergy detection: AWGN channel vs. shadow-fading channel (when noise uncertainty is 1 dB).
Relationship: neutral
Domain: Networks
Sentence 1: By simulation with names extracted from the IRCache traces, we demonstrate that our forwarding en­gine achieves a promising performance of 8.8 MPPS and our NDN router can forward NDN traf.c at 20Gbps or higher.
Sentence 2: cONCLUSION &#38; FUTURE WORK In this paper, we proposed a design of an NDN data plane based on hash tables, which not only enables high-speed forwarding but also provides DoS-resistance for an NDN router.
Relationship: neutral
Domain: Networks
Sentence 1: The underlying reason is that current 3G/4G standards sup­port soft handover/handoff [20], which enables to simultaneously connect to multiple base stations and send/receive data to/from them.
Sentence 2: we then con.gure phones to use 3G networks only and perform the DL­UDP-200kbps experiment on Route 13 at the speed of 104 km/h.
Relationship: neutral
Domain: Networks
Sentence 1: Opt(y)- 1 r + r 1 ' 10: if tky = r and ty > Opt(x)then 11: Opt(x).
Sentence 2: if gic+ i gmci <B, the adversary selects the link li with the maximum value of GD(i)as a victim link and jams the link until li starts to use p(ti).
Relationship: neutral
Domain: Networks
Sentence 1: Our work systematically investigates the dynamics of TFRC, TCP, RAP, and the SQRT binomial algorithm under variable band­width conditions, using persistent loss rates, long-and short-term fairness, utilization, and smoothness as metrics.
Sentence 2: in Figure 7, each column of marks shows the results from a single simulation, with one mark giving the observed throughput for each of the ten .ows.
Relationship: neutral
Domain: Networks
Sentence 1: The IMEC SE consists of two core components: an ana­logue RF front-end SCALDIO (SCAlable raDIO) and a DIg­  (a) USRP N210 -FFT 128 bin (b) Atheros AR9380 -FFT 56 bin (c) IMEC SE -FFT 128 bin Figure 1: Screenshots of PSD estimations for di.erent devices and con.gurations  (a) NITOS ACM card (b) Testbed node attached with the developed hardware solutions Figure 2: Hardware components and modi.cations to sensing devices ital Front-end For Sensing (DIFFS).
Sentence 2: uSRP N210 is capable of monitoring 25 MHz of bandwidth, limited by the maximum bandwidth of Gigabit Ethernet, while the USRP E110 device is limited to bandwidth sizes up to 8MHz, due to the reduced sampling rate and processing capabilities.
Relationship: neutral
Domain: Networks
Sentence 1: OSPF-OMP [40], an Internet draft, describes another technique that .oods the realtime link load infor­mation and adaptively routes traf.c across multiple paths.
Sentence 2: ui(n) because uM (n) is a linear combination of link utiliza­tions at step n, whereas ui(n) is the maximum utilization at step n. uj (n + 1) <uM (n) .
Relationship: neutral
Domain: Networks
Sentence 1: Session-speci.c .elds can typically be updated us­ing only state inferred from output of the veri.er.
Sentence 2: compute decision procedure (STP) (s) .029 .013 0.10 .652 .142 .95 7.54 2.02 5.73 Total time to solve formula (3+4+5) (s) .142 1.744 15.29 Table 4: Checksum replay performance.
Relationship: neutral
Domain: Networks
Sentence 1: 3.5 Fault Tolerance Rings are well known to be less fault tolerant than a multi-rooted tree: two link failures in a ring partition the network.
Sentence 2: for rack level shuf.e traf.c, the normalized  Network Latency without Congestion # of 64-port Switches Wiring Complexity Path Diversity 2-Tier Tree 1.5µs (3 Switch Hops) 17 16 1 Fat-Tree 1.5µs (3 Switch Hops) 48 1024 32 BCube 16µs (2 Switch Hops &#38; 1 Server Hop) 32 960 2 Jelly.sh 1.5µs (3 Switch Hops) 24 240 =32 Mesh 1.0µs (2 Switch Hops) 33 528 32 32 (with WDMs) Table 9: Summary of different network structures with 1k servers  throughput is about 0.75.
Relationship: neutral
Domain: Networks
Sentence 1: Under the former case, the residual WAN bandwidth after accounting for cross-traf.c is above 8Gbps needed for IB DDR 4x, but in the latter case the residual bandwidth is below 7.6Gbps.
Sentence 2: in general, latency-sensitive applications may have to be suitably enhanced to account for the larger RTT of wide-area connections.
Relationship: neutral
Domain: Networks
Sentence 1: In this case, n pairs of conversion functions must be de.ned for Ai because each of its component Aid, d = 1, ...,n, requires a pair: (1) Fid.0d: Sid .S0d, and (2) F0d.id: S0d .Sid.
Sentence 2: we propose to extend the routing algebra framework as follows.
Relationship: neutral
Domain: Networks
Sentence 1: More speci.­cally, using the port(s) listed in the 2nd column of the table, we ex­tract 10,000 unique .ows containing the port(s) from the NetFlow dataset beginning at 10:00am on 02/17/2006 to generate the cor­responding .owset F for each application TAG.
Sentence 2: we introduce our proposed tNMF graph decomposition method and address key practical issues in Sec.
Relationship: neutral