sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: DISTRIBUTED PROTOCOL Although solving the MILP problem proposed in the last section can achieve the optimal lifetime, it is not practical due to high computational complexity and intrinsic central­ized characteristic.
Sentence 2: we propose a distributed proto­col to solve the topology knowledge range control problem Source Geographical coordinates Destination Geographical coordinates Minimum estimated lifetime knowledge range value flow rate P/R flag Figure 1: The structure of probe message for maximizing lifetime in sensor networks.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.1 Multi-path Routing and Fair Rate Alloca­tion In our system model of wireless sensor networks, proactive routing is preferred since nodes in the network are static and tra.c requirement is also .xed.
Sentence 2: each sensor node will .rst .nd a set of routes to deliver its collected data to the sink node, and then determine the .ow rate on each of its routes.
Relationship: reasoning
Domain: Networks
Sentence 1: The ratio of the pilot power to the raw (total) power in the channel turns out to be a a good indicator of cellular load.
Sentence 2: we de.ne: P ilotP ower P owerRatio = T otalRawP ower In WCDMA (3G), the particular parameters that correspond to the pilot power and the power ratio are Received Signal Code Power (RSCP) and Received Energy per chip and Interference level (ECIO), respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: 3 will change from face F1 to face F3 directly since the intersection point p3 is the one which is located closest to t compared to p1 and p2.By exploring the next face F3 the message will .nd p4 as the closest intersection, switch to face F4 and .­nally reach the destination node tlocatedonthis face.
Sentence 2: this variant will visit the shorter face sequence F1,F3,F4 in this example.
Relationship: reasoning
Domain: Networks
Sentence 1: (2) -1 (SRD) Note that the block circulant matrix H can be block diag- Hl = LHl , onalized in a Fourier basis.
Sentence 2: applying the discrete L2 = LSRD, (11) fourier transform (DFT) on the two-slot received block sig- ERDESR E2 = MESR+s2 , nal vector (14) yields the following frequency domain block communication model, .
Relationship: reasoning
Domain: Networks
Sentence 1: 3.2.1 M/M/1 queue For the M/M/1 queue, the service time is exponentially distributed with parameter µ.
Sentence 2: the cumulative dis­tribution function (CDF) and probability density function  (PDF) of the service delay are F (t) = 1 - eµt and f(t) = -µt µe , respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: (3)There are several service-speci.c issues that also contribute signi.cantly tothe overalldesign complexity(e.g.,introduction of a new vendor andimplementation of newpolicies); thus,itappearsthatservice­speci.c mechanisms maybefundamentally unavoidablein manag­ing servicedesign and con.guration.
Sentence 2: it appearsthatthehighprevalent complexity mayimpede thegrowth and adoption of services.
Relationship: reasoning
Domain: Networks
Sentence 1: The .rst is the reception of message Tree, which means that node Nj chooses Ni as its parent in the spanning tree.
Sentence 2: ni will add Nj to its list of children and will send it a Leader message contain­ing the identi.er and the result of its current leader in order to permit to Nj to update its variables and generate the required events in its sub-cluster.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the sublinear upper bound on the size of Si prevents the probability of exactly one node sending frombeing too small.
Sentence 2: theprobability aparticular uninformed node does not receive m in a single slotis lnn 4e(c+1) at most 1 - qj where qj =0 if Caroljams e·2(b/2)i+1 2ai+(b/2)i and qj =1 if she does not.
Relationship: reasoning
Domain: Networks
Sentence 1: Finally, unlike a traditionalphasedarray,a virtual array madeup of collabo­rating wireless sensor nodesdoes nothave a regular andpre­cisely known geometry; furthermore standard localization techniques such as GPS fall far short of the accuracy neces­sary toovercomethisgeometricuncertaintyforthepurposes of beamforming.
Sentence 2: distributed beamforming requires a highly sophisticated synchronization process that accounts for all of the above uncertainties.
Relationship: reasoning
Domain: Networks
Sentence 1: Also at each time slot, at most .max .ows join the network.
Sentence 2: for a resident .ow with sf = (n+1)T -D, the probability that the .ow has not learned the Rmax by max)D time (n +1)T - 1islessthan M (1 - p. we have .. L .. E 1 f.GB(n) (.maxF max +(T - D).maxmaxD = ) M (1 - p ), and .
Relationship: reasoning
Domain: Networks
Sentence 1: So we can omit it and focus on the transmit time.
Sentence 2: define G=(g, leL, feR) to be a 0-1 matrix such that glf=1 if user-flow f is cross link l and glf=0 if link l is not used by user­flow f. the flow link constraint of WMN can be included, as follows: |L|u|R||R|u1|L|u1 G u X dV (2)  3.2.3 Put Constraints Together We now put the two types of constraints (1) (2) together and pre­sent a mathematical constraint model for the bandwidth allocation.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, based on the Shannon theorem, we can calculate the achievable data rate of BSi to uj : rj = bj · log2(1 + d) () pj · .j = bj · log2 1+ ,bj and 2 g .j = j , T · Na where gj is the BS s channel gain to uj , T is the SNR gap (a constant), and Na is the AWGN power spectral density.
Sentence 2: we can compute the necessary power of the BS to satisfy uj s demand as follows: pj = bj (2rj /bj - 1).j bj · T · N = 2 a (2rj /bj - 1).
Relationship: reasoning
Domain: Networks
Sentence 1: Standard utilities (e.g., ifcon.g) al­low clients to set MAC addresses of individual interfaces as desired.
Sentence 2: from the point of view of the infrastruc­ture, a MultiScan handoff appears as if a single-radio wire­less client just re-associated with a different AP (with zero USENIX Association Internet Measurement Conference 2005 4 4 4 MultiScan Single Interface MultiScan 3.5 3.5 3.5 3 3 3 2.5 2.5 2 2 RTT (ms) RTT (ms) RTT (ms) 1.5 1.5 1.5 1 11 0.5 0.5 0.5 0 00 53 53.5 54 54.5 55 55.5 56 53 53.5 54 54.5 55 55.5 56 Time (s) Time (s) Time (s) 0 6 12 18 24 30 36 42 48 54 60 Figure 3: Ping RTTs with periodic Figure 4: Zooming in on Figure 3 for a Figure 5: A handoff by a single inter­ handoffs for MultiScan client.single handoff instant.face client (see Figure 4).
Relationship: reasoning
Domain: Networks
Sentence 1: However, the security properties of authenticated encryp­tion using non-interactive DH were only very recently formalized (see [25]), and more work is required to develop a higher-level security calculus on top of these proper­ties; note that replacing authenticated encryption with unauthenticated encryption would eliminate the security of typical protocols that use authenticated encryption.
Sentence 2: we do not claim that MinimaLT is formally veri.ed.
Relationship: reasoning
Domain: Networks
Sentence 1: The overhead needed for keeping routes alive and transmitting data along the routes is a main source of energy consumption in PNs.
Sentence 2: the rout­ing protocol can profoundly a.ect dependability of PNs, not only by utilizing fault-tolerant mechanisms to increase reli­ability in the presence of faults, but also by generating less overhead and consuming less energy to achieve the required level of reliability.
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 3 shows the unsurprising but signi.cant fact that increas­ing the probing load through increasing .P results in the over­all system deviating increasingly far from the original unperturbed system in which .P =0.
Sentence 2: even if an estimate of the true mean (or the CDF) is unbiased, that estimate is an estimate of the full (probe + cross-traf.c) system, not the unperturbed (cross­traf.c only) system that one wishes to measure.
Relationship: reasoning
Domain: Networks
Sentence 1: Assume there are 13 connectors in C. Then there are at least 13 non-sharing dominators in I2(u).From pigeonhole principle, we know that there must have 2 dominators v1 and v2 such that .v1uv2 = 2p/13 < 2arcsin( 4 1 ).
Sentence 2: using Lemma 3, v1 and v2 will share a common connector in C,which contradicts to the selection of v1 and v2.
Relationship: reasoning
Domain: Networks
Sentence 1: In the simulation setup, cars are simulated by nodes which move according to the Manhattan mobility model (moving back and forth, right and left) in an area of 500 m x 500 m. Hereby, the street ar­eas only determine the mobility behavior, but do not model any additional features, like solid obstacles (buildings, etc.).
Sentence 2: besides concurrent access to the wireless medium, distance is the major factor for link quality degradation and link breaks.
Relationship: reasoning
Domain: Networks
Sentence 1: Whenaforeignagentreeivesapagingrequestfromthe pagingforeignagent,itfrstondutsanauthentiationhek iftheforeignagentsshareamobilityseurityassoiation6.
Sentence 2: ifauthentiationissuessful,thentheforeignagentbroad­aststhepagingmessageonitsownnetwork.Whenamobile nodefndsitshomeaddressinthepagingrequestandthe messageisdiretlyfromitsregisteredforeignagent,thenthe registeredforeignagentisthesameoneasthemobilehost's urrentforeignagent.themobilenodededuesthat itisstillloatedinthesamenetworkasitsregisteredforeign agent.Inthisase,themobilenodesendsapagingreply baktothepagingforeignagentwithoutregistering,and setsitsoperationalmodetoativeandrestartsitsative timer.0therwise,themobilenodestartstheregistration proeduretomakesurethatthebindingbetweenitshome addressandneware­ofaddressisvalid.Followingthis, themobilenoderespondstothepagingrequestbysending apagingreply.Themobilenodewillinsertitsare­ofad­dressinthepagingreply.Thetransmissiontimeforeah registrationandpagingreplytoaforeignagentisrandom­izedtoavoidpotentialollisionsbetweensignalingmessages (e.g.,registrationsandpagingreplymessages)frommultiple pagedmobilenodesinthesamenetwork.
Relationship: reasoning
Domain: Networks
Sentence 1: On the contrary, the same error in networks using just routing would a.ect only a sin­gle source to destination path.
Sentence 2: the fundamental issue to be carefully considered to understand the actual performance improvement and ad­vantage of network coded multi hop/cooperative communi­cations is to take into account that all the nodes of the net­work are error prone, and that erroneous decoding and for­warding might have a signi.cant impact on the end to end performance, diversity, throughput, and quality of service.
Relationship: reasoning
Domain: Networks
Sentence 1: Network processing has long been performed in a multi­threaded manner, with di.erent portions of the network stack being executed at di.erent times (some during the socket system calls, some in the context of receive packet processing, etc.).
Sentence 2: the problem of data arriving faster than it can be processed is currently being dealt with by exploiting the multicore nature of modern processors and having di.erent parts of the network stack computations ex­ecute on di.erent cores.
Relationship: reasoning
Domain: Networks
Sentence 1: Table 2 shows that the loss rate in transmitter AP2 is com­parable to that of transmitter AP1 s, which suggests that site AP2 s transmission succeeds even though interfering en­ergy is detected by AP1.
Sentence 2: the losses from AP2 are uncorrelated with the CS-triggered delays from AP1.We have identi.ed a real case of the example shown in Figure 4.
Relationship: reasoning
Domain: Networks
Sentence 1: It is important to note that the type of node installed at each site is known at each step of the search procedure.
Sentence 2: it is possible to break the problem into four dif­ferent subproblems: the TPs to node Bs assignment sub­problem; the node Bs to RNCs assignment subproblem; the RNCs to MSCs assignment subproblem and the RNCs to SGSNs assignment subproblem.
Relationship: reasoning
Domain: Networks
Sentence 1: We denote N IS,i(n) as the number of nodes that successfully receive the IS packet sent (n) from node i in the nth round of the DD process and denote NIS,i as the number of nodes that do not know node i among N IS,i(n).
Sentence 2: we have: n- () (n 1) ()n (1-.kn i , (1) ) ·(Ntotal -1)(1-p)(3) n - 'NIS i , =-(1 .kn i , )·NIS i , = ' (1) ·- .n-) 1+.IS fail , +.IS fail , (1 kn i , e () () The number of effective IS packets are N IS i , n =N n .
Relationship: reasoning
Domain: Networks
Sentence 1: Widely-used applications, such as Voice over IP (VoIP), peer-to-peer and video-streaming, could greatly benefit from the knowledge of the available bandwidth along an Internet path [1].
Sentence 2: many active probing tools have been developed and studied in recent years, such as IGI [2], Abing [3], Spruce [5], Pathload [6], TOPP [7], pathChirp [8], FEAT [9], and BART [10].
Relationship: reasoning
Domain: Networks
Sentence 1: When receiving a .ooded message from a boundary node, say q,each node p executes the following rules: If p has yet not received the .ooded message from any boundary node, it appends q to the list of nearest boundary nodes of p (denoted by List(p)), increases the counter by one and forwards the updated message to its neighbors;  else if the distance of p to q is equal to, or larger by one than, the minimal distance of p to the nodes in List(p), p keeps record of the boundary node q,increasesthe counter by one and forwards the updated message to its neighbors;  else p simply discards the arrived message.
Sentence 2: each interior node keeps record of its extended feature nodes and the distance (in hops) to the feature nodes.
Relationship: reasoning
Domain: Networks
Sentence 1: http://www.top500.org cess will stop at some point (in the worst case, one of B or C runs out of elements).
Sentence 2: l(A) * k+2, which contradicts [17] M. Valerio, L. Moser, and P. Melliar-Smith, Recursively Scalable Fat-trees as Interconnect Networks.
Relationship: reasoning
Domain: Networks
Sentence 1: Suppose that we havepi < i.I i.I P. Then it is straightforward to see that the allocation is P not e.cient, since multiplying all powers (pi)i.I by i.I pi improves the SINR of all players.
Sentence 2: for an e.cient  allocation of power, we always havei.I pi = P,which implies that the SINR and the average throughput for user i can be written as functions of pi : ri .igi(P -pi)+.i .i = W gipi ri .igi(P -pi)+ .i (1) .
Relationship: reasoning
Domain: Networks
Sentence 1: In[8],.........isusedtointrodueadynamisheme formodelingativenetworkassuraneusingomposablese­  Figure16:GatekeeperExampleNetwork uritypoliies.IntheGatekeeperexample,anypaketom­ingfromClientisallowedaesstotheseureresoures.
Sentence 2: theseurityprovidedisnotsuÆientsine,forexample,an ativeflebouneattak(AFBA)anbeexeuted.AFBA ourswhenaninnoentnode(e.g.Client)isusedasa bounepointserverbyanyOthernodestohaveaessto theresoureontheServer.ConsidertheasewhereOther hasaesstoresouresonClient.Othersendsapaketto Clientthatwhenproessed,needsaseureresoureonSer­ver.ClientsendsapakettoServer,requesting theresoure.SinethepaketomesfromClient,there­questisaepted.ClientgetstheresoureandfnallyOther alsogetstheresoure.Theattakhassueeded.Theso­lutionproposedandverifedinthemodelonsistsofhaving theseuritypoliiesgoverningaesstoaresoureresident onthepaketthatisarryingtheresoure.Twogroupsof proofsaredone:(1)toshowthattheoriginalnetworkisin­seure;and(2)thatthesolutionproposedprovidesaseure network.
Relationship: reasoning
Domain: Networks
Sentence 1: individual frame size and quality, tween PSNR and Mean Opinion Score (MOS) speci.ed in video frame rate, encoding method, quantization scale etc) video literature [1], which is based on end user polls.
Sentence 2: about the video encoding process, required to be used by our according to Figure 4, RAMP-AODV and RA-AODV pro­rate-adaptation method.
Relationship: reasoning
Domain: Networks
Sentence 1: Some of these problems are inherent of the protocol processing, such as excessive looping and branching and the maintenance of a slot set database in memory, others, such as excessive procedure calls and inefficient memory management, are caused by the inefficiency of the code generation tool.
Sentence 2: it is crucial to have both: better tools and compilers to generate more efficient code from high-level language descriptions of the protocol and efficient memory management schemes, that can be achieved using the methodology presented in [8].
Relationship: reasoning
Domain: Networks
Sentence 1: Both the CC2420 and the AT86RF230 radios are 802.15.4 standards-compliant and they inter-operate at a 250 kbps data rate.
Sentence 2: they both support back­cast using offset quadrature phase shift keying (O-QPSK) modulation with half-sine pulse shaping [19] used in the 802.15.4 standard [23].
Relationship: reasoning
Domain: Networks
Sentence 1: This state is rounded out by k states for the uncoded transmis­sions of the input received from one of the k single incom­ing links and one state indicating no transmission.
Sentence 2: each block of length k can only take one of the following (k + 2) strings: 111...1 , 100...0 , 010...0 , 001...0 , ..., 000...1 , 000...0 .
Relationship: reasoning
Domain: Networks
Sentence 1: (1) k=1 k=1 By the celebrated result of Birkhoff and von Neumann, all doubly stochastic matrices can be decomposed as a weighted sum of permu­tation matrices (i.e., matchings) with the sum of the weights being at most 1.
Sentence 2: non-oversubscribed networks can support all doubly stochastic traf.c matrices.
Relationship: reasoning
Domain: Networks
Sentence 1: Counting the number of changes during the P simulation is achieved via statechange = |Cti | {ti}t1,...,tT  3.2.3 Availability Mobility creates inconsistencies between local information gathered by all nodes and the communication graph.
Sentence 2: wrong concurrent and distributed decisions may lead to:  not exactly one backbone per connected component isolated nodes, i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: In this case, holding the same cache is inefcient on the same edge network since cache size on routers are lim­ited by a storage on them.
Sentence 2: we conducted another simulation in which total cache size is equal and the same Figure 6: Reduction Rate of Trafc Consumed Inside The Network Edge cache .le is stored in one location using Methods A, D, and E. Methods B and C are excluded from this simulation since the same cache .le is stored in the edge network.
Relationship: reasoning
Domain: Networks
Sentence 1: A last word on redundancy: since the secret servlets use tunnel­ing to reach the target, it is possible to use the backup links of a multihomed site to carry SOS-routed traf.c (effectively using tun­neling as a source-routing mechanism).
Sentence 2: all attack traf.c will use the BGP-advertised best route to the target, while traf.c from the SOS infrastructure will use the unused available capacity of the target site.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, an ISP may have a policy to dynamically compute the value of the MED attribute (or the community at- tribute) based on its internal network conditions, as these attributes influence how its neighbors may direct their traffic toward its network.
Sentence 2: the large number of SPATH implicit withdrawals sent by ISP2 ad ISP3 may be explained by the fact that these two tier-1 ISPs have richer network topologies and more sophisticated policies than the other tier-1 or regional ISPs in the monitored set.
Relationship: reasoning
Domain: Networks
Sentence 1: Bene.ts and drawbacks of cognitive capabilities at small cells is not yet explored ade­quately from an energy e.ciency viewpoint [3].
Sentence 2: our aim is to investigate the interplay between the energy gains achieved by introducing cognitive femtocells with spec­trum sensing/discovery capability and the additional energy overhead induced by spectrum sensing and backhauling by these systems.
Relationship: reasoning
Domain: Networks
Sentence 1: By caching frequently accessed objects and serving requests for these objects from the cache, proxies can yield a number of per- formance benefits: (i) deploying a proxy in a local area network or near a slow inter-continental link helps reduce client response times, (ii) deploying a proxy near an access link (i.e., the link that connects the organization to the rest of the Internet) helps organizations and network service providers reduce their network bandwidth usage, (iii) deploying a proxy close to web servers (referred to as server- side caching) helps reduce load on these servers, and (iv) deploying proxies in the network core helps reduce aggregate network load on backbone links.
Sentence 2: by absorbing a portion of the workload, proxy caches can improve client response times as well as increase the capac- ities of servers and networks, thereby enabling them to service a potentially larger clientele.
Relationship: reasoning
Domain: Networks
Sentence 1: SIC: MAC LAYER PERSPECTIVE Similar RSSs increase the relative capacity gain with SIC; thisimpliesthatintryingtorealizethese gains,thetrans­missionratesofthetwopacketshavetobe dissimilar.This isevidentfromEquation(1)and(2), whererate r 1 depends 1 2 ontheratioofthe two RSSvalues, but r 1 onlydependson theratiowith noise.
Sentence 2: whenthetwoRSSare sim­ 12 ilar, r 1 willbelow, and r 1 will be muchhigher in compar­ison.Convertingthistothetransmission timeofpackets, wenotethat onepacketwillincura long air-time,while the otherpacket(transmittedin parallel)will.nishmuch quicker.Ironically,thetransmitterthat experienceslonger air time (i.e., T1)actuallyhasastrongersignaltothere­ceiver; but its rate must still be low, because, to achieve SIC, it has to cope with the interference from the other transmitter(T2).
Relationship: reasoning
Domain: Networks
Sentence 1: Speci.cally, VLB s re­quirement for a per-server processing rate of 2R 3R is derived as­suming that all VLB phases impose the same burden on the servers; in reality, certain forms of processing will be more expensive e.g., IP route lookups vs. load-balancing.
Sentence 2: we need to understand whether/how VLB s analytically derived requirement deviates from what a practical implementation achieves.
Relationship: reasoning
Domain: Networks
Sentence 1: (17) Ti j j=1 Indeed, the right-hand side is the rate of successful encoun­ters, for an individual holding a collection of i coupons: K j y j istheprobability thatthe encounteredindividualhas a collection of jcoupons and theremainingfactor i / K is jj the probability that the encounter s collection of j coupons is a subset of the instigator s collection, given that the insti­gatorhas icoupons.
Sentence 2: the sumin(17)is theprobability thatthetarget user scollectionisasubset oftheinstigator s collection, given that the instigator has i coupons.
Relationship: reasoning
Domain: Networks
Sentence 1: Whileproprietarymiddle-boxesarepopularpointsolutionswithin enterprises,they are not as attractiveina cloud environment.First, cloudproviders cannotbene.tfrom atechnology whosegoalisto reducecustomerbandwidthbills,andthusarenotlikelytoinvestin one.Moreover,a .xed client-sideand server-sidemiddle-boxpair solutionisinef.cientfor a combination of a mobile environment, which detaches the client from a .xed location, and cloud-side elasticity which motivates workdistribution and migration among data centers.
Sentence 2: it is commonly agreed that a universal, software-based, end-to-endTREis crucialintoday spervasive en­vironment[4,1].
Relationship: reasoning
Domain: Networks
Sentence 1: For a large number of nodes, the probability that a node can access the channel for k consecutive transmissions is approximately n1 .Thus, k for large node densities, we can assume that any node can capture channel for multiple consecutive transmissions with very low probability.
Sentence 2: with very high probability, subsequent packet transmissions by the same node see ap­proximately independent channels; this is especially true if n times average packet transmission time is on the order of Tc.
Relationship: reasoning