oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Search Results: 1 - 10 of 1547 matches for " Saurabh Aggarwal "
All listed articles are free for downloading (OA Articles)
Page 1 /1547
Display every page Item
Strategies for Utility Maximization in Social Groups with Preferential Exploration
Saurabh Aggarwal,Joy Kuri
Computer Science , 2014,
Abstract: We consider a \emph{Social Group} of networked nodes, seeking a "universe" of segments for maximization of their utility. Each node has a subset of the universe, and access to an expensive link for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum or negligible cost, some nodes in the group try to exploit the system. We term such nodes as `non-reciprocating nodes' and prohibit such behavior by proposing the "Give-and-Take" criterion, where exchange is allowed iff each participating node has segments unavailable with the other. Following this criterion for inter-node links, each node wants to maximize its utility, which depends on the node's segment set available with the node. Link activation among nodes requires mutual consent of participating nodes. Each node tries to find a pairing partner by preferentially exploring nodes for link formation and unpaired nodes choose to download a segment using the expensive link with segment aggressive probability. We present various linear complexity decentralized algorithms based on \emph{Stable Roommates Problem} that can be used by nodes (as per their behavioral nature) for choosing the best strategy based on available information. Then, we present decentralized randomized algorithm that performs close to optimal for large number of nodes. We define \emph{Price of Choices} for benchmarking performance for social groups (consisting of non-aggressive nodes only). We evaluate performances of various algorithms and characterize the behavioral regime that will yield best results for node and social group, spending the minimal on expensive link. We consider social group consisting of non-aggressive nodes and benchmark performances of proposed algorithms with the optimal.
Delay Modelling for a Single-hop Wireless Mesh Network under Light Aggregate Traffic
Albert Sunny,Joy Kuri,Saurabh Aggarwal
Computer Science , 2010,
Abstract: In this paper, we consider the problem of modelling the average delay in an IEEE 802.11 DCF wireless mesh network with a single root node under light traffic. We derive expression for mean delay for a co-located wireless mesh network, when packet generation is homogeneous Poisson process with rate \lambda. We also show how our analysis can be extended for non-homogeneous Poisson packet generation. We model mean delay by decoupling queues into independent M/M/1 queues. Extensive simulations are conducted to verify the analytical results.
Application Delay Modelling for Variable Length Packets in Single Cell IEEE 802.11 WLANs
Albert Sunny,Joy Kuri,Saurabh Aggarwal
Computer Science , 2010,
Abstract: In this paper, we consider the problem of modelling the average delay experienced by an application packets of variable length in a single cell IEEE 802.11 DCF wireless local area network. The packet arrival process at each node i is assumed to be a stationary and independent increment random process with mean ai and second moment a(2) i . The packet lengths at node i are assumed to be i.i.d random variables Pi with finite mean and second moment. A closed form expression has been derived for the same. We assume the input arrival process across queues to be uncorrelated Poison processes. As the nodes share a single channel, they have to contend with one another for a successful transmission. The mean delay for a packet has been approximated by modelling the system as a 1-limited Random Polling system with zero switchover times. Extensive simulations are conducted to verify the analytical results.
Delay Modelling for Single Cell IEEE 802.11 WLANs Using a Random Polling System
Albert Sunny,Joy Kuri,Saurabh Aggarwal
Computer Science , 2010,
Abstract: In this paper, we consider the problem of modelling the average delay experienced by a packet in a single cell IEEE 802.11 DCF wireless local area network. The packet arrival process at each node i is assumed to be Poisson with rate parameter \lambda_i. Since the nodes are sharing a single channel, they have to contend with one another for a successful transmission. The mean delay for a packet has been approximated by modelling the system as a 1-limited Random Polling system with zero switchover time. We show that even for non-homogeneous packet arrival processes, the mean delay of packets across the queues are same and depends on the system utilization factor and the aggregate throughput of the MAC. Extensive simulations are conducted to verify the analytical results.
Social optimum in Social Groups with Give-and-Take criterion
Saurabh Aggarwal,Joy Kuri,Rahul Vaze
Computer Science , 2013,
Abstract: We consider a "Social Group" of networked nodes, seeking a "universe" of segments. Each node has subset of the universe, and access to an expensive resource for downloading data. Alternatively, nodes can also acquire the universe by exchanging segments among themselves, at low cost, using a local network interface. While local exchanges ensure minimum cost, "free riders" in the group can exploit the system. To prohibit free riding, we propose the "Give-and-Take" criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the aggregate cardinality of the nodes' segment sets. First, we present a randomized algorithm, whose analysis yields a lower bound on the expected aggregate cardinality, as well as an approximation ratio of 1/4 under some conditions. Four other algorithms are presented and analyzed. We identify conditions under which some of these algorithms are optimal
Algorithmic Optimization of BDDs and Performance Evaluation for Multi-level Logic Circuits with Area and Power Trade-offs  [PDF]
Saurabh Chaudhury, Anirban Dutta
Circuits and Systems (CS) , 2011, DOI: 10.4236/cs.2011.23031
Abstract: Binary Decision Diagrams (BDDs) can be graphically manipulated to reduce the number of nodes and hence the area. In this context, ordering of BDDs play a major role. Most of the algorithms for input variable ordering of OBDD focus primarily on area minimization. However, suitable input variable ordering helps in minimizing the power consumption also. In this particular work, we have proposed two algorithms namely, a genetic algorithm based technique and a branch and bound algorithm to find an optimal input variable order. Of course, the node reordering is taken care of by the standard BDD package buddy-2.4. Moreover, we have evaluated the performances of the proposed algorithms by running an exhaustive search program. Experi-mental results show a substantial saving in area and power. We have also compared our techniques with other state-of-art techniques of variable ordering for OBDDs and found to give superior results.
Common New Fixed Point Theorem in Modified Intuitionistic Fuzzy Metric Spaces Using Implicit Relation  [PDF]
Saurabh Manro, Sumitra  
Applied Mathematics (AM) , 2013, DOI: 10.4236/am.2013.49A005
Abstract:

In this paper, we prove some common fixed point theorems for two pair of compatible and subsequentially continuous mappings satisfying an implicit relation in Modified Intuitionistic fuzzy metric spaces. Consequently, our results improve and sharpen many known common fixed point theorems available in the existing literature of metric fixed point theory.

Fixed Point Theorem for Maps Satisfying a General Contractive Condition of Integral Type  [PDF]
  Sumitra, Saurabh Manro
Advances in Pure Mathematics (APM) , 2014, DOI: 10.4236/apm.2014.43013
Abstract:

The aim of this paper is to prove common fixed point theorems for variants of weak compatible maps in a complex valued-metric space. In this paper, we generalize various known results in the literature using (CLRg) property. The concept of (CLRg) does not require a more natural condition of closeness of range.

Coincidence and Common Fixed Point of Weakly Compatible Maps in Fuzzy Metric Space  [PDF]
Saurabh Manro, Sumitra  
Applied Mathematics (AM) , 2014, DOI: 10.4236/am.2014.59126
Abstract:

The aim of this paper is to establish some new common fixed point theorems for generalized contractive maps in fuzzy metric space by using property (E.A.), common property (E.A.), JCLRST property and CLRS property. Our results improve and extend the results of Chauhan et al. [1] and Sedghi et al. [2] besides several known results. We also furnish an illustrative example in support of our results.

Analyzing the Impact of Different Factors on Software Cost Estimation in Today’s Scenario  [PDF]
Deepa Gangwani, Saurabh Mukherjee
Journal of Software Engineering and Applications (JSEA) , 2015, DOI: 10.4236/jsea.2015.85025
Abstract: Software cost estimation is a main concern of the software industry. However, the fact is also that in today’s scenario, software industries are more interested in other issues like new technologies in the market, shorter development time, skill shortage etc. They are actually deviating from critical issues to routine issues. Today, people expect high quality products at very low costs and same is the goal of software engineering. An accuracy in software cost estimation has a direct impact on company’s reputation and also affects the software investment decisions. Accurate cost estimation can minimize the unnecessary costs and increase the productivity and efficiency of the company. The objective of this paper is to identify the existing methods of software cost estimation prevailing in the market and analyzing some of the important factors impacting the software cost estimation process. In order to achieve the objective, a survey was conducted to find out:

Nature of projects that companies prefer.

Impact of training on employees in software cost estimation.

How many people review the estimated cost?

How much risk buffer the company keeps for future prospects?

Page 1 /1547
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.