sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: To deal with this increased complexity, we have to measure the SIR more than one time to verify the successful reception of just one packet.
Sentence 2: in the literature, most of the optimality frameworks for scheduling/routing problems focus on the so-called protocol interference model [8, 10], which relies on simpli.ed assumptions based on the behavior of the IEEE 802.11 Medium Access Control (MAC).
Relationship: neutral
Domain: Networks
Sentence 1: I (0) -> provider-to-customer ........ peer-to-peer d Figure 5: A BGP system that obeys Guideline B but violates Assumption P For example, the BGP system in Figure 5 violates Assump- tion P since AS i is an indirect provider and a peer of AS 3.
Sentence 2: both AS 1 and AS 2 prefer the peer route over the customer route, which violates Guideline A.
Relationship: neutral
Domain: Networks
Sentence 1: The choices of the nodes in V  R are inde­pendent of the choices made by nodes in R. Hence, we can use the principle of deferred decisions as if all choices made by nodes in V  R are made after R has been determined.
Sentence 2: x(r) denote the subset of nodes that obtained m through a shortest path of length 0 = d = ., and denote by xd(r)= |Xd(r)| its size.
Relationship: neutral
Domain: Networks
Sentence 1: n              5     2 1  3  2    3   5   4   6  5 7    6   8 7    _     : : e : : l : O : 1 t             8  O e 1 : : e : : r f s l t            O : c W : c m : W       .
Sentence 2: printouts of this file are unaffected by this problem.
Relationship: neutral
Domain: Networks
Sentence 1: In this work, each user bases their transmission probability on their channel gain, assuming each user knows their own channel gain as well as the distribution of other users channel gains.
Sentence 2: the experiment results show that by using OAR as the data transmission scheme, MAD achieves up to 70% network throughput improvement over original OAR, which proves that exploiting multiuser diversity in wireless LANs can enhance overall network performance substantially.
Relationship: neutral
Domain: Networks
Sentence 1: When processing a CCN name as a .-expression, and  is encountered in the next term, it is replaced with the respective call mapping.
Sentence 2: 2.2 NFN node architecture In its current instantiation NFN extends the CCN/NDN [10] architecture2, hereafter referred to as CCN, (i) by integrat­ing a .-expression resolution engine in a CCN relay, and (ii ) by optionally hosting an application processing/execution environment.
Relationship: neutral
Domain: Networks
Sentence 1: Referring speci.cally to small cells, there already have been large scale deployments, even for the HSPA technology, of compact base stations with transmission power less than 5W (as opposed to macro 10W or even 20W).
Sentence 2: at the same time, it is worth noting that RS nodes are not placed too far from BS to avoid a situation when a link between BS and RS becomes a bottleneck.
Relationship: neutral
Domain: Networks
Sentence 1: The proof is avoided due to lack of space but can be established using MUD analysis tools [14].
Sentence 2: rEFERENCES [1] 3GPP, Technical speci.cation group radio access networks; 3G home NodeB study item technical report (release 8), TR 25.820 V1.0.0 (2007-11), Nov 2007.
Relationship: neutral
Domain: Networks
Sentence 1: First, the network in­teracts with the outside world constantly, i.e., receiving packets and Permission to make digital or hard copies of part or all 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 ci­tation on the .rst page.
Sentence 2: our main focus is on the check­pointing and rollback for the switches.
Relationship: neutral
Domain: Networks
Sentence 1: Thecompressionratioofaclas­si.er f isde.nedas the ratio ofTCAMbits usedby apartic­ular approach A to store f in a series ofTCAMchips overthe TCAM bits used to store f when f is pre.x expanded.
Sentence 2: we call this method strict partitioning since we can partition tables among these columns; however, we also show that .nding an optimal partitioning is NP-Complete.
Relationship: neutral
Domain: Networks
Sentence 1: For this small data center, an average monthly link availability of 99.945 will result in more than 300 link failures each month, creating asymmetric links between S1 and S2 switches and making the topology imbalanced.
Sentence 2: we show how to deploy WCMP in a production OpenFlow network environment and present experimental and simula­tion results to show that variation in .ow bandwidths can be reduced by as much as 25× by employing WCMP relative to ECMP.
Relationship: neutral
Domain: Networks
Sentence 1: In this paper, we focus on the VR (Virtual Router) architecture for controlling BGP, which is embedded in the AISLE agent, and discuss about application for the routing adjustment used for transit ISPs and their customer ASs.
Sentence 2: this is because 1) CDPS coincides with the con­trol architecture, and observing methods should be managed on a request-and-acceptance basis rather than by centralized control ap­proaches, 2) observed results including statistical analysis should be shared, after local calculation has been performed, for ef.ciency and scalability, and 3) operation availability increases when some problems exist in the network.
Relationship: neutral
Domain: Networks
Sentence 1: They may be able to make intelligent guesses about when circuits are switched based on changes in the tra.c .ow be­tween connections, and estimate the number of packets sent by the switched circuit if it occupies a signi.cant fraction of the overall bandwidth.
Sentence 2: thus when Tor is used for bulk .le downloads (such as BitTorrent [5]), delays for interactive tra.c (such as web tra.c and SSH) increase [9].
Relationship: neutral
Domain: Networks
Sentence 1: Then we collect packet reception rate (PRR) statistics for all 8 rates using 1, 2, and 3 spatial streams as we vary the power between -10 dBm and 16 dBm in steps of 2 dB.
Sentence 2: for the right-most, deeply faded links, the packet SNR decreases from 25 dB to 15 dB (10× transmit power reduc­tion) as the effective SNR only drops by 4 dB (2.5×).
Relationship: neutral
Domain: Networks
Sentence 1: After this delay, the attack radio selects its next channel uniformly at random.
Sentence 2: we modeled the jamming defense problem as a max-min game between defense and at- Jamming Defense Power Efficiency 1 0.8 0.6 0.4 0.2 0   reactive defense against slow-sweeping attack proactive defense against slow-sweeping attack reactive defense against scanning attack proactive defense against scanning attack proactive defense against fast-sweeping attack reactive defense against fast-sweeping attack 1 2 3 4 5 6 7 8 9 10 Jamming Detection Delay (x Packet Time) Figure 7: E.ect of jamming-detection threshold on JDPE.
Relationship: neutral
Domain: Networks
Sentence 1: Speci.cally, (n) h (n) i,j h= (16) i,j (n) vhv i,j Plugging this into (12), the new T (n) is given by P H(n)(fp)H(N)(fp) * (n) p T = .
Sentence 2: n = 5 and the history is composed of measurements n =1,..., 4.
Relationship: neutral
Domain: Networks
Sentence 1: In the .rst ap­proach,wesimply hijack BGP.Additional(optional) at­tributes are de.ned for updates, which are su.ciently rich instructurethatthey canbeused todescriberoutesfor any routing algebras de.ned in RAML.
Sentence 2: if an alge­bra is only SM, then one could use a link-state approach with a local algorithm that essentially simulates vectoring on a local model of the network.
Relationship: neutral
Domain: Networks
Sentence 1: Figure 14: Overlapping clusters in N. than one cluster, and hence can capture the relationship shown in Figure 14.
Sentence 2: the output of this step is a set of L-Cost (L)= X...´ ` '' - e J x,x |L D(x, x ) ... x,x1 .X×X is minimized and for every x .
Relationship: neutral
Domain: Networks
Sentence 1: For this use case, direct network monitoring was not included in order to highlight that significant network state insight can be inferred from device-based monitoring.
Sentence 2: [9] MASON Multiagent Simulation Toolkit: http://cs.gmu.edu/~eclab/projects/mason/ [10] Oracle Event Processing: http://www.oracle.com/technetwork/middleware/complex­event-processing/overview/index.html [11] Oracle Fusion Middleware CQL Language Reference for Oracle Complex Event Processing 11g Release 1 (11.1.1.6.3).
Relationship: neutral
Domain: Networks
Sentence 1: We found that limits on participation applied to co­investigators and non-investigators alike: it was not a lack of motivation, but rather that personal and family activities are a necessary part of life, even for co-investigators, and people can only tolerate so much interference due to participation in a residential sensing study.
Sentence 2: essa, B. MacIn­tyre, E. Mynatt, T.E.
Relationship: neutral
Domain: Networks
Sentence 1: If at the end of slot 1, the CS suppresses A and D, then even though the set of linear equations has 2 variables (A and D) and 2 equations (samples received at AP1 and AP2), still it is not possible to decode both A and D without the exchange of samples.
Sentence 2: at the end of recovery, the APs need to take a few steps to ensure: (i) GH is dynamically changed to ensure that all APs have equal chance of being the GH; (ii) Members belonging to a small group have a non-zero proba­bility of merging with a bigger group; (iii) Members belong­ing to a large group have a non-zero probability of splitting into multiple smaller groups; and, (iv) Next recovery starts as soon as possible.
Relationship: neutral
Domain: Networks
Sentence 1: [30] K. K. Rachuri, M. Musolesi, and C. Mascolo.
Sentence 2: more speci.cally, the key contributions of our work can be summarized as follows: We illustrate a novel sensor sampling scheme based on reinforcement learning that adaptively controls the rate at which sensors in the phone are sampled, and show that it achieves better accuracy and latency with­out considerably compromising on the energy consump­tion.
Relationship: neutral
Domain: Networks
Sentence 1: Many software tools exist to generate random mobility traces particularly for unguided mobility patterns.
Sentence 2: we found that there is no comprehensive software freely available for the researchers with the following characteristics: (i) support to generate the trace of intended mobility patterns, (ii) support for vi­sualization and analysis of the mobility trace of the chosen model so that a suitable choice can be made, (iii) support for performance observations from the mobility trace to get more accurate insight about the system behavior, and (iv) support of a user friendly interface to e.ectively exploit the supports (i) to (iii).
Relationship: neutral
Domain: Networks
Sentence 1: The stored video has a .nite length, and when the state reaches d = NT , i.e., all the segments have been downloaded, the streaming task completes, which is called an episodic task.
Sentence 2: .qt is thequeuelengthvariationafteranew segment has been retrieved, i.e., .qt = qt - qt-1, which indicates whether the requestedvideo sbit­rate matches theavailable bandwidth.
Relationship: neutral
Domain: Networks
Sentence 1: Systems a.ected by the bug generated predictable random numbers, most importantly public/private keypairs.
Sentence 2: the most popular Unix browser based on OpenSSL is KDE s Konqueror, whose us­age share across all Unix platforms, not just Debian is well under 0.05%.2 many popular non-Web clients as well as command line Web clients such as wget use OpenSSL and therefore are likely to be a.ected.
Relationship: neutral
Domain: Networks
Sentence 1: traÆharaterization(e.g.,trending),aounting(e.g.,for priing),andapaityplanningandprovisioning.
Sentence 2: traf.c Measurement Inthissetion,weusetrajetorysamplingforasimplemea­surementtask.Thegoalofthisexperimentistoillustrate howestimatorsanbeonstrutedbasedonthesampledla­belsreeivedfromthemeasurementdomain.Westudythe followingsimplesenario.Assumethataservieprovider wantstodeterminewhatfrationofpaketsonaertain bakbonelinkbelongstoaertainustomer.Toestimate thisfration,theservieprovideranusethelabelsol­letedfromthebakbonelinkunderstudyandfromthe aesslink(s)wheretheustomeronnetstothenetwork.
Relationship: neutral
Domain: Networks
Sentence 1: 4.2 The State Transition of CCP In CCP, each node determines its eligibility using the Ks-coverage eligibility algorithm based on the information about its sensing neighbors, and may switch state dynamically when its eligibility changes.
Sentence 2: a node can maintain a neighborhood table that includes the loca­tions of all two-hop neighboring coordinators from the HELLO messages.
Relationship: neutral
Domain: Networks
Sentence 1: However, using GPS on each sensor node is very expensive and the accuracy of the existing location algorithms is not very high.
Sentence 2: in their work, three various scenarios are studied: (1) perimeter nodes know they are on the perimeter and their own locations, (2) perimeter nodes know they are on the perimeter and do not know their locations, (3) perimeter nodes neither know they are on the perimeter nor the loca­tion information.
Relationship: neutral
Domain: Networks
Sentence 1: In order to support various applications, such as Voice over IP (VoIP), video streaming, web browsing etc., the IEEE 802.16e defines four kinds of service classes: Unsolicited Grant Service (UGS), Real-Time Polling Service (rtPS), Non-Real-Time Polling Service (nrtPs), and Best Effort (BE).
Sentence 2: the MSS simply sleeps for the predefined period of time and then returns to normal operation.
Relationship: neutral
Domain: Networks
Sentence 1: Our approach is di.erent from autonomic routing; while au­tonomic routing focuses on interoperability among routing protocols, we .nd the most favorable routing protocol in a particular situation.
Sentence 2: since smaller preference values are more favorable, the preference value is de.ned in two ways, depending on whether the performance metric is maximizing Table 2: Preference Value Table Performance Metric Applications app.1 app.2 · · · app.j metric 1 p k 11 p k 12 · · · p k 1j metric 2 p k 21 p k 22 · · · p k 2j · · · · · · · · · · · · · · · metric i p k i1 p k i2 · · · p k ij Sum Sk 1 Sk 2 · · · Sk j or minimizing: {|sij -rij | k k sij  rij (if rij is max.req.)
Relationship: neutral
Domain: Networks
Sentence 1: Hence, FEC or multiple description coding which seek to protect a user for a speci.c loss level may not be appropriate as they will cre­ate super.uous redundancy most of the time and might be overwhelmed when losses occur.
Sentence 2: simulations are run over a similar topology with 1000 nodes, 750 of which are placed at the extremity of the network.
Relationship: neutral
Domain: Networks
Sentence 1: [2] G. Bai and C. Williamson, Workload Characterization in Web Caching Hierarchies Proceedings of IEEE/ACM MASCOTS Conference, Fort Worth, TX, pp.
Sentence 2: [14] S. Jin and A. Bestavros, GISMO: A Generator of Internet Streaming Media Objects and Workloads , ACM Performance Evaluation Review, Vol.
Relationship: neutral
Domain: Networks
Sentence 1: TheprotoolisdesribedinFigure3.Forsimpliity,weas­sumethatthesignatureshemeisdefnedsuhthat(ph(z) alsoontainsthevaluez.
Sentence 2: theaboveintuitionholdsonlyinasettingwhere asingleexeutionoftheagreementprotooltakesplae.
Relationship: neutral
Domain: Networks
Sentence 1: Client invocation through request manager 2.2 Replica Management Policy Attributes Two key issues in replica management are: replication type (R) and protocol used for total ordering of concurrent requests from multiple clients (O).
Sentence 2: here, the client only attempts to unicast its request to the sequencer, but does not go ahead with the transmission as it wrongly suspects the sequencer to have failed.
Relationship: neutral
Domain: Networks
Sentence 1: 10.4 Execution comparison GPSR VS. TPGF In this subsection, we demonstrate the execution comparison GPSR_CW is larger than that of GPSR_CCW is only because the unclosed part of the hole is in the clockwise side, which actually use GPSR_CCW can get better result.
Sentence 2: the Node­disjoint multi-path transmission has the lowest priority in our protocol realization, because once at least one routing path is built for a source node, such as an image node, some amount of data Figure 5.
Relationship: neutral
Domain: Networks
Sentence 1: Coupled with the results of our prior work [28], the vulnerabilities identi.ed in this paper raise signi.cant ques­ tions about the reliability of wiretap evidence and suggest that the bulk of the wiretapping technologies currently em­ ployed by law enforcement are largely incapable of reliable evidence collection in the face of relatively simple counter­ measures.
Sentence 2: we repeated the experiment using T-Mobile as the target s service.
Relationship: neutral
Domain: Networks
Sentence 1: Detection: An important part of the coexistence problem is how can a high-power node detect whether a low-power user is dis­turbed by its interference.
Sentence 2: that same preamble could have been respected by some other HP node (say HP3, not shown in Figure 2) who cannot detect LP1 and hence it missed its L preamble, but can detect LP3.
Relationship: neutral
Domain: Networks
Sentence 1: FairCloud: Sharing the Network in Cloud Computing Lucian PopaGautam Kumar Mosharaf ChowdhuryHP Labs UC Berkeley UC Berkeley Arvind KrishnamurthySylvia RatnasamyIon Stoica U. Washington UC Berkeley UC Berkeley ABSTRACT .e network, similar to CPU and memory, is a critical and shared resource in the cloud.
Sentence 2: a similar model is assumed by other e.orts such as Oktopus [10] or Gatekeeper [24].
Relationship: neutral
Domain: Networks
Sentence 1: Zheng kqyan@cyut.edu.tw scwang@cyut.edu.tw s9414606@cyut.edu.tw Chaoyang University of Technology  ABSTRACT The Byzantine Agreement (BA) plays a key role in fault-tolerant distributed system design.
Sentence 2: there are two SBAP (source processor with initial value vs) phases in the SBAP, they are the message exchange phase and the Pre-Execute.
Relationship: neutral
Domain: Networks
Sentence 1: Lemma 1: If both the extended lines of FOV of camera are exactly secant to the circular object, the first two intercross points which are formed by two secant lines will be a chord.
Sentence 2: { 15: if (sk ==sec) { 16: find k where rotate(sk) = ti, .i.S-C; 17: curr_ang = rotate(tk) ; 18: } 19: else 20: find k where min { rotate(sk)-ti };  21: } 22: else { 23: find j where max{ rotate(tj)-ti } .i.D; 24: C = C.{j}; 25: curr_ang = rotate(tj) ; 26: } 27: }  If there is no covered range to span across 0°, the node with largest covered range is selected as the first node and then to go on selecting the next node clockwise or counter-clockwise.
Relationship: neutral
Domain: Networks
Sentence 1: [26]P.Feldman.APratialShemeforNon-Interative VerifableSeretSharing.InPro.28thFOCS,pp.427-437.
Sentence 2: theprivayofMfollowsfromtheprivayofV,sinethe ombinedviewofat-adversarywhihdoesnotorruptany playerinMisthesameasitsviewinV.Theorretnessof MalsoeasilyfollowsfromthatofV:at-adversaryattak­ingMannothangethevalueoutputbyanhonestplayer unlessitanhangethereonstrutedvalueinV(implying thatitmustorruptV).Finally,theagreementpropertyof MfollowsfromtheommitmentpropertyofV.Speifally, supposethatat-adversaryattakingManausetwohon­estplayersinMtooutputdiferentvalues.Thisadversary isinasensemorepowerfulthananadversaryorrupting thesamesetofplayersinV:byorruptingaplayerinM itmayfrstlearntheviewsofallhonestplayers,andthen usethisinformationtodeideona"faked"viewtobesent toeahotherplayerinM.bylettingthead­versary"guess"thehonestplayers'views,apositivesuess probabilityinviolatingtheagreementpropertyofMan betranslatedintoapositivesuessprobabilityinviolating theommitmentpropertyofV.ItiseasytoseethatifVis eÆientthensoisM.
Relationship: neutral
Domain: Networks
Sentence 1: UWSNs are an emerging paradigm that is attracting many re­searchers.
Sentence 2: equations 1 and 2 now become: i ' 2 (t)= aprns(t)i(t)-ßi(t) (7) s ' (t)= ßi(t)-aprn 2 s(t)i(t) (8) Thegeneral solution of i ' (t)is: (apr 2 -ß) i(t)= - n (9) t(ß-apr2)+c(apr22 e nn-ß) -aprn Thissystemhasstilltwosteadystates:STEADY0 reached when i(t)= 0,andSTEADY1 reached when i(t)= 1- ß .
Relationship: neutral
Domain: Networks
Sentence 1: Data-caches and multi-threading are complementary; whereas data-caches exploit locality to reduce the number of context-switches and the off-chip memory bandwidth requirement, multi-threading exploits parallelism to hide long cache-miss latencies.
Sentence 2: since most application-data are either read-only (e.g., route table) or .ow-speci.c (e.g., metering coun­ters), we ensure the coherence of application-data by pinning each .ow to a processor core (i.e., by processing all packets of a .ow on the same processor core).
Relationship: neutral
Domain: Networks
Sentence 1: Industry understands that interfaces, or lack thereof, can shape a market.9 There is probably a whole paper on the tussles surrounding open vs. closed systems.
Sentence 2: one investment option that is gaining momentum now is munic­ipal deployment of .ber, because .ber installed by a neutral party such as a municipality can be a platform for competi­tors to provide higher level services (e.g.
Relationship: neutral
Domain: Networks
Sentence 1: With this redirection mechanism, VR1 s con­trol plane not only can exchange routing messages with its neighbors, it can also act as the remote control plane for its old data plane on A and continue to update the old FIB when routing changes happen.
Sentence 2: the delays in completing all of these steps would cause unacceptable disruptions for both the data tra.c and the routing protocols.
Relationship: neutral
Domain: Networks
Sentence 1: TheOLPC Z adjuststhetransmitpowertotheMCS speci.cSINRtarget .k * such that the requiredpowerper subcarrierforMCS k is ** Pk (I,L)= .k · (N0 + I) · L (1) where N0 isthenoisepower.
Sentence 2: the y-axis shows the outage as in previous .gures.
Relationship: neutral
Domain: Networks
Sentence 1: If the userwants to initiateaconversationwithafriend,hesendsoutan Interest,with the friend sremote service name as the Interest sname,and the mes­sage that he wants to deliver to his friend as the Interest s payload.
Sentence 2: figure 1(a) and Figure 1(b) illustrate the Interest and Data packet forwarding process within a router, from which the PIT lookup and update process can be derived as well.
Relationship: neutral
Domain: Networks
Sentence 1: The work in [4] in­vestigates the problem of rule order optimization for packet .lters, and presents the outline of a greedy approximation algorithm.
Sentence 2: in addition, the paper provides no further de­tails on how rule weights are computed based on collected tra.c statistics, how these weights are dynamically updated with the current tra.c conditions, and how the optimiza­tion algorithm can be seamlessly integrated in the packet matching module of .ltering devices.
Relationship: neutral
Domain: Networks
Sentence 1: Recently, this biological model has been extended and shown to be able to achieve decentralized time synchronization and co­ordinated sensor control in wireless sensor networks [5, 14, 2].
Sentence 2: determining a slot schedule in multi-hop topologies is a much more complex problem for two reasons: nodes belong to intersecting and multiple-sized neighborhoods and over­lapping broadcast regions create hidden terminals.
Relationship: neutral
Domain: Networks
Sentence 1: It is assumed in the Bianchi s model that the network does not have any hidden nodes, so that all embedded epochs of all nodes in the network are almost synchronized and hence the use of a single DTMC su.ces for analysis.
Sentence 2: (1 - 2 pi,c)(W + 1) + pi,cW (1 - (2 pi,c)M ) Expressions for Ptr,i , Ps,i and E[Li] are the same as in the previous section because the expressions of .i and .i(1 - pi,c) are not a.ected by the introduction of the fake collision probability fi.
Relationship: neutral