Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Daniel Philip Venmani

dblp:50/11260 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network management and operations · 32% Network optimization and economics · 32% Software-defined and programmable networks · 16%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource sharing
bandwidth sharing
0.212013
OpenRoutes: augmenting backhaul network survivability with reduced redundancy- a topology based analysis · MobiCom 2013
Physical-layer communications › cooperative communication
cooperative routing
0.212013
OpenRoutes: augmenting backhaul network survivability with reduced redundancy- a topology based analysis · MobiCom 2013
Network management and operations
failure recovery
0.212013
OpenRoutes: augmenting backhaul network survivability with reduced redundancy- a topology based analysis · MobiCom 2013
Software-defined and programmable networks › control plane
logically centralized control
0.212013
Stitch-n-Sync: Discreetly disclosing topology information using logically centralized controllers · ICNP 2013
Network optimization and economics
resource allocation
0.212013
OpenRoutes: augmenting backhaul network survivability with reduced redundancy- a topology based analysis · MobiCom 2013
Cellular and mobile networks
wireless backhaul
0.012013
OpenRoutes: augmenting backhaul network survivability with reduced redundancy- a topology based analysis · MobiCom 2013

Methods — techniques the papers use, named apart from their topics

simulation · 0.3topology-based analysis · 0.2
YearPublicationVenuePosition
2015 On Improving Clock Synchronization Accuracy for LTE-A Networks
abstract
The need to synchronize wireless networks very accurately is slowly but steadily gaining importance recently among the research community as well as network operational teams. This is due to the rapid advancement of wireless access technologies like the LTE-A, 5G, etc. Within this context, in this paper we propose, design, evaluate a model based reinforcement learning algorithm that aim to improve network clock synchronization accuracy suitable for future networks. The proposed algorithm embraces a new metric which identifies asymmetric links in the backhaul networks in advance and prevents re-routing of timing packets via these links. By this, we claim that link asymmetry delays (LADs) which is a major cause for poor timing accuracy could be eliminated. Experimental results are presented to show the effectiveness of our approach
Daniel Philip Venmani, Arai Kaoru
VTC Fall1
2014 Cross-control: A scalable multi-topology fault restoration mechanism using logically centralized controllers
abstract
Logically centralized network control design enables data-plane and control-plane separation in communication networks. Until today, traditional fault restoration mechanisms based on such designs were restricted to ‘one’ centralized network manager to detect faults and manually reroute traffic around effected areas. Nonetheless, this design is challenged by the overall scalability, restoration latency and convergence delay of the physically centralized controller. As a result, in this paper we argue that one can do a far more efficient network design. Here we propose, model, and design the problem of placing multiple centralized controllers, among multiple network topologies, so as to maximize the resilience and scalability of such networks- within the bounds of convergence delay. We begin with formal model definitions to optimize the controller placement locations. Based on the model, new ILP formulations have been defined. Subsequently, a simple but efficient greedy based heuristics has been proposed to solve the ILP. Performances are quantitatively evaluated and our results show significant reliability improvements in a given topology.
Daniel Philip Venmani, Yvon Gourhant
HPSR1
2014 Low-cost wireless network architecture for developing countries
abstract
The emergence of Internet access and advanced wireless technologies has its limitations across the globe, i.e. today there exist several rural regions, especially in developing countries, that do not afford Internet connectivity. In this paper, we present a design of a cost-effective wireless network architecture that aims at providing Internet in fix-usage within those countries. We claim that with few design changes to the 3GPP architecture, it is possible to extend Internet connectivity within suburban and rural areas by deploying numerous hotspots based on sharing tasks and revenues with local actors.
Yvon Gourhant, Elena Lukashova, Malla Reddy Sama, Sherif Abdel Wahed, Djamal-Eddine Meddour, Daniel Philip Venmani
I4CS6
2013 Stitch-n-Sync: Discreetly disclosing topology information using logically centralized controllers
abstract
Competitive Mobile Network Operators (MNOs) are typically long-known for their shrewdness to conceal their underlying network topology information. Having said this, in this article, we propose a quasi-distributed topology information sharing framework for network operators based on logically centralized controllers. Through our approach, we present a topology information sharing scheme in which two or more MNOs can cooperatively and more importantly, discreetly reveal their topology information for the sake of utilizing the unused available resources of each other, at times of network failure situations. Our approach has been formulated and developed based on a novel key metric to ‘tune’ the amount of information sharing. Based on extensive simulations, we then investigate the impacts of network topology information sharing on the network capacity. The overall feasibility is illustrated through significant numerical results.
Daniel Philip Venmani, Yvon Gourhant, Djamal Zeghlache
ICNP1
2013 OpenRoutes: augmenting backhaul network survivability with reduced redundancy- a topology based analysis
abstract
In this article we illustrate that, management of network resources can yield notably different performances leading to different restoration behaviors -- for different network topologies. In consideration towards this, we first briefly summarize our earlier work on a novel fault restoration mechanism. The proposed mechanism addresses the problem of finding the minimum bandwidth cooperative route in the backhaul of mobile network operators that is shared among multiple operators. We then present our recent results on the extended performance evaluations of the same, for four different synthetic network topologies carried out using extensive simulations. Through these evaluations, we conclude on the best topology that mobile network operators should construct in order for them to maximally benefit by the proposed cooperative routing scheme to yield optimum performance for their capital expenditure.
Daniel Philip Venmani, Yvon Gourhant, Djamal Zeghlache
MobiCom1
2012 Divide and share: A new approach for optimizing backup resource allocation in LTE mobile networks backhaul
Daniel Philip Venmani, Yvon Gourhant, Djamal Zeghlache
CNSM1
2012 Give and Take: Characterization of Availability of Multi-State Wireless Backhaul Networks
abstract
In this paper, we provide a new availability analysis of backhaul wireless communication networks which are supported by microwave links which evolved out of sharing between two different mobile network operators (MNOs) based on the Multi-State System (MSS) approach using Discrete-state Continuous-time Markov chain model. Our results show that such a jointly- constructed network was available to meet the required demand of the total system more than 99.8 % of the time.
Daniel Philip Venmani, Yvon Gourhant, Djamal Zeghlache
VTC Fall1