sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Since the bound­ary cells are slightly smaller than those in the center, the results reported by the simulator could be slightly di.erent from those that would be obtained if all cells were of equal size.
Sentence 2: this inaccuracy is not critical, both because it is quite small and because it can only cause our simulator to underestimate the minimum number of nodes in a cell and the network lifetime.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore we have implemented packet-size-dependent delay using linear delay approximation as a function of packet size.
Sentence 2: even if our current implementation focuses on payload-dependent delay, we would like to emphasize that the described emu­lation concept is generic in nature and that an implemen­tation procedure analogous to the one presented below can be used to easily integrate other payload-dependent metrics like, e.g., payload-dependent loss with NetEm.
Relationship: contrasting
Domain: Networks
Sentence 1: Furthermore, each DTN router may optionally add its own EID and, in the future, capability indicators (e.g., custody transfer support) to provide further information for a DTN routing protocol.
Sentence 2: any such extension comes at the expense of increasing the size of the exchanged packets so that the MTU size limit may be reached earlier and error probability may grow; such trade-offs require further investigation.
Relationship: contrasting
Domain: Networks
Sentence 1: Therefore, it it is highly attractive to implement content­based routing directly on the network layer.
Sentence 2: since changes to existing standard network protocols and hard­ware seemed to be unrealistic (as the slow support of the highly anticipated IPv6 standard shows), current research refrains from network layer implementations, and instead tries to improve application layer approaches along several dimensions: (1) inferring the underlay topology from the overlay topology [33, 10, 14, 5], (2) speci.c hardware allow­ing for e.cient matching of advertisement and subscriptions on network brokers [28], and (3) reducing the expressiveness of content-routing to topic-based publish/subscribe [11].
Relationship: contrasting
Domain: Networks
Sentence 1: CONCLUSIONS AND FUTURE WORK InthispaperwehavepresentedaprotocolextensiontolegacyIEEE802.11a/gsystemsenablingthedynamicadaptationofthemodulationtypepersub-carriertothecurrentchannelgain.Thisrequiresthetransmittertoacquirechannelstateinformationwhilethereceiverhastobeinformedoftheusedmodulationtypepersub-carrier.WesuggesttostarteachsuchtransmissionwithanRTS/CTShandshake(usedtoestimatethesub-carriergains)whileextendingthePLCPframeforthepayloaddatatransmissiontocarrysignalinginformationaswell.Evaluatingthisschemebysim­ulations,weshowthatthenewapproachoutperformsthelegacyIEEE802.11a/gmodesigni.cantly,evenifthelegacymodeisnotusingtheRTS/CTShandshake.Especiallyforlargepacketsizestheperformancedifferenceisquitelarge.Wearguethatthisisduetoamuchbettercontrolofthefrequencyselectivechannel,leadingtoa(slightly)higherthroughputanda(signi.cantly)lowerpacketerrorrate.
Sentence 2: asfutureworkweconsidertheapplicationofdynamicOFDMmulti-userschemesin802.11DYNaswell,suchthatseveralsta­tionsareservedsimultaneouslybytheaccesspoint.Whileben­e.tingfromthebettercontrolofthechannelandanevenhigherthroughput(duetoexploitingthemulti-userdiversity)suchanap­proachhasalotofpotentialfromthelinklayerperspectiveaswell,asonlyonechannelaccesshastobeperformedforthetransmis­sionofseveralpackets(hence,thelinklayeref.ciencyisincreased,too).Inthiscontext,wearealsointerestedinacomparisonbetweenourdynamicschemeandIEEE802.11n,asthelatteroffersforexampletheopportunitytotransmitseveralpacketsconsecutivelywithoutcontendingforthechannelinbetween.802.11ndoesapplylinkadaptation(asisthecaseforIEEE802.11a/g)andincreasesitsthroughputmainlybychannelbondingandMIMOtechniques.Hence,webelievethatthedynamicadaptationsdis­cussedinthispapercouldalsoleadtoasigni.cantperformanceincreaseforIEEE802.11nsystems.
Relationship: contrasting
Domain: Networks
Sentence 1: same number of users, at the windy state, the users will experience average packet delay of over 1.5 seconds (s=0.7), which means that the quality of service has been degraded over 50%.
Sentence 2: to ensure that the average packet delay is less than 1 second, less than 42 users can be supported under windy conditions (s=0.7), which is much less than in the calm state.
Relationship: contrasting
Domain: Networks
Sentence 1: Lack of programma­bility restricts possibilities for modi.cations, extensions and ex­perimentation of MAC protocols.
Sentence 2: purely soft­ware based modular implementations of PHY-and MAC layers on GPP based platforms, such as the GNU radio [11] on USRP, pro­vide .exibility but often fail to satisfy hard real-time requirements and handle wide signal bandwidths.
Relationship: contrasting
Domain: Networks
Sentence 1: [16], 79% of paths we ob­servedhadIPv6performance within10% ofIPv4(orIPv6 had better performance) if the forward AS-level path was the same in both protocols, while only 63% of paths had similar performance if the forward AS-level path was di.er­ent.
Sentence 2: our measurements(and theirs) aredominated by the path RTT because the transfers are typically small (although we only analyze measurements of transfers over 10K bytes).
Relationship: contrasting
Domain: Networks
Sentence 1: On the contrary, when D is smaller than 0, the actual through­put ratio is larger than the target ratio, and it is necessary to reduce the throughput di.erence.
Sentence 2: it may be dif­.cult that throughput ratio exactly becomes a target ratio in real systems, and in general, the operation that expands the di.erence may lead to excessive di.erence.
Relationship: contrasting
Domain: Networks
Sentence 1: As a part of a scenario description, the expected deployment size of a network, application data rate, and a characterization of its behavior (e.g., bursty or constant application traf.c rate) can also be speci.ed.
Sentence 2: the results presented in Section 4 focus only on the Packet Reception Ratio (PRR) and power consumption since we consider these attributes to be highly important for WSNs.
Relationship: contrasting
Domain: Networks
Sentence 1: In a typical classi.er rule, the three .elds of source and destination IP addresses and protocol type are speci.ed as pre.xes where all the *s are at the end of the ternary string, so the .elds can be directly stored in a TCAM.
Sentence 2: the other two .elds of source and destination port numbers are speci.ed in ranges (i.e., integer intervals), which need to be mapped to one or more pre.xes before being stored in a TCAM.
Relationship: contrasting
Domain: Networks
Sentence 1: For a singleplane route­re.ector design, the resulting number of peering sessions is 6,450 and each RR has to maintain 20,000 routes.
Sentence 2: if the ISP switches to a multi-plane solution withtenplanes, the total number ofpeering sessionsgoesdown to4,290 while the number of routes in eachRRis reducedto2,000.
Relationship: contrasting
Domain: Networks
Sentence 1: Similarly, accurately model­ing the cost of a secure BGP protocol is also dif.cult; for example, soBGP requires exposing all neighboring information, including peering information, to other adopting ASes.
Sentence 2: peering information can be highly valued by some ASes [13], thus the cost of adopting soBGP for these ASes may be higher than oth­ers.
Relationship: contrasting
Domain: Networks
Sentence 1: Energy-Efficient Opportunistic Topology Control in Wireless Sensor Networks Jian Ma, Qian Zhang, Chen Qian, and Lionel M. Ni Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong {majian, qianzh, cqian, ni}@cse.ust.hk  Abstract Topology control has been proposed as a promising technique to achieve energy-efficiency in wireless sensor networks (WSNs).
Sentence 2: existing topology control algorithms assume that wireless links are static, either connected or disconnected.
Relationship: contrasting
Domain: Networks
Sentence 1: Indeed, although it would be possible to imple­ment such individual structure within NSGA-II/III, these algorithms do not provide natively this kind of .exible en­coding, that is crucial to this problem.
Sentence 2: µGP o.ers o.-the-shelf various encoding schemes, thus re­quiring a much smaller coding e.ort on the algorithm im­plementation, and allowing users to focus on applications rather than algorithmic details.
Relationship: contrasting
Domain: Networks
Sentence 1: Under this assumption, a 2x2 MIMO system is able to use the maximum power of only a single node at a given time, since only one of two communicating nodes can transmit at a given time.
Sentence 2: with full duplexing, the system can use the maximum power of both communicating nodes at the same time, thus allowing the use of more total power in system.
Relationship: contrasting
Domain: Networks
Sentence 1: In this condition, our proposed methods can achieve high coverage such as 86% for the MIDDLE poisoning and 90% for the MIDDLE+BOTTOM poisoning, but both methods still can not achieve the same poisoning effect as the conventional method.
Sentence 2: increasing the lifetime of .le keys gives more duration for indirect index poisoning effect to take place in the network and the MIDDLE+BOTTOM poisoning can achieve the same coverage with the conventional method (96%).
Relationship: contrasting
Domain: Networks
Sentence 1: This is because lowering the rate can increase the transmission range so that the interfering nodes are more likely to sense/capture its packets and consequently back o.. Also, packets sent at lower rate are more robust to interference or noise.
Sentence 2: previous work has also shown that lowering the sending rate results in signi.cantly low network utilization [31] and, in certain cases, can even worsen the unfairness problem [34].
Relationship: contrasting
Domain: Networks
Sentence 1: Another popular option is to train students about attack techniques, arguing that thinking like a hacker enables one to protect against them [1].
Sentence 2: others argue that it is better not to train additional hackers but to emphasize security techniques 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 profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: contrasting
Domain: Networks
Sentence 1: Also the first prototypes of QoS adaptation components are demonstrating the viability of the approach, at least if considered as separated basic mechanisms.
Sentence 2: since the characteristics of the QoS adaptation compo- nents are tightly connected to the nature of the interested service, we expect to obtain significant feedback from the performance results we are collecting in the implementation of a multimedia distribution service capable of adapting to groups of heterogene- ous QoS-requestlng PDA receivers.
Relationship: contrasting
Domain: Networks
Sentence 1: Or per­haps when it appears that the only hosts still contacting the old address are faulty?
Sentence 2: the original expectations for D-root s changeover were that (1) the vast majority of traf.c would migrate over to the new address rela­tively quickly, (2) the only remaining traf.c would be due to faulty servers or botnets, and thus (3) a few months of running the old address would suf.ce.1 the changeover has not been as rapid in practice: 63% of sources do not switch over after four months (by May 2, 2013), and they generate 4,721 queries per sec­ond on average.
Relationship: contrasting
Domain: Networks
Sentence 1: In a design of a cellular network, such high peak traffic becomes a target, i.e., it is required to provision for peak traffic levels, which makes installed femto/pico cells or wireless LAN APs underutilized at off-peak times.
Sentence 2: there are some infrastructure-less communication technologies, e.g., adhoc network [5], delay tolerant network (DTN), etc., that have been considered as a promising means for communication in a challenged situation such as severe natural disaster.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, if we use G.726 at rate 32 kbps, with a header size of 74 bytes and a PI of 10 ms, the required bandwidth is 32 kbps+74 bytes/10 ms=91.2 kbps.
Sentence 2: with a PI of 20 ms, the required bandwidth reduces to 32 kbps+74 bytes/20 ms=61.6 kbps.
Relationship: contrasting
Domain: Networks
Sentence 1: 10(b) and 10(c) plot the packet loss rate of the competing technologies: the DSSS phone and ZigBee.
Sentence 2: the .gure shows that if 802.11n transmits concurrently, without TIMO, these technolo­gies can suffer signi.cantpacketloss.if802.11n employs TIMO,thenitsinterferenceincreasesloss ratesbylessthan0.5%, whichis negligible.Thus,TIMO canhelpdiverse technologies co­exist in the same frequency band while placing the burden of in­terferenceprevention onhigh-endMIMO nodesinstead oflow-end single antenna systems.
Relationship: contrasting
Domain: Networks
Sentence 1: In both cases, to keep the queue length close to the target value, the AWM algorithm tries to increase the TCP source sending rate by indicatingalways increasing values of the suggested window.
Sentence 2: the TCP sources are not allowed to increase their sending rate because they are driven by either the forward and actual bottleneck node, or by the user tra.c; so AWM indications do not take e.ect.
Relationship: contrasting
Domain: Networks
Sentence 1: Given thatTCPprocessing overheads are typically dominated by the checksum compu­tation and segmentation, and that these tasks are increas­inglydelegatedtohardwarein modernNICs, webelieve that this assumption is quite reasonable.
Sentence 2: vFlood still has to carefully manage the .nite amount of bu.er space for .ooded data among multiple connections.
Relationship: contrasting
Domain: Networks
Sentence 1: We experimented by varying a from 0 to 1 and observed that RCE was not signi.­cantly sensitive to a (in spite of a = 0, MCD exhibited a low RCE indicating that once the sensors reached their target angles, choosing the direction that minimized the distance between the hull and the actual centroids resulted in the sen­sors converging onto the contour).
Sentence 2: latency showed 5Applied Science Associates Inc., http://www.appsci.com/ 6GRAM++: Full runtime GIS supporting Vector And Raster map data creation, query, analysis and layout ap­plication, http://www.csre.iitb.ac.in/gram++/ some variation with a and at a =0.5, both the SA and the MCD algorithm displayed a low latency value.
Relationship: contrasting
Domain: Networks
Sentence 1: 2.1 The Push/Pull Envelope When sensor data are needed at a constant rate, push requires less downlink traffic (cloud to edge, edge to sensor), since the application issues one subscription request only, then acquires the stream of values from the sensor.
Sentence 2: pull incurs a round­trip penalty for each data query (e.g., involving steps such as request, transmit, receive, and acknowledge).
Relationship: contrasting
Domain: Networks
Sentence 1: In our context, precision can be de.ned as the ratio of the number of Nugache peers in the returned list of hosts to the length of the returned list.
Sentence 2: recall can be de.ned as the ratio of the number of Nugache peers in the re­turned list to the number of all Nugache peers in the network except the seed bot (m - 1).
Relationship: contrasting
Domain: Networks
Sentence 1: As mentioned previously, FRuG does not use seeds as ClassBench does to generate classification tables.
Sentence 2: considering that EffiCuts produces very different results when the size of the rules and the overlap between them vary, we implemented two scenarios in FRuG: a small scenario with little overlap and mostly small rules (best case) and a large scenario with a lot of overlap and a wide variety of rule sizes, including wildcards (worst case).
Relationship: contrasting
Domain: Networks
Sentence 1: In proactive routing protocols, all the nodes are known beforehand, and similarly, if using proactive service publishing, all the services are known throughout the network even before there is a need to invoke them.
Sentence 2: in on-demand routing protocols, the route to a node is discovered only when needed, and similarly, if using on-demand service discovery, the needed services are discovered only when it is requested.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.4 Synchronized Channel Sensing on a DualRadio Platform The experiments with the radio array platform have shown that simultaneous occupation of adjacent IEEE 802.15.4 channels is a reliable indication for a Wi-Fi transmitter detection.
Sentence 2: us­ing an 8-radio or a 4-radio platform for detecting Wi-Fi signals on the host platform involves a high communication/coordination overhead for the master microcontroller.
Relationship: contrasting
Domain: Networks
Sentence 1: It will thus not be able to choose a path via an area i .0 for a destination D if D is not in this area.
Sentence 2: b R1 = could be on the shortest path from a router X in area i to the border router B R2 that X selected for destination D. When a packet with destination D, entering the network in X will reach B R1, it will be forwarded into the backbone, instead of being forwarded to B R2 and only then be forwarded into the backbone.
Relationship: contrasting
Domain: Networks
Sentence 1: Link Layer Assisted Mobility Support Using SIP for Real-time Multimedia Communications Wooseong Kim , Myungchul Kim , Kyounghee Lee , Chansu Yu and Ben Lee School of Engineering Department of Electrical and School of Electrical Engineering and Information and Communications Computer Engineering Computer Science University, Daejeon, Korea Cleveland State University Oregon State University {wskim, mckim, Cleveland, OH, USA Corvallis, OR, USA leekhe}@icu.ac.kr c.yu91@csuohio.edu benl@eecs.oregonstate.edu Abstract Session Initiation Protocol (SIP) was standardized for real-time applications and extended to support terminal mobility by Internet Expert Task Force (IETF).
Sentence 2: sIP terminal mobility suffers from the considerable handoff latency which is unsuitable for the real-time communications.
Relationship: contrasting
Domain: Networks
Sentence 1: During the measurement period, we also ensure that the network was free of cross traf.c, packet loss, and retrans­missions.
Sentence 2: although the web server could bias the RTT, the bias, if Figures 3(d), 3(g), and 3(j) show that the delay overheads incurred by the socket-based methods are consid­erably small.
Relationship: contrasting
Domain: Networks
Sentence 1: The corre­sponding probability distribution then reads s 0 if |c| = |s|, layered pcs (X)= Xs(1) if |c|= |s|. ''
Sentence 2: s:|s'|=|c|X s in .at systems, users are assumed to sample uniformly from the total population of users when selecting a target user.
Relationship: contrasting
Domain: Networks
Sentence 1: On the one hand, multiple receivers may overhear a single transmission on the same channel at no additional cost above a point-to-point transmis­sion; this property has been exploited in many oppor­tunistic applications (e.g., [2]).
Sentence 2: the shared nature of the medium e.ectively forces wireless nodes to leverage frequency diversity and channelization for e.ciency.
Relationship: contrasting
Domain: Networks
Sentence 1: One of the drawbacks of backing o. is that the SU may miss some part of the white spaces during backo.. An alternative approach to backing o. is to continuously sense the channel so as not to miss any white space.
Sentence 2: this approach is highly energy in-e.cient (specially for battery operated small mobile SUs, and cognitive sensor networks) because the SU devices need to sense the channel even if they have no frame to transmit.
Relationship: contrasting
Domain: Networks
Sentence 1: DISCUSSION AND OPEN QUESTIONS Many signs of excitables point to PowerDNS: it is most popular in Europe (where the majority of excitables come from), we have identi.ed that some versions include both of D-root s IP addresses in its list of root name servers, and its root selection algorithm can send all queries to a single name server.
Sentence 2: our runs of fpdns have turned up only a single PowerDNS resolver running an old version of the software.
Relationship: contrasting
Domain: Networks
Sentence 1: It may be possible that mid-scale disaggregation (resource disaggregation at the rack-or pod-level) would provide enough ef.ciency and .exi­bility.
Sentence 2: we speculate that having a .at, uni.ed interconnect across a datacenter can be much simpler than the two levels of network structure, in terms of the design and scheduling complexity.
Relationship: contrasting
Domain: Networks
Sentence 1: For the any- 2-any and leaf-2-1eaf models, shown in Figure 8(a), the maximum edge congestion scales almost identically to that for shortest path routing (compared with Figure 5(a) and 6(a)).
Sentence 2: somewhat surprisingly, for the clout model, congestion under policy based routing scales only as n 3 compared to over n 5 for shortest-path routing.
Relationship: contrasting
Domain: Networks
Sentence 1: Then, both Aand Cwould switch to the route via AS 3, which may lead to a change in the properties of the end­to-end paths for traf.c entering AS 1 at routerC.
Sentence 2: the link failure does not cause a change in the BGP route at Dand, as such, the change is not visible to the measurement system.
Relationship: contrasting
Domain: Networks
Sentence 1: The result of Mode 1 extends lifetime 2.87 times than that of Mode 2 and at least 3.65 times than the other two when the value of K all equal to 8, which means in the case of K=8, Mode 1 prolongs the lifetime of network by unequal widths adaptation of rings.
Sentence 2: it performs worse than Mode 2 when K in Mode 2 is 20 and 25.
Relationship: contrasting
Domain: Networks
Sentence 1: Particularly, under the benchmark policy, the through­out is saturated if the load is larger than 0.52; the delay in­creases sharply when the load increases from 0.5 to 0.7 and gradually increases if load is greater than 0.7.
Sentence 2: the average end-to-end delay under policy 2 increases much slower.
Relationship: contrasting
Domain: Networks
Sentence 1: LEMMA3.AlgorithmAlis2-ompetitive.
Sentence 2: proof:ConsideranarbitraryinputsequeneI.Theost G.ofAloninputIsatisfes G.:nGT+lateny(PT)+lateny(AlPT) wherenGTisthenumberofaknowledgementsperformed byPToninputI,andlateny(AlPT)isthelateny inurredbyAlthatisnotinurredbyPT.itiseasytoseefromFigure3thatlateny(AlPT)is preiselytheareaofasetofretangles(shadedinthefgure), whereeahretanglehasitsleftsideatthetimewhenPT sendsanaknowledgement,anditsrightsideatthefollowing timewhenAlsendsanaknowledgement.Bydefnition ofalgorithmAl,alltheseretangleshaveareaatmost1.
Relationship: contrasting
Domain: Networks
Sentence 1: (27) is ob­tained from the fact that if the new connection is accepted and allocated r +n units of bandwidth, the payoff for the base station becomes the total utility of the ongoing con­nections after some portion of bandwidth have been taken away (which results in decrease in the total utility for the ongoing connections) plus the utility of the new connection.
Sentence 2: if the new connection chooses to deny the offered service, the payoff for the base station is identical to that when the base station rejects the new connection.
Relationship: contrasting
Domain: Networks
Sentence 1: For window sizes of 1 second we obtain recall and precision of 94 and 92% respectively which compares well with recall and precision of 85 interarrival time alone (92 and 65%) and large packet lengths (recall 72% and precision 80%).
Sentence 2: there is considerable 80 Precision is between 90 and 95% for the same window sizes but declines to 85% for a 10 second window.
Relationship: contrasting