for Journals by Title or ISSN
for Articles by Keywords

Publisher: Springer-Verlag (Total: 2351 journals)

 A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Showing 1 - 200 of 2351 Journals sorted alphabetically
3D Research     Hybrid Journal   (Followers: 19, SJR: 0.214, h-index: 10)
4OR: A Quarterly J. of Operations Research     Hybrid Journal   (Followers: 10, SJR: 1.073, h-index: 25)
AAPS J.     Hybrid Journal   (Followers: 22, SJR: 1.192, h-index: 74)
AAPS PharmSciTech     Hybrid Journal   (Followers: 7, SJR: 0.718, h-index: 54)
Abdominal Imaging     Hybrid Journal   (Followers: 14, SJR: 0.723, h-index: 60)
Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg     Hybrid Journal   (Followers: 3, SJR: 0.447, h-index: 12)
Academic Psychiatry     Full-text available via subscription   (Followers: 23, SJR: 0.492, h-index: 32)
Academic Questions     Hybrid Journal   (Followers: 8, SJR: 0.135, h-index: 6)
Accreditation and Quality Assurance: J. for Quality, Comparability and Reliability in Chemical Measurement     Hybrid Journal   (Followers: 26, SJR: 0.378, h-index: 30)
Acoustical Physics     Hybrid Journal   (Followers: 11, SJR: 0.355, h-index: 20)
Acoustics Australia     Hybrid Journal  
Acta Analytica     Hybrid Journal   (Followers: 7, SJR: 0.387, h-index: 6)
Acta Applicandae Mathematicae     Hybrid Journal   (Followers: 1, SJR: 0.624, h-index: 34)
Acta Biotheoretica     Hybrid Journal   (Followers: 4, SJR: 0.419, h-index: 25)
Acta Diabetologica     Hybrid Journal   (Followers: 16, SJR: 1.318, h-index: 46)
Acta Endoscopica     Hybrid Journal   (Followers: 1, SJR: 0.113, h-index: 8)
acta ethologica     Hybrid Journal   (Followers: 4, SJR: 0.465, h-index: 23)
Acta Geochimica     Hybrid Journal   (Followers: 7)
Acta Geodaetica et Geophysica     Hybrid Journal   (Followers: 2, SJR: 0.294, h-index: 13)
Acta Geotechnica     Hybrid Journal   (Followers: 7, SJR: 1.818, h-index: 22)
Acta Informatica     Hybrid Journal   (Followers: 5, SJR: 0.524, h-index: 32)
Acta Mathematica     Hybrid Journal   (Followers: 11, SJR: 8.021, h-index: 47)
Acta Mathematica Hungarica     Hybrid Journal   (Followers: 2, SJR: 0.53, h-index: 29)
Acta Mathematica Sinica, English Series     Hybrid Journal   (Followers: 6, SJR: 0.406, h-index: 30)
Acta Mathematica Vietnamica     Hybrid Journal   (SJR: 0.451, h-index: 5)
Acta Mathematicae Applicatae Sinica, English Series     Hybrid Journal   (SJR: 0.22, h-index: 20)
Acta Mechanica     Hybrid Journal   (Followers: 20, SJR: 0.898, h-index: 52)
Acta Mechanica Sinica     Hybrid Journal   (Followers: 5, SJR: 0.426, h-index: 29)
Acta Metallurgica Sinica (English Letters)     Hybrid Journal   (Followers: 6, SJR: 0.525, h-index: 18)
Acta Meteorologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.524, h-index: 14)
Acta Neurochirurgica     Hybrid Journal   (Followers: 6, SJR: 0.833, h-index: 73)
Acta Neurologica Belgica     Hybrid Journal   (Followers: 1, SJR: 0.348, h-index: 27)
Acta Neuropathologica     Hybrid Journal   (Followers: 5, SJR: 6.61, h-index: 117)
Acta Oceanologica Sinica     Hybrid Journal   (Followers: 3, SJR: 0.295, h-index: 17)
Acta Parasitologica     Hybrid Journal   (Followers: 10, SJR: 0.581, h-index: 28)
Acta Physiologiae Plantarum     Hybrid Journal   (Followers: 2, SJR: 0.551, h-index: 39)
Acta Politica     Hybrid Journal   (Followers: 13, SJR: 0.658, h-index: 20)
Activitas Nervosa Superior     Hybrid Journal  
adhäsion KLEBEN & DICHTEN     Hybrid Journal   (Followers: 5, SJR: 0.103, h-index: 4)
ADHD Attention Deficit and Hyperactivity Disorders     Hybrid Journal   (Followers: 23, SJR: 0.871, h-index: 15)
Adhesion Adhesives & Sealants     Hybrid Journal   (Followers: 8)
Administration and Policy in Mental Health and Mental Health Services Research     Partially Free   (Followers: 15, SJR: 0.795, h-index: 40)
Adsorption     Hybrid Journal   (Followers: 4, SJR: 0.774, h-index: 52)
Advances in Applied Clifford Algebras     Hybrid Journal   (Followers: 3, SJR: 0.319, h-index: 15)
Advances in Atmospheric Sciences     Hybrid Journal   (Followers: 35, SJR: 0.959, h-index: 44)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 18, SJR: 1.255, h-index: 44)
Advances in Contraception     Hybrid Journal   (Followers: 3)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 54, SJR: 1.113, h-index: 14)
Advances in Gerontology     Partially Free   (Followers: 8, SJR: 0.141, h-index: 3)
Advances in Health Sciences Education     Hybrid Journal   (Followers: 25, SJR: 1.397, h-index: 42)
Advances in Manufacturing     Hybrid Journal   (Followers: 3, SJR: 0.2, h-index: 4)
Advances in Polymer Science     Hybrid Journal   (Followers: 43, SJR: 0.637, h-index: 89)
Advances in Therapy     Hybrid Journal   (Followers: 5, SJR: 0.79, h-index: 44)
Aegean Review of the Law of the Sea and Maritime Law     Hybrid Journal   (Followers: 7)
Aequationes Mathematicae     Hybrid Journal   (Followers: 2, SJR: 0.882, h-index: 23)
Aerobiologia     Hybrid Journal   (Followers: 2, SJR: 0.511, h-index: 36)
Aesthetic Plastic Surgery     Hybrid Journal   (Followers: 9, SJR: 0.821, h-index: 49)
African Archaeological Review     Hybrid Journal   (Followers: 16, SJR: 0.612, h-index: 24)
Afrika Matematika     Hybrid Journal   (Followers: 1, SJR: 0.248, h-index: 6)
AGE     Hybrid Journal   (Followers: 7, SJR: 1.358, h-index: 33)
Ageing Intl.     Hybrid Journal   (Followers: 7, SJR: 0.337, h-index: 10)
Aggiornamenti CIO     Hybrid Journal   (Followers: 1)
Aging Clinical and Experimental Research     Hybrid Journal   (Followers: 2, SJR: 0.529, h-index: 55)
Agricultural Research     Hybrid Journal   (Followers: 4)
Agriculture and Human Values     Hybrid Journal   (Followers: 14, SJR: 1.197, h-index: 49)
Agroforestry Systems     Hybrid Journal   (Followers: 19, SJR: 0.64, h-index: 56)
Agronomy for Sustainable Development     Hybrid Journal   (Followers: 11, SJR: 1.732, h-index: 59)
AI & Society     Hybrid Journal   (Followers: 6, SJR: 0.171, h-index: 19)
AIDS and Behavior     Hybrid Journal   (Followers: 13, SJR: 2.006, h-index: 71)
Air Quality, Atmosphere & Health     Hybrid Journal   (Followers: 4, SJR: 0.706, h-index: 19)
Akupunktur & Aurikulomedizin     Full-text available via subscription   (Followers: 1)
Algebra and Logic     Hybrid Journal   (Followers: 4, SJR: 0.566, h-index: 18)
Algebra Universalis     Hybrid Journal   (Followers: 2, SJR: 0.388, h-index: 22)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1, SJR: 0.868, h-index: 20)
Algorithmica     Hybrid Journal   (Followers: 8, SJR: 0.898, h-index: 56)
Allergo J.     Full-text available via subscription   (Followers: 1, SJR: 0.183, h-index: 20)
Allergo J. Intl.     Hybrid Journal   (Followers: 2)
Alpine Botany     Hybrid Journal   (Followers: 5, SJR: 0.729, h-index: 20)
ALTEX : Alternatives to Animal Experimentation     Open Access   (Followers: 3, SJR: 1.392, h-index: 32)
AMBIO     Hybrid Journal   (Followers: 15, SJR: 1.094, h-index: 87)
American J. of Cardiovascular Drugs     Hybrid Journal   (Followers: 16, SJR: 0.864, h-index: 39)
American J. of Community Psychology     Hybrid Journal   (Followers: 26, SJR: 1.237, h-index: 83)
American J. of Criminal Justice     Hybrid Journal   (Followers: 8, SJR: 0.634, h-index: 13)
American J. of Cultural Sociology     Hybrid Journal   (Followers: 15, SJR: 0.283, h-index: 3)
American J. of Dance Therapy     Hybrid Journal   (Followers: 4, SJR: 0.175, h-index: 13)
American J. of Potato Research     Hybrid Journal   (Followers: 3, SJR: 0.558, h-index: 35)
American J. of Psychoanalysis     Hybrid Journal   (Followers: 22, SJR: 0.293, h-index: 13)
American Sociologist     Hybrid Journal   (Followers: 14, SJR: 0.18, h-index: 13)
Amino Acids     Hybrid Journal   (Followers: 8, SJR: 1.362, h-index: 83)
AMS Review     Partially Free   (Followers: 4)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 7, SJR: 0.21, h-index: 37)
Analysis and Mathematical Physics     Hybrid Journal   (Followers: 4, SJR: 0.665, h-index: 7)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Analysis of Verbal Behavior     Hybrid Journal   (Followers: 5)
Analytical and Bioanalytical Chemistry     Hybrid Journal   (Followers: 31, SJR: 1.096, h-index: 123)
Anatomical Science Intl.     Hybrid Journal   (Followers: 2, SJR: 0.301, h-index: 26)
Angewandte Schmerztherapie und Palliativmedizin     Hybrid Journal  
Angiogenesis     Hybrid Journal   (Followers: 3, SJR: 2.212, h-index: 69)
Animal Cognition     Hybrid Journal   (Followers: 17, SJR: 1.122, h-index: 55)
Annales françaises de médecine d'urgence     Hybrid Journal   (Followers: 1, SJR: 0.156, h-index: 4)
Annales Henri Poincaré     Hybrid Journal   (Followers: 3, SJR: 1.377, h-index: 32)
Annales mathématiques du Québec     Hybrid Journal   (Followers: 4)
Annali dell'Universita di Ferrara     Hybrid Journal   (SJR: 0.504, h-index: 14)
Annali di Matematica Pura ed Applicata     Hybrid Journal   (Followers: 1, SJR: 1.167, h-index: 26)
Annals of Behavioral Medicine     Hybrid Journal   (Followers: 14, SJR: 2.112, h-index: 98)
Annals of Biomedical Engineering     Hybrid Journal   (Followers: 18, SJR: 1.182, h-index: 94)
Annals of Combinatorics     Hybrid Journal   (Followers: 3, SJR: 0.849, h-index: 15)
Annals of Data Science     Hybrid Journal   (Followers: 11)
Annals of Dyslexia     Hybrid Journal   (Followers: 10, SJR: 0.857, h-index: 40)
Annals of Finance     Hybrid Journal   (Followers: 28, SJR: 0.686, h-index: 14)
Annals of Forest Science     Hybrid Journal   (Followers: 6, SJR: 0.929, h-index: 57)
Annals of Global Analysis and Geometry     Hybrid Journal   (Followers: 1, SJR: 1.136, h-index: 23)
Annals of Hematology     Hybrid Journal   (Followers: 16, SJR: 1.117, h-index: 62)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 12, SJR: 0.593, h-index: 42)
Annals of Microbiology     Hybrid Journal   (Followers: 10, SJR: 0.402, h-index: 26)
Annals of Nuclear Medicine     Hybrid Journal   (Followers: 4, SJR: 0.68, h-index: 45)
Annals of Operations Research     Hybrid Journal   (Followers: 10, SJR: 1.186, h-index: 78)
Annals of Ophthalmology     Hybrid Journal   (Followers: 12)
Annals of Regional Science     Hybrid Journal   (Followers: 8, SJR: 0.405, h-index: 42)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
Annals of Solid and Structural Mechanics     Hybrid Journal   (Followers: 10, SJR: 0.553, h-index: 8)
Annals of Surgical Oncology     Hybrid Journal   (Followers: 14, SJR: 1.902, h-index: 127)
Annals of Telecommunications     Hybrid Journal   (Followers: 8, SJR: 0.315, h-index: 25)
Annals of the Institute of Statistical Mathematics     Hybrid Journal   (Followers: 1, SJR: 0.931, h-index: 31)
Antonie van Leeuwenhoek     Hybrid Journal   (Followers: 5, SJR: 0.992, h-index: 87)
Apidologie     Hybrid Journal   (Followers: 4, SJR: 1.14, h-index: 57)
APOPTOSIS     Hybrid Journal   (Followers: 8, SJR: 1.554, h-index: 87)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2, SJR: 0.354, h-index: 27)
Applications of Mathematics     Hybrid Journal   (Followers: 1, SJR: 0.274, h-index: 20)
Applied Biochemistry and Biotechnology     Hybrid Journal   (Followers: 42, SJR: 0.575, h-index: 80)
Applied Biochemistry and Microbiology     Hybrid Journal   (Followers: 16, SJR: 0.267, h-index: 26)
Applied Cancer Research     Open Access  
Applied Categorical Structures     Hybrid Journal   (Followers: 2, SJR: 0.361, h-index: 21)
Applied Composite Materials     Hybrid Journal   (Followers: 48, SJR: 0.705, h-index: 35)
Applied Entomology and Zoology     Partially Free   (Followers: 3, SJR: 0.554, h-index: 34)
Applied Geomatics     Hybrid Journal   (Followers: 4, SJR: 0.323, h-index: 9)
Applied Geophysics     Hybrid Journal   (Followers: 8, SJR: 0.541, h-index: 13)
Applied Intelligence     Hybrid Journal   (Followers: 11, SJR: 0.777, h-index: 43)
Applied Magnetic Resonance     Hybrid Journal   (Followers: 4, SJR: 0.358, h-index: 34)
Applied Mathematics & Optimization     Hybrid Journal   (Followers: 6, SJR: 0.955, h-index: 33)
Applied Mathematics - A J. of Chinese Universities     Hybrid Journal   (SJR: 0.275, h-index: 8)
Applied Mathematics and Mechanics     Hybrid Journal   (Followers: 5, SJR: 0.37, h-index: 26)
Applied Microbiology and Biotechnology     Hybrid Journal   (Followers: 62, SJR: 1.262, h-index: 161)
Applied Physics A     Hybrid Journal   (Followers: 8, SJR: 0.535, h-index: 121)
Applied Physics B: Lasers and Optics     Hybrid Journal   (Followers: 24, SJR: 0.983, h-index: 104)
Applied Psychophysiology and Biofeedback     Hybrid Journal   (Followers: 8, SJR: 0.677, h-index: 47)
Applied Research in Quality of Life     Hybrid Journal   (Followers: 11, SJR: 0.288, h-index: 15)
Applied Solar Energy     Hybrid Journal   (Followers: 18, SJR: 0.251, h-index: 6)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 5, SJR: 0.351, h-index: 9)
Aquaculture Intl.     Hybrid Journal   (Followers: 22, SJR: 0.613, h-index: 40)
Aquarium Sciences and Conservation     Hybrid Journal   (Followers: 1)
Aquatic Ecology     Hybrid Journal   (Followers: 32, SJR: 0.646, h-index: 44)
Aquatic Geochemistry     Hybrid Journal   (Followers: 4, SJR: 0.764, h-index: 39)
Aquatic Sciences     Hybrid Journal   (Followers: 13, SJR: 1.172, h-index: 53)
Arabian J. for Science and Engineering     Hybrid Journal   (Followers: 5, SJR: 0.345, h-index: 20)
Arabian J. of Geosciences     Hybrid Journal   (Followers: 1, SJR: 0.417, h-index: 16)
Archaeological and Anthropological Sciences     Hybrid Journal   (Followers: 23, SJR: 1.056, h-index: 15)
Archaeologies     Hybrid Journal   (Followers: 12, SJR: 0.397, h-index: 13)
Archiv der Mathematik     Hybrid Journal   (Followers: 1, SJR: 0.597, h-index: 29)
Archival Science     Hybrid Journal   (Followers: 56, SJR: 0.804, h-index: 22)
Archive for History of Exact Sciences     Hybrid Journal   (Followers: 8, SJR: 0.28, h-index: 15)
Archive for Mathematical Logic     Hybrid Journal   (Followers: 1, SJR: 0.946, h-index: 23)
Archive for Rational Mechanics and Analysis     Hybrid Journal   (SJR: 4.091, h-index: 66)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 5, SJR: 0.865, h-index: 40)
Archives and Museum Informatics     Hybrid Journal   (Followers: 142)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5, SJR: 2.841, h-index: 40)
Archives of Dermatological Research     Hybrid Journal   (Followers: 7, SJR: 0.9, h-index: 65)
Archives of Environmental Contamination and Toxicology     Hybrid Journal   (Followers: 13, SJR: 0.846, h-index: 84)
Archives of Gynecology and Obstetrics     Hybrid Journal   (Followers: 16, SJR: 0.695, h-index: 47)
Archives of Microbiology     Hybrid Journal   (Followers: 8, SJR: 0.702, h-index: 85)
Archives of Orthopaedic and Trauma Surgery     Hybrid Journal   (Followers: 8, SJR: 1.039, h-index: 56)
Archives of Osteoporosis     Hybrid Journal   (Followers: 2, SJR: 1.092, h-index: 13)
Archives of Sexual Behavior     Hybrid Journal   (Followers: 10, SJR: 1.198, h-index: 74)
Archives of Toxicology     Hybrid Journal   (Followers: 17, SJR: 1.595, h-index: 76)
Archives of Virology     Hybrid Journal   (Followers: 5, SJR: 1.086, h-index: 90)
Archives of Women's Mental Health     Hybrid Journal   (Followers: 14, SJR: 1.264, h-index: 50)
Archivio di Ortopedia e Reumatologia     Hybrid Journal  
Archivum Immunologiae et Therapiae Experimentalis     Hybrid Journal   (Followers: 2, SJR: 1.2, h-index: 42)
ArgoSpine News & J.     Hybrid Journal   (SJR: 0.102, h-index: 3)
Argumentation     Hybrid Journal   (Followers: 5, SJR: 0.295, h-index: 18)
Arid Ecosystems     Hybrid Journal   (Followers: 3)
Arkiv för Matematik     Hybrid Journal   (Followers: 1, SJR: 0.948, h-index: 22)
Arnold Mathematical J.     Hybrid Journal   (Followers: 1)
Arthropod-Plant Interactions     Hybrid Journal   (Followers: 2, SJR: 0.797, h-index: 17)
Arthroskopie     Hybrid Journal   (Followers: 1, SJR: 0.145, h-index: 8)
Artificial Intelligence and Law     Hybrid Journal   (Followers: 11, SJR: 0.288, h-index: 25)
Artificial Intelligence Review     Hybrid Journal   (Followers: 14, SJR: 0.948, h-index: 48)
Artificial Life and Robotics     Hybrid Journal   (Followers: 8, SJR: 0.231, h-index: 14)
Asia Europe J.     Hybrid Journal   (Followers: 5, SJR: 0.247, h-index: 9)
Asia Pacific Education Review     Hybrid Journal   (Followers: 12, SJR: 0.371, h-index: 17)
Asia Pacific J. of Management     Hybrid Journal   (Followers: 16, SJR: 1.676, h-index: 50)
Asia-Pacific Education Researcher     Hybrid Journal   (Followers: 12, SJR: 0.353, h-index: 13)
Asia-Pacific Financial Markets     Hybrid Journal   (Followers: 2, SJR: 0.19, h-index: 15)
Asia-Pacific J. of Atmospheric Sciences     Hybrid Journal   (Followers: 20, SJR: 1.006, h-index: 14)
Asian Business & Management     Hybrid Journal   (Followers: 8, SJR: 0.41, h-index: 10)
Asian J. of Business Ethics     Hybrid Journal   (Followers: 8)
Asian J. of Criminology     Hybrid Journal   (Followers: 5, SJR: 0.263, h-index: 8)
AStA Advances in Statistical Analysis     Hybrid Journal   (Followers: 2, SJR: 0.681, h-index: 15)
AStA Wirtschafts- und Sozialstatistisches Archiv     Hybrid Journal   (Followers: 5, SJR: 0.195, h-index: 5)
ästhetische dermatologie & kosmetologie     Full-text available via subscription  

        1 2 3 4 5 6 7 8 | Last   [Sort by number of followers]   [Restore default list]

