An Efficient Simulation Technique for Performance Studies of CSMA/CD Local Network

O'Reilly, Peter John Paul; Hammond, J.L.

doi:10.1109/jsac.1984.1146040

Cited by 26 publications

(17 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Examples of distributed MAC protocols are ALOHA [3], Carrier Sense Multiple Access/Collision Detection (CSMA/ CD) [5], [6], [7], [8], [9], and Carrier Sense Multiple Access/ Collision Avoidance (CSMA/CA) [10], [11], [12], whereas an example of centralized MAC protocol is HIPERLAN [1], [2]. For the present work, a p-CSMA type access strategy for medium access is considered.…”

Section: Access Gamementioning

confidence: 99%

“…We now discuss this characteristic in some detail. It can be said that the formulation of the "Access Game" in this paper has a fairness-bias, i.e., achieving fairness in a distributed medium access scenario is the primary concern and this concern has been incorporated in the form of the fairness conditions in (8). Therefore, it is no surprise that the proposed solution does indeed result in fairness.…”

mentioning

confidence: 98%

See 1 more Smart Citation

Fair bandwidth sharing in distributed systems: a game-theoretic approach

Rakshit

Guha

2005

IEEE Trans. Comput.

View full text Add to dashboard Cite

Abstract-Fair sharing of bandwidth remains an unresolved issue for distributed systems. In this paper, the users of a distributed LAN are modeled as selfish users with independence to choose their individual strategies. With these selfish users, the contention-based distributed medium access scenario is modeled as a complete-information, noncooperative game, designated the "Access Game." A novel MAC strategy based on p-persistent CSMA is presented to achieve fairness in the "Access Game." It is proven that there are an infinite number of Nash Equilibria for the "Access Game," but they do not result in fairness. Therefore, it may be beneficial for the selfish users to adhere to a set of constraints that result in fairness in a noncooperative fashion. This leads to the formulation of a constrained "Access Game" with fairness represented as a set of algebraic constraints. It is proven that the solution of the constrained game, the Constrained Nash Equilibrium, is unique. Further, it is shown that, in addition to achieving fairness, this solution also optimizes the throughput. Finally, these results are extended to a more realistic incomplete-information scenario by approximating the incomplete-information scenario as a complete-information scenario through information gathering and dissemination.

show abstract

Section: Access Gamementioning

confidence: 99%

mentioning

confidence: 98%

Fair bandwidth sharing in distributed systems: a game-theoretic approach

Rakshit

Guha

2005

IEEE Trans. Comput.

View full text Add to dashboard Cite

show abstract

“…Ethernet behavior has been extensively studied both analytically [1,5,8,9,11,16,17,3,21,32,34,33,31,30] and through simulation models [1,14,19,23,22,24,36]. Most analytical models developed, make assumptions about one or more parameters: packet size, cable length, population size etc.…”

Section: Related Workmentioning

confidence: 99%

“…To complement analysis, several simulation models of Ethernet have been presented [1,14,19,23,22,24,36]. Many of the simulation models represent the Ethernet as a point-to-point link with special characteristics.…”

Section: Introductionmentioning

confidence: 99%

The effect of detail on ethernet simulation

Hussain¹,

Kapoor²,

Heidemann³

2004

Proceedings of the Eighteenth Workshop on Parallel and Distributed Simulation - PADS '04

View full text Add to dashboard Cite

show abstract

“…An overview of hybrid techniques is given *in [13]. Several specific studies [36,37] will be summarized in the following sections.e " Four cases where hybrid techniques have been applied to queueing system *simulation will be reviewed here relative to their applicability to PCNSAS.…”

mentioning

confidence: 99%