sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Alterna­tively, we might achieve protocols that succeed with high proba­bilityin N. However, inlarge networks, N may notbeknown a priori.Furthermore,ahighprobabilityguaranteein N typicallyin­volves O(logN)operations which,forlarge N, maybetoo costly.
Sentence 2: bydevisingLasVegasprotocols, we avoidproblematic assumptions when n « N. Channel Utilization: Sendingorlistening on the communication channelbyAliceandBobismeasuredindiscreteunitscalled slots.
Relationship: reasoning
Domain: Networks
Sentence 1: On the other hand, network activity that is not correlated with, or immediately preceded by, mouse clicks is probably less important and can incur some delays without degrading the applications interactive performance.
Sentence 2: our na¨ive all-click (AC) switching mechanism transitions the WNIC to CAM upon each click and transmits all network I/O that follows the last mouse click within some time interval in CAM, thereby minimizing delays by already being in the high-power mode before I/O arrives and serving data with higher throughput than was measured for PSM.
Relationship: reasoning
Domain: Networks
Sentence 1: new distinct vertices are dominated by u2.Again, as OP T is a weakly-connected dominating set of G,there must be another element of OP T at distance at most 2 from either u1 or u2.This vertex, called u3, dominates at most .
Sentence 2: new distinct vertices.We repeat this argument until we have included all |OP T | elements of OP T .G can contain at most n = (.
Relationship: reasoning
Domain: Networks
Sentence 1: Our approach follows the same principles.
Sentence 2: speci.cally, when the interference signal starts,it causes adramatic increaseindecoding errors.As shown inFig.6(a), these errors appear at thePHYlayer as large differences between the received symbol and the nearest constellationpointsintheI andQdiagram.We refertothesediffer­ences assofterrors.foreachOFDM subcarrier,the802.11n receiver computes the soft-error, and normalizesitbythe minimum distance of the constellation.
Relationship: reasoning
Domain: Networks
Sentence 1: We .rst observe that since the transmitter chooses the best subchannel to the legitimate receiver, it is quite likely that .R > .E.
Sentence 2: the proposed approach is to use the resulting wiretap channel (said to be stochastically degraded) to deliver a se­cret key created at the transmitter, without leveraging the presence of a public, noiseless, side channel for discussion.
Relationship: reasoning
Domain: Networks
Sentence 1: Subsequently, delivering incoming data to the intended receiver will now involve T instead of I, thus, Susan ends up with only two authentication requests the last user in the cascade and the .rstuserinthecascade(theintended receiver).
Sentence 2: we solved two of the three previously identi.ed problems, namely (1) contacting every user in the cascade, and (2) there is only a single point of failure left, the last user in the cascade.
Relationship: reasoning
Domain: Networks
Sentence 1: PERFORMANCE EVALUATION Weuseaombinationofanalysisandsimulationtoevaluate thesignalingostofMobileIPwithandwithouttheP­MIP pagingextensions.Westudyhowpagingareasize,mobile speed,mobiledensity,andsessionharateristisanimpat thesignalingostunderavarietyofsystemonditions.The signalingostisrepresentedastheprodutoftheweighted distane(seeSetion5.2.1fordetails)thesignalingmessage travelsandthesignalingrate.Theunitofostisweighted hops*pkt/se.Forsimpliity,theairinterfaeistreatedas asinglehopinthewirelinenetwork.Beauseagentadver­tisementandsoliitationsignalingpresentthesameostsin MobileIPandP­MIP,weexludethemfromtheevaluation.
Sentence 2: onlyregistrationandpagingsignalingareonsid­ered.Simulationisalsousedtoinvestigatesenariosthat annotbeonsideredbyanalysis,forexample,usingarange ofmobilespeedsotherthanaonstantspeed,whihison­sideredintheanalysis.P­MIPisimplementedasextensions tothenssimulator[17]MobileIP[16]ode.Simulationis alsousedtovalidatetheanalysis.Thens­2P­MIPsoure odeusedtoevaluatetheprotoolisavailableontheweb http://omet.olumbia.edu/pmip.
Relationship: reasoning
Domain: Networks
Sentence 1: [3] However, the enterprise PoC of the shipbuilding industry is not a low-speed communication environment that the OMA targets, not an ordinary conference communication environment that the IEFT targets, but a private communication method that can replace wireless sets and TRS and that can be used in shipyards.
Sentence 2: it has different features from general PoC and conference from the aspects of bandwidth, reliability, and security.
Relationship: reasoning
Domain: Networks
Sentence 1: Our architecture (shown in Figure 1) is based on three key ideas: First, in order to satisfy requirement R1, we need MAPLE to store per-packet latency measurements in some scalable way; any form of aggregation within routers cannot be used to satisfy R1.
Sentence 2: at its heart, MAPLE contains a scalable packet latency store (called PLS) designed to simply store laten­cies of all packets in a scalable and e.cient fashion.
Relationship: reasoning
Domain: Networks
Sentence 1: To allow receiver 2 to decode the basic layer whenever receiver 1 can and to ensure that the remaining signal after subtraction has enough strength over noise, the channel quality to receiver 2 should be better than that to receiver 1; that is, the two channels should be asymmetric.
Sentence 2: we also refer to receiver 1 as the weaker receiver and receiver 2 the stronger.
Relationship: reasoning
Domain: Networks
Sentence 1: (6)  Given eti, the corresponding received energy eri is given by  ()-n x eri = etiL(d0) .. (7) d0 The link-reliability requirement can be expressed as dl =Pr{eri = t} () t xi n =Pr .
Sentence 2: = etiL(d0) d0 txn i etiL(d0)dn = e - 0 (8) Under min-hop routing, the maximum number of links of an end-to-end path is K. in order to guarantee the constraint dp on the path reliability, the minimum link reliability must be 1 dl = dp K .
Relationship: reasoning
Domain: Networks
Sentence 1: For intra-BSS traf.c, we consider that the downlink transmissions from the AP to the MSs are given a higher priority than the uplink transmissions and do not compete channel resources with the uplink transmissions, as it has been shown that IEEE 802.11 DCF has serious unfairness between the uplink and the downlink transmissions and the downlink trans­missions experience a higher collision probability [14].
Sentence 2: in the remaining part of the paper the BSS transmission through­put is only for uplink transmissions.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition to the above consid­erations, the reference model considers the shared-medium aspect of wireless networks, namely, that collections of nodes are divided into contention neighborhoods in which, for example, received traf­.c contends with outgoing traf.c (unlike wireline networks).
Sentence 2: this fairness reference model differs from classical objectives in the fairness granularity (TAP aggregated vs. per-node or per-.ow), the basic resource considered (time vs. throughput), spatial properties (no spatial bias and maximum spatial reuse), and the medium (mul­tirate shared wireless channels vs. wired links).
Relationship: reasoning
Domain: Networks
Sentence 1: The lookup request then continues its search in the squares of (Ls i )8 and might choose the path such that it visits p only on its last step, v which is at the latest after .tlookup = .2i.8 5(seeproof of Lemma 4.1).
Sentence 2: the lookup request reaches p at the 5Apointer to t is either a LPt,aFPt or a TFPt .
Relationship: reasoning
Domain: Networks
Sentence 1: Channel Rank (rij (fj )) For the transmit­ter-receiver pair i - j, this is the index k of the the highest transmission rate for transmitter i allowed by the receiver j, Tk, such that the channel fj is .at fading.
Sentence 2: ch fj rij (fj ) = argk max Tk|Bk <B c (5) We recall that, if the coherence bandwidth of the channel fj (Bc ) is greater than the bandwidth used for the signal (Bk), then the channel is .at fading.
Relationship: reasoning
Domain: Networks
Sentence 1: That is, we choose the Fi that minimizes the pro­jection of yi * onto S .
Sentence 2: in summary, our identi.cation algorithm consists of: 1. for each hypothesized anomaly Fi, i =1, ..., I, compute yi * using Equation (1) Cy * 2. choose anomaly Fj as j =argmini .
Relationship: reasoning
Domain: Networks
Sentence 1: Net­work organization can also be changed by topology control protocols, which turn o. nodes producing redundant or un­necessary data to the application [14].
Sentence 2: as transmis­sion power control protocols are complementary to topology control proto cols, networks striving energy-e.ciency should employ topology control proto cols to lessen the amount of transmitted data, at the same time transmitting the re­maining information at the lowest transmission power neces­sary to provide an e.cient communication among the active nodes.
Relationship: reasoning
Domain: Networks
Sentence 1: We have already mentioned that an intermediate node needs to receive and transmit in each direction, a .ow will require 4 slots per frame.
Sentence 2: if we have nctl = 1, and ncon = 1, we are left with ndat = 8, which can support 8/4 =2 voice calls throughabottleneckintermediate node.For F = 60 ms, the data path delay in an 8-hop path would only be (8/2) × F = 240 ms (this isbecause, due to our scheduling algorithm, a data packet traverses two hops, in each frame), which is good for real-time voice.
Relationship: reasoning
Domain: Networks
Sentence 1: Then BER(Eb, J, n) = Pr[d =1 and d = -1] + Pr[d = -1 and d = 1] n =2 * Pr[ vipni > 0 and d = -1] i=1 nn Eb J =2 * Pr[d pnipni + ripni > 0 and d = -1] nn i=1 i=1 nn Eb J =2 * Pr[- pnipni + ripni > 0 and d = -1] nn i=1 i=1 n J =2 * Pr[- Ebn + ripni > 0] * Pr[d = -1] n i=1 n Eb = Pr[ ripni >n] J i=1 where pni is a random variable independent from the adver­sary s ri choices.
Sentence 2: lni=1 ripni is the sum of n ran­dom variables of equal probability taking values {-1, +1}.
Relationship: reasoning
Domain: Networks
Sentence 1: For a given application, the link can be optimized if the sum of the CTAs for the two hops with Si and Sj is smaller than the CTA required for the direct link with Sl, i.e., given Rl+1<D=Rl, Ri+1<D1=Ri, and Rj+1<D2=Rj, thus D=D1+D2=Ri+Rj, a 2-hop connection via DEV3 is better than the direct connection if and only if: CTA(i,app) +CTA( j,app) < CTA(l, app) (6) Substituting (4) into (6) results in: km[TP(l, size) -(TP(i, size) + TP( j, size))] > TO(app) (7) Equation (7) implies that the link can be optimized by a 2-hop connection if and only if the reduction in payload transmission time is greater than the additional overhead.
Sentence 2: given rate index i, j, l, the frame payload size threshold (Pth) for a specific traffic type can be derived.
Relationship: reasoning
Domain: Networks
Sentence 1: for n = 100, .n = 0.9, and various adversarial drop rates .. For a test that has signi.­cance level a = 0.01, (2) dictates that n1 = 81 (a = 0.0046).
Sentence 2: receiving at most 81 responses occurs about 0.46% of the time given our choice of .n and n, and we can conclude that there is a greater than 99% chance that the route is faulty.
Relationship: reasoning
Domain: Networks
Sentence 1: = (1-d3)log(n) p2 = Pr 9n -d32log(n) -d2 3 = 2e 27 =2n 27 .
Sentence 2: (28) as n .8, in the limit we have 9n log(n) Pr(J) = 1 - (1 - (1 - p2)p18) 2 -d3 -89n log(n) = 1 - (1 - (1 - 2n 27 )n 9 ) !n!
Relationship: reasoning
Domain: Networks
Sentence 1: Since our main research on XCAST is in the area of real world deployment of XCAST6 version 2.0[13], our motivation is to realize an XCAST6 simulation environment which can complement our real world XCAST6 deployment when faced with time and resource constraints.
Sentence 2: our target in OMNeT++ was the implementation of XCAST simulation on the IPv6 stack.
Relationship: reasoning
Domain: Networks
Sentence 1: In the MPEG-2 codec, a loss event affects not only the slices contained in the lost packets, but also the other slices in the same frame, while in the H.264 codec, only the slices in the lost packets are affected.
Sentence 2: the value of ( tof the MPEG-2 codec tends to be larger than that of the H.264 codec, even if they are experiencing the same loss process.
Relationship: reasoning
Domain: Networks
Sentence 1: The fairness properties of asymmetric topolo­gies are illustrated in Figure 8(b), which depicts the long-term fair­ in such topologies would result in collision, i.e., if S1 does not set ness index vs. the Ef.ciency Index .. We observe that the fairness its NAV and starts transmitting there would be a collision at R2 .index varies drastically with ..
Sentence 2: there are only two narrow regions when inferring the channel state locally, we have in which the fairness index is smaller than 0.5.
Relationship: reasoning
Domain: Networks
Sentence 1: To explain the role of aqos , we introduce the following scheduling parameters for a connection with index i: ai: (arrival time) the slot number at the beginning of which the .rst group of tslot × Rencoded bits of the connection can be transmitted, fi: (connection s length) the number of slots required to transmit all encoded bits in the stream to the intended user at the distinguished rate R, ci: (completion time): the last slot number used in serving the connection.
Sentence 2: (the total process­ing time of the connection at the base station is given by 1 + ci -fi slots.)
Relationship: reasoning
Domain: Networks
Sentence 1: In this way we can observe the following sequences and the number of their occurrences within the time window: 111 occurs 6 times, 110 2, 100 2, 000 6, 001 1, 011 1.
Sentence 2: we can assign them the following sequences: 111 0.33, 110 0.11, 100 0.11, 000 0.33, 001 0.06, 011 0.06.
Relationship: reasoning
Domain: Networks
Sentence 1: The duration of the active DD phase equals the duration of the response scan window plus the transmission time of an IS packet, i.e., Tact =tIS+tacqu+Wscan ·s, (see Fig.2).
Sentence 2: the duration of the active phase is also modeled by a random variable Tact with a uniform distribution over [E[Tact]/2, 3E[Tact]/2].
Relationship: reasoning
Domain: Networks
Sentence 1: In the first part of IEP, the encountered nodes exchange their summary vector (using a HELLO message) including delivery predictability values to update the internal delivery predictability vector of each node, and later they exchange bundle information including destination and size of the bundle combined with the updated delivery predictability.
Sentence 2: nodes are able to decide which bundles to request for and to be forwarded to the other nodes based on the forwarding strategy used.
Relationship: reasoning
Domain: Networks
Sentence 1: We know that normalized .e and .m cannot exceed .U, which decreases with N and increases with A provided that .U <0.5.
Sentence 2: in the regions above each of the curves, the normalized per-node end-to-end throughput of 0.1 is not achievable, whereas it may be achievable (by all nodes or on average) below the curves.
Relationship: reasoning
Domain: Networks
Sentence 1: In a neighborhood with n nodes, in or­der to not exceed the decoding capacity of any node at data transmission time, the number of streams that can be simul­taneously transmitted in the neighborhood is constrained.
Sentence 2: we constrain the number of transmitter nodes as well to this value to avoid unnecessary channel measure­ment, reduce processing complexity at a receiver, and better serve higher priority packets.
Relationship: reasoning
Domain: Networks
Sentence 1: V }, where Pi[v|u] is the prob­ability with which node i moves from a street u to another street v within a city represented by the graph Gi(V, Ei).
Sentence 2: the selection engine computes the utility func­tion Uf (t) that maximizes the meeting probability between connected nodes Nc t and the unreachable destinations Nu t of the message at time t. The selection engine detects the probability of divergence between two space syntax tra jectories at time t + 1 in order to eliminate outliers.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, if there is enough capacity to transmit, TSi is scheduled for transmission.
Sentence 2: otherwise WCBS operatesreplenishing thecapacity and,if neces­sary,postponing thedeadline.while WCBS usesacon­stant TXOP assigned during the admission control phase, UTSS can make this parameter variable each time TS is scheduled for transmission.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, packets buffered at P RADS2 (100 pack­ets on average), while waiting for all packets originally sent to P RADS1 to arrive and be processed, each incur up to 96ms of additional latency (7% more than LF PL+ER).
Sentence 2: applications can bene.t from choosing an alternative version of move if they do not require both guarantees.
Relationship: reasoning
Domain: Networks
Sentence 1: Itremainstoanalyzetheprobabilitythat:sueedsin thisforgery.First,itiseasytoseethatwhen:doesnot abort,thesimulationofthesequentialexeutionsisperfet, andthatA'sviewinthissimulationisidentialtoarealexe­ution.Furthermore,theprobabilitythatPjistheidentity ofthe(unorrupted)generalinthefrstfoiledagreement equals1/nexatly.ThefatthatPjishosenaheadof timemakesnodiferenebeausethesimulationisperfet.
Sentence 2: thehoieofPjby:doesnotmakeanydifer­enetothebehaviorofA.Weonludethat:sueeds inforgingwithprobability1/ntimestheprobabilitythatA sueedsinfoilingagreement(whihisnon­negligible).This ontraditstheseurityofthesignaturesheme.
Relationship: reasoning
Domain: Networks
Sentence 1: That is, different operating points in the tradeoff between cache-.ll and redirection percentage, while all yielding the same byte hit rate , can translate into diverse consequences depending on the server.
Sentence 2: the individual servers ability and willingness to cache-.ll (i.e., the CDN s preference at that server) is an important factor that needs to be properly taken into account in caching decisions.
Relationship: reasoning
Domain: Networks
Sentence 1: Assuming that a local observer O has seen a packet .ow going through an MPR Procedure Probabilistic Flow Routing II(Node i)  if a .ow has to be sent to D then Find the shortest distance l between i and D Find a path of length l = l' = l + k to D (Mi1 , Mi2 , · · · , Miy) l Build the .ow tag with Function Tag+ Broadcast the packets with this tag node M * , let de.ne the following set Di,O = {t|.a path from Mi to t through M * } (8) for a given MPR node Mi.
Sentence 2: the probability distribution of Pr[S = Mi] is de.ned as follows: 1 |Di,O| Pr[S = Mi] = · (9) nt n - 1 where nt is the number of MPR nodes which may eventually go through M * i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: We want to remark that the fact that the load observed at the APs and num­ber of registered users are only loosely correlated have been observed in several papers that have analyzed user traces collected from real world network deployments [1, 4, 17, 26].
Sentence 2: our QoS-RWP model is able to reproduce one of the most important behaviors observed in real-world de­ployments of wireless data networks, i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: This means that no other up­date can be sent over this session until M seconds later (M is by default set to 4 to 5 seconds).
Sentence 2: when RR2 .nishes processing the withdrawal from PE2 and sends its own withdrawal to RR4, RR4 realizes that there is no path in its table, and it sends a withdrawal to PE3 at T =4.7 second.
Relationship: reasoning
Domain: Networks
Sentence 1: However, if the mobile actual RTT = 20 ms actual RTT = 80 ms actual RTT = 120 ms ways responds with TCP ACKpackets immediately after the observed RTT (ms) 250 200 150 100 50 0 250 200 150 100 50 0 250 200 150 100 50 0  beacon and the TCP connection becomes synchronized with the PSM-static beacon period.
Sentence 2: the observed RTTs are rounded up to the nearest 100 ms.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, in .gure 2(b), only the RTS frames sent by C and D may have  Figure 2: Active transmitting neighbors in the sat­urated and unsaturated situations Figure 3: Three di.erent transmission patterns ac­cording to B collision with the RTS frame of B, while the RTS frame E sends will never have collision with B s. If there were W distinct time slots available for contention, the probability that a node can successfully transmit a RTS packet is given as: ..M-1 M 1 p =1 - 1 - (6) Nneighbor W Since W represents the average number of time slots and nodes are only permitted to transmit packets at the begin­ning of each time slot, W = Tavg.
Sentence 2: in the subse­quent expressions related to equation 6, W is replaced by Tavg.
Relationship: reasoning
Domain: Networks
Sentence 1: At a distance of 15, all nodes were essentially covered for the 25 x 25 range, but as the number of nodes was increased, so was the number of floods that occurred.
Sentence 2: it is safe to say that for a high number of nodes in the 25 x 25 area it is desirable to have a lower send distance, while for a low number of nodes in the same area it is desirable to have a higher send distance.
Relationship: reasoning
Domain: Networks
Sentence 1: )of T(t) nodesofsatisfes n=t(nT-1)+1 (1) ThefollowingLemmaharaterizesthesizeofthet-horizon T(t) ofthegraph,andfollowsasanimmediateonsequene ofLemma2.
Sentence 2: lEMMA3.SupposeVEVcVTisanendnodeofafat T(t) tirein.Thet­horizon1(V,t)ofVistheunionofthe nodesinallthetfattiresforwhihVisanendnode,i.e., 1(V,t)=tdv+1.Ontheotherhand,ifVEV-VT,then Visontainedintheinteriorofsomefattirehavingend nodesaandb,inwhihasethet­horizonofVistheunion ofthenodesinallthetfattiresforwhiheitheraorbis anendnode,i.e.,1(V,t)=t(da+db)-t+1.. NowonsideratreeTofdepthr,whoserootvertexhas yhildrenandwhosevertiesatleveliallhavexhildren, i=1,,t-1.Then,thenumbernTofnodesofTsatisfes: r-1r-1 nT= 1+y+yx++yxyx+1(2) Substitutingequation(1)intoinequality(2),weobtainn= t(nT-1)+1:tyxr-1 .-11-r 1<y<ntx (3) NowonsideranyplaementofkserversatasubsetSof T(t) vertiesin.ItfollowsimmediatelyfromLemma3that thesizeofthet-horizon1(S,t)ofSisgivenbythefollowing.
Relationship: reasoning
Domain: Networks
Sentence 1: Fig­ure 10(c) shows that Hybrid Divert performs as well as the better transmitter (A) when it uses di.erent path-switching thresholds for di.erent paths.
Sentence 2: divert can adapt re­markably well to extremely asymmetric, dynamic channel conditions (e.g., R1) by making small adjustments to H and T. In our mobile environment, Divert performs no worse than the best available path when the available paths are extremely di.erent (e.g., R1).
Relationship: reasoning
Domain: Networks
Sentence 1: For the link li,j with the largest din i,j (G ' ) in G ' , i,j (G ' ) -dout ) =dout we must have din ).
Sentence 2: when we assign color i,j (G ' i,j (G ' Algorithm 2 Centralized Scheduling under Protocol-Interference Input: A communication graph G=(V,E) of mlinks.
Relationship: reasoning
Domain: Networks
Sentence 1: In both this con.gura­tion and the IDS Router con.guration from our earlier experiments, each packet is processed by one IDS element; the difference is that in the diverging con.guration, there are two IDS elements, each of which processes half of the packets.
Sentence 2: we can expect that, if the overhead of our divergence handling strategy is low, the con.gura­tion with two GPUIDSMatchers should achieve similar throughput to the con.guration with a single one.
Relationship: reasoning
Domain: Networks
Sentence 1: Moreover, dissipated energy may have a large impact on these delays.
Sentence 2: pEQ is evaluated through the following metrics: Sink-Source-Sink Delay - latency from the moment a subscription is sent to the moment the first corresponding event is received at the sink; Average Delay -average latency from the moment an event is transmitted to the moment it is received at the sink;  Average Event Delivery Ratio - number of distinct received events to the number of originally sent events ratio;  Average Dissipated Energy - total dissipated energy to the number of nodes ratio.
Relationship: reasoning