Towards A Framework for Rate Control on Dynamic Communication Networks

Kumari, Suchi; Singh, Anurag; Ranjan, Priya

doi:10.1145/2896387.2896397

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is an important result because of the use of the isomorphic directed graph as a tool to analyze both the properties of a TVG and the behavior of dynamic processes over a TVG. A framework to represent mobile networks dynamically in a Spatio-temporal fashion is designed and algebraic structural representation is also provided [12].…”

Section: Optimization Of Network Topologymentioning

confidence: 99%

Modeling of Data Communication Networks using Dynamic Complex Networks and its Performance Studies

Kumari

Singh

2016

Complex Networks &Amp; Their Applications V

Self Cite

View full text Add to dashboard Cite

All the existing real world networks are evolving, hence, study of traffic dynamics in these enlarged networks is a challenging task. The critical issue is to optimize the network structure to improve network capacity and avoid traffic congestion. We are interested in taking user's routes such that it is least congested with optimal network capacity. Network capacity may be improved either by optimizing network topology or enhancing in routing approach. In this context, we propose and design a model of the time varying data communication networks (TVCN) based on the dynamics of in-flowing links. Newly appeared node prefers to attach with most influential node present in the network. In this paper, influence is termed as reputation and is applied for computing overall congestion at any node. User path with least betweenness centrality and most reputation is preferred for routing. Kelly's optimization formulation for a rate allocation problem is used for obtaining optimal rates of distinct users at different time instants and it is found that the user's path with lowest betweenness centrality and highest reputation will always give maximum rate at stable point.

show abstract

Section: Optimization Of Network Topologymentioning

confidence: 99%

Modeling of Data Communication Networks using Dynamic Complex Networks and its Performance Studies

Kumari

Singh

2016

Complex Networks &Amp; Their Applications V

Self Cite

View full text Add to dashboard Cite

show abstract

“…A new node has access to a fraction of nodes and a new connection is formed with the known set of nodes with a probability proportional to the degree of the node. A framework to represent mobile networks dynamically in a Spatio-temporal fashion is designed and algebraic structural representation is also provided by [12].…”

mentioning

confidence: 99%

Fair end‐to‐end window‐based congestion control in time‐varying data communication networks

Kumari

Singh

2019

Int J Communication

Self Cite

View full text Add to dashboard Cite

Communication networks are time-varying and hence, fair sharing of network resources among the users in such dynamic environment is a challenging task. In this context, a time-varying network model is designed and shortest user's route is found. In the designed network model, an end to end window-based congestion control scheme is developed with the help of internal nodes or router and the end user can get implicit feedback (RTT and throughput). This scheme is considered as fair if the allocation of resources among users minimizes overall congestion or backlog in the networks. Window update approach is based on multi-class fluid model and is updated dynamically by considering delays (communication, propagation and queuing) and the backlog of packets in the user's routes. Convergence and stability of the window size are obtained using a Lyapunov function. A comparative study with other window-based methods is also provided. IntroductionReal life systems such as communication, social, biological can be described with the help of complex networks [1,2]. It is a challenging task to design a time-varying communication network (TVCN) with the ability to respond to the randomly changing traffic. Hence, the study of the traffic dynamics and fair sharing of resources on communication networks has received a great wave of interest for the researchers in past few years. The allocation of resources among the users in an unbiased manner is one of the challenging tasks in today's scenario. For assigning resources in an unbiased or fair manner, some researchers use various rate vector allocation schemes [3,4] to gain maximum utility while others select fair end to end window-based congestion control scheme [5,4]. In this paper, we are interested to design a TVCN model considering network growth, redistribution of traffic from heavily loaded nodes and removal of some fraction of links to reduce maintenance cost. A window-based congestion control scheme may be applied on the proposed TVCN model and user's current window size may be updated by considering delays(communication, propagation and queuing delays).Communication networks are evolving and the concept of evolving networks with preferential linking during the addition of new nodes is introduced by Barabasi-Albert ([6]). The distribution of degrees of nodes in these networks follow the power law and is termed as scale free nature of the networks. Many time-varying graph (TVG) models are proposed [7,8]. A series of static graphs (i.e., the snapshots) is used to represent the network at a given time instant [9]. Wehmuth et al. [7] proposed a new unifying model for representing finite discrete TVGs. A framework is designed to obtain degree distribution of evolving network with the consideration of deletion of nodes and a continuum formulation is also provided by [10]. A preferential attachment model for network growth is proposed where a new node has partial information about the network [11]. A new node has access to a fraction of nodes and a new connection is formed with the...

show abstract

Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks

Kumari¹,

Singh²,

Cherifi³

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Towards A Framework for Rate Control on Dynamic Communication Networks

Cited by 4 publications

References 16 publications

Modeling of Data Communication Networks using Dynamic Complex Networks and its Performance Studies

Modeling of Data Communication Networks using Dynamic Complex Networks and its Performance Studies

Fair end‐to‐end window‐based congestion control in time‐varying data communication networks

Optimal Local Routing Strategies for Community Structured Time Varying Communication Networks

Contact Info

Product

Resources

About