sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: In [12], the one-to-all and the all-to-all paradigms have been addressed in DC-WSNs: approxima­tion algorithms, complexity and experimental results have been achieved.
Sentence 2: one of the main di.erences from our model resides in the assumption that sensors can trans­mit messages at any time, not only when they are active (awake), and the duty-cycle is considered only with respect to the receiving capabilities.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, while the AD of E.2 is 110, a route received from a peer OSPF process of E.2 may be con.gured to have an AD value di.erent from 110, say 90.
Sentence 2: we realize it may be possible to take advantage of such .ex­ibility and create guidelines on AD assignment to eliminate routing instabilities.
Relationship: contrasting
Domain: Networks
Sentence 1: That is, the Worldwide Interoperabil­ity for Microwave Access (WiMAX) system uses a VBR real-time polling service (rtPS) that results in additional access latency jit­ter and bandwidth allocation problems for transmitted multimedia stream variable data rates when the base station regular time inter­val polling to 802.16 entity (SSs) for contention bandwidth request period.
Sentence 2: this scheduling algorithm solves the SS band­width resource allocation problem, and depends on initial values provided by an extended real-time polling service (ertPS) during a speci.ed period.
Relationship: contrasting
Domain: Networks
Sentence 1: On the other hand, ad hoc wireless networks, with characteristics such as the lack of a central coordinator and mobility of the nodes (as in the case of battle-.eld networks), require nodes with a very high energy reserve.
Sentence 2: advances in the battery technologies are negligible when compared to the recent advances that have taken place in the .eld of mobile computing and commu­nication.
Relationship: contrasting
Domain: Networks
Sentence 1: They show that the two methods di.er considerably with the random selection method providing better results be­cause the trace method produces more overlapping pre.x pairs.
Sentence 2: rather than using an ad hoc trace, we pre­fer to stress ABV further by adding a controlled injection of groups of pre.xes that share a common pre.x to produce more overlapping pre.x pairs.
Relationship: contrasting
Domain: Networks
Sentence 1: C3S2E-10 2010, May 19-21, Montreal [QC, CANADA] Editor: B. C. Desai Copyright &#38;#169;2010 ACM 978-1-60558-901-5/10/05 $5.00  University of Ontario Institute of Technology 2000 Simcoe Street North, Oshawa, ON L1H 7K4 905-721-8668  supreet.baweja@uoit.ca potential to provide high bandwidth efficiency and the lowest delay by directly engaging network routers in the process.
Sentence 2: deployment of network-layer multicast in the Internet infrastructure has not kept up with the growth of various forms of multicast services in recent years.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, the way mobility is modeled has a major impact on the topo­logical properties of a vehicular network, and, apart from overtak­ings, all of the motion features (.ows merging and the car-to-car in­teraction it is build upon, traf.c light management, multiple lanes) proved to generate unique cluster-and link-level effects, motivat­ing the employment of realistic motion representations instead of approximate ones.
Sentence 2: when focusing on networking protocols, the results prove that: protocol performance evaluations conducted on scenarios in which no realistic .ows interaction is considered can be eas­ily misleading, as the vehicular network topology tends to be much more globally connected in such conditions;  street topology locations are not all equal.
Relationship: contrasting
Domain: Networks
Sentence 1: 978-3-9815370-0-0/DATE13/&#38;#169;2013 EDAA Julien Penders Body Area Networks imec-nl Eindhoven, the Netherlands Julien.penders@imec-nl.nl With over 1 billion overweight people on the globe, and 300 million obese, weight is the 4th biggest risk factor for global mortality leading to 3.2 million deaths each year.
Sentence 2: it is not straightforward to combine our daily work and life with healthy active living, as most of us spend the better part of a workday doing sedentary activities.
Relationship: contrasting
Domain: Networks
Sentence 1: However, AHMAC can obtain a higher through­put since contention does not occur under high-tra.c con­ Figure 10: Average packet delay in an IEEE 802.11s mesh network with a single-interface environment dition.
Sentence 2: when N>110, TH3 severely decreases since the frames of nodes located at three hops are not suf­.ciently forwarded to the MAPs located at 2-hop distance from the MPP.
Relationship: contrasting
Domain: Networks
Sentence 1: Thus, it becomes clear that the bottleneck in terms of connectiv­ity and capacity is the VANET.
Sentence 2: the decentralized charac­ter of VANETs for distributing traf.c information is very appeal­ing: a cooperative approach where every participant contributes, distributes, and consumes information, where no central institu­tions and no central infrastructure are necessary, where, conse­quently, the absence of single points of failure promises a robust service, without recurring fees for the users all this is obviously highly desirable.
Relationship: contrasting
Domain: Networks
Sentence 1: To ensure safe coexistence of different end-point resource allocation strategies, the system maintains a key invariant that the amount of traf.c a sender can generate is limited by its budget, which is the maximum amount it can spend per unit time.
Sentence 2: numerous practical challenges exist in generating ex­plicit price feedback, while allowing the end-points to dynamically change their .ows budget allocation.
Relationship: contrasting
Domain: Networks
Sentence 1: Indeed, from Example 6, there are routing systems where nodes prefer 3-hop paths over 1-hop paths, and yet the system is safe under .ltering.
Sentence 2: checking whether such systems are safe under .ltering requires global veri.cation; the theorems we have presented sug­gest that safety under .ltering cannot be guaranteed through local veri.cation alone, if some nodes are allowed to prefer (n + k)-hop paths over n-hop paths.
Relationship: contrasting
Domain: Networks
Sentence 1: Although a path p with the maximum or minimum w20 weight can be found in the DAG, it is not easy to find a path p for which w2(p) is as close as possible to c2 in polynomial-time.
Sentence 2: very efficient heuristics can be developed based on the fact that we can compute the maximum and the minimum w20 from the source to every node and from every node to the desti- nation.
Relationship: contrasting
Domain: Networks
Sentence 1: Thomas Gross Computer Science Department ETH Zurich 8092 Zurich Switzerland trg@inf.ethz.ch  searchers rely on wireless simulators for evaluating new pro­tocols/applications for wireless networks.
Sentence 2: simu­lators are often based upon idealized and simpli.ed radio propagation and physical environment models that fail to capture the complex channel characteristics of a real sys­tem faithfully.
Relationship: contrasting
Domain: Networks
Sentence 1: While our initial results are promising, several issues, which are the sub ject of ongoing study, need to be addressed before deploying VMScope operationally.
Sentence 2: the .rst concerns the bandwidth overhead it imposes on the network.By joining the Default MDT group over tunnels to multiple PEs, the monitor will receive multiple copies of all its probe packets, as well as multiple copies of all customer packets transmit­ted on the MVPN.For a large MVPN this overhead could be substantial.the MVPN speci.cation provides a mechanism (see Footnote 1) to allowhigh bandwidth cus­tomer groups to be encapsulated in special Data MDTs in the provider backbone.This feature provides an engineer­ing mechanism to limit the bandwidth on the Default MDT.
Relationship: contrasting
Domain: Networks
Sentence 1: No-Scheduler s performance drops to almost half as the number of interferers in­creases to 2 and gradually falls to zero, as the number of inter­ferers increases to 6.
Sentence 2: omniVoice provides the full rate for VoIP for up to 4 interferers, and falls only slightly as the number of interferers goes up to 9.
Relationship: contrasting
Domain: Networks
Sentence 1: In this paper we are not concerned with the analysis of which are the scenarios where one speci.c routing solution for WMNs shows better performance than another speci.c routing solution.
Sentence 2: the central question ad­dressed in this paper is: How to design self-adaptive mesh networking solutions that autonomously and on-the-.y de­cide upon the best routing protocol for a tra.c .ow from a set of supported algorithms, given an estimate of the cur­rent network state?
Relationship: contrasting
Domain: Networks
Sentence 1: The SSL Landscape A Thorough Analysis of the X.509 PKI Using Active and Passive Measurements Ralph Holz, Lothar Braun, Nils Kammenhuber, Georg Carle Technische Universität München Faculty of Informatics Chair for Network Architectures and Services {holz,braun,kammenhuber,carle}@net.in.tum.de ABSTRACT The SSL and TLS infrastructure used in important protocols like HTTPs and IMAPs is built on an X.509 public key infrastructure (PKI).X.509certi.cates are thus used to authenticate serviceslike onlinebanking, shopping, e-mail, etc.
Sentence 2: it alwayshasbeen felt that the certi.cation processes of this PKI may not be con­ducted with enough rigor, resulting in a deployment where many certi.catesdo not meet the requirements of a securePKI.
Relationship: contrasting
Domain: Networks
Sentence 1: LANC 2011, October 12-13, 2011 Quito, Ecuador Copyright &#38;#169; 2011 ACM ISBN 978-1-4503-0886-1/11/10... $10.00.
Sentence 2: link state routing protocols are more complex, and running them adds an important overhead on routers in the form of memory and CPU utilization.
Relationship: contrasting
Domain: Networks
Sentence 1: For example, the ISP could perform per-.ow account­ing on the edge router to police the contract.
Sentence 2: some edge routers may not have the memory or CPU resources to perform the necessary .ow accounting especially if hun­dreds of mobile devices are connected and their applications keep shifting between foreground (where they can see ad­vertisements) and background (where they cannot and the mobile OS closes the open ports) states.
Relationship: contrasting
Domain: Networks
Sentence 1: [5]  6.6 Summary of Results [6] We see that dynamic pipelining is the only IP-lookup scheme [7] that is truly scalable in routing-table size, lookup throughput, imple­mentation cost, power dissipation, and routing-table update cost.
Sentence 2: all other IP-lookup schemes do not scale well in a number [8] of these requirements.
Relationship: contrasting
Domain: Networks
Sentence 1: Based on SOA and multi-agent system, a distributed traffic Simulation system was proposed [15].
Sentence 2: all of the current SOA based solutions for transportations employ SOA clients in mobile devices [16-18] that access via the Internet or roadside infrastructures web services deployed on specific servers; thus SOA based mobile applications are not capable of running in the mobile devices independently and directly collaborating with each other over ad-hoc manner.
Relationship: contrasting
Domain: Networks
Sentence 1: How many handoff calls will arrive at a cell c depends on the number of calls in c's neighbors and on the mobility pattern.
Sentence 2: if c's state does not include the number of calls in neighboring cells (as is the case in our model), we must find some way of estimating the number of calls at c's neighbors in order to estimate the handoff probability (which in turn affects the transition probability in the MDP).
Relationship: contrasting
Domain: Networks
Sentence 1: In partic­ular, the core protocols at the basis of the communication among the hosts are often tested using non realistic models, including ran­dom mobility models, such as thevery popular RandomWay Point model [9].
Sentence 2: the performance analysis of protocols using random mobility models may provide inaccurate information and give wrong insights into the real applicability of protocols and ap­plications.
Relationship: contrasting
Domain: Networks
Sentence 1: An out-of-sequence forwarding on the other hand can overcome this problem as nodes that have lost a packet can continue to forward any higher (or lower) sequence number packets that they might have received.
Sentence 2: such an approach can po­tentially lead to unnecessary NACK implosion, where downstream nodes will issue a chain of NACK requests for holes detected in the sequence of packets received, even when the concerned packets are not available.
Relationship: contrasting
Domain: Networks
Sentence 1: Because the main purpose of the Tokyo-XP network is to provide transit services among academic organizations in di.erent countries, the network itself is relatively small in scale, with no more than ten routers in its OSPF backbone area.
Sentence 2: through our 8-month study, we found we Figure 8: Number of total Router-LSAs and their changes on APAN Tokyo-XP network could also observe intra-domain routing instability on such a small-scale network.
Relationship: contrasting
Domain: Networks
Sentence 1: The maximization of the cache hit ratio, irrespectively of the link through which the requests exit the ISP network, has usually been the objective of ICN research.
Sentence 2: we argue that the primary goal of an ISP is to minimize the 3For correctness, it is worth specifying that usually CDNs pay ISPs to send them tra.c only in case ISPs are su.­ciently large.
Relationship: contrasting
Domain: Networks
Sentence 1: To avoid this, a better way would be also propagate the con­ gestion noti.cation to 2-hop neighbors and ask them drop packets correspondingly.
Sentence 2: as we mentioned in sec­tion 4.3, coordinating 2-hop neighbors requires non-trivial Queue size (# of pkts) 200 150 100 50 0 0 10 20 30 40 50 60 70 80 90 100 110 120 130 140 overhead.
Relationship: contrasting
Domain: Networks
Sentence 1: As the capacity Q increases, the call loss rates de-crease irrespective of the use of BLA.
Sentence 2: the call loss rates are reduced significantly by using our location update scheme, especially when the capacity Q is small such as in An )~h ~ Capacity Q Prloss Przos8 4 4 10 2 9.14% 50% 10 10 10 5 4.91% 20% 20 20 10 8 6.12% 12.5% 20 10 10 8 1.66% 12.5% Table 1: Call loss rates of moving from microcell to macrocell tier.
Relationship: contrasting
Domain: Networks
Sentence 1: 6.3 Waxman Random Topology Model Figure 4a shows the similar behavior for success ratios for the four algorithms under Waxman random topology for changing values of the Weibull shape parameter as the ones under Barabasi model in Figure 3b.
Sentence 2: figure 4b dis­plays a little di.erent behavior for changing scale parameters under Waxman then under Barabasi in Figure 3c.
Relationship: contrasting
Domain: Networks
Sentence 1: In general there are three properties needed at minimum to make reputation systems work: (1) entities must be long-lived, so that there is an expectation of future interaction with other such entities, (2) feedback about current interactions is captured and distributed so that such information is visible in the future, and (3) past feedback guides buyer decisions.
Sentence 2: as various studies have pointed out, reputation systems are not infallible and further work is needed to improve their re­silience to malicious behavior.
Relationship: contrasting
Domain: Networks
Sentence 1: The number of collisions have a signi.cant amount of variation from one execution of the experiment to another because of the randomness present in the MAC protocol.
Sentence 2: clearly noticeable is the fact that a drastic reduction in the number of collisions (as shown by the cutoff at around 100 in Figure 5) in­dicates signi.cant reduction in interference.
Relationship: contrasting
Domain: Networks
Sentence 1: Table 1:3D stacking TSV diameter as per ITRS Global Level, W2W, D2W or D2D 3D-stacking 2009-2012 2012-2015 Minimum TSV diameter 4-8 µm 2-4µm Minimum TSV pitch 8-16 µm 4-8 µm  If we are conservative and say that we cannot have a TSV pitch lower than 8µm, we still get a TSV density of 1cm2/64µm2 =1,562,500 TSVs/cm2.
Sentence 2: we will never need more than log2(10 ^ 15)=50 bits to address any part of the memory, and we will never need to access more than 1,000 input-weights in order to do one calculation.
Relationship: contrasting
Domain: Networks
Sentence 1: Practical solutions, that determine the energy optimal communi­cation settings by exploring the domain of parameter s values, work well when the domain is small [2].
Sentence 2: once the domain de­.ned by the number of channel width values, modulation and cod­ing schemes (MCSs) and the resolution of transmission power knob becomes large, such as in .exible white space communication, we need to rely on the theory to restrict the empirical search range.
Relationship: contrasting
Domain: Networks
Sentence 1: We assume that a peer with high reputation is altruistic, whereas misbehaving peers will have a low reputation.
Sentence 2: a peer with a high reputa­tion may be punished in two ways: a) The higher reputation a peer has, the greater the amount tra.c that will be for­warded to it and, thus, more of its resources (i.e.
Relationship: contrasting
Domain: Networks
Sentence 1: i =(NCBPS /16)(k mod 16) + floor(k/16) (1) j = s × floor(i/s)+(i + NCBPS - floor(16 × i/NCBPS )) mod s (2) Smartinterleavers: Thegoalofthe standardinterleaveristo avoid long runs of low reliability bits by spreading adjacent bits apart to reduce correlated losses.
Sentence 2: they do not consider that different subcarriers can experience very different loss rates and differentsymbols canhavedifferentimportance.
Relationship: contrasting
Domain: Networks
Sentence 1: The Blockmon modular principle is borrowed from the Click modular router [20] which is itself a fundamental pil­lar in the history of device programmability.
Sentence 2: the approach presented in this paper di.ers from the Click one since it is based on a purely functional language and PFQ Lang computations are (combinations of ) pure functions, while Click con.gurations are built by connecting elements that can have side e.ects.
Relationship: contrasting
Domain: Networks
Sentence 1: In contrast, the Cyclops (refer Table 4) is much more energy ef.cient as compared to the CMUcam and consumes 33 mW for 892 ms, which is better than the CMUcam by a factor of 5.67 in terms of energy usage.
Sentence 2: the latency of detection at the Cyclops is around 900 ms, which is more than 6 times as much as the CMUcam.
Relationship: contrasting
Domain: Networks
Sentence 1: If an otherwise-legitimate router is compromised, it would be able to utilize network resources at an arbitrary CoS setting and send traffic purportedly originating from any user who s identity is known to the router.
Sentence 2: if the message signature is carried end-to­end (an option for DTN security), a legitimate user could repudiate the origin of any traffic generated in this manner at a later time.
Relationship: contrasting
Domain: Networks
Sentence 1: The simulation results illustrated in Figure 4 show clearly that the SA and the proposed game have quite the same performance, since the maximum di.erence between the mean value of the SINR obtained by the SA and the game is -3dB.
Sentence 2: water-Filling obtains lower mean SINR levels and performance worsens for in­creasing number of users in the network.
Relationship: contrasting
Domain: Networks
Sentence 1: This is consistent with well-known results for the sum-rate capacity of non-fading Gaussian interfer­ence channels (see, e.g., [8]), where the sum-rate-optimal solution switches from all-private to all-common at a =1.
Sentence 2: in our scenario, due to fading and the absence of CSI, we do not have a hard threshold, but rather a gradual switching between these two strategies, and furthermore, the switching tends to occur for a< 1.
Relationship: contrasting
Domain: Networks
Sentence 1: A Regional Cell Routing in Wireless Sensor Networks Dae-Young Kim and Jinsung Cho Department of Computer Engineering Kyung Hee University, Korea {kimdy,chojs}@khu.ac.kr ABSTRACT Among routing protocols of wireless sensor networks, hier­archical routing protocols are more e.cient, in general, be­cause they involve less sensor nodes for data transmission.
Sentence 2: when events happen regionally and dynamically, unnecessary overheads occur in hierarchical routing proto­cols.
Relationship: contrasting
Domain: Networks
Sentence 1: Accord­ingto[14],whentwonodes meet a messageissenttoanother nodeif thedeliverypredictabilityto thedestinationishigher than the other node.
Sentence 2: as the node that forwards the messagecan.nd abetternodeorthe.naldestinationin the future, the forwarded message is not removed from the node,butis storedinbu.er(sincethereis available space).
Relationship: contrasting
Domain: Networks
Sentence 1: 4.2 Tit For Tat A second alternative is to use a Tit For Tat (TFT)strat­egy[2].
Sentence 2: itwasgeneralizedin[15]forthewirelesscontext as follows: (0) p =0 i TFT (k)(k-1) p = p for k = 1. i TFT -i Milan et al.
Relationship: contrasting
Domain: Networks
Sentence 1: 1 10 1001,000 WWW 6.12 1.91 1.23 1.04 other 22.42 6.06 1.93 1.15 napster 455.31 33.55 2.63 1.15 smtp 5.66 2.33 1.51 1.14 ftp 36.21 10.36 2.42 1.26 nntp 107.23 36.48 7.11 1.22 https 6.34 1.58 1.09 ~ 1.01 ms-strm 95.66 24.91 2.11 1.10 pop3 5.19 1.64 1.18 1.01 domain 2.26 1.34 1.07 1.01 realaudio 467.16 17.64 2.45 1.14 quake 19.58 15.30 5.14 1.25 http-alt 4.12 1.47 1.07 1.00 ALL 7.75 2.491 1.44 1.08 TABLEI DEPENDENCE OF MEAN PACKETS PER FLOW ON SAMPLING PERIOD, BY APPLICATION; 30 SECOND INTERPACKET TIMEOUT decreases for most applications.
Sentence 2: streaming and file sharing applications, in particular napster (curve 3) and realaudio (curve 7) buck this trend.
Relationship: contrasting
Domain: Networks
Sentence 1: Recovering this data incurs no energy overhead for clients as long as the measure­ments are only uploaded while the battery is charging, and our recent analysis of 89 million scan results col­lected from 139 smartphones over 5 months [13] has demonstrated the value of these measurements for net­work monitoring and debugging.
Sentence 2: because smartphones are frequently idle, periodic scans may not re.ect either locations where users actually use their devices or locations where their devices use the network.
Relationship: contrasting
Domain: Networks
Sentence 1: For hierarchical topologies like Fat­trees [2], shortest path routing has been largely suf.cient when there are no failures.
Sentence 2: recently proposed direct network topologies like HyperX, BCube, and Flattened Butter.y [1, 17, 20], which employ paths of different lengths, have not seen adoption in data centers due to the limitations imposed by commodity data cen­ter switches and shortest path routing.
Relationship: contrasting
Domain: Networks
Sentence 1: The scalability of the simulation scheme is highly depen­dent on the number of nodes but also on the communica­ 400 300 200 100 0 number of nodes time (s) Figure 8: Scalability of distributed mixte simula­ tion activity of the simulated nodes.
Sentence 2: it is hard to clearly analyze the impact of this last parameter.
Relationship: contrasting
Domain: Networks
Sentence 1: 4.1.2 21 n -perfect Unicast System In [8], Eidenbenz proposed a unicast system that charge the ser­vice request an amount that equals to the weight of the second shortest path, where the second shortest path is the shortest path in graph G -LCP(s, t, d).
Sentence 2: the second shortest path could be arbitrary large than the total VCG payment.
Relationship: contrasting