Journal Cover Annals of Telecommunications
  [SJR: 0.315]   [H-I: 25]   [8 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1958-9395 - ISSN (Online) 0003-4347
   Published by Springer-Verlag Homepage  [2351 journals]
  • Design of reliable communication networks
    • Authors: Eric Gourdin; Deep Medhi; Achille Pattavina
      Pages: 1 - 3
      PubDate: 2018-02-01
      DOI: 10.1007/s12243-017-0624-1
      Issue No: Vol. 73, No. 1-2 (2018)
  • k -node-disjoint hop-constrained survivable networks: polyhedral analysis
           and branch and cut
    • Authors: Ibrahima Diarrassouba; Meriem Mahjoub; A. Ridha Mahjoub; Hande Yaman
      Pages: 5 - 28
      Abstract: Given a graph with weights on the edges, a set of origin and destination pairs of nodes, and two integers L ≥ 2 and k ≥ 2, the k-node-disjoint hop-constrained network design problem is to find a minimum weight subgraph of G such that between every origin and destination there exist at least k node-disjoint paths of length at most L. In this paper, we consider this problem from a polyhedral point of view. We propose an integer linear programming formulation for the problem for L ∈{2,3} and arbitrary k, and investigate the associated polytope. We introduce new valid inequalities for the problem for L ∈{2,3,4}, and give necessary and sufficient conditions for these inequalities to be facet defining. We also devise separation algorithms for these inequalities. Using these results, we propose a branch-and-cut algorithm for solving the problem for both L = 3 and L = 4 along with some computational results.
      PubDate: 2018-02-01
      DOI: 10.1007/s12243-017-0622-3
      Issue No: Vol. 73, No. 1-2 (2018)
  • Mixed integer optimization for the combined capacitated facility
           location-routing problem
    • Authors: Dimitri Papadimitriou; Didier Colle; Piet Demeester
      Pages: 37 - 62
      Abstract: This paper combines the multi-product variant of the capacitated facility location problem with multicommodity flow routing. This problem shares many similarities with the digital content placement and retrieval problem when minimizing the cost of installing a set of servers for storing multiple sets of data objects (files) and connecting clients to them in order to satisfy their demands while accounting for the induced arc load. However, the regular formulation of the facility location problem models the cost of allocating the demand originated by individual clients independently of the others. The combination of this problem with flow routing removes the demand allocation independence property, leading to strongly interrelated facility location and routing decisions. Moreover, involving multiple types of data objects yields facility capacity constraints with a more complex structure than the simple superposition of per-product constraints. This paper proposes a mixed integer programming formulation for this combined problem and evaluate the computational performance for solving it. Experimental results obtained with this combined formulation are provided and compared with those obtained when solving these two problems sequentially. With the latter, the routing cost increases (up to doubling) or the facility installation cost increases (up to requiring more than twice the number of facilities) compared to the cost values obtained by solving the combined problem. This paper also extends the combined model with demand rerouting to evaluate its cost gain compared to demand protection as provided by the reliable facility location model. The results obtained with the combined formulation indicate that when subject to representative failure probabilities, demand rerouting can significantly outperform demand protection up to a factor four.
      PubDate: 2018-02-01
      DOI: 10.1007/s12243-017-0620-5
      Issue No: Vol. 73, No. 1-2 (2018)
  • Provisioning dynamic and critical demand structures for geographically
           correlated failures
    • Authors: M. Todd Gardner; Yufei Cheng; Cory Beard; James P. G. Sterbenz; Deep Medhi
      Pages: 111 - 125
      Abstract: During disasters and other geographically correlated failures, the local telecommunications infrastructure undergoes a unique set of challenges. First, the telecommunications infrastructure is typically damaged reducing the capability to sustain the normal level of demands on the networks. Second, the demands on the telecommunications infrastructure increase typically by an order of magnitude. This is both for critical demands and non-critical demands. Third, critical demands, which may now be used to support disaster first responder and recovery efforts take on a crucial role. In this work, we propose multi-situational linear programming techniques to create disaster modes that take advantage of the non-coincidence of disasters in different geographic areas simultaneously reducing cost and improving restoration of demands during disasters. We also propose efficient heuristics to provision for disasters at a lower cost than standard provisioning with 1 + 1 redundancy. Additionally, we use diverse routing techniques to reduce the likelihood of damage to critical services. The restoration of demands during disasters also presents challenges for network provisioners. We present both heuristic and linear programming methods to assist with restoration of services in stressed network environments giving critical demands priority. Finally, service level agreements (SLAs) are used to provide a framework for these concepts.
      PubDate: 2018-02-01
      DOI: 10.1007/s12243-017-0618-z
      Issue No: Vol. 73, No. 1-2 (2018)
  • Geo-aware erasure coding for high-performance erasure-coded storage
    • Authors: Lakshmi J. Mohan; Pablo Ignacio Serrano Caneleo; Udaya Parampalli; Aaron Harwood
      Pages: 139 - 152
      Abstract: Erasure code-based distributed storage systems are increasingly being used by storage providers for big data storage since they offer the same reliability as replication with a significant decrease in the amount of storage required. But, when it comes to a storage system with data nodes spread across a very large geographical area, the node’s recovery performance is affected by various factors that are both network and computation related. In this paper, we present a XOR-based code supplemented with the ideas of parity duplication and rack awareness that could be adopted in such storage clusters to improve the recovery performance during node failures and compare it with popular implementations of erasure codes, namely Facebook’s Reed-Solomon codes and XORBAS local recovery codes. The code performance along with the proposed ideas are evaluated on a geo-diverse cluster deployed on the NeCTAR research cloud. We also present a scheme for intelligently placing blocks of coded storage depending on the design of the code, inspired by local reconstruction codes. The sum of all these propositions could offer a better solution for applications that are deployed on coded storage systems that are geographically distributed, in which storage constraints make triple replication not affordable, at the same time ensuring minimal recovery time is a strict requirement.
      PubDate: 2018-02-01
      DOI: 10.1007/s12243-017-0623-2
      Issue No: Vol. 73, No. 1-2 (2018)
  • Raptor : a network tool for mitigating the impact of spatially correlated
           failures in infrastructure networks
    • Authors: Arun Das; Arunabha Sen; Chunming Qiao; Nasir Ghani; Nathalie Mitton
      Pages: 153 - 164
      Abstract: Current practices of fault-tolerant network design ignore the fact that most network infrastructure faults are localized or spatially correlated (i.e., confined to geographic regions). Network operators require new tools to mitigate the impact of such region-based faults on their infrastructures. Utilizing the support from the U.S. Department of Defense, and by consolidating a wide range of theories and solutions developed in the last few years, the authors of this paper have developed Raptor, an advanced Network Planning and Management Tool that facilitates the design and provisioning of robust and resilient networks. The tool provides multi-faceted network design, evaluation, and simulation capabilities for network planners. Future extensions of the tool currently being worked upon not only expand the tool’s capabilities, but also extend these capabilities to heterogeneous interdependent networks such as communication, power, water, and satellite networks.
      PubDate: 2018-02-01
      DOI: 10.1007/s12243-017-0609-0
      Issue No: Vol. 73, No. 1-2 (2018)
  • A survey on the communication and network enablers for cloud-based
           services: state of the art, challenges, and opportunities
    • Authors: George Patrick Xavier; Burak Kantarci
      Abstract: The wide adoption of the cloud computing concept has resulted in major impacts in both fixed and mobile communication networks leading to cutting-edge research to provide appropriate network architecture and protocols, along with resource management mechanisms. Cloud computing research has been witnessing the interplay between the system and communication aspects in order to offer powerful inter-networking and interoperability between the systems and networks. This paper reviews recent works focusing on architectural design issues, virtualization solutions, and challenges in cloud communications and networking. We mainly discuss the architectural challenges and solutions in today’s leading cloud communication technologies starting with network virtualization, software-defined networking (SDN), network function virtualization (NFV), and SDN-enabled NFV solutions. Furthermore, considering the benefits of cloud computing for mobile communications, we overview the cloud-RAN architecture for radio access networks, along with its support for various existing and future wireless communication technologies including future 5G wireless networks. We study each cloud communication technology by focusing on the existing works from the standpoint of objectives, challenges, and solutions. Furthermore, for all cloud communication concepts, we present a thorough discussion on the open issues and opportunities.
      PubDate: 2018-02-26
      DOI: 10.1007/s12243-018-0629-4
  • Average power allocation based sum-rate optimization in massive MIMO
    • Authors: Suresh Dahiya; Anil Kumar; Arun Kumar Singh
      Abstract: This paper exploits variations in the average channel gains in multi-cell multi-user massive multiple input multiple output (MIMO) systems. An average transmit power-control-based sum-rate optimization scheme is presented for the uplink of the system. The matched filtering (MF) and the zero forcing (ZF) processors are considered with perfect and imperfect channel state information at receiver (CSIR) under frequency flat Rayleigh fading channel. An average power-control-based system model is constructed for analyzing the sum-rate and formulating an optimization problem. A discrete level combinatorial optimization is performed for MF and ZF sum-rate under perfect and imperfect CSIR. The numerical results show a significant improvement in the sum-rate and power consumption. A low complexity algorithm for numerical optimization of the sum-rate is proposed. The performance of algorithm is quantified with different scenarios including different number of users, macro cells, and micro cells with low and high inter-cell interference powers. The evaluation results show that the improvement in sum-rate and energy efficiency increases with inter-cell interference power and the number of MTs.
      PubDate: 2018-02-12
      DOI: 10.1007/s12243-018-0628-5
  • Secure multiuser MISO communication systems with limited feedback link
    • Authors: Berna Özbek; Özgecan Özdoğan Şenol; Güneş Karabulut Kurt
      Abstract: Physical layer security is one of the promising techniques for the security of next-generation wireless systems. In this paper, we analyze the impact of the limited feedback link on the secrecy capacity for a system which includes a base station with multiple antennas, a single legitimate user selected from multiple active ones and multiple eavesdroppers. We propose to design a limited feedback link by reducing the feedback load and quantizing the channel state information (CSI) of legitimate users to establish a secure communication system. The feedback load is decreased with a self discrimination criterion at the legitimate users’ side while keeping the secrecy capacity constant. The best legitimate user is selected based on the quantized CSI through a limited feedback link. We also analyze the impact of CSI of eavesdroppers, which information may or may not be available at transmitter. In practical cases where eavesdroppers are passive and their location is not known by the transmitter, an artificial noise is used to disrupt their reception. When the CSI of eavesdroppers is known, the generalized singular value decomposition is applied. We illustrate the performance results of the proposed limited feedback link through the availability of CSI of eavesdroppers at the transmitter.
      PubDate: 2018-02-03
      DOI: 10.1007/s12243-018-0627-6
  • Cognitive-based multi-radio prototype for industrial environment
    • Authors: Michele Ligios; Maria Teresa Delgado; Davide Conzon; Rosaria Rossini; Francesco Sottile; Claudio Pastrone
      Abstract: Today, a large number of cost-saving and energy-efficient applications are enabled by wireless sensor and actuator networks (WSANs). Usually, these solutions have serious connectivity problems in scenarios where other wireless technologies are co-located sharing the frequency spectrum (e.g., industrial shop-floors). To cope with this issue, the concept of multi-radio (MR) has been introduced, which promotes the simultaneous use of multiple radio communication interfaces, leveraging their different characteristics, to improve the overall system performance and reliability. The proposed approach based on cognitive algorithm considers two wireless technologies operating at the 2.4-GHz frequency band, namely Wi-Fi and 6LoWPAN, and provides a concrete implementation of the system using a real test-bed industry scenario. The solution provides a reliable communication infrastructure for manufacturing processes, firstly combining the properties of several physical layer standards and secondly providing the ability to recover from temporary network failures by switching from a communication channel to another one.
      PubDate: 2018-01-29
      DOI: 10.1007/s12243-018-0626-7
  • Joint sensing time and power allocation in cognitive networks with
           amplify-and-forward cooperation
    • Authors: Shunling Ruan; Chengshi Zhao; Song Jiang; Kyungsup Kwak
      Abstract: Cognitive radio is a novel approach to cope with spectrum scarcity, in which either a network or a wireless node changes its transmission or reception parameters to communicate efficiently. However, it is difficult to avoid the interference between licensed and unlicensed users in various scenarios. This paper analyzes the jointly optimized allocation of sensing time and power for a two-user, amplify-and-forward (AF) cognitive network developed by maximizing the average aggregate throughput of its secondary network. In particular, this paper discusses diverse cooperation ratios for different scenarios and a unique cooperation ratio in spite of scenario changes. The observations of experiment results indicate that the sensing duration is within a strict interval. The results show that the optimized sensing time is 14.111 ms and the aggregate throughput equals to 1.1451 bps/Hz which are tractable by sequential optimization. This result indicates that by adopting the fixed cooperation ratios, the achievable throughput of the system is decreased. The system innovatively creates multiple independent fading channels to achieve technological diversity among partners.
      PubDate: 2018-01-26
      DOI: 10.1007/s12243-018-0625-8
  • Emergency optical network planning with multi-vendor interconnection and
           portable EDFAs
    • Authors: Sugang Xu; Noboru Yoshikane; Masaki Shiraiwa; Takehiro Tsuritani; Hiroaki Harai; Yoshinari Awaji; Naoya Wada
      Abstract: In this paper, we introduce an emergency optical network design problem for the low-cost post-disaster recovery of core optical transport networks. We take into account both the interconnection of the surviving multi-vendor resources and the utilization of portable emergency erbium-doped fiber amplifiers (EDFAs). The surviving multi-vendor optical nodes (e.g., reconfigurable optical add/drop multiplexer (ROADM) or wavelength cross-connect (WXC) nodes) and fiber links are the available resources during a disaster recovery and should be efficiently utilized first. The portable EDFAs are emergency resources added to replace the optical nodes that have either been destroyed or are down because of power outages. To solve this design problem, we propose an emergency network planning method using an integer linear programming (ILP) formulation such that the locations for the emergency interconnection of the multi-vendor networks and placement of the portable EDFAs are optimally selected. Evaluations show the benefits of the multi-vendor interconnection approach and utilization of emergency portable EDFAs.
      PubDate: 2018-01-03
      DOI: 10.1007/s12243-017-0619-y
  • Fronthaul-aware superposition coding for noncoherent transmission in C-RAN
    • Authors: Seok-Hwan Park; Changick Song
      Pages: 661 - 667
      Abstract: Cloud radio access network (C-RAN) has arisen as a promising architecture for the 5G wireless communication system. Among many advantages, C-RAN is known to enable large-scale interference management by migrating baseband processing functionalities from radio units (RUs) to a control unit (CU) with the aid of fronthaul links. Most of literatures prescribe that perfect synchronization is available among distributed RUs and fronthaul links are equipped with infinite capacities. Since these assumptions are far from practical situations, this work proposes a more practical noncoherent transmission strategy, in which synchronization is not needed among the RUs, by means of a novel superposition, or broadcast, coding. Under the proposed superposition coding scheme, the problem of maximizing the weighted sum of per-user achievable rates is tackled while satisfying per-RU transmit power and fronthaul capacity constraints. Some numerical results are provided to validate the effectiveness of the proposed scheme.
      PubDate: 2017-12-01
      DOI: 10.1007/s12243-017-0594-3
      Issue No: Vol. 72, No. 11-12 (2017)
  • GA3: scalable, distributed address assignment for dynamic data center
    • Authors: Elisa Rojas; Joaquin Alvarez-Horcajo; Isaias Martinez-Yelmo; Jose M. Arco; Juan A. Carral
      Pages: 693 - 702
      Abstract: Deployment and maintenance of current data center networks is costly and prone to errors. In order to avoid manual configuration, many of them require centralized administrators which constitute a clear bottleneck, while distributed approaches do not guarantee sufficient flexibility or robustness. This paper describes and evaluates GA3 (Generalized Automatic Address Assignment), a discovery protocol that assigns multiple unique labels to all the switches in a hierarchical network, without any modification of hosts or the standard Ethernet frames. Labeling is distributed and uses probes. These labels can be leveraged for shortest path routing without tables, as in the case of the Torii protocol, but GA3 also allows other label-based routing protocols (such as PortLand or ALIAS). Additionally, GA3 can detect miswirings in the network. Furthermore, control traffic is only necessary upon network deployment rather than periodically. Simulation results showed a reduced convergence time of less than 2 s and 100 kB/s of bandwidth (to send the GA3 frames) in the worst case for popular data center topologies, which outperforms other similar protocols.
      PubDate: 2017-12-01
      DOI: 10.1007/s12243-017-0569-4
      Issue No: Vol. 72, No. 11-12 (2017)
  • Crowded spot estimator for urban cellular networks
    • Authors: Sahar Hoteit; Stefano Secci; Marco Premoli
      Pages: 743 - 754
      Abstract: The real-time detection of crowded spots in access networks is considered nowadays a necessary step in the evolution of mobile cellular networks as it can be of great benefit for many use-cases. On the one hand, a dynamic positioning of contents and computing resources in the most crowded regions can lower connection latency and data loss and can allow us to have a seamless service provided for the users, without performance degradation across the network. On the other hand, a dynamic resource allocation among access points taking into account their loads can enhance the user’s quality of service and indeed network performances. In this context, using real mobile data traces from a cellular network operator in France, provided us with a temporal and spatial analysis of user content consumption habits in different French Metropolitan areas (Paris, Lyon and Nice). Furthermore, we put to use a real-time crowded spot estimator computed using two user mobility metrics, using a linear regression approach. Evaluating our estimator against more than one million user databases from a major French network operator, it appears to be an excellent crowd detection solution of cellular and backhauling network management. We show that its error count definitely decreases with the cell load, and it becomes very small for reasonable crowded spot load reaching upper thresholds. We also show that our crowded spot estimator is time and city-independent as it shows a stable behavior for different times of the day and for different cities with different topographies. Furthermore, compared to another crowded spot estimator from the literature, we show that our proposed estimator offers more suitable and accurate results in terms of crowded spot estimation for the three selected areas.
      PubDate: 2017-12-01
      DOI: 10.1007/s12243-017-0591-6
      Issue No: Vol. 72, No. 11-12 (2017)
  • Power reduction strategies with differentiated quality of protection in
           IP-over-WDM networks
    • Authors: Ali Hmaity; Francesco Musumeci; Massimo Tornatore
      Abstract: This work considers two important aspects of modern communication networks, network survivability, and energy efficiency. Survivability is a design requirement to provide failure recovery against network outages such as fiber cuts. To ensure survivability, traditionally, spare network (i.e., backup) resources are reserved in case of failures of primary (i.e., working) network resources. On the other hand, energy efficiency is required to cope with the continuous growth of the Internet traffic. Backup resources increase the energy consumption, especially if constantly powered-on. Hence, a trade-off between energy efficiency and network resiliency arises. To increase transport capacity and reduce energy consumption, wavelength division multiplexed (WDM) networks are adopted as the most practical solution for data transport in core networks, which are the focus of our work. In WDM networks, different levels of protection (i.e., dedicated, shared) can be implemented for different traffic demands, and different protection levels are characterized by different power consumptions. We consider a differentiated quality of protection (Diff-QoP) scheme where different levels of protection are provided. In this context, we investigate on two different power-reduction strategies to be used in protected WDM networks: (i) setting backup devices into low-power modes (sleep mode) and (ii) adapting the devices (i.e., transmitting/receiving equipment) usage to hourly traffic variations. We present exact modeling through Integer Linear Program (ILP) of the three scenarios and a provisioning algorithm to solve the problem of power minimized design of resilient optical core networks, under static and dynamic traffic conditions. We evaluate the performance of the proposed algorithm under static traffic conditions by comparing the obtained results with the optimal solution, in absence of traffic grooming. We show that the proposed heuristic reduces the computational time by three orders of magnitude with an optimality gap ranging from 8.88 up to 23.88%. Furthermore, we include traffic grooming and solve the problem under dynamic traffic conditions. Our findings show that enabling sleep mode (SM) for backup devices can help reduce total power consumption up to 20 and up to 38% when considering with Diff-QoP. Finally, adapting the number of transmitting/receiving devices to actual traffic needs guarantees power savings up to 80%, especially during off-peak hours.
      PubDate: 2017-12-27
      DOI: 10.1007/s12243-017-0621-4
  • Assessing the risk of complex ICT systems
    • Authors: Nizar Kheir; A. Ridha Mahjoub; M. Yassine Naghmouchi; Nancy Perrot; Jean-Philippe Wary
      Abstract: ICT systems are becoming increasingly complex and dynamic. They mostly include a large number of heterogeneous and interconnected assets (both physically and logically), which may be in turn exposed to multiple security flaws and vulnerabilities. Moreover, dynamicity is becoming paramount in modern ICT systems, since new assets and device configurations may be constantly added, updated, and removed from the system, leading to new security flaws that were not even existing at design time. From a risk assessment perspective, this adds new challenges to the defenders, as they are required to maintain risks within an acceptable range, while the system itself may be constantly evolving, sometimes in an unpredictable way. This paper introduces a new risk assessment framework that is aimed to address these specific challenges and that advances the state of the art along two distinct directions. First, we introduce the risk assessment graphs (RAGs), which provide a model and formalism that enable to characterize the system and its encountered risks. Nodes in the RAG represent each asset and its associated vulnerability, while edges represent the risk propagation between two adjacent nodes. Risk propagations in the graph are determined through two different metrics, namely the accessibility and potentiality, both formulated as a function of time and respectively capture the topology of the system and its risk exposure, as well as the way they evolve over time. Second, we introduce a quantitative risk assessment approach that leverages the RAGs in order to compute all possible attack paths in the system and to further infer their induced risks. Our approach achieves both flexibility and generality requirements and applies to a wide set of applications. In this paper, we demonstrate its usage in the context of a software-defined networking (SDN) testbed, and we conduct multiple experiments to evaluate the efficiency and scalability of our solution.
      PubDate: 2017-12-27
      DOI: 10.1007/s12243-017-0617-0
  • The 2 edge-disjoint 3-paths polyhedron
    • Authors: Quentin Botton; Bernard Fortz; Luis Gouveia
      Abstract: Given an undirected graph, we study the problem of finding K edge-disjoint paths, each one containing at most L edges, between a given pair of nodes. We focus on the case of K = 2and L = 3. For this particular case, previous known compact formulations are valid only for the case with non-negative edge costs. We provide the first compact linear description that is also valid for general edge costs. We describe new valid inequalities that are added to a well known extended formulation in a layered graph, to get a full description of the polyhedron for K = 2and L = 3. We use a reduction of the problem to a size-2 stable set problem to prove this second property.
      PubDate: 2017-12-08
      DOI: 10.1007/s12243-017-0615-2
  • Exploring the logical layer to support differentiated resilience classes
           in multilayer networks
    • Authors: Abdulaziz Alashaikh; David Tipper; Teresa Gomes
      Abstract: The concept of providing differentiated classes of resilient services over communications networks has received attention in the literature. A number of proposals tried to address the problem by provisioning different resilience classes of service with various protection schemes. However, most of these works are applied to a single layer and lack cross-layer coordination in multilayer scenarios. In addition, there is an increasing need for supporting services with very high resilience requirements over future communications networks. In this paper, we utilize the spine concept idea of embedding a subnetwork at the physical layer with comparatively high availability link and node values (Gomes et al. 2014; Alashaikh et al. Comput Netw 82:4–19 2015), to provide a foundation for resilience differentiation between multiple classes of flows. Cross-layer mapping and spine-aware routing are performed in a way that transfers the spine differentiation capability to the upper layer network and flows. We provide joint routing-mapping optimization formulations with different protection configurations and evaluate their performance in a multilayer scenario. Furthermore, we compare providing protection at the lower layer versus protection at the upper layer in terms of QoR class availability differentiation and resource requirements.
      PubDate: 2017-12-08
      DOI: 10.1007/s12243-017-0616-1
  • Erasure correction-based CSMA/CA
    • Authors: Patrick Tortelier; Didier Le Ruyet
      Abstract: It is well known that the performance of carrier sense multiple access with collision avoidance (CSMA/CA) is poor when the number of users increases, because of collisions. In this paper, we consider a modified version of CSMA/CA based on erasure codes at the packet level, which significantly reduces the complexity of the decoding and does not require any change in the underlying physical layer. In order to improve the performance, we use non-binary maximum distance separable (MDS) codes. We give analytical derivation of the global goodput and show that there is a trade-off between the code parameters and the length of the contention window in order to maximize the global goodput for a given number of users.
      PubDate: 2017-08-25
      DOI: 10.1007/s12243-017-0606-3
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-