sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: NumPeaks = NumPeaks +1 // try to assign min(V0, TotalTra.c) amount of traf.c for each k, Bink = pk SortedFlowList = sort .ows in descending order of FlowTra.c 5.1 for each .ow f in SortedFlowList .nd ISP k with the largest bin size Bink if Bink = FlowTra.c(f) Assignment(f)= k Bink = Bink - FlowTra.c(f) // assign the remaining traf.c for each k, Bink = Bink + P seudoCapk - pk RemainingFlowList = SortedFlowList- .ows in Assignment for each .ow f in RemainingFlowList Assignment(f)= k, where ISP k has the largest Bink Bink = Bink - FlowTra.c(f) // return the result MaxISP = argmaxkBink return Assignment, MaxISP } Figure 6: The OfflineIntegral() subroutine: an of.ine greedy integral .ow assignment algorithm.
Sentence 2: we use both analysis and simulations based on realistic traf­.c and performance data to demonstrate that our algorithms yield good performance and low cost.
Relationship: neutral
Domain: Networks
Sentence 1: Further, the strongest probing bias appears at the available bandwidth point for all three cases, which is 7.5 mb/s in our case.
Sentence 2: combining the case when gI = s/C as is stated in Theorem 3, we get the lower bound on E[gO] for the entire probing range 0 < gI < 8 as fol­lows4: s .
Relationship: neutral
Domain: Networks
Sentence 1: In one case the pre.x owner peered with the o.ending AS, and in the other case the pre.x owner and the o.ending AS belonged to the same company.
Sentence 2: they can be categorized into two categories: prevention [22, 26, 30, 21, 31], and detec­tion [32, 23, 27, 16, 6].
Relationship: neutral
Domain: Networks
Sentence 1: 6.3 Summary of main results The accuracyofthe minimalist approach con.gured withthe aggregate resources used by the six different applications is better than or comparable to the application-speci.c ap­proaches.
Sentence 2: if the .ow is selected, then the router uses its hash as an index into a table of .ows and updates the byte and packet counters for the .ow.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 2: Comparison of Throughput Performance with Different Fixed Fragment Sizes (Scenario I) Comparison of "n.lmughput Pedonmince of Adaptive Aloodthrns (Scenario I) tsoo : tloo to 15 20 25 30 35 40 ~ 50 SlmulaUon 11me (rrdn.)
Sentence 2: figure 5: Comparison of Throughput Performance of Different Adaptive Algorithms (Scenario II) Figure.4 shows the comparison of throughput performance u.sing different fixed fragment sizes in channel quality sce- nario II, i.e., pa is 0.7 and Pb is 0.3.
Relationship: neutral
Domain: Networks
Sentence 1: One of the limitations of the seed embedded into the SSID has to do with the handling of NULL values, as mentioned above.
Sentence 2: in this paper we propose anovel solution for the autocon.guration of IEEE 802.11 Mobile Ad Hoc Networks (MANETs) [1] are a networking based MANETs that relies on SSID parameter embedding.
Relationship: neutral
Domain: Networks
Sentence 1: This result implies that P-Unsplittable-Find remains NP-hard for T > 1, regard­less of whether the routing structure is allowed to change over time slots or not.
Sentence 2: as all the battery levels are positive in all the time slots between t and s, i can spend at least min{(bk i,s) - B, mint+1=te=s bk e } energy at i,s + ei,s - .bk i,t ' the time t and have bi,te = 0 .t.
Relationship: neutral
Domain: Networks
Sentence 1: Notice in Figure 2 that although the packet 3 from d13da3 with key d22456 goes through a di.erent next overlay hop node from pack­ets 1 and 2, the physical path that packet 3 takes shares 3 physical hops with that by packets 1 and 2.
Sentence 2: high degree of route reuse in DHT routing leads to 69 d467c4 (a) Logical Domain (b) Physical Domain d123c1 d467c4 2 1 3 d123c1 2.
Relationship: neutral
Domain: Networks
Sentence 1: Connected component of TCG ofWeb proxy packet trace(t =1[s]; ER-Rules: 1, 2, and 3(a, b)).
Sentence 2: tCGs can extract the root cause by pro.ling application programs with .ow causality, i.e., network operators can identify the root cause and the position of the detected anomaly if they know the traf.c is a part of Web proxy traf.c and proxy servers propagate .ows to other hosts.
Relationship: neutral
Domain: Networks
Sentence 1: As with the Boolean model, the concept of the thresh­old range allows the precise and e.cient simulation of k­connectivity: the simulation results shown in Section 5, Fig­ure 6, have been obtained as empirical cumulative distribu­tions of the threshold attenuation range for k-connectivity.
Sentence 2: it is relevant to ask when randomized beamforming improves the connectivity of ad hoc networks, in addition to asking how as done in [3].
Relationship: neutral
Domain: Networks
Sentence 1: Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH) (San Francisco, CA, U.S.A., 19 Sep. 08, pp.
Sentence 2: the server could have a proactive role in the rate adaptation action (e.g., looking in advance at the future of the media bit stream to be transmitted, in order to understand its characteristics and better adapt to outages in bandwidth availability).
Relationship: neutral
Domain: Networks
Sentence 1: This work was supported by Nano-Tera, the National Competence Center in Research on Mo­bile Information and Communication Systems under SNSF grant number 5005-67322, the Swedish Foundation for Strate­gic Research, and the Cooperating Objects Network of Ex­cellence under contract number EU-FP7-2007-2-224053.
Sentence 2: iPSN 12, April 16 20, 2012, Beijing, China.
Relationship: neutral
Domain: Networks
Sentence 1: It is the advantage that can select the route which is adequate to the data property as it decides the stable shortest route and have multiple routes.
Sentence 2: experimentation Parameters Parameters Value Size of simulation 1000 m X 1000 m Number of node 60 Velocity of node 2 m/sec, 4 m/sec, 8 m/sec for each 20 node Size of data packet 256 bytes Size of RREQ, RREP 64 bytes Size of RRER, Handoff 32 bytes Transmission of data packet 1 Mbps Time of simulation 100 sec Figure 10.
Relationship: neutral
Domain: Networks
Sentence 1: 4.4 No Key-change Knowledge in SBKH With SBKH, almost all knowledge of key indices, initializations and authorizations, and key changes are implicit in the protocol and cannot be determined by an analysis of in-the-clear messages.
Sentence 2: it is strongly recommended that S-offset < I-offset, to avoid encryption key reuse during resynchronization.
Relationship: neutral
Domain: Networks
Sentence 1: In the long run, the jammer knows that the transmitter will explore S * , and will choose the best set.
Sentence 2: we can also consider the class of transmission priority schemes in which reserved channels always take priority over unreserved channels; un­der such schemes, in the steady-state, transmitter A will always defer to transmissions of other nodes, actually in­creasing the performance of other nodes.
Relationship: neutral
Domain: Networks
Sentence 1: When bu.ers sizes are large (such as in the DSL example shown in the introduction), prop­agation delay is less of an issue and contributes negligibly to the delayed feedback and/or the dynamics of the whole system.
Sentence 2: [7] S.-R. Kang, Y. Zhang, M. Dai, and D. Loguinov, Multi-Layer Active Queue Management and Congestion Control for Scalable Video Streaming, IEEE ICDCS, March 2004.
Relationship: neutral
Domain: Networks
Sentence 1: VALIDATION 5.1 Simulations We evaluate the system performance using the ONE simulator [13] to which we add a LiberouterApplication class that is agnos­tic to the underlying routing protocol and is run, e.g., on access points and a LegacyRouter class for legacy nodes that will only interact with the nodes running the former.
Sentence 2: the notable outliers for improvement (see also .gure 5) are controlled replication with the smallest node population (50 nodes), again all acting as access points.
Relationship: neutral
Domain: Networks
Sentence 1: (We notethatbyomposition,werefertostatelessomposition; seeSetion2.3foraformaldisussion.)
Sentence 2: weshowthatifanauthentiatedByzantineAgreementpro­toolthattoleratesn/3ormorefaultypartiesistoompose sequentiallyrtimes,thenthereareexeutionsinwhihit runsformorethanr/2rounds.thenumberofrounds intheprotoolislinearinthenumberoftimesitistoom­pose.Thisrulesoutanypratialprotoolthatwillompose fora(large)polynomialnumberoftimes.
Relationship: neutral
Domain: Networks
Sentence 1: In the in­formation reconciliation stage [5], Alice and Bob exchange error-correcting messagesoveranauthenticatedpublicchan­nel that allow them to agree on an identical string of bits.
Sentence 2: [17] R. Wilson, D. Tse, and R. Scholtz, Channel identi.cation: Secret sharing using reciprocity in UWB channels, IEEE Transactions on Information Forensics and Security, vol.
Relationship: neutral
Domain: Networks
Sentence 1: Whenpaketsaredestinedtomobilenodes,homeagents forwardthemtotheforeignagentsregisteredbythemo­ l Futureworkwillonsiderpaginginenvironmentsthatdo notsupportforeignagents,(e.g.,whenolloatedare­of addressesareused).
Sentence 2: forregistrationrefresh,wemayadjusttheregistration lifetimeinP­MIPtomaketherefreshingrateinMobileIP andP­MIPequivalent.inthesignalinganalysis,we ignoretheefetofrefreshsignalingandfousonthesignal­ingdiferenewithandwithoutpaging.Wenormalizethe signalingosttotheweightthedistanebetweenahome agentandforeignagent.Equation(3)and(4)redueto C Cn = dHA,FA(Rorewore+Rzoazwzoaz) (5) pvl =i 7 Cp Cpn= dHA,FA(Rorewore+Rzoazwzoaz) pvlipvl ()=+i-ia 77 ()2 (6) l +pi(1-a)(Ad+Aa) 4 dFA,FA(i-1)p(z)2 i(1-a)Aa 4 + dHA,FA(RoreRw+Rzoaz) wherethehopweightratioRw(disussedinSetion5.3) istheratioofworetowzoaz.
Relationship: neutral
Domain: Networks
Sentence 1: To capture this tradeo., we .rst choose three handover modes and test their perfor­mance in practice while handing tra.c from WiFi over to 3G (Section 4).
Sentence 2: as we will see later, in today s networks it makes sense for MPTCP to prefer the WiFi interface when avail­able and only use the 3G interface when there is no WiFi connectivity.
Relationship: neutral
Domain: Networks
Sentence 1: There is a potential attack that some malicious nodes may pre­tend to frequently experience propagation delay changes to cause 140 1 0.9 120 0.8 100 0.7 0.680 Simulation time(s) 0.5 Average coordinates movement in 10s bins(ms) Fraction of malicious nodesDetection performance  Cumulative distribution 60 40 0.4 0.3 0.2 20 0.1 0 0 Simulation time(s) Simulation time(s) Relative error (a) (b) (c) Figure 13: The performance of integrating TIV detection and coordinates stabilization (a) Detection performance (b) Coordinates stability (c) Coordinates accuracy unnecessary coordinates recomputation.
Sentence 2: [23] M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti.
Relationship: neutral
Domain: Networks
Sentence 1: Whereas build­ing an equation system automatically in general is far from trivial, we can take the advantage of the special structure of our problem and hence allow LSMod to derive the model by itself.
Sentence 2: each sensor only obtains the information about the direct path; this necessitates a networked sens­ing system (hence higher system complexity and deployment cost) with at least three sensors to actually locate a source.
Relationship: neutral
Domain: Networks
Sentence 1: (5) Upon receiving the message from client A, client B confirms the challenge number rb, which was generated by itself before.
Sentence 2: before SIP proxy A sends the first message to SIP proxy B, SIP proxy A encrypts  with its private key as a digital signature, then it encrypts the digital signature with SIP proxy B s public key, and sends the encrypted message to SIP proxy B.
Relationship: neutral
Domain: Networks
Sentence 1: We lastly explore selective caching as a mechanism to simultaneously impede certain tra.c analysis tactics and decrease the ex­pected path length.
Sentence 2: the expected path length E[l]is de.ned as an in.nite geometric series: 8 X i 238 1 E[l]= r =1+r + r + r +··· +r = (1) 1-r i=0 subject to 0 = r< 1.
Relationship: neutral
Domain: Networks
Sentence 1: In VANET, owing to the high mobility and continuous change in the network topology, the .rst alternative (pe­riodically) that we mentioned before in MANET is more suitable in VANET [7].
Sentence 2: aRCHITECTURE Figure 1 shows the On Board Unit (OBU) architecture, which rep­resents the parts of the vehicles OBU and how it controls and in­teracts with the other devices that are connected to it, in order to achieve the aim of reducing the bandwidth consumption and over­head by sending HELLO message adaptively.
Relationship: neutral
Domain: Networks
Sentence 1: 2The Intel and Broadcom WiFi chipset we have looked at do not let us set the driver bu.er size.
Sentence 2: the Atheros WiFi card that we use in our evaluations holds only one packet, although in principle the physical memory bu.er might be larger.1 While packets pass through four queues, they are copied only twice: from user-space to the kernel s socket bu.er and then via DMA from the kernel to the device bu.er.
Relationship: neutral
Domain: Networks
Sentence 1: Since the NATs are expected to be on high-speed wireline network, the bandwidth overhead of tunneling is not really an issue.
Sentence 2: in our prototype, once virtual and actual IP are allocated for a host, the DHCP server updates the SNAT and DNAT tables in NAT to map the actual source IP to virtual source IP and the virtual destination IP to the actual destination IP for the packets coming in and going out on internal interface, respectively.
Relationship: neutral
Domain: Networks
Sentence 1: Alternatively, we are planning to combine stack introspec­tion techniques from the security community [47] with causal anal­ysis techniques recently used to create high-performance .le sys­tems that provide strong persistence guarantees [33].
Sentence 2: no constraints are expressed with respect to IROBs of other types, so, for example, the library may reorder an on-demand fetch IROB ahead of a modi.cation IROB.
Relationship: neutral
Domain: Networks
Sentence 1: INTRODUCTION Finding problems in complex networks has always been chal­lenging, as the substantial literature on network debugging and root-cause analysis tools [4, 7, 10, 11, 13] can attest.
Sentence 2: we have developed an initial ver­sion of such an algorithm, based on an extension of [20], but we cannot present it in detail here due to lack of space.
Relationship: neutral
Domain: Networks
Sentence 1: CoNext 06, December 4 7, 2006, Lisboa, Portugal Copyright 2006 ACM 1-59593-456-1/06/0012 ...$5.00.
Sentence 2: as TE is most effective in a network where the bottleneck is in the backbone and not at the periphery, we sim­ulate an underprovisioning network and set the link bandwidths of the links between routers to 10 Mbit/s.
Relationship: neutral
Domain: Networks
Sentence 1: This is due to the fact that the contention situations are more homogeneous, and UxDMA can take advantage of global topology information.
Sentence 2: even though the message delivery probability approaches one as the neighbor protocol sends out the same message in signals repetitively for extended period of time, the neighbor proto­col has to regulate the rhythm of sending signals, so that the desired probability of the message delivery is achieved with a small number of retransmissions in a short time, while in­curring a little amount of interference to other neighbors signal transmissions.
Relationship: neutral
Domain: Networks
Sentence 1: PL = (1 -- pB)(1 --pv) + (1 --PB)PuPw +PBPw" (8) Proof: A direct transmission from host X to host Y succeeds in WAR if Y receives the packet either from X or from a wit- ness of X and then X is informed about the success.
Sentence 2: (24) + Ps( 1 - PL) For DSR, we have: EL "Jr" PL'DSR(1 -- PS,DSR) ] Zrouting,DSR : PL'DSn(1 --PS'DSR)T (25) + PS DSR---------5 aCK, DSR(-----------i-- PL with PL,DSR and PS,DSR from eq.
Relationship: neutral
Domain: Networks
Sentence 1: The measurement results demonstrate that our NP-based switch can reduce the http processing latency by an average of 83.3% for a 1K byte web page.
Sentence 2: the .rst one is to see how much improvement can be achieved by using TCP splicing, thus we com­pare the performance of a proxy-based Linux switch to that of a splicing-based Linux switch (we call it Linux splicer).
Relationship: neutral
Domain: Networks
Sentence 1: The Farthest To BS algorithm outperforms Nearest To BS algorithm in case the number of SS is 6, while the Nearest To BS algorithm outperforms Farthest To BS algorithm in case the number of SS is 9.
Sentence 2: according to the given mesh tree T and request set D, the BS will make an efficient schedule that assigns transmissions as more as possible in each slot such that the total transmission time required for satisfying the request demand D is minimal.
Relationship: neutral
Domain: Networks
Sentence 1: We also let t,h =1,...,n +1, jj be the time for pj s tofully arrive(including thelastbit of the packet) at H(h).
Sentence 2: for this set of experiments, except for H(5), we did not generate cross tra.c for other hops (i.e., wj (h) = 0, .h= h ' , in Eqns.
Relationship: neutral
Domain: Networks
Sentence 1: If the conference doesn t exist (case 1.b) then the service returns a URL to which the client should send a POST message (case 2) which will result in the creation of a new conference.
Sentence 2: the session-oriented nature of telephony appli­ cations which are based on stateful protocols requires the use of .nite state machines to describe and implement the expected behaviour.
Relationship: neutral
Domain: Networks
Sentence 1: The .rst one tries to minimize the collision areas of channels, in order to maxi­mize the channel reuse and network performance.
Sentence 2: 4.3 Results Scenarios based on channel allocation algorithms 1, 2 and 3 were simulated, and we collected the results of transmission power, CPE throughput, allocation times of channels, CPE accessing possibilities, fairness on accessing possibilities and the average times of routing messages for other CPEs, when the available channels are from 1 to 10.
Relationship: neutral
Domain: Networks
Sentence 1: 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.
Sentence 2: there is considerable ner­vousness in the community regarding deployment of RED, and nu­merous variations of RED have been proposed [5], [12], [4].
Relationship: neutral
Domain: Networks
Sentence 1: After joining the former AT&#38;T Bell Labs in 1986, his work moved to industry-oriented research in areas of interconnection, electronic packaging, reliability, and assembly in manufacturing, and then moved again to netwo rk management, network architecture and standards for both wireless and wireline networks.
Sentence 2: [7] B. Li, L. Li, B. Li, K. M. Sivalingam, and X. R. Cao, Call admission control for voice/data integrated cellular networks: performance analysis and comparative study, IEEE Journal on Selected Areas in Comm., vol.
Relationship: neutral
Domain: Networks
Sentence 1: In all the aforementioned studies, it was established that multicell decoding e.ectively elimi­nates the interference-limited behavior of the per-cell capac­ity.
Sentence 2: the complexity of such a receiver grows exponentially with the number of UTs which are involved in the SIC process [8] and in addition, succes­sive decoding techniques can introduce error propagation in the decoding process.
Relationship: neutral
Domain: Networks
Sentence 1: To develop our model we use a large set of user mobility traces collected from the Dartmouth College campus WiFi network, which recorded the time and identity of over 500 wireless cells visited by more than 6000 users over a period of over 2 years [3].
Sentence 2: we found that with the threshold set to be the average cluster popularity there were a large number of clusters selected.
Relationship: neutral
Domain: Networks
Sentence 1: On the one hand, The CPMS-NB scheduling algorithm is based on aheuristicbacktracking approach(the nearest available robot) to obtain the robot scheduling solution for the ex­pected failures belonging to a given window.
Sentence 2: if fli doesn t exist (fi will be the .rst failure a.ected to m Rm), theRm initial position is considered.
Relationship: neutral
Domain: Networks
Sentence 1: In APSCC 08: Proceedings of the 2008 IEEE Asia-Paci.c Services Computing Conference, pages 1623 1627, Washington, DC, USA, 2008.
Sentence 2: the coupling of VIS-SIM and SUMO helps to obtain an overall real time factor greater than 1 even though a huge number of vehicles is simulated.
Relationship: neutral
Domain: Networks
Sentence 1: 1 1 IS AK M P I S A K MP + x - MI P   1x rt t D i s c onn e c t i o n     Figure 10: Mobile coming back home We used ethereal and tcpdump measuring tool to capture the data on the mobile s multiple interfaces.
Sentence 2: it does not address how to support seamless handoff while preserving a VPN and also does not address heterogeneous access technologies.
Relationship: neutral
Domain: Networks
Sentence 1: Compared with IP-based link state rout­ing, NLSR offers more ef.cient update dissemination, built-in up­date authentication, and nativesupport of multipath forwarding.
Sentence 2: in the context of a single network domain, there is usually a network administrator (trust anchor) that can certify the authenticity of keys in the net­work.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 6 has psuedo-code for the steps.
Sentence 2: 1 eventReceivedFromSrcInst (event) 2 if shouldBufferEvents then 3 eventQueue.enqueue (event.packet) 4 else 5 sw.forward (event.packet, dstInst) 6 packetReceivedFromSw (packet) 7 if lastPacketFromSw== null then 8 signal (GOT_FIRST_PKT_FROM_SW) // wait @ 24 9 lastPacketFromSw .
Relationship: neutral
Domain: Networks
Sentence 1: When a network is composed by mixed DCF and Idle Sense stations, those that are less aggressive with respect to channel access will su.er from lower performance.
Sentence 2: even widely used simulators such as NS2, OPNET, or GloMoSim do not provide suf­.ciently realistic models of complex wireless behavior and their results may signi.cantly di.er for the same problem [15].
Relationship: neutral
Domain: Networks
Sentence 1: While there exists a pseudo-polynomial dynamic programming solution for subset­sum, it cannot be directly applied here since it makes assumptions on the bound of the values themselves.
Sentence 2: both users and adversaries are aware of the names of the target .les, the names of the cover text cover .les, and the size of the tuples used to create chunks (publishers create tuples up to a certain size).
Relationship: neutral
Domain: Networks
Sentence 1: First, it enables legacy protocols that were defined using old notations such as pictures of bits and bytes or by tables to be re­defined before extension into a new (and usually more complex) version that requires a more sophisticated protocol definition mechanism.
Sentence 2: the current specification is not very precise on what a decoder should do when it receives an attribute id that is "unknown" (an attribute defined by some other equipment manufacturer) - or if this can in fact happen.
Relationship: neutral
Domain: Networks
Sentence 1: Categories and Subject Descriptors C.2.5 [Computer Communication Network]: Internet; C.4 [Performance of Systems]: Measurement Techniques; C.2.3 [Network Operations]: Network Monitoring   Keywords Bu.erbloat; Queueing delay; Passive Measurement; TCP; Queues; Tra.c classi.cation 1.
Sentence 2: we validate our methodology in a local testbed under di.erent data rate of the links, from 1Mbps (typical of ADSL uplink) to 100Mbps.
Relationship: neutral
Domain: Networks
Sentence 1: Each application can use Open-Flow [1] as a lingua franca for expressing its part of the network policy, and rely on an underlying hypervisor to me­diate access to the switches.
Sentence 2: inspired by past work in the Frenetic project [4, 5, 6, 7], we envision that the hypervisor can combine member policies in parallel (+) or in series (»).
Relationship: neutral