sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: These protocols achieve high en­ergy ef.ciency and remove the synchronization overhead required in synchronous duty cycle approaches.
Sentence 2: they are mainly optimized for light traf.c loads, and we found that they become less ef.cient in latency, power ef.ciency, and packet delivery ratio as traf.c load increases, due to their long preamble transmissions.
Relationship: contrasting
Domain: Networks
Sentence 1: (2) Similarly, for server log based streaming media workloads of large video .les, such as CTVoD-04, the fetch-at-most-once e.ect does not exist either.
Sentence 2: the access pattern of workload CTVoD-04 deviates from the Zipf model even more signi.cantly than those small .le workloads.
Relationship: contrasting
Domain: Networks
Sentence 1: It was found that timestamping early in the driver-code for the network interface card provided an excellent compromise of almost no scheduling problems (1 timestamp per 10,000, and then usually with an error under 1ms), and with timestamping noise (dominated by interrupt latency) of the order of at worst 15µs, whilst keeping the code sim­ple and almost entirely at the user-level.
Sentence 2: the standard gettimeofday system call to obtain timestamps from the SW clock under Linux suffers from much higher system noise due to the above and other effects.
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION Many systems, such as ad hoc networks and peer-to-peer systems, require many users to participate, in order to lever­age the full bene.ts of the system.
Sentence 2: in many cases, users may be required to provide their own resources (e.g., memory, bandwidth, battery power) for others to use, with­out getting any direct bene.t from that.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, in Figure 3, S can spoof the identity of host V , specifying IP source address R. and reverse path [V ].
Sentence 2: iP src addr: R  IP src addr: B IP dst addr: A IP dst addr: D forward path: [B, D] reverse path: [V] forward path: [ ] reverse path: [V, R , A ]  IP src addr: A IP dst addr: B forward path: [D] reverse path: [V, R ] Figure 3: Reverse Path Spoo.ng Example this sort of spoo.ng does not prevent the re­ceiver from identifying the gateways of spoofed tra.c.
Relationship: contrasting
Domain: Networks
Sentence 1: To overcome this issue, we can wait for existing .ows to terminate and only reroute new .ows [22, 38].
Sentence 2: since .ow durations are unbounded, this approach cannot guarantee the SLA will be satis.ed: e.g., up to 40% of .ows in cellular networks last longer than 10 minutes [36].1 The only way to both satisfy the SLA and maintain NF accuracy is for the control plane to offer the ability to move NF state alongside updates to network forwarding state.
Relationship: contrasting
Domain: Networks
Sentence 1: [20] analyzed a set of publications on routing protocols from 1995 till 2003 and summarized the common assumptions that are used in the evaluation of those protocols: a radio s transmission area is circular; all radios have equal range; if I can hear you, you can hear me (symmetry); if I can hear you at all, I can hear you perfectly; signal strength is a simple function of distance.
Sentence 2: according to many researchers these assump­tions do not hold and the basic simple propagation mod­els alone do not re.ect the complexity of real radio sys­tems [44, 41, 20].
Relationship: contrasting
Domain: Networks
Sentence 1: # Hosts per VLAN (182 VLANs) Current Systematic Mean 82.9 82.9 Std Dev 71.9 57.1 90%ile  193 167 Max 254 195 Table 1: Number of hosts per VLAN with the current and the systematic designs.
Sentence 2: about 10% of the VLANs span 5+ buildings, and the largest VLAN spans over 60 buildings.
Relationship: contrasting
Domain: Networks
Sentence 1: The RFC 4186 says that The EAP-SIM protocol should be implemented in such a way that the peers should be protected against triplet query­ing attacks by malicious software[20].
Sentence 2: we show a practical attack against implementation of EAP-SIM proto­col in this HNB that gives us complete GSM triplets values including RAND, Kc, and SRES.
Relationship: contrasting
Domain: Networks
Sentence 1: The work in [34] focused on selecting egress points such that traf.c loads do not exceed the egress-point capac­ities, with the secondary objective of minimizing the total distance traveled by the traf.c.
Sentence 2: we formulate an optimization problem that minimizes congestion over the links in the network, using the objective function used in earlier traf.c-engineering stud­ies [9].
Relationship: contrasting
Domain: Networks
Sentence 1: For example, with a data rate of 2 Mbps and RTS/CTS on, RTT reaches 473 ms with a window size of 2 MSS, while it is only 55 ms with a window size of 3 MSS.
Sentence 2: the 3 MSS window size gives the As we increase the hop count beyond 2, the throughput drops signi.cantly and is close to zero for most topologies [6].
Relationship: contrasting
Domain: Networks
Sentence 1: Work-to-date has largely concen­trated on the question of whether non-trivial crosscutting con­cerns occur in systems software and whether they can be modular­ized (e.g., [8, 24, 31]).
Sentence 2: .ner-grained optimizations may be more prevalent, more technically challenging for aspect-oriented (AO) programming languages, and less compelling examples of improved modularity.
Relationship: contrasting
Domain: Networks
Sentence 1: e.P1 .e.P2}.We de.ne the node partition change rate for a node nk as: |Epart(nk,T )| Rn(nk,T )= (2)tmax -tmin The average node partition change rate for T is de.ned as n 1 ter, we used two graphs, one representing a typic European city, and the other representing Midtown Manhattan.The total simulation time was 3600 s.The speed of nodes was randomly chosen from the interval [0.5, 2.0] m/s.
Sentence 2: figure 1 shows the results for the average number of par­titions |.|avg(T ) as a function of the number of nodes in the network.For small networks, |.|avg(T )ismostlyde­termined by the number of nodes in the network, which de.ne the upper bound of the number of partitions.Once the node density is higher than 75 nodes/km2, which corre­sponds to 300 nodes in our simulations, |.|avg(T ) steadily decreases.even for larger networks with a den­sity of 600 nodes/km2, i.e.
Relationship: contrasting
Domain: Networks
Sentence 1: Ourlocallycompactingallocatorsonlycompactinthevicin­ityofthelastupdate.Wehaveshownthattheaverage performanceofoneofourallocators,theSegment-Holeallo­catordoesmuchbetterthanabenchmarkBest-Fitallocator onaverage,istunable,andprovidesgoodworstcasemem­oryutilizationguarantees.
Sentence 2: ourcompactingallocatorsareproblem-specifcunlikegen­eralpurposeallocatorslikeBest-Fit.ouralloca­torsworkforanyapplicationforwhicheachallocatednode isonlypointedtobyasmallnumberofparents".Whilewe haveonlyemphasizedapplicationslikelookupandhashing thathaveasinglepointer,itcanalsobeusedforapplications withasmallnumberofparents.Weconjecturethatother applicationsthatuselimitedfastmemory(cachememory forsoftware,orSRAMforhardware)canalsobeneftfrom localcompaction.Perhapslocalcompactioncouldbecome partofthebagoftricks"availabletosystemsimplemen­tors.
Relationship: contrasting
Domain: Networks
Sentence 1: CAC schemes not only have to ensure that the network meets the QoS of newly arriving calls if accepted, but should also guarantee that QoS of existing calls does not deteriorate.
Sentence 2: internet frameworks for QoS provisioning rely, basically, on two architectures: Integrated Services (IntServ) [15] and Differentiated Services (DiffServ) [16].
Relationship: contrasting
Domain: Networks
Sentence 1: For example, Figure 12 shows two failures at the network periphery that a network operator could pinpoint with knowledge from the routing con.guration about the next-hops and neighboring networks that connect to each router.
Sentence 2: for example, in Figure 12(a), the burst of BGP routing updates would contain only next-hop IP addresses of routers outside the network, as router A changed its next-hop route selection from router B to router C.the failure scenario in Figure 12(b) would cause the monitor at router A to see BGP routing messages with next-hops inside the local network, as router A changed its route selection from a route with the next-hop outside the local network (router C) to one inside the same network (router E).
Relationship: contrasting
Domain: Networks
Sentence 1: Since the approximation algorithm does not dictate how servers should be allocated when there are multiple websites, we study only the case of single website.
Sentence 2: as noted above, even though the insight of high-rate vector quan­tization is obtained in a continuous model, the server allocation and placement algorithm works on discrete problems with arbitrary (discrete) request rates r. to compare with the analyt­ical (approximate) expression for costs, we choose in our simu­lations request distributions whose continuum approximations are uniform, Gaussian, and power-law, the three spatial request densi­ties in Examples 2-4, as follows.
Relationship: contrasting
Domain: Networks
Sentence 1: Because network con.gurations are continually forking and because there may always be some ambiguity about the true state of the network, the number of network con.gura­tions is generally not pared down to one.
Sentence 2: we have found that the ISENDER can usually quickly pare down the prior to a smaller list of possibilities as it homes in on a good estimate of the network parameters.
Relationship: contrasting
Domain: Networks
Sentence 1: When a request (for inserting a child) arrives at an unfrozen vertex, it is han­dledbyProtocol Dyn-Anc, thateventuallygrantsitapermit.
Sentence 2: when a request arrives at a frozen vertex v, it is .rst put in a queue at v. When v becomes unfrozen again (whichis guaranteedtooccureventually),therequestsfrom its queue are dequeued one by one, according to the First In First Out discipline, and are handled by Protocol Dyn-Anc.
Relationship: contrasting
Domain: Networks
Sentence 1: As an example, for an outage target of .0 = 5% from curves we can select CB/N = 10.8 dB and CF /N = 12 dB.
Sentence 2: for a given CB/N, it is not possible to arbitrarily Figure 3: UL-UL: Minimum values of (C/N) for the cell-BS and for the femto-BS for variable number of femto-BS and CB/N.
Relationship: contrasting
Domain: Networks
Sentence 1: This is shown by .rst establishing a state-space collapse, i.e., the deviations of queue lengths from the direction c are bounded, independent of heavy­tra.c parameter E. Since the lower bound of mean queue length is of order of 1 , the deviations from the direction c are negligible compared to the large queue length for a su.ciently small E, and thus the queue lengths concentrate along the normal vector c. Because of this, we also call the normal vector c the line of attraction.
Sentence 2: as discussed in Section 3, we are interested in large values of a to provide satisfactory service regularity.
Relationship: contrasting
Domain: Networks
Sentence 1: Thestohastimodelhasbeenmathedtotheeletrohemi­almodelforthepartiularaseofalithium­ionbattery,and aomparisonbetweentheurvesobtainedfromthestohas­tiandtheeletrohemialmodelhasshowedaverygood agreement[22].
Sentence 2: 2.2 Application: An Example Byusingthestohastibatterymodel,weareabletoex­plorewaysinwhihtheenergyeÆienyofmobilewireless ommuniationsanbeenhanedthroughtheuseofim­provedenergy­eÆientbatterymanagementtehniques.We onsideranarrayofLellsonnetedinparallel,thatanbe seletivelysheduled.Fig.2illustratestheaseforL=2.A deliveredenergyequaltoNanbedrainedfromeahellby meansofaonstanturrentdisharge.byusing aproperpulseddishargetehnique,theregionofdelivered energyanbeinreased.Thegoalistofndmethodsto extendtheregionofdeliveredenergyuptothemaximum limit,i.e.,thetheoretialavailableenergyT.Cellsanbe sheduledbasedonthedishargedemandandtheirownsta­tus,sothatthedemandanbedistributedinamannerthat T N NT Figure2:Marginofimprovementfortheenergy deliveredbyanarrayofL=2ells, providesadequaterestperiodsforindividualells.Weap­plyloadbalaningalgorithmstobatterymanagementand proposebothadelay-freeanddelayeddeliveryapproah.
Relationship: contrasting
Domain: Networks
Sentence 1: Applying Traf.c Merging to Datacenter Networks Alessandro CarregaSuresh SinghRaffaele Bolla University of GenoaPortland State UniversityUniversity of GenoaGenoa, ItalyPortland, OR 97207Genoa, Italyalessandro.carrega@unige.it singh@cs.pdx.edu raffaele.bolla@unige.it Roberto Bruschi National Inter-University Consortium for Telecommunications (CNIT) Genoa, Italy roberto.bruschi@cnit.it ABSTRACT The problem of reducing energy usage in datacenter net­works is an important one.
Sentence 2: we would like to achieve this goal without compromising throughput and loss char­acteristics of these networks.
Relationship: contrasting
Domain: Networks
Sentence 1: For instance, TCP uses the timestamp option [14] to (among other things) take round-trip time measurements more fre­quently than once per round-trip time, for the Protection Against Wrapped Sequences [14] algorithm and for detecting spurious time­outs [18].
Sentence 2: middleboxes along a path can interfere with the use of TCP options, in an attempt to thwart attackers trying to .nger­print hosts.
Relationship: contrasting
Domain: Networks
Sentence 1: Traditional solutions that increase resilience to interference by making 802.11 fall down to a lower bit rate are ineffective against high-power cross-technology interference.
Sentence 2: as a result, the most common solution today is to hop away to an 802.11 channel that does notsufferfrominterference[6,38,31,32].theISM band is becoming increasingly crowded, making it dif.cult to .nd aninterference-free channel.Thelack ofinterference-free channels hasledWiFidevice manufacturers[6,11,3]and researchers[29]to develop signal classi.ers thatinform the802.11 user about the root cause oftheproblem(e.g.,Bluetooth, microwave,baby monitor).
Relationship: contrasting
Domain: Networks
Sentence 1: Despite this dual-actor landscape [14, 20], there are already three mainbusiness roles at play in the current Internet: The (Phys­ical) Infrastructure Provider (PIP), which owns and manages an un­derlaying physical infrastructure (called substrate ); the connec­tivity provider, which provides bit-pipes and end-to-end connectiv­ity to end-users; and the service provider, which offers application, data and content services to end-users.
Sentence 2: the distinction between these roles has often been hid­den inside a single company.
Relationship: contrasting
Domain: Networks
Sentence 1: Improving TCP Smoothness by Synchronized and Measurement-based Congestion Avoidance Chi Zhang Vassilis Tsaoussidis College of Computer Science College of Computer Science Northeastern University Northeastern University Boston, MA 20115 Boston, MA 20115 czhang@ccs.neu.edu vassilis@ccs.neu.edu ABSTRACT In this paper, we observe that although multiplicative decrease is necessary to accomplish fairness in congestion control, it does not inevitably sacrifice system throughput, as long as the system operates between the knee and the cliff, according to an equation.
Sentence 2: even when the system throughput is relatively stable, end users of real-time applications do not necessarily experience a smooth traffic, mainly caused by the unsynchronized window adjustments due to random congestion indications.
Relationship: contrasting
Domain: Networks
Sentence 1: A value of 1 means that the .lter implementation  (a) nodes (b) links Figure 10: Topology information missed missed all nodes and links when compared to the list im­plementation.
Sentence 2: a value of 0 mean that there is no loss, and all nodes and links discovered by the list implementation are discovered by the .lter implementa­tion.
Relationship: contrasting
Domain: Networks
Sentence 1: It was proved in [4] that the HOL blocking limits the switch s v maximum throughput to about 2 - 2 58.6%.
Sentence 2: the VOQ bu.ering maintains a (logically) separate queue for each output port at each input port, so that a packet will no longer be held up by another packet ahead of it that goes to a di.erent output port.
Relationship: contrasting
Domain: Networks
Sentence 1: Our performance evaluation showed that medium-access aware RA strategies such as GORA, in which every station attemptstosel.shly maximizeitsgood­put, actually result in a degradation of the overall network performance.
Sentence 2: simple legacy RA tech­niques such as MBLAS, in which every station chooses the PHY ratebased solely onitsSignal toNoise ratio, are much more robust and, on average, result in better performance.
Relationship: contrasting
Domain: Networks
Sentence 1: [4] used PRISM to introduce a Continuous Time Markov Chain representation of the Kaminsky attack and the proposed fix, and to perform the required probabilistic model checking.
Sentence 2: their analysis of attack difficulty largely target at basic poisoning model which factors TTL of the target domain while Kaminsky­class poisoning inherently has no "wait penalty" for poisoning failure.
Relationship: contrasting
Domain: Networks
Sentence 1: For ex­ample, if the failure caused a loss of reachability to a destina­tion network, the router will generate a withdrawal message, listing the network pre.xes that have become unreachable.
Sentence 2: if the failure simply causes a path change (or if the router learns of a previously unknown destination), then an announcement is generated containing a set of net­work pre.xes and associated path attributes.
Relationship: contrasting
Domain: Networks
Sentence 1: The combination of the validity and well connected prop­erties form the basics for any desirable scheduling function in any grid formation obeying the grid/mesh transmission range inequality.1 Validity ensures that there will be no collisions on one hand, and that whenever a node sends a message, some other node will be listening for these mes­sages.
Sentence 2: well connected means that it is possible to .nd a routing scheme that will deliver messages between any pair of nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: This is because, in HCDD, there is only single structure used to maintain the routing information even if there are mul­tiple source nodes in the network.
Sentence 2: in the grid method, each source node builds an independent structure for itself, and, hence, the overhead of location update proce­dure would signi.cantly increase with the number of source  number of source nodes Two-level(1,1) One-level(1) Grid-based(50) 60 sources 1.9648 (joule) 4.5461 (joule) 19.7699 (joule) 100 sources 1.4017 (joule) 4.0113 (joule) 24.6024 (joule)  Figure 6: Number of sources vs. Network lifetime Figure 7: Comparison of di.erent schemes Table 1: Overhead comparison nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: For each VP, we tracerouted to the .rst (.1) address in each of the 465,944 non-overlapping pre.xes observed by Route-Views collector rv2, used BGP data to map the encountered IP addresses to ASes, and inferred an interdomain link when we observed the .rst address in a traceroute path that maps to an AS outside the VP s hosting network.
Sentence 2: this method may not correctly identify the border routers, or their owners, depending on how interfaces are numbered.
Relationship: contrasting
Domain: Networks
Sentence 1: In this case, if we further assume synchronized data collection, i.e., all the sources start their collection at the same time, we can achieve the largest time-overlap of the packets, and thus maximize the rate of each source node.
Sentence 2: in practice, the time-offsets of the packets from different nodes may be time-varying, due to the dy­namic join (leave) of sensor nodes, and the oscillation of the rates caused by the variation of the environment as well as the underly­ing MAC layer scheduling.
Relationship: contrasting
Domain: Networks
Sentence 1: Once purchased, a unit of data can be treated in the same way as the budgets IMP currently considers, since there are no refunds for unused data and partially spent units are gener­ally rounded up to the next full unit for billing.
Sentence 2: we would also need to consider the monetary cost of each data increment and also incorporate some notion of how much the user is willing to spend, which would require direct input from the user.
Relationship: contrasting
Domain: Networks
Sentence 1: For scenario (i), if we apply the TZ cluster con­struction on (V, E), we end up with a set A with the re­quired cardinality, and cluster CA(w) s such that |CA(w)| = O(.n log(n)).
Sentence 2: because we constructed A and CA using exclusively (V, E), |CA(w)| does not account for any mobile nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: Given any solution to the 2-spanner problem, we set the push set (resp., pull set) to be the set of neighbors of the node in the solution subgraph; the resulting cost is twice the cost of the subgraph.
Sentence 2: any solution of push and pull sets for the data dissemination problem yields a 2-spanner of at most half the cost.
Relationship: contrasting
Domain: Networks
Sentence 1: They will surely bene.t meSDN , and we look forward to seeing such new knobs.
Sentence 2: even with those new knobs in the driver, we believe pTDMA scheduling intelli­gence is better to reside outside the WiFi driver/stack and rather in the meSDN global or local controller where infor­mation about user applications and other devises is avail­able.
Relationship: contrasting
Domain: Networks
Sentence 1: Taking into account these results, although the idea of using flat routing protocols could be considered in small networks (< 50 nodes more or less), using hierarchical routing will produce almost the same performance.
Sentence 2: when the network is bigger (> 50 nodes), we find clear scalability problems in OLSR protocol, whereas in the HOLSR protocol a lineal growth is maintained in the overhead parameter.
Relationship: contrasting
Domain: Networks
Sentence 1: Forexample,fora3 transmittersystem,we .nd thatmulti­plexingschemes(netMIMO)yield thebestperformancefor static users withlarge coherencetimes withgains ashigh as 69.84%.
Sentence 2: when applied to mobile users and even static users with small coherencetimes,itdegradesperfor­mance by as much as 71.4%.
Relationship: contrasting
Domain: Networks
Sentence 1: On the other hand, the communication require­ments and hardware capabilities of an individual cognitive radio varies in a heterogeneous network and so the over­head of sequence based spectrum mapping may be counter­productive for some nodes particularly those having sporadic communication needs.
Sentence 2: since a channel s availabil­ity can be represented using single bit, the real-time spec­trum map dissemination is possible without much overhead and can take place on the common control channel or piggy­backing with the packets on data channel.
Relationship: contrasting
Domain: Networks
Sentence 1: However, current ON approaches lack the ability to auto­nomically con.gure a system consisting of both clusters and workstations in a scalable manner.
Sentence 2: previous work on this topic [11, 13], analyzed the use of Peer-to-Peer (P2P) VN interfaces and the prospects of using dynamic host con.gu­rationprotocol(DHCP) and addresslookup through the use of adistributedhashtable(DHT).alimitation of this approach was the need toincurON routing overheadfor allVNpackets,including thosedestined to LANhosts.
Relationship: contrasting
Domain: Networks
Sentence 1: Mathematically, this problem can be formulated as a linear programming (LP) problem (see Section 2.2) within which the objective function is de.ned as the sum of rates over all the nodes in the network and the con­straints are: (1) .ow balance is preserved at each node, and (2) the energy constraint at each node can be met for the given network lifetime requirement.
Sentence 2: the solution to this problem shows (see Section 5) that although the network capacity (i.e., the sum of bit rates over all nodes) is maximized, there exists a severe bias in the rate allocation among the nodes.
Relationship: contrasting