sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Therefore, the total time for which the transmitter is turned on and the energy consumption is as follows: TSpeckMACD_Tx = (TRxTx + ((+ TPreamble / TTx + + 1)) * TTx) * NPkts ESpeckMACD_Tx = TSpeckMACD_Tx * PTx (15) As in the previous section, worst case assumptions have been made to provide fair comparisons with B-MAC, i.e., the channel is sampled during channel listening between the transmissions of two data packets.
Sentence 2: the radio will be turned on at the beginning of a data packet and remain so until the next data packet is received, i.e., the radio is turned on for a duration of 2 * TRx.
Relationship: reasoning
Domain: Networks
Sentence 1: (14) i=1 If k = 0, we de.ne Fe(n : f)= Ft(n : f)=0.
Sentence 2: (15) the objective is to .nd k * and v1,v2, ··· ,vk* that maximizes Fe(n : v1,v2, ··· ,vk) and Ft(n : v1,v2, ··· ,vk) which is referred to as an n-optimization problem.
Relationship: reasoning
Domain: Networks
Sentence 1: The main objective of our scheme and other ef­.cient .ooding schemes is to improve the performance in terms of the number of retransmissions as much as possible so that the occurrence of redundant transmissions and col­lisions is minimized.
Sentence 2: we evaluate the performance of the .ooding schemes in terms of the ratio of retransmissions, which is the ratio of the total number of the RNs retrans­missions to cover the entire network to the total number of nodes, and the number of collisions with regard to the fol­lowing two parameters: the number of nodes and the trans­mission ranges.
Relationship: reasoning
Domain: Networks
Sentence 1: It is worth noting that, due to independent descrip­tions, the MD-Like scheme only requires to know how many and not which packets have been received.
Sentence 2: all the packets have roughly the same importance, and, in the optimization process, the second order statistics of the channel will be a suf.cient informa­tion for the FEC design, as described in the following.
Relationship: reasoning
Domain: Networks
Sentence 1: Since the requirements on .ows 1 (2) and 4 (3) are identical in each test case, the throughput of .ows 1 (2) and 4 (3) are nearly the same in the simu­lation results.
Sentence 2: to avoid cluttering the plots, we only report the average value of .ows 1 and 4, and .ows 2 and 3.
Relationship: reasoning
Domain: Networks
Sentence 1: The reason is that neighbor-table management policies [7, 31] employed by current link estimators, such as 4BLE, always prefer neighbors with high quality links over the neighbors with intermediate quality links.
Sentence 2: if the number of neighbors with good links is greater than or equal to the table-size, which is the case in Motelab (see Ta­ble 1), the chances that BRE will .nd an entry in the ta­ble with lower path-ETX are negligible with existing table­management policies.
Relationship: reasoning
Domain: Networks
Sentence 1: Even more detailed automated code analysis, such as control .ow analysis, data .ow analysis, structural analysis and se­mantic analysis cannot guarantee that all uses are correctly identi.ed [8].
Sentence 2: we decided to conduct a more detailed manual study to .nd out what sort of information is actually sent via these potentially broken SSL communication chan­nels, by installing apps on a real phone and executing an ac­tive MITMA against the apps.
Relationship: reasoning
Domain: Networks
Sentence 1: The ad­vantage of the nicter is that we have a large number of dark­net IP addresses that are distributed in wide area in terms of position of network address and geographical location.
Sentence 2: by comparing attack trends among sensors, we can promptly grasp many types of propagation strategies that re.ect characteristics of each malware, and the global trends such as outbreaks of emerging malwares.
Relationship: reasoning
Domain: Networks
Sentence 1: In many applications, including ours, self loop steps are free : they can be executed in zero time and require no communi­cation.
Sentence 2: it makes sense to de.ne the actual mixing time of a random walk, denoted Tactual mix, which is the expected number of actual steps (i.e., non-self loop steps) needed for the random walk to approach its limit distribution.
Relationship: reasoning
Domain: Networks
Sentence 1: For threshold­based pricing it will be shown that the asynchronous heuris­tic outperforms the synchronous heuristic for f= 0.5.
Sentence 2: when the congestion e.ect of interfering users is strong (f= 0.5), it is better to apply the asynchronous model whereas with f<0.5 synchronous distributed scheduling is bet­ter.
Relationship: reasoning
Domain: Networks
Sentence 1: Additionally, since each RPL instance generates packets independently and can di.er in choice of next hop, this creates an implicit priority queue within each node (i.e., each node has limited resources and their usage is weighted by each DODAG s operations).
Sentence 2: to ensure that the e.ect of only multiple RPL in­stances is considered in simulations, any MAC level prioriti­zation should focus of channel access and not queue schedul­ing.
Relationship: reasoning
Domain: Networks
Sentence 1: The MAP can be viewed as the local home agent , and in most cases, it is located closer to the MN than the HA.
Sentence 2: the signaling cost saved is the difference between the roundtrip time of the MN to the MAP and the roundtrip time between the MN to the HA, assuming that message processing time within a network node is insignificant in comparison.
Relationship: reasoning
Domain: Networks
Sentence 1: Regarding whether each addition produces a carry from bit r-1to bit r, there are four sub-cases as follows: Case 1.1: neither A+ B0 or A+ B1 produces a carry from bit r-1to bit r. B0 and B1 do not a.ect the most signi.cant l-r bits of A+B0 or A+B1.
Sentence 2: the most signi.cant l-r bits of these two are determined solely by A and hence are the same.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, an additional SRLG was added to our SRLG database that incorporated the links in a given area that were MPLS enabled application of this enhanced SRLG database successfully localized all of the SRLGs impacted by the four simultaneous failures with a threshold of 1.0.
Sentence 2: this illustrates how the threshold used in the SCORE algorithm can allow our results to be robust to incom­plete modeling of all of the possible SRLGs any level of modeling of risk groups can be inadequate as there could be more complicated failure scenarios that cannot be modeled by humans perfectly a priori.
Relationship: reasoning
Domain: Networks
Sentence 1: Overprovisioning in order to avoid having to deal with QoS aspects on the other hand is qui­te expensive in mobile environments and currently not done on a suf.cient scale to make networked games playable.
Sentence 2: we used GAV to characterize this traf.c type in more de­tail, performing measurements regarding bandwidth usage, server response times, and user behavior.
Relationship: reasoning
Domain: Networks
Sentence 1: Even if theadversary .ndsaphysicalpositionand anappropriatetrans­mission con.guration, theperiodic change of thefrequency affects theRSS relation within thelegitimateWSN(asdemonstratedin Section 2.1) and invalidates the con.guration used for the attack.
Sentence 2: the signalprint which was broken by the adversary is not validfor communication using other transmission con.guration.
Relationship: reasoning
Domain: Networks
Sentence 1: We .nd that these quantities become independent of t (be­come stable) after a certain number of agents have joined the system and their time evolutions also match accurately with each other for di.erent value pairs of v and b.Figure 3 shows few such sample cases for di.erent combinations of the other two parameters N and µ.
Sentence 2: it can be understood that, to analyze the coverage, i.e., number of distinct sites where a message can be spread by means of a speci.c information dissemination scheme in DTN, the very .rst step to be carried out is to estimate the parameters of the bipartite network setup that can work as a perfect proxy for the DTN setup.
Relationship: reasoning
Domain: Networks
Sentence 1: A Joint Centralized Scheduling and Channel Assignment Scheme in WiMax Mesh Networks Yuliang Tang* Department of Communication Engineering, Xiamen University Xiamen, P. R. China tyl@xmu.edu.cn Yan Yao Department of Communication Engineering, Xiamen University Xiamen, P. R. China Xinrong Lin Department of Computer Science Xiamen University Xiamen, P. R. China   ABSTRACT The IEEE 802.16 standard, also known as Worldwide Interoperability for Microwave Access (WiMax), which provides a mechanism for deploying high-speed wireless mesh networks in metropolitan areas.
Sentence 2: quality of Service (QoS) is very important for WiMax networks.
Relationship: reasoning
Domain: Networks
Sentence 1: mon, forward, and reverse nodes, we split the coverage constraint in Eq (2) into two separate equations: fwd fwd .c : cov = pc,j + o (8) cc,j j :Nj .Pcommon fwd cj :Nj .P c rev rev .c : cov c = pc,j + oc,j (9) j :Nj .Pcommon j :Nj .Prev cc Now, for stateful analysis, the notion of coverage is meaningful only if both sides of the session have been monitored.
Sentence 2: we model the effective coverage as the minimum of the forward and reverse coverage values: fwd rev .c : covc = min{cov c ,cov c , 1} (10) We make three observations here.
Relationship: reasoning
Domain: Networks
Sentence 1: These anomalies represent a large fraction of the Internet tra.c that is unwanted and penalizes legitimate users from ac­cessing optimal network resources.
Sentence 2: detecting and 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: reasoning
Domain: Networks
Sentence 1: (9) As to the .rst term nf(n) on the right hand side of (9), where f(n)=  1 - `1+ e´2kvr(n) n d , recalling that e = o`log n nd ´ we have d log f(n)= n log 1 - `1+ e´2kvr(n)  ~-2kvnd r(n)= - log n - .. - log n-.´ = .c-.
Sentence 2: nf(n)=T`ne e , for all n = N0(.c), where .c is a .xed positive constant.
Relationship: reasoning
Domain: Networks
Sentence 1: Consider, for example, a TC that has recently registered with a WFIN and has provided the further infor­mation that it is 10 hops from the WFIN (such values are commonwhenthe TC is on theupper .oors of a building).
Sentence 2: if the WFIN desires to reach the TC, it could, per­haps, broadcast a paging message that is to be relayed no 1 Due to the straight streets and buildings lining the streets, it is common that when propagating down a street, the sig­nal strength decays like d-a,where a<2.This e.ect is known as propagation in urban canyons.
Relationship: reasoning
Domain: Networks
Sentence 1: [] 2. ing procedure leads to false positives.Even if the available computational power can perform 232 CRC tests, we pick a block size that is su.ciently large (i.e., NB is su.ciently small) so that, even in the worst case, we do not perform too many CRC checks.Hence, we guarantee by design that 2.
Sentence 2: if E is close to 232, it is likely that the combin­ « 232 and keep the false positive probability su.ciently small.Our implementation uses NB =6.
Relationship: reasoning
Domain: Networks
Sentence 1: where sinc(x)=sin(px)/px captures the interaction be­tween the .xed virtual and true sensor delays, and St,£ = {i : -1/2W< t i -e/W = 1/2W} is the set of all sensors whose relative delays lie within the e-th delay resolution bin of width .t =1/W.
Sentence 2: the angle-delay virtual repre­sentation partitions the sensor responses into distinct angle­delay resolution bins: the virtual coe.cient HV (m,m,e)isa superposition of all sensor responses whose angles and delays lie in the intersection of m-th spatial beam and e-th delay ring (see Fig.
Relationship: reasoning
Domain: Networks
Sentence 1: )= P(die = e >.|die >r(n)) where r(n)isde.nedin(4).
Sentence 2: p(die = r(n))is upperbounded as pr2(n) ln(f(n)/4) P(die = r(n))= = 2(n)23+5a/2.f(n) c P(Snear ln(f(n)/4) + P (Snear e >.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.1 Link Lifetime Estimation PBGR predicts the link lifetime using the model from [5], which assumes a free space propagation model [10] where the received signal strength is only determined by the distance to the transmitter.
Sentence 2: as long as the distance between two nodes is less than the transmission range, r or equivalently the signal strength is higher than some threshold; the link between them can be maintained.
Relationship: reasoning
Domain: Networks
Sentence 1: Also, the convergence rate of coor­dinate descent method is usually linear [26] (in practice, we .x the iteration number as a constant).
Sentence 2: the computa­tional complexity of Algorithm 1 is actually linear with re­spect to the number of events (i.e., t), considering that the number of nodes involved in each aggregation (i.e., n) and the number of classes (i.e., m) are usually small.
Relationship: reasoning
Domain: Networks
Sentence 1: We can represent each tree by de.ning parent functions .M and .S nn for TM and TS respectively.
Sentence 2: under this construction, data at node n is routed to the sink through .M in TM , .S in TS, nn and .n in T. we de.ne the edges in each tree by the ordered pairs (n,.M ) and (n,.S) for TM and TS.
Relationship: reasoning
Domain: Networks
Sentence 1: However, management systems and veri.cation tools for BGP con.guration already exist today, but they are more compli­cated and constrained because they must work around the artifacts of today s routing system.
Sentence 2: adding RCP to the routing system does not really constitute more functionality ; rather, RCP moves routing functionality to a part of the system where complexity can be better managed.
Relationship: reasoning
Domain: Networks
Sentence 1: With TCP tra.c and RTS/CTS disabled, the re­ported results are ß1 =0.382, ß2 =0.200, and ß3 =0.135.
Sentence 2: we .nd a more extreme unfairness with our empiri­cal measurements (ß1 =0.71, ß2 =0.100, ß3 =0.069, and ß4 =0.009), indicating that [10] is overly optimistic with respect to the fairness of 802.11 in parking lot tra.c matri­ces.
Relationship: reasoning
Domain: Networks
Sentence 1: For the PNC scheme, both the active transmission and re­ception areas can overlap, but during each time slot, a trans­mitter node in the overlapped active reception areas can only transmit one packet, while a receiver node in the over­lapped transmission areas will also receive a combination of the information transmitted from its neighboring transmit­ Figure 3: Available total active area for PNC ter nodes as one packet (see Figure 3).
Sentence 2: we have the following important observation of Ataa for PNC: Lemma 3.4.
Relationship: reasoning
Domain: Networks
Sentence 1: To support this functionality in distributed environments, PDQ provides the ability to perform distributed preemp­tion of existing .ow tra.c, in a manner that enables fast switchover and is guaranteed to never deadlock.
Sentence 2: pDQ provides a distributed .ow scheduling layer which is lightweight, using only FIFO tail-drop queues, and .exible, in that it can approximate a range of scheduling disciplines based on relative priority of .ows.
Relationship: reasoning
Domain: Networks
Sentence 1: The reason that we do not see a speedup of eight when using eight worker threads is the following: even though we restrict the user application to run on a limited number of cores, equal to the number of worker threads, the operating system kernel runs always on all the available cores of the processor.
Sentence 2: when Scap creates less than eight worker threads, it is only the user-level ap­plication that runs on these cores.
Relationship: reasoning
Domain: Networks
Sentence 1: Nevertheless, performance can su.er severely if an algorithm is selected that is unable to moderate con­gestion.
Sentence 2: we have a limited set of options: use a non-optimal global heuristic to attack the LP formula­tion for the whole topology, separate the bu.er management mechanism from the route selection problem, or decompose the problem into separate routing domains where loops may be permitted among only a subset of the nodes.
Relationship: reasoning
Domain: Networks
Sentence 1: FIB Updates We have emphasized that one of the bene.ts of C U CK -O O SW IT CH is that it supports in-place updates, which eliminates the need for pointer-swapping techniques such as Read-Copy-Update (RCU) to update the FIB.
Sentence 2: cU C KO O SW I T C H can respond instantly to FIB updates and can avoid the need to store multiple copies of the forwarding table.
Relationship: reasoning
Domain: Networks
Sentence 1: From (1), p1ks /cks = p1ks+1 /cks+1 .
Sentence 2: (1 - p1i)p1k|S| /ck|S| = min1=l=|S|(1 - p1i)pl/cl = (1-p1i)p1j /cj = 1.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition, one may wish to focus on la­tencies for a subset of packets that belong to a .ow, perhaps to hone in on the ones that exhibited abnormal latency, or to track the latency time-series of the .ow.
Sentence 2: clearly, in order to satisfy these requirements, we need a more .exible architecture than the one-size-.ts-all approach of existing solutions such as LDA (aggregate) or RLI (per-.ow).
Relationship: reasoning
Domain: Networks
Sentence 1: A client receiving a SKIP logically elides the remainder of the object region, without reserving physical buffer space, passing it to applications, or waiting for additional pack­ets from the server.
Sentence 2: the inherent paral­lelism between Trickles can be used to multiplex logi­cally separate transmissions on a given connection, while subjecting them to the same .ow equation.
Relationship: reasoning
Domain: Networks
Sentence 1: The correlation attack allows the adversary to infer the source and destination of a connection if he can observe both ends.
Sentence 2: if the adversary can observe tra.c from the user (either by compromising the entry router or by observing the user s connection to it) and can also ob­serve tra.c from the destination (either because he controls the destination or the last router on the path or observes the tra.c between them) then the user has no anonymity.
Relationship: reasoning
Domain: Networks
Sentence 1: Tind .THi .THAck (6) where Tind is the delay between the AP and the PAR, THI is the delay between the PAR and the NAR, THAck is the delay between the NAR and the PAR.
Sentence 2: we can summarize the handover latency for Yokota's FPMIPv6: LTFP .
Relationship: reasoning
Domain: Networks
Sentence 1: Using virtual ex­press lanes, which e.ectively act as dedicated wires between pairs of nodes, EVC-based .ow control is able to create par­tial communication .ows in the network, thereby improving resource utilization and reducing contention Tc at individual routers.
Sentence 2: packets spend less time waiting for resources at each router which lowers the average queuing delay, al­lowing the network to push through more packets before sat­uration and hence approach ideal throughput.
Relationship: reasoning
Domain: Networks
Sentence 1: Thismeansthatforanymulti-pathroutingthecorrespondingsingle-pathrouting,accordingto(11),yieldsatmostequalscalarpacket.uxateverypointx.Inparticular,wehavethefollowinglocalresult: Remark 1 If a multi-path solution at point x forwards packets with a given destination genuinely to several directions, then (13)in fact implies that the corresponding single-path routing, de­.ned by (11), yields a strictly lower scalar .ux about x (cf., triangle inequality).
Sentence 2: 2.3 Randomized path selection Letusfurtherelaboratetheprocedureofobtainingthesingle­pathroutesbyconsideringaspecialcaseofmulti-pathroutingob­tainedbyrandomlychoosingapathforeachpacketdestinedtor fromacountablesetI ofsingle-pathsolutions.Inotherwords,eachpacketismarkedtouseacorrespondingpathfromsetI with P acertainprobabilityofai,i.I ai =1.thepathchosenatrandombythesourceisthenfollowedtothedestinationwithoutanyfurtherrandomselections.LettheJi denotethecorrespondingd-.owswhenallthetraf.cdestinedtor isroutedusingpathseti,i .I.Accordingto(11)thecorrespondingsingle-pathroutingdecisionisinthedirectionofthenetd-.ow,i.e., X .
Relationship: reasoning
Domain: Networks
Sentence 1: Thisgainin throughput occurs because making F1 =0.99 produces end-to-end Bell pairs witha.delity abovethe .xed threshold just after the .nal swapping is done.
Sentence 2: no additional end-to-end puri.cation steps are required and these Bell pairs can be used immediately by the application layer, providing a throughput improvement.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition, other mechanism, e.g., a relatively low frequency process integrity checking mechanism, can be im­plemented to detect code modi.cations due to a slow prop­agating worm.
Sentence 2: the primary function of the Wireless Taps architecture is to provide a secure means of monitor­ing the performance or health of the applications, and to provide reports of health to all hosts and network manage­ments systems.
Relationship: reasoning
Domain: Networks
Sentence 1: The challenge is compounded by the fact that the sensors are battery-powered and owing to size lim­itations the sensors can only be deployed with low-lifetime batteries, most of which are not rechargeable.
Sentence 2: a sen­sor ceases to function (e.g., monitor) once its battery ex­pires, and oftentimes, sensors whose batteries have expired can not be easily replaced owing to logistics issues such as remoteness or inaccessibility of distribution areas.
Relationship: reasoning
Domain: Networks
Sentence 1: Since a video frame generated by the LML33 codec consists of two JPEG images specifying interlaced video .elds, each image separated by the marker bit corresponds to either an even or odd .eld of the input video.
Sentence 2: it can be estimated that the data rate is approximately 16.5 Kbytes/.eld, or 8 Mbps, which is within the range of the high quality requirement.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that the pseudo-price for anygivenprimaryisless than or equaltox (wherex = v) whenever he has unused bandwidth and he quotes a price of x or less: the probability that both these events occur is q.(x).
Sentence 2: since F (x) is the probability that k or more pseudo-prices(among those n -1) are less than or equal to x, F (x)equals n-1 () n n -1 i i [q.(x)][1-q.
Relationship: reasoning
Domain: Networks
Sentence 1: RELATED WORK The characterization of the instantaneous topology of a vehicu­lar network demands, by its own nature, the knowledge of the exactpositions of all the vehicles in a large geographical region at everysecond or so.
Sentence 2: logs of real-world car movements (e.g.,obtained via GPS tracking) would represent the ideal data uponwhich to carry out a topological analysis.
Relationship: reasoning
Domain: Networks
Sentence 1: (T) = y v 22c(T + 1)n logn - 2 2cn log n +cT log n and t is either v v n + 2 2cn log n or just 2 2cn log n depending on whether one wants to include the cost n of sending the message on a clear channel in t or not.
Sentence 2: our algorithm is resource­competitive.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that dJ(r~) _ ~-~ dJ(ri) drl dt ~ iEvl dri dt = ~ V'(r,)(a-iE v1 ~p' )2Vt(ri) > o (4) since the derivative of the strictly concave, increasing func- tion U(r~) is always positive.
Sentence 2: j(ri) is also a Lyapunov function for the channel allocation scheme given in Equa- tion (3).
Relationship: reasoning
Domain: Networks
Sentence 1: The two main problems consistently addressed by the research community are the collision avoid­ance mechanism of 802.11 [12, 29, 30] and the breakdown of CSMA under periods of heavy contention.
Sentence 2: even with careful network planning and assignment of AP parameters, the irregularities of the transmission range and receiver sensitivity, the shared 802.11 spectrum and ad­hoc location of clients in the network can cause degradation in the performance of the network.
Relationship: reasoning