sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: The superior per­formance of entropy metrics on truncateddata suggests that the distribution of .ows per network pre.x is similar to the distribution per IP address.
Sentence 2: in Switzer­land and in the European Union any data that can be used either directly or indirectly, i.e., through the use of addi­tional information, to identify an individual is considered personaldata and must thereforebeprotected.
Relationship: neutral
Domain: Networks
Sentence 1: The covariance of X (t) given (Y(t) ' ,Z(t) ' ,Y (t - 1) ' ,Z(t - 1) ' ,··· ) can be written using the following proposition.
Sentence 2: resource limitations (cache memory, required band­ width, etc) and the high volume of tra.c in today s high speed network allow only for limited measurements through sampling.
Relationship: neutral
Domain: Networks
Sentence 1: Then, Carol s cost is O(2(b/2+1)r ' ) a b/2+1 while the cost to Alice is O(T lnn)since she will proceed intothenext(and,w.h.p., .nal)round.
Sentence 2: by atleast step h = 2(1-(h+1)/k)i k-1, the set Si,k-1 contains T(n lnn )informed nodes which en­ 2i/k sures that all remaining uninformed nodes can receive m ifno step in creating Si,h isblocked.
Relationship: neutral
Domain: Networks
Sentence 1: Compared with the special cas­ es in Section 4, when k = 2, the LS algorithm guarantees rendezvous in O(|Vi||Vj |) time slots, which corroborate the v analysis, and while k = O( n), the quorum based algorithm guarantees rendezvous in O(n) time slots, which meets the lower bound when both |Vi|, |Vj | =O(n).
Sentence 2: 4 guarantees rendezvous in M TTR = |Vi||Vj | O( k2 Number of channels: N ) time slots.
Relationship: neutral
Domain: Networks
Sentence 1: Headphones and earphones use a soft cable, which may advertently or inadvertently become coiled.
Sentence 2: based on our experimental results, under typical distance between the transmitter and receiver, such as 2.5 meters with a RSSI of -100 dBm, m=2 can offer a good reliability, i.e., a bit error rate of less than 5%.
Relationship: neutral
Domain: Networks
Sentence 1: Suhasimpleserviehandofprotool,however,isnotsuf­fient.Itfailswhenommuniationpartiipantsperform handofssimultaneously,sinetheterminalagentsforthe newendpointswouldnotknowofoneanother'sexistene andannotsendthenotifationmessagesfordatafowes­tablishment.Asaresult,thesystemisinaninonsistent state.Similarly,ifaterminalagentfailsandreoverswith anewIPaddresswhenaserviehandofours,thenewly reoveredagentwouldnotknowoftheserviehandofa­tivitythathastakenplae.
Sentence 2: failurereoverymehanismsarerequiredtosavethegroup IDandtheurrentmembershiplist(eitheratsomeend­pointorsomelusterstatemaintainer)sothatthereov­eredmemberanontinuepartiipatingthegroupmem­bershipprotool.
Relationship: neutral
Domain: Networks
Sentence 1: ACKNOWLEDGEMENTS We thank Brian Levine for input during the initial discus­sions of this work, Brian Lynn for help with the measurement set up, Devesh Agrawal for help with implementation of fast switching, and Mira Dontcheva and Wilmot Li for help with collecting data in San Francisco.
Sentence 2: the VoIP quality may be a.ected.
Relationship: neutral
Domain: Networks
Sentence 1: We find that the amount of data generated during the sleeping cycle (200ms) is 5000 bytes (packet size*sleeping cycle/inter arrival rate) which is just half of an OFDM bandwidth.
Sentence 2: in order to fulfill the capacity of the allocated OFDM frame, a BS repeatedly put the packe ts which have the smallest counter into this OFDM frame until the capacity of the fragment OFDM frame is completely fulfilled.
Relationship: neutral
Domain: Networks
Sentence 1: }), {Nr with nonce Nr not seen or generated before by B; B B (2) At time t2 , recorded as tREP , node B has sentmessage m2 = B ); (REP,Nr B (3) At time t3 , recorded as tRNG, node B has received a RNG message m3 =1||Ns , with Ns neither seen nor generated before by B; A (4) Node B has received the following message with tREQ A and tREP passing the synchronization test: AAA m4 = (ACK,Ns,tREQ,tREP ,tRNG,MACKAB {.})
Sentence 2: as we show in Section 2, virtually all of them are not generally applicable to WSN, either because they need specializedhardware,orthey rely onthepresence of an external trustworthy infrastructure, or because they are based on assumptions that limit their applicability.
Relationship: neutral
Domain: Networks
Sentence 1: Since BlTl = IlTl and BhTh = IhTh, IlTl > Il Ih Il Bh Bl = Bh IhTh is true according to the assumption and Ih Il Ih Lemma 1.
Sentence 2: [3] H. S. Ashwini, Amit Thawani, and Y. N. Srikant.
Relationship: neutral
Domain: Networks
Sentence 1: (4) 1 - Pi If all hosts share the same CW and consider the successful transmission and collision intervals like any other intervals during which they wait3,the attempt probability Pe can be computed as [5,9,7]: 2 Pe(CW)= .
Sentence 2: this has low impact on the through­put,because of the .at shape of the cost function for a large number of hosts N (cf.
Relationship: neutral
Domain: Networks
Sentence 1: d y s f e d e g ) m  Some text in this electronic article is rendered in Type 3 or bitmapped fonts, and may display poorly on screen in Adobe Acrobat v. 4.0 and later.
Sentence 2: h F s , n s F  y 1 s d d F l l y , e : o y a n f l m F m y e n k l r r m n e e t F d a s F .
Relationship: neutral
Domain: Networks
Sentence 1: In order to sim­plify the simulation and reduce the calculation time, two-ray propagation model is chosen, given by: Pr(d)= Pt + Gt + Gr -Lp(d) (1) where, the path loss in the indoor environment is calculated as Eq.
Sentence 2: the mobility of the MS is usually unstable and hence the predicted direction may have an error range as mentioned above.
Relationship: neutral
Domain: Networks
Sentence 1: The number of ANs on our testbed and the variety of links they route their packets via, allow for a pragmatic real-world evaluation with live Internet traf.c.
Sentence 2: aN1 is a WiFi WPA2 network, AN2 is offering a UMTS link with 7.2Mbps/2Mbps down­link/uplink theoretical capacity and 180 ms roundtrip la­tency, and .nally, AN3 offers a Satellite link by Inmarsat us­ing an Explorer 500 mobile terminal with 464kbps/128kbps downlink/uplink theoretical capacity and 1 second roundtrip latency.
Relationship: neutral
Domain: Networks
Sentence 1: Although the execution time for the optimization part of the k-medoids al­gorithm is better, the execution time for the construction of the pair-wise distance table should be included in overall execution time of the algorithm.
Sentence 2: since the hop distances between a set of CC locations and all other nodes in G can be com­puted in O(n + |E|), the worst-case time complexity of the clustering algorithm is O(k(n + |E|)).
Relationship: neutral
Domain: Networks
Sentence 1: If an honest node p requests data m where |m| = c 2 log3 N, and if there are at most contention(p, m) concur­rently active nodes during the request; then p can get the data in O(|m| · contention(p, m)) time w.h.p.9 PROO F. First, notice Lemma 10 guarantees honest nodes will not be incorrectly removed before their requests are completed.
Sentence 2: we will show, with prob­ability at least 1 - 2e, at least one identity in S suffers 81k/512c losing rounds.
Relationship: neutral
Domain: Networks
Sentence 1: PE3 is on due to the update at T =4.7 second in Table 1.
Sentence 2: when routes associated with a VRF gets dis­tributed via the MP-BGP session, this RD gets added to each IPv4 pre.x to form a VPNv4 pre.x (i.e., (RD:IPv4-Pre.x)).
Relationship: neutral
Domain: Networks
Sentence 1: Most of the network is therefore devoid of applica­tion tra.c, which, as explained previously, leads to a lack of stable multihop routes in those areas.
Sentence 2: sensors within the range of an event region/epicenter (enclosed by the dotted ellipse) generate data events that travel along a propagation funnel (enclosed by dotted line) to­ward the sink when an event occurs.
Relationship: neutral
Domain: Networks
Sentence 1: In this paper, we consider a case where time sensitive multimedia is sent using multiple paths which can make better use of load balancing strategies, increase bandwidth and save node energy.
Sentence 2: pVi of path i is initiated at source node as follows: PVi = PVin Path Evaluation  Initiation The source node needs to update the PVi of path i after a share of data has been sent to path i.
Relationship: neutral
Domain: Networks
Sentence 1: The results for the Nash equilibrium when .ows vary their decrease parameters are shown in (b).
Sentence 2: 1.since CHOKe+ assigns a much higher loss rate to .ows than RED for the same setting of the in­crease or the decrease parameters of the n .ows (Figures 5(a) and (c)) and since CHOKe+ induces many more bursty packet drops than RED (this is intuitively clear from the CHOKe+ algorithm), TCP SACK .ows tend to time-out occasionally when CHOKe+ bu.ers are used.In fact aggressive TCP SACK .ows will time­out quite frequently under CHOKe+.The goodput equation for Gentle .ows (Equation 24) does not capture this time out behav­ior.Hence, Figures 6(a) and (b) do not correctly represent the behavior of CHOKe+.Indeed CHOKe+ results in a much less aggressive parameter setting at Nash equilibrium than RED, as our simulations for the TCP Game (described below) show.
Relationship: neutral
Domain: Networks
Sentence 1: In this case, local movements are statistically predominant across all movements of a node.
Sentence 2: the power law selection of the modi.ed HCMM model will consider only a subset of  200 500 1000 2000 distance [m] Figure 4: MLE .tting -100 communities all thepossible distances, thus creating what we have called subsampling e.ect.
Relationship: neutral
Domain: Networks
Sentence 1: The experimental evaluation reveals that such protocol discovers about 10% more disjoint covers than does the best algorithm of Slijepcevic and Potkonjak [13].
Sentence 2: one potential problem here might happen when two neighbor nodes are making the decision of turning themselves off at the same time, so that one thinks that the other can cover for it and both go off-duty this situation leads to blind areas what jeopardizes coverage.
Relationship: neutral
Domain: Networks
Sentence 1: Of course, in the case that even if Tx powers off, Tx cannot 21achieve its target with its current transmission power, then it simply offers no reward to Tx .Up to now, we showed how a 2transmitter defines its reward, as well as the percentage reduction of the transmission power that it demands.
Sentence 2: fairness has to do with whether, trying to find out a (N-1)-feasible solution, the unsatisfied node varies with the time (and this will always be one of the unsatisfied nodes at the last round of FM).
Relationship: neutral
Domain: Networks
Sentence 1: Gary Marsden Michael Pazzani Dept of Computer Science, AdaptiveInfo, University of Cape Town, 111 Innovation Drive, Private Bag RONDEBOSCH,  Suite 200, 7701 South Africa Irvine, CA 92612 gaz@cs.uct.ac.za human-centred perspective.
Sentence 2: note, when cursor is moved to a line it changes to display truncated text.
Relationship: neutral
Domain: Networks
Sentence 1: Similarly, in [10, 12, 15, 19, 23], routing decisions were mainly based on the so-called contact prob­ability of two users (or one user visiting an access point if available).
Sentence 2: in the real world, it has been observed that users routinely spend a consider­able amount of time at a few speci.c place(s), referred to as hub(s).
Relationship: neutral
Domain: Networks
Sentence 1: A PROPORTIONAL DIFFERENTIATION MODEL FOR WIRELESS LANS The proportional service differentiation model [10] is first introduced as a per-hop-behavior (PHB) for DiffServ [6] in wired networks.
Sentence 2: the service differentiation ratio between Class-2 node and Class-1 nodes under varying data rates of Class-2 node is shown in Figure 13.
Relationship: neutral
Domain: Networks
Sentence 1: MAD algorithm performs a modi.ed version of a breadth­.rst search algorithm to the combinations of di.erent RCs in matrix M to minimize the summation of the area dif­ference values in M. Working with RCs rather than RBs signi.cantly reduces the computational complexity of the MAD algorithm.
Sentence 2: among many architectural improvements, 3GPP Release 8 speci.ed that scheduling the uplink channel would take place at the base station, or eNodeB, to enhance the sys­tem s response.
Relationship: neutral
Domain: Networks
Sentence 1: In this experiment, each controller needs to compute for each request (according to the source IP address to calculate out which routing path to fetch) and fetch the global network view (reading routing path from cache), so it is reasonable of each controller to process 400,000 requests per second.
Sentence 2: 4.2.2 Latency Analysis Comparing this powerful logical controller to a single controller deployed in the current OpenFlow network, the time delayed in ASIC is O ( h ) + O( f ( n ) ) which could be accepted by end users based on the analysis as follows: 1) h is the hops of balancers in the balancing system which a request needs to go through before reaching a physical controller.
Relationship: neutral
Domain: Networks
Sentence 1: GKMPAN is an efficient group rekeying scheme for secure multicast in ad-hoc networks proposed by Zhu[10].GKMPAN also uses the probabilistic key pre-distribution technique as the underlying means to establish secure channels between nodes.
Sentence 2: node c is similar to the case above, except that node c is out of node a s one-hop but in two-hop communication range.
Relationship: neutral
Domain: Networks
Sentence 1: It should be noted that when most sizes correspond to a unique packet type as is the case in Table 3 and would be true for any size transformation that is a simple additive offset, the distribution only needs to start to converge on the correct distribution for the MAP classifier to be correct.
Sentence 2: further the victim assumes something is wrong with the ARP table and it starts broadcasting ARP re­quests.
Relationship: neutral
Domain: Networks
Sentence 1: By using tilting patterns com­posed of two concentric squares with di.erent gray levels, the demodulator can decide whether the data bit is 0 or 1 from the di.erential gray level between the inner and outer parts of a tilting patten, without the need of estimating a threshold.
Sentence 2: it is not ideal for random bit error correction because one bit error su.ces to cause a multi-bit symbol error.
Relationship: neutral
Domain: Networks
Sentence 1: Activat­ing Net.ow everywhere on the network yields an extensive knowledge of the Origin-Destination (OD) .ows.
Sentence 2: in this short paper, we restrain ourselves to the case of a single linear constraint p T w : b, but we point out that we recently extended the model [1] to handle more realistic, per-router constraints (consisting in a set of linear inequalities of the form Rw : b), and to take into accounts the link measurements (SNMP).
Relationship: neutral
Domain: Networks
Sentence 1: For each test, we select at random 0% (X6Ti-0), 30%(X6Ti-30),70%(X6Ti-70) and100%(X6Ti-100) of the routers to be Xcast-aware routers.
Sentence 2: x6Ti allows interchange (without any con.gurations) be­tweenOverlay Multicast mode(end-hostsduplicateandfor- 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 ordistributedforpro.t or commercial advantage and that copies bearthisnoticeand thefull citation onthe .rstpage.Tocopy otherwise,to republish, topost on servers or to redistribute tolists, requiresprior speci.c permissionand/or afee.
Relationship: neutral
Domain: Networks
Sentence 1: Let Dr and Rr be the expected delivery rate and e.ec­tive throughput4 using bit-rate r.Then, the throughput achieved by the lower bit-rate is the same as the current bit-rate if Dr-1 × Rr-1 = Dr × Rr.
Sentence 2: [29] Sadeghi, B., Kanodia, V., Sabharwal, A., and Knightly, E. Opportunistic media access for multirate ad hoc networks.
Relationship: neutral
Domain: Networks
Sentence 1: For local residents, other than the benefits mentioned above, the high-speed Intranet enables building of home office, which would improve work efficiency and the quality of life.For local government users, most economic benefits were the same as business users.
Sentence 2: the digital convergence project in Qingdao High-Tech Zone reduces the market access threshold for disadvantaged operators, breaks the monopoly of the dominant operator, and provides a platform for fair competition.
Relationship: neutral
Domain: Networks
Sentence 1: 4.2 Static SOLAR-KSP Algorithm In this protocol version (referred to as S-SOLAR-KSP), we assume that each user knows of every other user s mobil­ity pro.les and each user distributively does the following: First, every user computes the contact probability with ev­ery other user.
Sentence 2: in the absence of any knowledge on the user mobility, e.cient routing remains a daunting task.
Relationship: neutral
Domain: Networks
Sentence 1: This can be generalized to deal with updates in O(log2 n)timeand re­porting points in time O(k+log2 n).
Sentence 2: calculation of dR 3,4 Figure 2: Dynamic linear k-connectivity mainte­nance 3.2 Planar node layout The static algorithm for planar k-strong connectivity in 1.4.2 heavily depends on computing Nt for every node t. for every node we want to be able to .nd its k­closest nodes in the plane.
Relationship: neutral
Domain: Networks
Sentence 1: At the same time mapping real world multi-hop topolo­gies on space constrained wireless testbeds in an e.cient and accurate manner presents a signi.cant challenge.
Sentence 2: ability Noise Shielding/Power Control MAC - Filtering PER - F iltering Channel Dependence yes no no no P ER Granularity coarse coarse coarse fine Local Control no no 2 3 yes yes Remote Execution yes no yes yes Node Mapping specific any any any Deployment Cost significant significant free free Emulating RSSI precise coarse no no Figure 10: Summary of comparison of approaches for topology creation.
Relationship: neutral
Domain: Networks
Sentence 1: In addition, the rapidly changing and sometimes vague OpenFlow speci.cations can result in multiple implementations that behave di.erently.
Sentence 2: after the connection setup and exchange of theinitial Hello messages, the testharnessinjects a sequence of several symbolicOpen-Flow messages and/orprobes, one at atime(wediscussthe input sequences in more details in Section 5).
Relationship: neutral
Domain: Networks
Sentence 1: Categories andSubject Descriptors C.2 [Computer-Communication Networks]: Dis­tributedSystems  GeneralTerms EnergyPro.ling,EnergyHarvesting  Keywords mPlatform,Ultra-capacitor,TwinStar 1 Introduction and Motivation Energypro.lingmeasures energy consumption of system components running atdiversepower modes and operational settings.
Sentence 2: node architecture   (a) (b)  Figure3.
Relationship: neutral
Domain: Networks
Sentence 1: 4.2 Sequentially Composable ABGn,n/2 FitziandMaurer[S]presentaprotoolfortheByzan­tineGeneralsproblemthattoleratesanytn/2faulty parties.Theirprotoolisfortheinformation­theoretiand unauthentiatedmodel.However,inadditiontothepoint­to­pointnetwork,theyassumethateverytripletofparties isonnetedwithanideal(3­party)broadasthannel.As wehaveshowninSetion4.1,givenapubli­keyinfrastru­tureforsignatureshemes,itispossibletoimplementseure broadastamongthreepartiesthatomposessequentially.
Sentence 2: )Now,sinetheagreementwas foiled,weknowthatP2doesnotoutputPj'sinputvalue x,whihmeansthatitdefaultedinStep5.Thisanonly happenifP2reeivedtwovalidsignaturesonthelabel£ whihitsentPjinthisexeution.Now,P2learlyreeived aorretsignaturemonPj'sinputusingthelabel£fromPj itself.
Relationship: neutral
Domain: Networks
Sentence 1: 2.1 Secure Routing Protocols Attacks on routing protocols can be classi.ed based on the type of attacks (active, passive and semi-active attacks); the perpetrator (external or internal attacker); and the severity of attacks (for exam­ple, a ratio of damage resulting from the attack to the attacker cost or the risk faced by the attacker ) [5], [6].
Sentence 2: thus a set of northbound vehicles in Interstate I-95 may form an ad hoc subnet that excludes all southbound vehicles (and vice-versa).
Relationship: neutral
Domain: Networks
Sentence 1: To avoid introducing externally visible churn, the hypervisorkeepsa historyofthelastupdatepeers have sent for each pre.x, and replays this for any new instance upon startup of that instance.
Sentence 2: code devel­opment maybecome morechallenging, sincethisapproach relies on knowingwhich parts of code are functionally equiv­alent.
Relationship: neutral
Domain: Networks
Sentence 1: Preemption is permitted amongst the sub-classes themselves so that a high-priority sub-class has a bet­ter chance of acceptance.
Sentence 2: as in Equation (24), if Count(1,n- 1) is less than c , then for every node j, the number of slots used by calls of these sub-classes is =B-c. All the remaining cslots are either free or are used by lower-priority calls which can be preempted by the call belonging to sub-class n. the call of sub-class ncan be accepted.
Relationship: neutral
Domain: Networks
Sentence 1: Tarek Bejaoui Institut d Electronique Fondamentale CNRS UMR 8622 Université Paris-Sud 11, France Tel : (33) 1 69 15 41 07 tarek.bejaoui@ief.u-psud.fr spectrum is real-time services requiring strong bandwidth guarantees.
Sentence 2: in our framework we provide an adaptability ratio measure which is integrated in the adaptive bandwidth allocation algorithm in order to reduce the CBP in addition to the CDP.
Relationship: neutral
Domain: Networks
Sentence 1: We assume a Poisson inter­probing pattern, because the asymptotic average of Pois­son samples converges to the limiting time average of the sample-path being sampled.
Sentence 2: paxon (1999) de.ned and measured a relative available bandwidth metric ß [18], which approached 1 when the path was void of cross­tra.c and 0 when the path was close to 100% utilization.
Relationship: neutral
Domain: Networks
Sentence 1: (25) J.8 J.8 As expected, q * = a * /(1 + a * ).
Sentence 2: [0, 1], and a = 0: DIA SIA DIA SIA DIA,* SIA,* xJ,a (p)= x a (p),y J,a (p)= yJ, a (p),p = pJ, a , J, J,a 1+a 1+a 1+a (24) = ASIA and thus ADIA a .
Relationship: neutral
Domain: Networks
Sentence 1: Given .h,the phase f.h (C) at whichacut C of h intersects h is equal to the largest label of an edge of .h in C. Note that for every hole of girth g there is a trivial phase assignment where every cut of the hole has phase at most g -one need only number the g edges of a minimal length cycle from 1 to g. In fact, in most situations simply using the girth of a hole instead of the phase of a cut under a particular phase assignment makes the analysis considerably simpler without a.ecting too much its accuracy.
Sentence 2: once again, we remark that all the results in the previous paragraph are proved for the square or the circle; there is no evidence that they would hold on deployment areas of di.erent topologies -e.g.
Relationship: neutral
Domain: Networks
Sentence 1: We also assume that, hence, intersym­bol interference (ISI) and interchannel interference (ICI) are avoided at both the legitimate receiver and the eavesdrop­per, either because the cyclic pre.x (or zero-padding su.x) is longer than the delay spread of both channels or because the channel coherence bandwidth is larger than the subcar­rier spacing.
Sentence 2: the loss intro­duced by using uniformly distributed QAM symbols can be reduced by augmenting the constellation cardinality, but it cannot be completely eliminated.
Relationship: neutral
Domain: Networks
Sentence 1: In this demo, we present a wireless experiment that is remotely executed in NITOS testbed [6] and more speci.cally show how energy e.ciency evaluation can be performed in parallel with experiment execution.
Sentence 2: recent studies [1] have highlighted the inability of existing models to accurately estimate energy consumption even in non-composite scenarios, where the operation of a single device is analyzed.
Relationship: neutral