標題: Titlebook: ; [打印本頁] 作者: 空格 時間: 2025-3-21 18:08
書目名稱Graphs and Algorithms in Communication Networks影響因子(影響力)
書目名稱Graphs and Algorithms in Communication Networks影響因子(影響力)學科排名
書目名稱Graphs and Algorithms in Communication Networks網(wǎng)絡公開度
書目名稱Graphs and Algorithms in Communication Networks網(wǎng)絡公開度學科排名
書目名稱Graphs and Algorithms in Communication Networks被引頻次
書目名稱Graphs and Algorithms in Communication Networks被引頻次學科排名
書目名稱Graphs and Algorithms in Communication Networks年度引用
書目名稱Graphs and Algorithms in Communication Networks年度引用學科排名
書目名稱Graphs and Algorithms in Communication Networks讀者反饋
書目名稱Graphs and Algorithms in Communication Networks讀者反饋學科排名
作者: abysmal 時間: 2025-3-21 23:48 作者: aristocracy 時間: 2025-3-22 03:33
https://doi.org/10.1007/978-94-009-3471-9m-specific preprocessing, MIPbased heuristics, and cutting planes based on either of the two layers. On several realistic two-layer planning scenarios, we show that these ingredients can be very useful to reduce the optimality gaps in the multilayer context.作者: excrete 時間: 2025-3-22 08:35 作者: GLUT 時間: 2025-3-22 12:38 作者: ANIM 時間: 2025-3-22 13:06 作者: ANIM 時間: 2025-3-22 20:55
https://doi.org/10.1007/978-1-4757-5936-5rk with minimum total cost. While Minimum Energy Broadcast Routing has been studied extensively during recent years, Cost Minimization in Multi-interface Networks is rather new. For both problems we survey recent complexity results and approximation algorithms under different assumptions.作者: 沙文主義 時間: 2025-3-22 23:51
https://doi.org/10.1057/9780230512689 of the problem. We consider several interference scenarios, the uniform and non-uniform data models, different optimization parameters, and the off-line and online settings of the problem. The objective functions we consider are the minimization of maximum completion time, maximum flow time, and average flow time.作者: 有罪 時間: 2025-3-23 05:26 作者: DUST 時間: 2025-3-23 08:56 作者: osculate 時間: 2025-3-23 13:26 作者: CANDY 時間: 2025-3-23 14:58 作者: 軌道 時間: 2025-3-23 18:09 作者: grotto 時間: 2025-3-24 01:06
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networksrk with minimum total cost. While Minimum Energy Broadcast Routing has been studied extensively during recent years, Cost Minimization in Multi-interface Networks is rather new. For both problems we survey recent complexity results and approximation algorithms under different assumptions.作者: 率直 時間: 2025-3-24 04:03 作者: 平靜生活 時間: 2025-3-24 10:04 作者: Dappled 時間: 2025-3-24 12:11
https://doi.org/10.1007/978-94-009-3469-6involved does not allow an exposition highlighting all details. References for further reading are provided. The chapter is closed with a brief description of the applications discussed in the consecutive chapters.作者: GULP 時間: 2025-3-24 18:27
https://doi.org/10.1007/978-94-017-6083-6abel space reduction problem. We propose a generic optimization model and, then, we describe some adaptations aiming at modeling each particular case. Simulation results are briefly discussed at the end of this chapter.作者: Mundane 時間: 2025-3-24 20:00
https://doi.org/10.1007/978-3-211-75121-3chitectures to establish the ordering of packets. If load balancing can be achieved by switches or routers, this can greatly facilitate applying load balancing across the network. Traffic characteristics such as QoS (delay bounds, throughput) and burstiness are considered.作者: 通便 時間: 2025-3-25 01:09
https://doi.org/10.1007/978-1-349-12670-5.. Here, we survey the results on permutation routing, the .-central routing, and the general (., .)-routing problems on regular plane grids, that is, square grids, triangular grids, and hexagonal grids. We assume the .-port model with synchronous transmission, and we consider both full and half-duplex networks.作者: Infinitesimal 時間: 2025-3-25 07:09
https://doi.org/10.1057/9780230390515ilability of collision detection mechanisms, the wake-up mode, the topology classes considered, and the use of randomness. This chapter introduces the problem, reviews the literature on time-efficient broadcasting algorithms for radio networks under a variety of models and assumptions, and illustrates some of the basic techniques.作者: CLAM 時間: 2025-3-25 10:05 作者: dissent 時間: 2025-3-25 13:06
Routing and Label Space Reduction in Label Switching Networksabel space reduction problem. We propose a generic optimization model and, then, we describe some adaptations aiming at modeling each particular case. Simulation results are briefly discussed at the end of this chapter.作者: cancer 時間: 2025-3-25 15:53
Problems in Dynamic Bandwidth Allocation in Connection Oriented Networkschitectures to establish the ordering of packets. If load balancing can be achieved by switches or routers, this can greatly facilitate applying load balancing across the network. Traffic characteristics such as QoS (delay bounds, throughput) and burstiness are considered.作者: mucous-membrane 時間: 2025-3-25 20:05
Permutation Routing and (,, ,)-Routing on Plane Grids.. Here, we survey the results on permutation routing, the .-central routing, and the general (., .)-routing problems on regular plane grids, that is, square grids, triangular grids, and hexagonal grids. We assume the .-port model with synchronous transmission, and we consider both full and half-duplex networks.作者: Chronic 時間: 2025-3-26 01:00 作者: 蕨類 時間: 2025-3-26 05:21
Texts in Theoretical Computer Science. An EATCS Series388155.jpg作者: 相信 時間: 2025-3-26 09:36 作者: Peak-Bone-Mass 時間: 2025-3-26 15:02 作者: Accommodation 時間: 2025-3-26 18:33 作者: 大笑 時間: 2025-3-26 23:41
Optimization of OSPF Routing in IP Networkse network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric, it is not possible to configure the routing paths for the communication demands between different pairs o作者: Conscientious 時間: 2025-3-27 01:47
https://doi.org/10.1007/978-94-009-3469-6ication networks. Techniques discussed include graph-theoretical concepts, (integer) linear programming, and complexity theory. To illustrate the importance of these techniques, classical applications in the area of communication networks are discussed. The wide variety and depth of the mathematics 作者: notice 時間: 2025-3-27 09:09 作者: 富饒 時間: 2025-3-27 11:58 作者: 使殘廢 時間: 2025-3-27 14:33
https://doi.org/10.1007/978-94-017-6083-6el space problems concerning three different technologies and architectures – namely Multi-protocol Label Switching (MPLS), Ethernet VLAN-Label Switching (ELS) and All-Optical Label Switching (AOLS) – are discussed in this chapter. Each of these cases yields to different constraints of the general l作者: OVERT 時間: 2025-3-27 18:17
https://doi.org/10.1057/9780230601390paths can be assigned to connections in the context of a shared protection framework. After formalizing the survivable online routing problem, two possible implementations are compared, one based on heuristics and the other on ILP. Building upon the concepts of routing already exposed, the chapter t作者: Herpetologist 時間: 2025-3-27 23:57 作者: 違法事實 時間: 2025-3-28 04:29
https://doi.org/10.1007/978-3-211-75121-3tilayer scenario, considering IP protocols on top of an MPLS network over an OBS optical network. The issue (and problem) is to maintain and ensure the end-to-end in-sequence routing of packets, combining load balancing in packet switching architectures and bandwidth/flow allocation in MPLS-based ar作者: 婚姻生活 時間: 2025-3-28 07:35 作者: Pastry 時間: 2025-3-28 12:47
https://doi.org/10.1057/978-1-349-95284-7rity that coordinates the network users in order to achieve efficient solutions. Instead, the users act in an uncoordinated and selfish manner and reach solutions to the above problems that are consistent only with their selfishness. In this sense, the users act aiming to optimize their own objectiv作者: 針葉樹 時間: 2025-3-28 17:56
https://doi.org/10.1007/978-1-349-12670-5within a reasonable amount of time. In the (., .)-routing problem, each node can send at most . packets and receive at most . packets. Permutation routing is the particular case . = . = 1. In the .-central routing problem, all nodes at distance at most . from a fixed node . want to send a packet to 作者: 難取悅 時間: 2025-3-28 20:14
https://doi.org/10.1007/978-1-4684-8917-0pects of WLANs range from deployment cost, coverage, capacity, interference, and data throughput to efficiency of radio resource utilization. In this chapter, we summarize some recent advances in applying mathematical optimization models for solving planning problems arising in placing access points作者: Graduated 時間: 2025-3-29 02:00 作者: 壯麗的去 時間: 2025-3-29 06:18
https://doi.org/10.1007/978-1-4757-5936-5ciently. Under these circumstances, we consider two interesting combinatorial optimization problems: . and .. The goal of the first problem is to perform broadcasting from a given source while minimizing the overall energy required for communication. The second problem refers to the choice of activa作者: AMOR 時間: 2025-3-29 10:59
https://doi.org/10.1057/9780230512689s can communicate data using a radio device; we consider a synchronous time model, where time is divided into rounds. The interference constraints limit the possibility of simultaneous data communication of nodes to the same region of the network. The survey focuses on two interference models, the g作者: Perigee 時間: 2025-3-29 13:58
https://doi.org/10.1007/978-3-658-11125-0otocol is quite simple to analyze and can be used in a lot of different situations. We give mathematical evidence showing that our performance is asymptotically tight. We also place ourselves in the WiFi and WiMAX frameworks, and discuss experimental results showing acollision reduction of 14% to 21作者: confederacy 時間: 2025-3-29 19:05 作者: Sarcoma 時間: 2025-3-29 20:19 作者: ingrate 時間: 2025-3-30 01:35
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problemsd node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation for a predefined set of admissible logical links that takes many practical side constraints into account, including node hardware作者: FUSC 時間: 2025-3-30 07:50 作者: 相一致 時間: 2025-3-30 09:45 作者: COMA 時間: 2025-3-30 14:41
Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approachrt of IP traffic. OBS architectures are in general bufferless and therefore sensitive to burst congestion. An overall burst loss probability (BLP) which adequately represents the congestion state of the entire network is the primary metric of interest in an OBS network. The network congestion can be作者: 無能力 時間: 2025-3-30 18:31
Problems in Dynamic Bandwidth Allocation in Connection Oriented Networkstilayer scenario, considering IP protocols on top of an MPLS network over an OBS optical network. The issue (and problem) is to maintain and ensure the end-to-end in-sequence routing of packets, combining load balancing in packet switching architectures and bandwidth/flow allocation in MPLS-based ar
