sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Figure6(a):SessionfailurewhenMNN1-HQ  Figure6(b):SessionfailurewhenHQ-MNN1  ThereisnocalldropinSMONforallmovingpatterns.On theotherhand,inMANEMO-AandMANEMO-Bwecan seefromFigures6(a)and(b)that most ofthecallsare droppedduringattachment.Thenumberothemovementcall dropsishasnodeschangeitheirpoints  offgherwhilethe call ismade fromanMNN totheHQincaseof MANEMO-A,asshowninFigure6(a),becauseduringa  handoverthereisnoroutetotheHQ.Hence,allcallsmade s timeare mmediateydroppedwithouS duringthNVIiries.While,thenumberoilfcall failures(t IP ITEretHQto MNN)islessthanthatofMNNtoHQbecausetheHQstill doesnot receiveaBindingUpdatefromtheMRduringthe  movements.Therefore,it usesthepreviouscare-of-address tocommunicatewith theMR.
Sentence 2: all SIPINVITErequests  aredroppedduring thishandover.once the handoverisfinished,SIPINVITErequestscanreachthe    Figure7(a):AveragesessionsetupdelaywhenMNN1-HQ  Figure7(b):AveragesessionsetupdelaywhenHQ-MNN1 Figures7(a)and(b)showthecomparisonoftheaverage  sessionsetuptimeamongthethreesystems.Wehavemade 200calls for each system for each type ofmovement pattern.Thedropcallsareconsideredasthedurationof32 sec(IETFRFC3261).ItisobservedfromFigures7(a)and (b)that thesessionsetuptime forSMONissteadyinthe wholeperiodofexperiment.Theaveragetimeforsession setupismuchhigherinMANEMO-Aduetocall dropand longerhandovertime.
Relationship: contrasting
Domain: Networks
Sentence 1: In recent years, there has been an increasing understand­ing on the algorithm design that target various aspects of QoS, especially packet delivery ratio requirement (e.g., [5], [6], [7]).
Sentence 2: there has been considerably less progress associated with the regularity of service, which is clearly a scales no faster than the order of v1c , where E measures 5 the closeness of the network load to the boundary of the capacity region.
Relationship: contrasting
Domain: Networks
Sentence 1: Google News .nished load­ing in 3.81 s (725%), Yahoo in 11.11 s (778%), WSJ in 14.40 s (447%) and CNN in 20.18 s (570%) for FIFO.
Sentence 2: cHAP managed to keep the Web response time low and close to the Web response time in the absence of the bulk .le download.
Relationship: contrasting
Domain: Networks
Sentence 1: In fact, the system tries to pro.t from the available resources in order to provide the best possible accuracy.
Sentence 2: the use of a small time scale (t = 600s) leads to an oscillating behavior of the overhead since the system tracks more details and changes in the traf.c while tracking changes on a large scale(t = 5400s)leads to a stable behavior of the overhead.
Relationship: contrasting
Domain: Networks
Sentence 1: Now we discuss how to choose parameter d. Since the purpose of scan is to find potential AP to get connected, it s reasonable that if the mobile phone user does not move, then the probability to find new AP by scan is rather small.
Sentence 2: people are subject to move around in short distance compared with AP s coverage range, especially at home or office, so we should take both the moving distance and AP s coverage distance together into consideration.
Relationship: contrasting
Domain: Networks
Sentence 1: The aggregate throughput increases from 17.9 Mbps to18.6 Mbps.
Sentence 2: cENTAUR with10 msepochs cantake advantage ofsome exposedterminals andincreasetheirthroughput evenfurther(e.g.,link8)by 1.8×.Onthe whole, CENTAUR with 10 ms epochsimproves aggregate throughput across alllinks46% overDCF.
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION Multimedia underwater sensor networks [1] would enable new applications for underwater multimedia surveillance, undersea ex­plorations, video-assisted navigation and environmental monitor­ing.
Sentence 2: these applications require much higher data rates 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: An alternative approach, called Time Division Multiple Access (TDMA), that solves both the hidden transmitter problem and the idle channel detection delay problem is to assign unique data packet time slots to each transmitter in a channel contention region (the area within which simulta­neous transmission from two transmitters can interfere at a common receiver).
Sentence 2: adoption of TDMA protocols in wireless sensor networks has been slow for many reasons, as pointed out by the authors of S-MAC [4].
Relationship: contrasting
Domain: Networks
Sentence 1: Unfortunately snooping, like any caching scheme works on the assumption that information gathered in the past can be used for some period of time in the future.
Sentence 2: when users in the network are very mobile, one of two things may happen: 1) entries become stale (large lifetime values), thus packet loss may occur or 2) entries expire early (short lifetime values), resulting in a large of amount of data broad­casts.
Relationship: contrasting
Domain: Networks
Sentence 1: INTRODUCTION Underwater acoustic networks havereceived rapidly growing re­search interests in the last few years since they can bring about signi.cant bene.ts in a wide range of aquatic applications [1, 2, 3, 4, 5].
Sentence 2: because of the unique characteristics of under­water acoustic channels such as limited available bandwidth, long propagation delays and extensive time-varying multi-path effects, and the harsh underwater environments,building autonomous un­derwater acoustic networks encounters great challenges at almost every layers of the protocol stack, among which ef.cient medium access control (MAC) is one of the most fundamental issues.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.2.1 Finding the repeater and branching When a node is selected to forward a packet and it is out­side the transmission range of a repeater, it continues with the directional broadcast protocol as described in Section 2.1.
Sentence 2: if the node is inside the trans­mission range of a repeater, the node sends the packet to the repeater using the point-to-point IEEE 802.11 protocol.
Relationship: contrasting
Domain: Networks
Sentence 1: In a traditional wireless network, increasing spatial reuse by allowing more concurrent transmissions always helps with the network throughput[1], which means traditional transmission power control schemes always try to find minimal transmission powers (if existing) for them so that receivers SINR(signal to interference and noise ratio) requirements were all satisfied.
Sentence 2: in a network coding enabled wireless network, there might be a counter effect to arbitrarily increasing the level of spatial reuse.
Relationship: contrasting
Domain: Networks
Sentence 1: From the user interactions perspective, our insights are the following: (i) The probability to meet di.erent people with the same cyberinterestsisdominantlyimpactedby the numberof userssharing thesameinterestsin agiven region.
Sentence 2: (ii)the frequency with which one meets with oth­ers who share the same cyber interests is dominated by the density of hotspots in a given area.
Relationship: contrasting
Domain: Networks
Sentence 1: Previous approaches [3, 25] that do not rely on infras­tructure for location and identity privacy have proposed to use pseudorandom or disposable identi.ers for all layers of the protocol stack.
Sentence 2: in these approaches the iden­ti.er spaces are shared by the applications, and therefore the tra.c can be linked to the host by observing the appli­cations.
Relationship: contrasting
Domain: Networks
Sentence 1: We note here, however, the 3% is an upper bound of our spammer detection false positive rate because the existing spam .lter might miss spam emails.
Sentence 2: there is a much smaller fraction of sessions from the likely static IP addresses with a high spam ratio: 31.4% of the sessions sent only spam, and 62.8% of the sessions had spam ratio lower than 90%.
Relationship: contrasting
Domain: Networks
Sentence 1: The control and management overhead, indi­cated by the denser area in the .gure, increases signi.cantly as the number of simultaneous users increases from 1 to 40.
Sentence 2: as the number of simultaneous users further increases from 40 to 80, the data throughput decreases, while the control and management overhead does not decrease as signi.cantly.
Relationship: contrasting
Domain: Networks
Sentence 1: However, the adversary KDV QR LGHD DERXW ZKHUH WKH XVHU¶V exact location is )URP WKLV SRLQW SULYDF RI XVHU¶V ORFDWLRQ LV increased by using spatial cloaking.
Sentence 2: in case that there is only one user in that region or area; the local server can easily perform detecting and tracking of that user automatically.
Relationship: contrasting
Domain: Networks
Sentence 1: [1]advocatedtheuseofasymmetricTxantennaspacing(in­steadofinternalphaseshifter)togeneratetherequiredphase shiftof p betweenthetransmitsignalsowingtoitsabilityto cause less destructive interference in the far .eld.
Sentence 2: the simulations used to highlight this observation relied on a free space path loss model for the far .eld which does not holdinreality(seeexperimentsinSection4).
Relationship: contrasting
Domain: Networks
Sentence 1: As shown in Table 1, for the raw data sending without concatenation, the packet loss ratio reaches 60% and the average time to send a message from the aggregator is 36.16 milliseconds.
Sentence 2: with concatenation, the packet loss is reduced to 42% and the average time to send a message from the aggregator is reduced to 27.13 milliseconds.
Relationship: contrasting
Domain: Networks
Sentence 1: LetbbethenumberofheaderbitsalloatedtoIPtrae­bak,andletnbethenumberofbitsrequiredtorepresent apathofattak(thedefnitionofnwillbemadepreisein Setion2).Foranyprotoolwiththisproperty,ifblogn thenthereissomeattakerpaththatanonlybeorretly identifedwithprobabilitylessthan1/2.1Thus,lognisa lowerboundonbforthislassofprotools.
Sentence 2: 1.1 Summary of results Inthispaper,weonsidertwodiferentsenariosforthe IPtraebakproblem:theimportantspeialase(studiedin [12],[7],and[16])wheretheattakersendsallofitspakets alongthesamepath,andthemoregeneralasewherethere aremultiplepathsofattak.Fortheaseofasinglepath ofattak,weintrodueanewtypeofPPMtehniquethat doesnotbelongtothelassofprotoolsdesribedabove, allowingforamoreeÆientenodingofthepathdesrip­tion.Thisnewtehniqueallowsanypathtoberevealed tothevitimevenwhenb=1.Inotherwords,thisnew shemerequiresusingonlyasingleheaderbit,whihisob­viouslytheminimumpossible.Unfortunately,thisrequires 8((21)2)paketstobereeivedbythevitim,foranyon­stant1>0,andthusisonlyappropriateforsmallvaluesof n.wealsoprovideaninformationtheoretilower bounddemonstratingthat(2)paketsareneessaryfor anyone­bitprotoolwherethevitimisabletodetermine theorretpathwithprobabilitygreaterthan1/2.
Relationship: contrasting
Domain: Networks
Sentence 1: Gossib attack appears severe to PPM traceback, for a dili­gent attacker can forge as many packet marks as the amount of tra.c it transmits, in comparison to a PPM marker who performs the marking routine at around 1/20 of the time.
Sentence 2: routers can co-operate to proactively identify and .lter forged packet marks, using an approach inspired by route-based distributed packet .ltering (DPF) [13].
Relationship: contrasting
Domain: Networks
Sentence 1: [20] the backbone is obtained as a connected dominat­ing set of the communication graph, by applying techniques from geometric radio networks.
Sentence 2: this result holds only for a re­stricted family of networks and the analysis requires that stations cannot receive signals from distance larger than 1 - e, i.e., their model assumes weak devices, and it is known that the power of that model is different than considered in our work (c.f., [15]) [7] M. Ghaffari, B. Haeupler, and M. Khabbazian.
Relationship: contrasting
Domain: Networks
Sentence 1: Second, comparing the results for paths computed by the shortest widest routing (Table 1) with those computed by path selection (Table 2), we can see that when the number of machines is small (128 machines with 32 and 64 switches), the paths computed by the shortest widest scheme requires less LIDs to realize than the paths computed by the path se­lection scheme assuming the same LID assignment heuristic.
Sentence 2: when the number of machines is larger (256 and 512), the paths computed from the shortest-widest scheme requires more LIDs.
Relationship: contrasting
Domain: Networks
Sentence 1: Moreover, they have studied the per­formance of MPTCP through analysis, by simulations, or by measurement in environments where all the tra.c is well controlled.
Sentence 2: we study the performance of MPTCP in the wild, with real wireless settings and back­ground tra.c, and focuses on .nite size data objects that better represent real world tra.c.
Relationship: contrasting
Domain: Networks
Sentence 1: The ultimate advantage of the millimeter-wave communication is its ca­pability to support multi-Gbps throughput since the abun­dant bandwidth can be secured in the unlicensed 60GHz band [3].
Sentence 2: due to the high propagation loss in 60GHz channel, the beamforming technique is essentially required to increase the transmission range and the system throughput.
Relationship: contrasting
Domain: Networks
Sentence 1: Variable-striding and compres­sion-based schemes can help reduce total memory size by eliminat­ing such redundant replication.
Sentence 2: for the worst-case distribution shown in Figure 4, the top half (triangular region) of the trie has no redundant replication whatsoever, and the bottom half (rectangular region) uses up space because of the large number of nodes and not because of in.ated node sizes.
Relationship: contrasting
Domain: Networks
Sentence 1: However,since a Huffman hash tree is hard to adjust once being constructed,the checking scheme cannot handle repository update ef.ciently.In contrast, FastAuth, as a one-time signature scheme, inherentlyrequires a new hash tree for every beacon and thus is free fromsuch a limitation Also, invalid signature noti.cation [22], an ideasimilar to the pushback warnings in SelAuth, has been proposedto help identify invalid but unveri.ed messages.
Sentence 2: withoutteamingwithSelAuth sforwarderidenti.cationmechanism, theat­tacker can abuse such noti.cations to cause denial of service.
Relationship: contrasting
Domain: Networks
Sentence 1: Cooperative sensing [7, 18, 13] is therefore developed to recent good attention in research.
Sentence 2: 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.To copyotherwise, to republish, to post on servers or to redistribute to lists, requires prior speci.c permission and/or a fee.
Relationship: contrasting
Domain: Networks
Sentence 1: Since Kelly controls are unstable unless condition (3) is satis.ed [9], a natural strategy to maintain stability is for each end-user i to adaptively adjusts its gain parameter .i ~ 1/Di such that (3) is not violated.
Sentence 2: this method depends on reliable estimation of round-trip delays Di and leads to unfairness between the .ows with di.erent RTTs.
Relationship: contrasting
Domain: Networks
Sentence 1: A complementary approach, more operator oriented, for minimizing the transmission power of cellular networks as well as increasing the network capacity, consists in a dra­matic densi.cation of micro-cells coverage [27].
Sentence 2: increasing the number of micro-cells multiplies the en­ergy consumed by the cells whatever their state, idle, trans­mitting or receiving, which is a major and growing part of the access network energy consumption [28].
Relationship: contrasting
Domain: Networks
Sentence 1: slightly increase with the number of concurrent streams, as the traf- Packets dropped (%) 80 60 40 20 0 Libnids Snort Scap Scap with packets Patterns Matched (%) 0 20 40 60 80 Libnids Snort Scap Scap with packets Streams lost (%) 0 20 40 60 80 Libnids Snort Scap Scap with packets .c rate remains constant.
Sentence 2: snort and Libnids can­not handle more than one million concurrent streams, even though they can handle 1 Gbit/s traf.c with less than 60% CPU utiliza­ tion.
Relationship: contrasting
Domain: Networks
Sentence 1: Optimal .ow scheduling: The optimal algorithm for minimizing average FCT when scheduling over a single link is the Shortest Re­maining Processing Time (SRPT) policy which always schedules the .ow that has the least work remaining.
Sentence 2: we are not scheduling over a single link but rather over an entire fabricwith aset of links connecting the ingress and egress queues.
Relationship: contrasting
Domain: Networks
Sentence 1: Extending the Reach of Infrastructure by Utilizing Node Mobility Yu Zhen, Xu Jingdong, Wu Ying Department of Computer Science Nankai University Tianjin 300071, China yuzhen@mail.nankai.edu.cn, {xujd, wuying}@nankai.edu.cn ABSTRACT With the advantage of high bandwidth and low cost, WLAN is widely regarded as an appealing technology for wireless access.
Sentence 2: wLAN only provides very limited coverage which is no more than hundreds of meters, making users experience inter­mittent connectivity when they move near Wi-Fi access points (AP).
Relationship: contrasting
Domain: Networks
Sentence 1: If the discrepancy d = |SB - SA| + |SA - SB | is known, then peer A can send a data collection of size only O(dlog u) bits, or if hashing is done as pre-processing, of size only O(dlog h) bits.
Sentence 2: if d is not known, a reasonable upper bound on d must be deter­mined through multiple rounds of communication.
Relationship: contrasting
Domain: Networks
Sentence 1: Indeed, the lingering index should tell apart nodes that are at similar distance from the target and travel in the same direction, but with different speeds.
Sentence 2: the contribution of speed v builds on the following considerations: as d grows, the coef.cient in (6) tends to zero making h(v, ., d) less and less sensible to the speed, up to independence from v for d = R (as from the constant behavior of the dashed line in Fig.
Relationship: contrasting
Domain: Networks
Sentence 1: 2The algorithm in [28] computes a maximal matching for each layer, and thus requires for each node to know which layer it belongs to, or equivalently to know w * .However, knowing the maximum weight w * may take O(|V |)timeto propagate in the worst case.
Sentence 2: distGreedy works with local weight information and the layering structure is only for the purpose of analysis.
Relationship: contrasting
Domain: Networks
Sentence 1: We have also conducted experiments with a production (Cisco) access point supporting 802.11e mechanisms and Windows-based stations, equipped with the same Atheros 802.11a/b/g PCMCIA card.
Sentence 2: to avoid potential in.uences from the di.erent wireless drivers, in the experiments we present in this paper we consider solely the Linux-based stations.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore, a larger observation window results in better estimation on the time-varying channel and BEM co­e.cients.
Sentence 2: an underlying assumption made by BEM based algorithms is that the wireless chan­nel s time-varying characteristic within one OFDM block is contributed by Doppler frequency only, while MPC distri­bution in each OFDM symbol is assumed to be static in the literature [7] [9] [11].
Relationship: contrasting
Domain: Networks
Sentence 1: This result makes sense as the Traditional repeater only utilizes the non-shared channel for uplink, whereas Multifacet is able to uti­lize an higher capacity shared channel in addition to the non-shared channel for uplink.
Sentence 2: multifacet-naive performs worse than Traditional repeater as round-robin scheduling of packets over two interfaces leads to unconstrained transmission by AP repeater on the shared link with repeater-client link.
Relationship: contrasting
Domain: Networks
Sentence 1: Objective: Severalworkshavelooked at thepractical re­alization of reuse[8],diversity[5], and multiplexing[3,6] strategies with afocus on static clients with stable channels.
Sentence 2: thisisunderstandableasa .rst step.movingfor­ward,giventheheterogeneity of userpro.lesthat a system must catertoinboth enterprises and outdoor cellular(e.g., small cellLTE,WiMAX) networks,itbecomesimportantto understand which strategies are appropriate for which user pro.les andhowtointelligentlycombinethem.
Relationship: contrasting
Domain: Networks
Sentence 1: Unlike taxonomies, which over-impose a hierarchical categorisation of content, folksonomies empower users by enabling them to personally and freely create and choose the tags that best describe a piece of information (a picture, a blog entry, a video clip, etc.).
Sentence 2: while being extremely easy to use, tags have often been criticized for lowering the e.cacy of matching [5].
Relationship: contrasting
Domain: Networks
Sentence 1: This increases the chance that only one node chooses that channel.
Sentence 2: when the num­ber of simultaneous messages is small, i.e., the load is low, assigning small probabilities to the higher priority channels could lead to under-utilization of these channels and higher utilization on the lower priority channels resulting in colli­sions and an increase in the overall latency.
Relationship: contrasting
Domain: Networks
Sentence 1: In our example work.ow, one could design the target network topology using a visual graph editor and store it, along with its link attributes (like latency and bandwidth), in a .le; then, one could write a program to import the topology, iteratively fail selected subsets of nodes and compute paths, and then calculate statistics for those paths, noting any cases when endpoint pairs become dis­connected (as a sign of failure susceptibility).
Sentence 2: none of these libraries implement IP-routing algorithms.
Relationship: contrasting
Domain: Networks
Sentence 1: This work is motivated from a novel idea that through tak­ing account of both space-time uncertainty and sleeping­waking frequency simultaneously, it is capable to improve existing TDMA schemes on minimizing sleeping-waking fre­quency.
Sentence 2: this new approach faces many challenges: First, due to space-time uncertainty, in order to minimize sleeping-waking frequency it requires to analyze the compli­cated con.ict relationship among nodes.
Relationship: contrasting
Domain: Networks
Sentence 1: Since the source MAC addresses of network frames forwarded via routers contain the address of an edge router, the HV-module in the destina­tion work server cannot discriminate between the LNIDs of the source VMs running on the other L2 domains.
Sentence 2: provided that the routers are equipped with a virtual rout­ing and forwarding (VRF) functionality, the HostVLAN­based architecture can cooperate with them in order to seg­regate networks across L2 domains.
Relationship: contrasting
Domain: Networks
Sentence 1: When the large estimated frequency variation is due to multi­ple OSes instead of iOS, our scheme wrongly identi.es iOS in the tethered traf.c.
Sentence 2: because other OS .ngerprinting features (e.g.IP TTL, TCP timestamp option, and TCP window size scale option) can still identify the correct OS, our scheme will identify iOS and non-iOS devices by combining results from all features.
Relationship: contrasting