sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Then, for any integer x=2, xl-(N+ln)/2c e Pr(Y>lx) xl) lxthe odds that Z>xl.So, for example, if l= 8, c = 15, x =3, n =210,and N =218 , then the 248 probability that Y> 24 is less than 1/,which is a very small number.
Sentence 2: in this example, we may safely discard the packets for any index C that have more than 24 packets.
Relationship: reasoning
Domain: Networks
Sentence 1: Computing a single path with required bandwidth subject to both inter­.ow contention and intra-.ow contention does not seem to be possible in polynomial time since intra-.ow contention can be determined only if the path is given but there may exist exponential number of single paths between a source and a destination node.
Sentence 2: we will present a maxi­mum bottleneck capacity path heuristic for this purpose.
Relationship: reasoning
Domain: Networks
Sentence 1: Thus, for a given AP, the maximum di.erence between the start of the data trans­mission times of its neighboring clients is at most 20.70µs (See Figure 3 where Alice can possibly start transmitting data as early as t = T + 6.35µs while Don may start as late as at t = T + 27.05µs).
Sentence 2: to ensure that the PN sequences in their data packet headers collide only with the PN sequences of other transmitters, the clients pad cyclic bits after their PN sequences.
Relationship: reasoning
Domain: Networks
Sentence 1: Without loss of generality, let domain m be the player which has the incentive to deviate ' to a new gateway selection strategy gm.
Sentence 2: we have '' i'* c i, ig + cim gm ,ir n (g ) imm n i=im(g),i.Nm m * + c i,ir n (gn) inequality, so does the new link cost metric c ' (a, b).
Relationship: reasoning
Domain: Networks
Sentence 1: As mentioned in [10], Physical-Layer Network Coding (PNC) [11] and Ana­log Network Coding (ANC) [12], which have been proposed in recent years, may implicitly o.er the ability of MPR and MPT as they allow simultaneous reception and combina­tion of the electromagnetic (EM) waves of di.erent signals at the physical layer.
Sentence 2: it may be possible that PNC and ANC, unlike the digital NC, may have the potential to improve the capacity order.
Relationship: reasoning
Domain: Networks
Sentence 1: By both analysis and simulation, we show that when the number of stations inanIBSSis notverysmall,thereisa non-negligibleproba­bility that stations mayget out of synchronization.The more stations, the higher probability and the larger ratio of asyn­chronism.
Sentence 2: the current IEEE 802.11 s synchronization mechanismdoesnotscalewell;itcannotsupportalarge-scale adhocnetwork,say,from 150to 200stations asintheclass­room examplementioned earlier.
Relationship: reasoning
Domain: Networks
Sentence 1: We al­ready analyzed the total number of data packets earlier in this subsection.
Sentence 2: in attack-free situations, the total computation cost required to verify a single code image in­cludes one signature veri.cation and (2 + M(log M +1) + N(P -1) + .|CI|-N(P -1)(|payload|-|H(·)|) .)
Relationship: reasoning
Domain: Networks
Sentence 1: In this case, the arrival rate at the link in interval [tk,tk +T) is R0 + u1 C1 = C1.So, packet k is serviced before packet k+ 1 arrives at the queue.
Sentence 2: .q1 k =0, .dk 1 =0, and R1 = R0 (18)  A.2 Induction to subsequent links The results that were previously derived for the .rst link can be proved inductively for each link in the path.
Relationship: reasoning
Domain: Networks
Sentence 1: If we de.ne a Bernoulli random variable Xi corresponding to the connectivity state of each node in square L×L, where i =1, 2, ··· ,N, { 1, isolated; Xi = 0, connected.
Sentence 2: the expected number of isolated nodes is nn E[n1]= E 2 Xi = 2P (Xi = 1) i=1 i=1 n 2 2P1 = nP1 .1LP1 i=1 Let d =1/2 and apply Cherno.
Relationship: reasoning
Domain: Networks
Sentence 1: The experiments show carrier sense behavior splitting up as a function of interferer distance into three distinct regimes, near, intermediate, and far, just as the theory claims, with modest inefficiency in the intermediate regime but nearly optimal performance near and far.
Sentence 2: within the parameter range explored, the experimental results concur with the theory, supporting its claim that carrier sense s average throughput leaves limited room for improvement.
Relationship: reasoning
Domain: Networks
Sentence 1: NetEx is based on the observation that bulk data transfers are not sensitive to the latency of individual packets, i.e., their main per­formance metric is completion time.
Sentence 2: bulk data transfers can exploit spare resources opportunistically, i.e., data is sent only To exploit spare bandwidth opportunistically, NetEx differentiates traf.c into normal and bulk traf.c classes, and forwards bulk traf.c with strictly lower prior­ity.
Relationship: reasoning
Domain: Networks
Sentence 1: PREVIOUS WORK While the issue of data rate selection was touched in previous wireless ad hoc network studies, the approach was generally oriented as follows: given a data rate choice, how does it affect the optimization of the number of hops and transmission power utilized towards achieving a certain level of end-to-end packet delivery rate [9].
Sentence 2: a direct study on optimal data rate selection for vehicle safety communications is generally not present in the literature.
Relationship: reasoning
Domain: Networks
Sentence 1: Our argument above suggests that unless one adopts the cache­along-default-path design, we cannot do the name-based routing fast enough to make ICN the narrow waist.
Sentence 2: that is, one cannot have the network level primitive be something that cannot be processed at packet speeds.8 there is an interesting tradeoff between naming (hierarchical or not), routing behavior (just route to server, or route to nearest copy), caching behavior (is the working set size small?
Relationship: reasoning
Domain: Networks
Sentence 1: In most cases, the optimal PG schedules have lower delay for the downlink packets than the optimal MG schedules, while the optimal MG schedules have the lower delay for the up­link packets than the optimal PG schedules.
Sentence 2: the optimal PG schedule may provide the better delay perfor­mance when ß increases, and the optimal MG schedule may provide the better delay performance when ß decreases.
Relationship: reasoning
Domain: Networks
Sentence 1: 5.2 The .............model .............ompletestheworkstartedinthe.. ........framework.In.............,thefous isputonreatingaformalmodelfortheNodeOSInterfae NewNodeTYPE=[# node addrNodeAddress, node resoures Resoures, envts set[ExeutionEnvironment] #] ResouresTYPE=[# thread poolThreadPool, memory poolMemoryPool, hannelsChannelPool, filesFilePool #] ExeutionEnvironmentTYPE=[# addrEEAddress, resoure inuse Resoures #] Figure8:TheAtiveNoeSPECnoe Speifation[5].Thisspeifationdesribestheoperation ofanativenode,withoutdetailsofhowexeutionenviron­mentsproesspakets.Therefore,.............pro­videsamodelforroutingpaketsinsideanodeandforman­agingthenoderesoures.Itanalsobeonsideredthat.. ............looksatthebigpitureoftheativenode.
Sentence 2: itmodelshowseveralexeutionenvironmentsaresimulta­neouslyrunningonthesamenode.In.........,an abstrationwasmadefromanexeutionenvironmenttoa nodebeausefromtheEE'sperspetive,anetworkismade ofonlyonetypeofexeutionenvironments.Theabstra­tionisnolongervalidin..............the termexeutionenvironment{EE)referstoavirtualmahine whereappliationsarerunandthetermnodereferstoan ativenodeonsistingofaNodeOSaswellasoneormore EEs.
Relationship: reasoning
Domain: Networks
Sentence 1: By a trivial symmetry argument, the cost of the opti­mum interference path between any two nodes only depends on their distance k, measured as the minimum number of nodes between them (moving either clockwise or counter­clockwise).
Sentence 2: we may assume, w.l.o.g, that u =0 and n-1 v = k,with 0 <k =2 .A link between nodes i< j is a chord of length c if j -i = c.It is easy to see that IN((i,j)) = min{n,3(j -i)+ 1}.In fact, a transmission along the chord (i,j) will interfere with the c nodes pre­ceding the sender i,the c nodes following the receiver j, and the c -1 nodes in-between; counting also sender and receiver and summing up gives interference 3c+1.See Fig­ure 5.
Relationship: reasoning
Domain: Networks
Sentence 1: v K 363 «k n We are interested in the number of neighbors actually detected pR2 - p( a Kr)2 a n n-kk P1 (1 - P1) k (Kr)2 X P2 ()=r n in NS2.
Sentence 2: we do not consider the whole network but pR2 «n only a "typical point" located at the origin of the plane and its k=0 v « 1-neighborhood.
Relationship: reasoning
Domain: Networks
Sentence 1: Applying PMIPv6 features to HIP, it is possible to have an intra-technology handover process which is completely transparent to HIP MNs thanks to the fact that they do not detect any change to the previous configured IPv6 address.
Sentence 2: the necessary signaling messages for the handover are reduced and the performances in terms of handover latency demonstrate the high efficiency of this solution compared to any other previous proposal.
Relationship: reasoning
Domain: Networks
Sentence 1: So, we have: -.A(z) F (z)= Pr(Z = z)=1 - e They approximated the area A(z)inFigure10as A(z) 4rz by assuming that z is small compared to r for reasonable densities of sensors.
Sentence 2: e[Z] can be computed as: Z 8 .
Relationship: reasoning
Domain: Networks
Sentence 1: Using results in matrix algebra, we have -1 T -1 -1 T (N)=(N -bb)= N+ ßvv , (17) 1 det{N} =det{N -bbT }= det{N}, (18) ß where v = N-1b, and ß =1/(1 -bT v).
Sentence 2: we can compute fD(S.{i})=det{N}incremen­ N-1 tally by computing v = b, and ß =1/(1 - bT v) (note that N-1 remains .xed for different i).
Relationship: reasoning
Domain: Networks
Sentence 1: Indeed, the behaviour of the transport proto­cols especially when they implement window-based .ow control algorithms and congestion control techniques, as for the TCP pro­tocol is generally dependent on the size of transmit and receive buffers.
Sentence 2: to get a better understanding of packet losses and buffer over.ows we will brie.y describe what happens when a packet, coming either from the application program or the network card (NIC), is processed by the station s operating system.
Relationship: reasoning
Domain: Networks
Sentence 1: The probability that exactly one node announces itself as the relay is therefore «Nr-1 «4 n 11 111 ps = Nr 1-= n 1-= > 0 n n n n 34 where Nr is the number of eligible relay nodes that (from Lemma3.1)liesinthe range[ n, 4 n].
Sentence 2: theprobabilityof a successful relay selection is a constant bounded away from 0.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition, for any protocol message (be it a route request or a route reply), it must also be pos­sible to determine the initiator and the target of the route discovery process to which the message belongs.
Sentence 2: there exist functions ini : M. L and tar : M.Lsuch that ini returns the identi.er of the initiator and tar returns the identi.er of the target.
Relationship: reasoning
Domain: Networks
Sentence 1: In practice, this fee is mainly determined by market conditions and thus it is poorly related to the true managerial and routing costs that the ISP selling transit incurs.
Sentence 2: a transit agreement includes a cer­tain element of hidden information because the ISP selling transit commits to provide a service for a fee, established a-priori, without knowing exactly the true cost it will incur to provide such service.
Relationship: reasoning
Domain: Networks
Sentence 1: This can be attained by minimizing the ex­pected total number of transmissions required.
Sentence 2: we can formulate our problem as the following constrained op­timization problem: k)1/hk k)hk/hk log(1 - (r )(r i min .. p,t log(1 - tij ) k.S (i,j).fk s.t.
Relationship: reasoning
Domain: Networks
Sentence 1: As shown in Section 3, we need at most N piercing points to pierce the neighborhood of a unit-disk D bearing the smallest .q(D) · .n among the (unpierced)disks in its neighborhood, where .n is an orientation that gives N. We call such a disk D a top disk.
Sentence 2: at each step of the algorithm, each top unpierced disk D elects itself as a pierc­ing disk and selects the points in PN(D)as piercing points.
Relationship: reasoning
Domain: Networks
Sentence 1: These high speed variants were originally designed for ef.cient probing ofthe availablebottleneck capacity inlargeBDPnetworks.But in bufferbloated cellular networks, they only make the problemworse by constant overshooting.
Sentence 2: the bufferbloat prob­lem adds a new dimension in the design of a new ef.cient TCP,especially for cellular networks.
Relationship: reasoning
Domain: Networks
Sentence 1: For example, to support the functionality of personal video recorders, DVB has produced a set of guidelines (DVB­TVA [13]) for the use of TV­Anytime [14][15] content management and metadata signaling in DVB operations.
Sentence 2: the design of DVB­IPDC ESG is naturally affected by both DVB­TVA and TV­Anytime specifications.
Relationship: reasoning
Domain: Networks
Sentence 1: Switching an interface incurs a non-negligible delay (around 5 ms in our testbed), and too frequent switching may signi.cantly degrade perfor­mance.
Sentence 2: there is a need for a queuing algorithm to bu.er packets, as well as a scheduling algorithm to trans­mit bu.ered packets using a policy that reduces frequent switching, yet ensures queuing delay is not too large.
Relationship: reasoning
Domain: Networks
Sentence 1: In this case, the two APs will get out of sync, and due to carrier sensing, will not be able to transmit simultaneously in the same slot.
Sentence 2: we usepacket staggering, which requiresdelaying the .rstpacket of thetwoAPsrelativetoeach othersuch thatthe followingpackets ofboththeAPsareperfectlysynchronized.
Relationship: reasoning
Domain: Networks
Sentence 1: This makesTHP outperformZFBF only in very highSNR.How­ever, in a real system implementation, coded modulation schemes based on QAM constellations would be used also with ZFBF, and these su.er from the same shaping loss ofTHP.Therefore,in an actualimplementation,theperfor­manceofZFBF woulddecrease alsoby roughly 0.5bit/s/Hz perstream.
Sentence 2: thee.ectivegainofTHPoverZFBFinan actual implementation can be signi.cant, even at moderate SNR.Thisis consistent with thetestbed experimentsshown in Section 6.1, where symbols from a 16QAM constellation were used.
Relationship: reasoning
Domain: Networks
Sentence 1: Assuming that FZone Hash is the area of the forwarding zone between the requester and the TRSU, the number NbHashReq of HashReq msg forwarded from the requester to the TRSU is: NbHashReq = FZone Hash × .
Sentence 2: (17) for a total number N of service requests, the total number NbT otalHashReq of HashReq msg exchanged dur­ing the simulation time T is: NbT otalHashReq = N × FZone Hash × .
Relationship: reasoning
Domain: Networks
Sentence 1: [31] examine an AIMD rate adjustment strategy in which the additive increase is proportional to the number of descendants of a node, and multiplicative decrease is performed whenever a node detects (by promiscuously listening) that its parent is unable to forward its traf.c.
Sentence 2: a parent indi­cates congestion by dropping some traf.c from its child, forcing the latter into multiplicative decrease.
Relationship: reasoning
Domain: Networks
Sentence 1: AODV-SB-RKEQ allows the propagation and penetration of PRREQ packet infor- mation a few hops away [rom the last stable host whereas AODV-SB-RBLEP cannot do this since the RREP packet is originally a unicast packet.
Sentence 2: we can infer that AODV- SB-RREQ, as an aggressive strategy, performs better where there are a high percentage of AODV nodes in the net-work.
Relationship: reasoning
Domain: Networks
Sentence 1: dis determined according to the att f type: ij if the type of att f is binary or nominal: { d( f )= 0 if xif = xjf ij 1 if xi f= xjf if the type of att f is interval, a normalized distance such as Euclidean distance and Manhattan distance can be used.
Sentence 2: figure 4: Message exchanges among agents for fault-tolerant embedding ( f ) dis used to express the priority coef.cients of the NF at­ ij tribute att f for nodes i and j. multi-level pri­ ority is assigned to the NF attributes of each virtual node.
Relationship: reasoning
Domain: Networks
Sentence 1: However, when the size of the regression table is large or the calibration in­terval is long (e.g., > 15 minutes), the frequency ratio variances be­come the dominating factor while the nondeterministic errors can be ignored as discussed in Section 7.1.
Sentence 2: it is su.­cient to estimate the frequency ratio using only the last two entries in the table.
Relationship: reasoning
Domain: Networks
Sentence 1: The channel state space is SS = {Bk, k = 0,1, ,N}, where Bk is the state where k nodes send data simultaneously in the current slot; and N is the number of nodes.
Sentence 2: b0 indicates that the current slot is in an idle state; B1 indicates that the current slot is in a successful data transmission state; {B2, ,BN} indicate that the current slots are in collisional states.
Relationship: reasoning
Domain: Networks
Sentence 1: By the second part of Lemma 4.5, for each link .. .
Sentence 2: ..1 (..), (' ) G ..1 (..) ,..; .. (..)= 1 (' ) G ..1 (..) ,..; .. (..) (' ) =G ..1 (..) ,..; .. - .. (..) () =G(..1 (..) ,..; ..) - G ..1 (..) ,..; .. ' (..) = .
Relationship: reasoning
Domain: Networks
Sentence 1: By the fourth step of the iteration above, the new path assignment is isomorphic to the initial con.guration: now node ik is using the path ikQkik+1Pk+10, and every other pivot node ij is using path ij Pj 0.
Sentence 2: as this iteration repeats, the dynamics will ultimately reach node ik once again with the original path assignment.
Relationship: reasoning
Domain: Networks
Sentence 1: It soon turned out that Waledac was not the only spambot family whose members paid close attention to the greeting banners returned by the SMTP servers.
Sentence 2: we upgraded our SMTP sink to support banner grabbing for se­lect connections: SMTP requests to a hitherto unseen host now caused the sink to actually connect out to the target SMTP server and obtain the greeting message, relaying it back to the spambot.
Relationship: reasoning
Domain: Networks
Sentence 1: u=iu=i However, the cost for retransmitting ci,k and ck+1,j sepa­rately is kk-1jj-1 bgb g C2(ci,j )=4log s+ .u + .u + .u + .u u=iu=iu=k+1 u=k+1 Hence, we get C1(ci,j ) - C2(ci,j )= .gk - 2log s= 0.
Sentence 2: c1(ci,j ) is not the minimal cost for the retransmission, which contradicts with the supposition.
Relationship: reasoning
Domain: Networks
Sentence 1: The attenuated bloom .lter of a node records the information about the data stored at all nodes up to D hops away in the underlying network.For each request, a Tapestry node .rst searches every node within D physical hops (i.e., checks the information recorded in the attenuated bloom .lter) before forwarding the request over the overlay network.
Sentence 2: unnecessary overlay forwarding is avoided when the requested data is physically nearby.
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 1´An example of sensors coverage According to the above, we can find Formula 4 as an objective function about N. m Formula 4: LiAx= NrA .
Sentence 2: i i=0 the issue which the paper describes about quality of coverage service can be transformed into a mathematical problem: find the extreme value (the minimum N) of objective function (Formula 4) under the linear restrict conditions (Formula 2 and Formula 3).
Relationship: reasoning
Domain: Networks
Sentence 1: If K is randomly generated by an STA, then attackers have .rst to cryptanalyse RK to decrypt {K}However, the RK.
Sentence 2: only values that attackers observe encrypted with RK are random K values, thus only exhaustive search seams usable to .nd RK or K. choosing large enough RK and (random) K values, with at least 128 bits, should be enough for preventing successful exhaustive key search attacks.
Relationship: reasoning
Domain: Networks
Sentence 1: We enrich this set with a push .ag indicator that indicates whether a data packet has its PUSH .ag set or not.
Sentence 2: for each data packet we have 3 parameters; direction of the pack­ets (1 for up and 0 for down), PUSH .ag indicator (1 if the .ag is present and 0 if not) an the size of the packet.
Relationship: reasoning
Domain: Networks
Sentence 1: To ensure limited in.uence, a database needs to summarize each user s reports on sj before computing a summary over these individual summaries.
Sentence 2: for simplicity, it computes an individual user s summary as just the most recent report from that user that was taken in the same channel condi­tions (see §5.2).7 there is no need for an honest user to submit a new report on sj unless the last one it submitted expired or if sj sperformance substantially changed.
Relationship: reasoning
Domain: Networks
Sentence 1: In an extended version of [13], the authors model a speci.c topol­ogy, called Large-EIFS problem, where all the emitters are in communication range.
Sentence 2: in all the theoretical studies of the DCF, the mobiles are synchronized on the contention phase: they be­gin to wait for a DIFS (or sometimes EIFS) at the same time.
Relationship: reasoning
Domain: Networks
Sentence 1: Recall the cyclic characteristics of AWGR, the signal from one input port must use different wavelengths to go to different output ports, meanwhile signals from different input ports go to the same output port by using different wavelengths.
Sentence 2: if we want to use identical optical DEMUXs at each OCA for each AWGR output port, we need to keep an identical partition on the wavelength domain for each output port.
Relationship: reasoning
Domain: Networks
Sentence 1: The power received by a node z from the pair (x, y) is 111 1 ++ da da da zx zy zx (dzx + dxy)a f(dzx,a) (15) by the triangular inequality, and since dxy : 1.
Sentence 2: if dzx : g(a), then the power received at z is greater than 1, and the pair (x, y) can cooperate to connect with z.
Relationship: reasoning
Domain: Networks
Sentence 1: 5.1.4 Summary  The analysis above indicates that media caching under the stretched exponential model is far less e.ective than Web caching under the Zipf model, especially when only a small portion of accessed objects can be cached.
Sentence 2: in many pre­vious studies advocating media caching where the Zipf model is assumed, it is highly likely that the bene.t of media caching has been overestimated.
Relationship: reasoning