sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Animportantissuewhenstudyingschedulingalgorithmsforwire­lessnetworksishowtomodelinterference.Themostcommonlyusedinterferencemodelscanberoughlyclassi.edintograph-basedmodelsandfadingchannelmodels.Ingraph-basedmodels,suchastheprotocolmodel[11],wetypicallymodeltheinterferenceofwirelesslinksbyainterferencegraphH,wheretheverticesarealllinksinthecommunicationgraphG,andtwoverticesl1,andl2 formanedge(l1,l2) ifthesetwolinksl1 andl2 cannotbesched­uledtotransmitatthesametime-slot.Foranypairoflinksl1 andl2,ifitisnot connectedintheinterferencegraphH,thentheycantransmitsimultaneously.Thusagraph-basedmodelconsidersin­terferenceasabinaryandalocalmeasure,i.e.,theysimplyignoreinterferencebeyondacertainrange.Suchmodelsserveasause­fulabstractionofwirelessnetworks,oftensimplifyingtheprotocoldesignandproofofprotocolef.ciency.Forexample,maximizingthethroughputisthenequivalentto.ndingthemaximumweightedindependentsetproblemintheinterferencegraphH.However,theprotocolsbasedonlocalizedgraph-basedinterferencemodelsarenotguaranteedtoworkinarealscenario.
Sentence 2: anothercategoryofinterferencemodelstakeallinterferencesexperiencedbyareceiverintoaccount.Thisisoftencalledphys­ical interference model,inwhichasignalisreceivedsuccessfullyiftheSINR(theratioofthereceivedsignalstrengthtothesumoftheinterferencecausedbyallothernodessendingsimultaneouslyplusnoise)isaboveathresholddependingonhardwareandcod­ingmethod.Asopposedtothegraph-basedmodel,inthisphysicalinterferencemodel,thede.nitionofasuccessfultransmissionac­countsalsointerferencegeneratedbytransmitterslocatedfaraway.Consequently,wecannotbuildaninterferencegraphapriorisincetheSINRofareceiverdependsonthesetofnodesthataresimul­taneouslytransmittingineachtime-slot.Observethat,givenasetoflinks,wecandecidewhethertheycantransmitsimultaneously.Inthispaper,wecallsuchasetoflinksindependent set of links also.Notethatherewhetherlinksareindependentisnotabinaryrelationanymore.traditionalmethodsforMIScannotbedirectlyusedfor.ndingamaximumweightedindependentsetoflinksinphysicalinterferencemodel.Thismakesthedesignandanalysisofalgorithmsmorechallengingthaningraphbasedmod­els[2,15,16].Goussevskaiaet al.
Relationship: reasoning
Domain: Networks
Sentence 1: Network administrators who attempt to avoid computers on their internal network as being part of botnets can simply block the outbound IRC connections.
Sentence 2: more and more botnets are now evolving from the centralized communication way to the advanced distributed strategy, such as the early Sinit [3], Phatbot with WASTE command [4], Nugache [5] and the recent Peacomm (Storm worm) [6].
Relationship: reasoning
Domain: Networks
Sentence 1: Given S replaces Mo with Mn in its forwarded message batch, it is computa­tionally infeasible for A to tell whether Mn is the decryption of Mo using some unknown secret key K, even if A may be able to link Mo with Mn as the messages originated from the same sender, assuming the semantic security of symmet­ric key encryption and the security of one-way function f ().
Sentence 2: a cannot link S with Mn with a probability bet­ter than random guessing either.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, to manage the multiple IPC pro­cesses, a multi-interface system would have a higher-level IPC process that performs not only multiplexing but also a relaying function.
Sentence 2: to manage the IPC channel through a multi-interface system (e.g., a router), a relaying-and­multiplexing task would be required to forward messages toward their destination.
Relationship: reasoning
Domain: Networks
Sentence 1: Additionally, the number of leaf-nodes is at least half the total number of nodes of the tree.
Sentence 2: the total memory requirement can be rewritten as: M =(|S1| + |S2|)(L + LP +log m + LNHI ) + |S1|LPtr1 + |S2|LPtr2 (7) From the formula, we can observe that the total mem­ory requirement M is not sensitive to the number of routing tables m.In fact, M is proportional to LVID = Ilog m1.
Relationship: reasoning
Domain: Networks
Sentence 1: As mentioned before, the testbed is composed of several modules running in parallel on different PC s. Then, it is very important to have a simple but powerful graphical user interface for setting up, controlling and visualizing the whole testbed execution and results.
Sentence 2: aGMT has been programmed to support the following set of functionalities:  Control the execution flow of the testbed and selection of the scenario to be demonstrated.
Relationship: reasoning
Domain: Networks
Sentence 1: On the contrary, the use of ECN+ (i.e., Table 1: Normalized Throughput (%) AQM scheme RED/ECN RED/ECN+ RED*/ECN RED*/ECN+ REM/ECN REM/ECN+ PI/ECN PI/ECN+ 90% load 84.91 85.11 73.24 79.29 78.28 78.63 86.37 86.56 105% load 94.65 95.02 76.62 96.51 94.42 99.73 99.76 99.89 marking instead of dropping packets) during these short congestion the bound determined by Wmax.
Sentence 2: because the initial window periods can have a dominant impact on end-to-end performance.size is two packets [6], and because TCP s slow-start mechanism doubles the window size each round-trip-time, the .ow arrives into the system in n bursts of size Xs = {2, ..
Relationship: reasoning
Domain: Networks
Sentence 1: A sequence of probes with a .xed sampling interval of 500milliseconds wasdispatched to a remoteADSL end­point with a downlink speed of 8 Mbits/s and an up­link speed of 800 Kbits/s.
Sentence 2: the forward path (from the measuringnode to theADSL node) contained theADSL sdownlink, whereasthereversepath(from the ADSL node to the measuring node) contained the ADSL s uplink.
Relationship: reasoning
Domain: Networks
Sentence 1: Cache hits from the key CCN nodes enable fast response to content request­s, but this needs to be balanced against the cost of having a large number of complex CCN nodes.
Sentence 2: addition­ally, by a judicious choice of placing a limited number of full-.edged CCN nodes that can also cache content at key points in combination with a larger number of hash-based forwarding (similar to IP forwarding), we address the prob­lem of e.cient migration to an Information Centric future.
Relationship: reasoning
Domain: Networks
Sentence 1: The number of possible orders in which events can oc­cur is, in fact, exponential in the number of members in the group and the number of actions (JOIN messages and group departures) which will occur.
Sentence 2: two facts quickly became clear: protocol veri.cation would need to be auto­mated, and this automation would have to be heavily op­timized in order to keep veri.cation tractable on standard hardware.
Relationship: reasoning
Domain: Networks
Sentence 1: Rate(d ) = S ; for R < d = R , 1 = i = n (1) i i+1i where, Ri is the transmission range of data rate Si that meets a given BER objective, and S1 and Sn are the minimum and maximum data rates respectively.
Sentence 2: rn+1 = 0, and R1 is the maximum transmission distance.
Relationship: reasoning
Domain: Networks
Sentence 1: The delay of 802.1X authentications was evaluated in [4] and the minimum value (150 ms) was obtained with 802.1X fast resume; the minimum values obtained for a full 802.1X and for the 4WHP were 750 ms and 10 ms, respectively.
Sentence 2: our minimum reassociation delay is at least two orders of magnitude smaller than the lowest delay with 802.1X and at least one order of magnitude smaller than the 4WHP delay.
Relationship: reasoning
Domain: Networks
Sentence 1: RandPhaseKing(vi )  Note that one phase with a correct king in each sub- protocol is sufficient in order to guarantee the protocol's correctness as can be seen from the analysis of Protocol 2.
Sentence 2: running each sub-protocol for a sufficient number R of phases will guarantee, except for some negligible proba- bility, that eventually, some correct player is elected as king.
Relationship: reasoning
Domain: Networks
Sentence 1: InFigure2(b),supposeAissendingapakettoBafterhav­inginitiatedanRTS­CTSexhange.NeithertheRTSnorthe CTSisheardbyC,whihproeedstoinitiateatransmission toD.TheRTS­CTSexhangebetweenCandDisdiretional andnotheardbyA,whih,afterompletingitstransmission toB,nowinitiatesatransmissiontoE.TheRTSfromAto EinterfereswiththedatabeingreeivedbyDfromC.
Sentence 2: withdiretionalommuniations,thereeiptofanRTS orCTSdoesnotimplythatyoumustbebloked(referfg­ure2(a))andthenon­reeiptofanRTSorCTSdoesnotim­plythatyouantransmit(referfgure2(b)).Moregenerally, thereisaspetrumoftradeofsbetweenhavingbetterspatial reusewithparalleltransmissions(butmoreollisions),and havinglessernumberofollisions(butlessspatialreuse).A goodsolutiontotheproblemshouldbeparametrizedtoallow foraseletabletradeofinthisspetrum.
Relationship: reasoning
Domain: Networks
Sentence 1: To halt a DDoS attack in progress, slave machines, which in this paper are simply called attacker, need to be identi.ed but the source address of attacking packets is not accountable for this purpose be­cause, in the current Internet, hosts can write spoofed source addresses in packets to send.
Sentence 2: we need to have an al­ternative that allows us to trace network paths along which attack packets travel in order to identify attackers.
Relationship: reasoning
Domain: Networks
Sentence 1: ns ' is feasible} 8: end for 9: c = c +1 10: end while 3.1.3 Selective Growing/Delete A further step to reduce the complexity in comparison toSelectiveGrowing(SG) is todeletethose network states which were assigned a duration smaller than a threshold t> 0.
Sentence 2: theinitialization of Sc+1 in theprevious algorithm, line 5 becomes Sc+1 = Sc|d* >t c Hence, the relation Sc-1 .Sc does not hold any more.
Relationship: reasoning
Domain: Networks
Sentence 1: In this paper we present a novel Swarm Intelligence routing algorithm for Wireless Mobile Ad-hoc Networks, named Stigmergic Landmark Routing(SLR).Itis inspiredby the behav­ior of bees and uses the concept of landmarks to indicatekeynodes which store routing information.
Sentence 2: little routing infor­mation needs to be stored and maintained in the network.
Relationship: reasoning
Domain: Networks
Sentence 1: Suppose the ratio of empty buckets is (, we have (s = be/m = e -ts = 0.051, where (s is the ratio of empty buckets when t = ts.
Sentence 2: n can be estimated as follows " 1 m M(j) m j=1 Cmm2 if 0 ( < 0.051 n =.
Relationship: reasoning
Domain: Networks
Sentence 1: As shown in Figure 6, in 10 × 4 nodes network (the longest dimension is X), the source node S can send packets to many nodes with XY-routing, and then, in 4 × 10 nodes network (the longest dimension is Y), the source node S can send packets to many nodes with YX-routing.
Sentence 2: this routing algorithm can utilize advantageously the fact: The performance of XY-routing is better that of YX-routing in a oblong mesh network in which the longest dimension is X.
Relationship: reasoning
Domain: Networks
Sentence 1: At the sink node (b), obviously, its forwarding se­quence is empty, the EDRb(0/) value is 100% (i.e., no packet loss), while EEDb(0/) and EECb(0/) values are both zeros (i.e., no delay and no energy consumption).
Sentence 2: we can obtain following initial equations: EDRb(0/)= 1 , EEDb(0/)= 0 , EECb(0/)= 0 (1) Data Delivery Ratio 0.8 0.6 0.4 0.2 Expected Delivery Ratio Actual Data Delivery Ratio 0 Let the bi-directional link quality pei denotes the success ra­ tio of a round-trip transmission (DATA and ACK) between node e and the ith forwarder in Se .
Relationship: reasoning
Domain: Networks
Sentence 1: The movement contour of user s is likely to be mostly outside the protection area of any link s ' .
Sentence 2: even setting As(t + 1) = 0, Problem 1 is likely to judge that links s and s ' have a low probability of mu­tual interference and make a resource allocation decision as same as that in the case of setting As(t + 1) = 1 (so that the mutual interference probability is 0).
Relationship: reasoning
Domain: Networks
Sentence 1: Equation 1 directly yields n-1 X CoE(vn,EEBL) = l4(vi) (4) i=0 which is linear with respect to the number of received noti­.cations from other vehicles.
Sentence 2: given a valid event (in which case vehicles v0,v1,...,vn-1 send their messages), we have: CoE(vn,EEBL) = O(n).
Relationship: reasoning
Domain: Networks
Sentence 1: Indeed, the slope of the line .tted to the data points is 0.478 and if we interpolate this line, the ordinate of the 0 variance point is 0.93.
Sentence 2: clt =0.478 and cµ =0.93-1 =1.075 which are almost identical to the theoretically derived values of 1/2 and 1 respectively.
Relationship: reasoning
Domain: Networks
Sentence 1: Relatively high values of pfp (e.g., 10-2 , i.e., 1 % of all messages) may result in revoking many benign nodes.
Sentence 2: we selected a much smaller value of pfp, namely10-4 ,which canberealizedby requiring nodestore­ceive several bad messages before identifying their sender as an attacker.
Relationship: reasoning
Domain: Networks
Sentence 1: This decentralized per-.ow control approach di.ers to the earlier work [3, 8] in the regards that they focus on distributing the per-.ow controls horizontally (i.e., distributed per-.ow control architecture) while we tend to distribute them somewhat vertically (i.e., towards decen­tralized per-.ow control architecture).
Sentence 2: in this work­in-progress paper, we design a pilot implementation of de­centralized per-.ow control by employing OpenFlow, NOX and Click.
Relationship: reasoning
Domain: Networks
Sentence 1: Also, for now, we will assume that the broadcast session finishes in less than or equal to |T| time-slots.
Sentence 2: then, we define the following rule: Broadcast Rule: At every time-slot, ti, a node considers broadcasting only if it has not broadcasted earlier in this session and it is admissible in Ti at the beginning of the time-slot ti Proposition 2 implies that nodes with smaller RC values would not be able to broadcast (i.e., be admissible) at the beginning of the time sequence TS, but will potentially be admissible in later timeslots (i.e., at lower levels).
Relationship: reasoning
Domain: Networks
Sentence 1: Because all the tables produced by our reencod­ing schemes have widths less than 36 bits, we can set the TCAM width to be 36.
Sentence 2: using a pipelined-lookup ar­chitecture, we can achieve a classi.cation throughput of one packet per cycle; using multi-lookup architectures, we can achieve a classi.cation throughput of one packet per twelve cycles.
Relationship: reasoning
Domain: Networks
Sentence 1: Hence q arrived at its destination by time t -dLwrJ+dLwrJ=t: since the length of its path is at most d, all its arrival times are earlier than t, so we may apply the induction hypothesis.
Sentence 2: all the LwrJ+1packets that use e in the time interval [t, t +LwrJ] must have been injected in the interval [t -dLwrJ+1,t].
Relationship: reasoning
Domain: Networks
Sentence 1: Exhaustively listing all subchannel access combinations to construct the strategy space would result in an ex­ponential growth (2C).
Sentence 2: we examine two approximate de.nitions of the strategy space with polynomial space size: we call these the Binary Branch strategy space and the Consecutive List strategy space, and de.ne them as follows: In the Binary Branch, we use a binary branch tree, where each node represents one strategy.
Relationship: reasoning
Domain: Networks
Sentence 1: Hidden Information and Actions in Multi-Hop Wireless Ad Hoc Networks Xiang-Yang Li* , YanWei Wu , Ping Xu , GuiHai Chen , Mo Li§ ABSTRACT For multi-hop ad hoc networks formed by individually owned nodes, the endpoints can only observe whether or not the end-to-end trans­action was successful or not, but not the individual actions of inter­mediate nodes.
Sentence 2: in the absence of properly designed incentive schemes, rational (i.e., sel.sh) intermediate nodes may choose to forward data packets at a very low priority or simply drop the packets at all, and it could put the blame on the unreliable wireless channel.
Relationship: reasoning
Domain: Networks
Sentence 1: The mean value of R' is then +1 (1 - p3) - (p3 rmax + 1)(1 - p3)rmax E[R']= .
Sentence 2: [1 - (1 - p3)rmax+1] · p3 (31) we can derive the conditional mean val­ues of M and N as ()( )() rmax+1 p1 p3rmax p1 - +1· p1+p3 p1+p3 p1+p3 E[M']= +( ) , rmax+1 p1 p3 1 - · p1+p3 p1+p3 (32) and ()( )()rmax+1 p2 p3rmax p2 - +1 · p2+p3 p2+p3 p2+p3 E[N']= + .
Relationship: reasoning
Domain: Networks
Sentence 1: The median spectral e.ciency of trace A is 2.4 bit/s/Hz (this is in line with early 3GPP estimates [12, Chapter 26]), the 90th percentile is 4.8 bit/s/Hz and the 99th percentile is 6.4 bit/s/Hz.
Sentence 2: in operational conditions, the highest spectral e.ciencies are not reached.
Relationship: reasoning
Domain: Networks
Sentence 1: )}.R2 , (18) where the dependence of the region R1(u) on R1 and R2 has been dropped for the sake of notational clarity.
Sentence 2: r1(u) is the re­ gion of channelgains [g1,g21 ] where receiver1 incursfailure con­ ditioned on the control variable ub =u.
Relationship: reasoning
Domain: Networks
Sentence 1: Note that because the set of active ASes and pre.xes has changed over the 9 year timespan, the sampling procedure was done indepen­dently for each year.
Sentence 2: the sets of pre.xes and ASes con­sidered vary from year to year, in order to capture the maximum amount of routing changes, and hence results in the remaining of this work were computed independently for each sample.
Relationship: reasoning
Domain: Networks
Sentence 1: Therefore, within testbed goals is the control and interworking of these IP-based functionalities like QoS-aware mobility with CRRM.
Sentence 2: specific objectives to be covered by the testbed framework are categorized under the following general points: Implementation and emulation of specific protocols, functional entities and algorithms that can serve as a proof of concepts for other studies but that can also provide an additional validation of such concepts under a more realistic scenario with the typical wireless constrains.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular, an administrator could partitiontheEIDs belongingtothedifferent subnetworksofanAD tooneof255possible paths (inpractice,weexpectthe numberof pathstobealot smaller)bysettingadifferentvalueoftheinterface .eld for each partition.
Sentence 2: anyupstream network can chooseto zero the interface bits in its wide-area advertisements as a way to reduce theamountof global routingtablestate,in muchthesamewaythatit aggregatespre.xes today.most wide-area routerswillforward usingADlookupsasbefore,butthose nearthedestinationthatmight be obligated to payattention to the interface bits of an AD address.
Relationship: reasoning
Domain: Networks
Sentence 1: Studies have shown that in many cases the set of candidate neigh­bors (e.g., recently heard nodes) is much larger than the set of use­ful neighbors (e.g., neighbors which can provide a reasonable reli­able link) and too large to retain in the memory of most microcon­trollers [53, 57].
Sentence 2: neighbor table management is critical.
Relationship: reasoning
Domain: Networks
Sentence 1: Us­ing a .xed grid size might not accurately capture the heteroge­neous spectrum condition of areas with large variances (needing to use a smaller grid size), or might waste time to measure the spectrum condition of open areas with small variances (needing to use a larger size).
Sentence 2: the complete monitoring adaptively determines the grid size based on the degree of heterogeneity in spectrum characteristics in a given measurement area.
Relationship: reasoning
Domain: Networks
Sentence 1: In this paper, we present MAETT (Mobile Agent Electronic Triage Tag) [13][9][21] and Haggle-ETT [14], that allow the triage data to be collected and repre­sented in an electronic format and to be transmitted, to a coordination point where they will be processed and made available for the managers of the disaster re­covery, even if no network infrastructures are present.
Sentence 2: these applications provide a collection of addi­tional information for a better coordination and a faster response.
Relationship: reasoning
Domain: Networks
Sentence 1: In particular, the gap between the JIT approach (optimal in terms of state, though with potentially unacceptable interruption time) and the static approach, which does not suffer from service interruption, however maximizes state cost.
Sentence 2: when a session relay approach is not an option due to stringent delivery delays required by the application, the application-aware solution constitutes a good tradeoff between the two extremes.
Relationship: reasoning
Domain: Networks
Sentence 1: This is achieved using a feature which allows SIP proxies to be con.gured to route SIP requests based on domain names of the SIP URL (the CS in this case), when the exact URL is not registered.
Sentence 2: even when the conference URL is not registered with the proxy, a message of the form sip:conf-id@conf-server is routed to the CS.
Relationship: reasoning
Domain: Networks
Sentence 1: Due to mobility, a node is not always aware of all its neigh­bors, and it is di.cult to guarantee that (IPaddress, key) database is updated at all neighbors at all times.
Sentence 2: for DSR we recommend that source routes learned by promis­cuous listening of routing-related packets be utilized, but the routes learned by promiscuous listening of data packets should not be used, unless it can be veri.ed that the over­hearing host is aware of the (IPaddress, key) database at the transmitting node.
Relationship: reasoning
Domain: Networks
Sentence 1: Notice that, Penrose [22] had showed that when the domain is a unit-area square, the probability that a random geometry graph G(V,rn) is k-connected and has minimum vertex degree k goes to 1 as n goes to in.nity.
Sentence 2: we can conjecture that the transmission radius rn such that the graph G(V, rn) is k-connected with high probability satis.es npr2 .ln n +(2k -3) ln ln n - n 2ln(k -1)!
Relationship: reasoning
Domain: Networks
Sentence 1: The data publisher should not only be able to understand the vulnerability or utility of a network object, but should also be able to use the analysis results to apply di.erent san­itization techniques to better satisfy the privacy and utility requirements of the sanitized trace.
Sentence 2: we need to pro­vide guidance about which .elds contribute more to the ad­versary s privacy attack or to the loss of utility than other .elds.
Relationship: reasoning
Domain: Networks
Sentence 1: Therefore, our main objective in this paper is to propose a solution that allows for adapting new calls in a way that decreases NCBP while at the same time preserving the priority of handoff calls which translates into minimum HCDP.
Sentence 2: the idea is to find a way to describe the state of the cell at any given time so that allows the system to decide whether it should adapt for the new calls or not.
Relationship: reasoning
Domain: Networks
Sentence 1: However, by cheating MORE to use 0.1 as the loss probability on link (R,D), node Rcan reduce its expected number of transmissions to 0.78, a reduction of expected workload by 34%.
Sentence 2: r has in­centive to cheat, but this cheating may lead to reduced throughput for the session from S to D. 2.3 Solution Concepts To study the incentive compatibility of opportunistic routing, we use a strategic game model.
Relationship: reasoning
Domain: Networks
Sentence 1: The rationale behind LRU and LFU is that most of popular objects are consumed many times once they are used, and their popularity generally follows Zipf distribution, which re.ects the power-law effect [4], That is, a relatively small number of popular objects are requested by a large number of users, which account for the majority of the Internet traf.c.
Sentence 2: our conjecture is that, if the in-network caching can detect and cache popular objects more timely (i.e.
Relationship: reasoning