sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Comparison with Other Networks Liu s NoC [3] uses a dual clock scheme with control and data path frequencies of 570 MHz and 1.8 GHz respectively and requires 292 NAND gates/bit, when synthesized with SMIC 90 nm library [3].
Sentence 2: 8x8 and 16x16 HAGAR networks have clock frequencies of 200 and 50 MHz respectively, when synthesized using FARADAY s 130nm UMC Library [2] (288 and 72 MHz respectively, when scaled to 90nm technology using general scaling [16]).
Relationship: contrasting
Domain: Networks
Sentence 1: When optics are relatively expensive, the cube collective topologyfares well(approachespar­ity) for even random traf.c; however, with lower cost optics, the dragon.y s superiorperformance onrandomtraf.cgivesit astark advantage despite its higher cost.
Sentence 2: the cube collective topologyhas a2x to3x advantage over thedragon.y topology(i.e.
Relationship: contrasting
Domain: Networks
Sentence 1: 7.1 more traceroute data in some continents We have compared continent-level AS topologies, and the results reveal the lack of vantage points to cover Africa and Oceania in the current data sets.
Sentence 2: it is challenging to obtain reliable measurements from  Figure 8: AS Core Map in U.S.(EST) developing countries because the measurement environ­ment such as computing facilities and networks are lim­ited and less reliable.
Relationship: contrasting
Domain: Networks
Sentence 1: 10.00  Copyright 2010 ACM 1-4503-0448-1/10/11 ...$ for improving anomaly detectors is to thoroughly inspect re­sults generated by such detectors and precisely identify any drawbacks.
Sentence 2: identifying anomaly detectors vulner­abilities is particularly dif.cult due to a lack of ground truth data and of rigorous methodology.
Relationship: contrasting
Domain: Networks
Sentence 1: In all cases, the simulations allow a fast performance comparison between di.erent pro­tocols/models with di.erent scenarios and for many times.
Sentence 2: in the real world tests (testbeds) and particularly in the wireless communication case, the impact of some pa­rameterssuch as: thetypeof environment(indoor/outdoor), 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.
Relationship: contrasting
Domain: Networks
Sentence 1: This need for direct object veri.cation was the original motivation for using self-certifying names in content­oriented architectures.2 By self-certifying name we mean a name that (together with some signed metadata) allows direct veri.cation of the binding between the name and an associated object, as will be described in more detail in Section 2.
Sentence 2: the use of self-certifying names has been recently criticized on two grounds in particular (see [10] for a critique of this approach and [12] for a response).
Relationship: contrasting
Domain: Networks
Sentence 1: Erroneous Packet Processing: Hardware MACs will discard packets determined to be in error, even if they are put into monitor mode.
Sentence 2: because the RF hardware simply passes a stream of bits into the DSP whenever a packet is received and the CRC is checked in the DSP, the MAC can be modi.ed to process even erroneous packets, or pass them up the network stack.
Relationship: contrasting
Domain: Networks
Sentence 1: Although such data collection and dissemination can be performed in a centralized client-server archi­tecture, this new generation of vehicles has the capacity to process all of its own local data, as well as any data coming from nearby vehicles, bypassing the need for centralized solutions, alleviating the load on the backhaul network and reducing the .nancial cost to the user.
Sentence 2: current networking paradigms are not ready to support this data explosion, with the consequence that the data is con.ned within the vehicles themselves or only available after the extremely long delays caused by nightly uploads.
Relationship: contrasting
Domain: Networks
Sentence 1: In VANETs, the limitations in coverage and channel ca­pacity of WiFi technologies, the high mobility of the nodes, and the presence of obstacles provoke frequent packet losses, topology changes, and network fragmentation.
Sentence 2: an optimal routing strategy, that makes better use of re­sources, might o.er the possibility of deploying more e.­cient VANETs.
Relationship: contrasting
Domain: Networks
Sentence 1: If the copy is forwarded, the deliv­ery probability of the copy in node j will be Pj,d,K-1,Tr-1, and that of the copy in node i will become Pi,d,K-1,Tr-1.
Sentence 2: if the copy is not forwarded to any node at time-slot Tr, the delivery probability of the same copy in node i will become Pi,d,K,Tr-1.
Relationship: contrasting
Domain: Networks
Sentence 1: While it is possible to decode the beacons from the over­lapping channels, these beacons are attenuated by varying factors (depending on channel separation), since the receive .lter of the client overlaps only partially with the adjacent channels.
Sentence 2: similar to the results presented in [15], we can determine the attenuation factors for each of the ad­jacent channels through measurements, and then correct the RSSI values of the beacons received on those channels.
Relationship: contrasting
Domain: Networks
Sentence 1: Sequential Progress for Different Piece Selection Policies (M = 20) 0 5 10 15 20 Number of Pieces Retrieved So Far Figure 1: Sequential Progress Example for M =20 By de.nition, the strict in-order policy is ideal in terms of sequential progress.
Sentence 2: each peer simply retrieves the .le pieces in numerical order from 1 to M. the overall performance of thispolicyin aP2P network canbe sluggish, as will be seen in Section 4.1.
Relationship: contrasting
Domain: Networks
Sentence 1: Figure 2: The time for encounters on all channels Table 2: Average completion time of .le transmis­sion (s): without primary users Sequence setting completion time random 20.4 proposed 16.1 proposed + follow 7.6 The results show that the completion time increases with the loading of the primary user as expected.
Sentence 2: the completion time using the random sequences increases sub­stantially with the loading of the primary user.
Relationship: contrasting
Domain: Networks
Sentence 1: IEEE802.15.4 channel 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 Time (days) Channel Hopping performs better than using a single chan­nel.Theseresults areobtained overasetofdatasu.ciently largeinnumberofnodes(44nodes)and time(28days)tobe statistically valid.
Sentence 2: connectivity traces were gath­eredin aprintingfacilityin which thereis no externalinter­ference from technologies operating on the same frequency band(WiFi,Bluetooth).
Relationship: contrasting
Domain: Networks
Sentence 1: Coomparing the dynamiic governors wwe can observve that the CConservative governoor has better energy efficieency than the Ondemand governoor, an expected result since we know that the CConservative is an immprovement off the Ondemandd.
Sentence 2: commparing the governoors with the fixeed frequencies, tthey are efficiennt only when comparred to the higherr frequencies of 1200 and 1000MMHz.
Relationship: contrasting
Domain: Networks
Sentence 1: The round­trip times (RTT) range from 0.5 µs up to a few tens of µs, except under hotspot congestion, when the end-to-end delays can grow by several orders of magnitude, reaching into 10s of ms or more[3].
Sentence 2: even if a congested DCN may have RTTs similar in magnitude with a WAN, there is a key difference.
Relationship: contrasting
Domain: Networks
Sentence 1: In this case, size-based policies (pFabric, STF) do result in reduction of completion time compared to fair­sharing policies like RCP, especially beyond the median up to the 95th percentile.
Sentence 2: even in this case, Baraat s FIFO-LM policy results in improved performance of roughly 60% relative to RCP and 36% over size-based policies at the 95th percentile.
Relationship: contrasting
Domain: Networks
Sentence 1: The method proposed in [5] eliminates backwards transmissions by computing coef.cients in a unidirectional manner (as data .ows towards the sink) along paths of a given routing tree.
Sentence 2: this results in an oversampled transform (the number of wavelet coef.cients generated is greater than the number of samples captured) when multiple paths merge, resulting in additional energy consumption for merging paths.
Relationship: contrasting
Domain: Networks
Sentence 1: In the above process, the same message M is transmitted to all the nodes in AT s and AT r. This will be very expensive, thus call­ing for an optimization to reduce the number of message transmis­sions.
Sentence 2: without optimization, the cost of exchanging messages to evaluate the CMAC increases linearly with k. we need not send the same message to all the nodes individually, since those nodes may share the same node as the parent node in AT s and the wireless transmission can be simultaneously received more than one node.
Relationship: contrasting
Domain: Networks
Sentence 1: However, it searches the available bandwidth region by detecting one-way-delay increasing trend within a packet-train, which is different from examining whether the rate response Z(rI ,s,n) is greater than one [7].
Sentence 2: since there is a strong sta­tistical correlation between a high rate response Z (rI ,s,n) and the one-way-delay increasing tend within packet­trains, our analysis can explain the behavior of pathload to a certain extent.
Relationship: contrasting
Domain: Networks
Sentence 1: As a maximum acceptable end-to-end delay we evaluated a value of between 100 ms and 200 ms. Meeting this delay bound in a mo­bile network without resorting to massive overprovisioning does require some form of resource reservation.
Sentence 2: because of the traf.c burstiness, the low bandwidth usage, and the tight delay requirements resource reservation on a per session basis, as speci­.ed for UMTS for real-time traf.c, would cause a signi.cant over­head resulting in inef.cient resource utilization and high reserva­tion costs.
Relationship: contrasting
Domain: Networks
Sentence 1: 206 1 201 0.9 196 0.8 191 0.7 186 M illion B us T ransactions per S econdCPU U tiliz ation 0.6 181 0.5 176 0.4 171 0.3 166 0.2 0.1 161 0 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 M essage S iz e (b y tes) M essage S iz e (b y te) Figure 17: CPU Utilization for BiBW Tests Figure 16: Chelsio BiBW Results 100.00 this to the ine.ciencies in the current implementations of RDMA for small messages in the blocking mode.
Sentence 2: one thing we should note is that for small messages, the 90.00 80.00 70.00 60.00 50.00 40.00 30.00 power increase compared with the idle power is quite small.
Relationship: contrasting
Domain: Networks
Sentence 1: By applying the SRS to D2D channel estimation, Rx-DUE can obtain full-band channel frequency response (CFR) of D2D related links and achieve high D2D s SINR.
Sentence 2: for these procedures, all SRS configurations of interference UE (IUEs), high SRS detection complexity, and a considerable channel estimation and feedback overhead are required.
Relationship: contrasting
Domain: Networks
Sentence 1: Un­der S-BGP the attacker could spoof a direct link to AS X as de­scribed in Section 7.2.
Sentence 2: sPV prevents the attacker from stripping off the cryptographic signatures of AS Y because AS Y will have added the necessary signatures to close the break in the chain (for example, by performing signatures on behalf of AS X) before adding its own signature.
Relationship: contrasting
Domain: Networks
Sentence 1: As pre.x 0* sends large traf.c, the task decides to drill down un­der pre.x 0* in the next epoch to .nd heavy hitters hoping that they will remain active then.
Sentence 2: to respect the resource constraint (3 TCAM counters), it must free a counter in the other sub-tree by monitoring pre.x 1* instead of 10 and 11.
Relationship: contrasting
Domain: Networks
Sentence 1: As shown in Figure (2:A), the prevalence ratio converges to be less than 20% while the network size in­creases, this means that the proposed protocol utilization (resultant of the network traversing replica) should be .xed (as a function in the network size).
Sentence 2: figure (2:B), the prevalence ratio is a.ected dramatically by very high speeds (starting from 70% mobility index).
Relationship: contrasting
Domain: Networks
Sentence 1: While commercial small cells typically have an application processor, memory, and storage, those components are provisioned for running network management code and not the de­manding cloudlet workloads such as vision.
Sentence 2: through the use of LIPA, that additional compute can be provisioned via a sep­arate compute server on the same LAN without requiring hardware or software changes on the small cell (other than con.guring LIPA).
Relationship: contrasting
Domain: Networks
Sentence 1: Service providers can henceforth look to such Wi-Fi systems as a viable way to seamlessly of.oad mobile traf.c and deliver added­value services, so that subscribers no longer face the frustration and aggravation of connecting to Wi-Fi hotspots.
Sentence 2: the technol­ogy being rather recent, we are not aware of public studies at the state of the art documenting the achievable gain in real mobile net­works.
Relationship: contrasting
Domain: Networks
Sentence 1: However with adaptive bandwidth allocation, when a new or handoff call comes and the network is overloaded, the allocated bandwidth of ongoing calls can be degraded to smaller values, thereby accepting the new or handoff call; this can reduce both call blocking and handoff dropping probabilities.
Sentence 2: when an ongoing call is terminated due to its completion or outgoing off, the released bandwidth can be utilized to upgrade other ongoing calls.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, the left­most bar illustrates that when both channel conditions are low quality denoted by [L,L], both OAR and RBAR provide the same temporal shares as single-rate IEEE 802.11 (20% and 80% respectively) while achieving throughput gains of approximately 60% and 35% respectively.
Sentence 2: note that in other scenarios, RBAR deviates signi.cantly from the IEEE 802.11 time shares whereas in OAR does not.
Relationship: contrasting
Domain: Networks
Sentence 1: Once again, no optimizations were made for the MSP430, so we believe performance could be improved if optimiza­tions targeted to the MSP430 were implemented.
Sentence 2: the current performance is generally acceptable even though the implementation is not optimized for TinyOS s run-to­completion task model: calling the hash function results in 14 ms of unyielding computation, constraining the realizable radio throughput to 76 packets per second.
Relationship: contrasting
Domain: Networks
Sentence 1: On the contrary, our solution cannot be applied to layer two mesh networks, as the proposed by the IEEE802.11 Task Group S (TGs), because the size of RANs could be big and then IP paging will perform badly.
Sentence 2: this scenario, large layer two based IEEE802.11 networks without paging support, was identified in the introduction as a possible source of scalability problems motivated by three factors: the increase of the MNs mobility, the need to deliver calls (or other type of sessions ended in the MN) to them and the use of PS mode to decrease battery wastes.
Relationship: contrasting
Domain: Networks
Sentence 1: Performance Improvement of Layered Modulation Based Cooperative Relaying Scheme Jee-Hoon Kim, Jung-In Baik, Jin-Hyuk Song and Hyoung-Kyu Song uT Communication Research Institute, Sejong University Gunja-Dong, Gwangjin-Gu, Seoul 143-747, Korea {bid4u,bji0309,song020}@sdc.sejong.ac.kr, songhk@sejong.ac.kr   ABSTRACT Cooperative communication is a novel approach utilizing limited resources to get reliability.
Sentence 2: overall transmission­rate is reduced to have decomposable composition at the destination node in time-division multiple access (TDMA) system, which diminishes the advantage of cooperation.
Relationship: contrasting
Domain: Networks
Sentence 1: This is remarkable, since in the  Figure 4: a) Expected network load and b) expected delivery success ratio with varying number of network nodes Figure 5: a) Expected network load and b) expected delivery success ratio with varying network density Figure 6: a) Expected network load and b) expected delivery success ratio with varying periodic retransmission rate previous paragraph we noted that the server approach has to bridge the distance between server and geocast destination region for each retransmission step, which should decrease successful deliveries.
Sentence 2: the most critical path is from the sender to the server, or from the sender to the geocast destination region for the other approaches, respectively.
Relationship: contrasting
Domain: Networks
Sentence 1: For the weighted matching problem, Preis [12] showed that, like GMS, LGMS returns a matching with a weight of at least 12 of the weight of a maximum weighted matching.
Sentence 2: a 1For example, we can color the links so that no two links interfering with each other have the same color, and then the links can send their control messages in a round-robin fashion based on their colors.
Relationship: contrasting
Domain: Networks
Sentence 1: Clearly, if the failures in the network are nonexistent or very rare, the best solu­tion is to use a routing algorithm that generates the most uniform overall network distribution (Row-First), maximiz­ing in this way the rate per node.
Sentence 2: as the failure rate of the network increases and the network becomes more unreliable, we should uniformly distribute the node-to-node tra.c load in order to avoid inoperative nodes and overcome the network unpredictability (Spreading).
Relationship: contrasting
Domain: Networks
Sentence 1: RRC connection release with redirect Inter-system handover Inter-system cell reselection  3G RRC 4G RRC 3G RRC 4G RRC (a) Inter-system switch options (b) High-rate data + CSFB Figure 6: RRC states in various inter-system switching options.
Sentence 2: this inter-system switching cannot be activated (the prop­erty MM_OK is violated).
Relationship: contrasting
Domain: Networks
Sentence 1: By doing so, we also expect that the UDP tra.c could play a role of other interferences which pre­vents APs packet transmission [9], thus we refer this UDP tra.c as Background Tra.c.Most of the experiments we performed are tested for background tra.c in the range 0­30 Kbps per STA.
Sentence 2: even with the di.erent UDP tra.c rate, overall pattern for most of our results remains unchanged and thus until speci.ed otherwise we present re­sults with 25 Kbps only.
Relationship: contrasting
Domain: Networks
Sentence 1: This new role is disruptive in what concerns Internet service models, since there is no distinction between what is today known as end-user device and network device: in the future, end-user devices will actively participate as part of the network.
Sentence 2: the Internet has been up to now mostly the means for end-users to obtain some form of network service, originally related to connectivity, person-to-person communication, or information retrieval.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, if MD5 is used for hashing and WEP-64 is used for encrypting, asingle hashinground su.ces since the 128 bit output is enough to obtain the 40 bits required for a valid session key.
Sentence 2: if WPA-PSK is used, we need two MD5 hashing rounds to generate a session key of 256 bits, as required.
Relationship: contrasting
Domain: Networks
Sentence 1: Because of the uniform density of nodes, we expect that this (curved) hyperplane will pass between many pairs of nodes -1/d separated by distance T(n ), i.e., the typical distance between a node and its close neighbors.
Sentence 2: the hyperplane continues to the boundaries of the hypercube, and so some of these pairs of nodes are likely to be at constant distance from t. since the nodes in the pair are on oppo­site sides of the hyperplane, the shortest MST path between them must pass through the cut edge, and thus be of con­stant length.
Relationship: contrasting
Domain: Networks
Sentence 1: Distributed and Collaborative Traf.c Monitoring in Software De.ned Networks Ye Yu, Chen Qian, Xin Li Department of Computer Science, Unversity of Kentucky Lexington, Kentucky, USA ye.yu@uky.edu, qian@cs.uky.edu, xin.li@uky.edu ABSTRACT Network traf.c monitoring supports fundamental network manage­ment tasks.
Sentence 2: monitoring tasks introduce non-trivial over­head to network devices such as switches.
Relationship: contrasting
Domain: Networks
Sentence 1: If the duration of the block is enough to estimate the PL i (t), for example through the updating in (25), the already de­rived controllers continue to work correctly and be optimal blockbyblock.
Sentence 2: when we use channel detection and data fusion, from the time window controller side the RSU (t) becomes an equivalent primary source with time-variant statis­tics PL i (t) given from the a posteriori probability 29-30, that usually presents quite high variability (roughly, the same or­der of variability of the indicator function of the RSU (i)ac­tivity).
Relationship: contrasting
Domain: Networks
Sentence 1: In the Long Flow Discrimination experiment, ISP D1 does not discriminate against service S2 ; simi­larly, ISP D2 does not discriminate the .ows for service S1 : NANO correctly estimates close to neutral performance for these ISPs in these cases.
Sentence 2: in the cases where these ISPs dis­criminate, NANO correctly detects a negative effect on throughput.
Relationship: contrasting
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: as a start­ing point, the .rst exercise should be to speculate about whether these various openness tussles can be modularized and disentangled, and what this means for mechanism de­sign.
Relationship: contrasting
Domain: Networks
Sentence 1: Table 1: Examples of Social-Proximity Applications on Android Application Description Downloads Rating out of 5 Foursquare1 Find interesting places nearby, check-in for discounts 10,000,000+ 4.2 Badoo2 Chatting, dating, making friends with people nearby 10,000,000+ 4.5 Groupon3 Finding local deals and discounts 10,000,000+ 4.6 Skout4 Discovering and meeting new people around 10,000,000+ 4.1 Circles5 Finding people nearby with mutual interests 1,000,000+ 4.5 Sonar6 Connect with friends and like-minded people nearby 1,000,000+ 4.1 GrabTaxi7 Finding and booking nearby cabs 100,000+ 4.1 While web apps do not have the full freedom of native applications, they are still quite powerful, having access to location, camera, and even the phone s sensors.
Sentence 2: they are currently limited to communication over sockets.
Relationship: contrasting
Domain: Networks
Sentence 1: Detecting the Beginning of a Packet Transmission: At the begin­ning of each packet transmission, an ambient backscattering trans­mitter sends a known preamble that the receiver detects using bit­level correlation on the digital hardware (in our case, the micro­controller).
Sentence 2: unlike RFID communication, where the tags correlate only when they are powered by a nearby reader, an am­bient backscatter device does not know when nearby devices will transmit and hence might have to continuously correlate, which is power-consuming and impractical for a low-power device.
Relationship: contrasting
Domain: Networks
Sentence 1: The main reasons for this are that (1) the ability to freely ma­nipulate label stacks gives outsiders direct control over how packets are switched through an operator intranet and (2) if enough label stack information were to be collected, it might be possible for competitors to gain knowledge of an opera­tor s network topology and take a competitive advantage us­ing it.
Sentence 2: mPLS can still be usable in interdomain contexts such as path brokering.
Relationship: contrasting