Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness (English)
- New search for: Koga, Hisashi
- New search for: Koga, Hisashi
In:
Algorithms and Computation
3
;
61-73
;
2001
- Article/Chapter (Book) / Electronic Resource
-
Title:Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness
-
Contributors:Koga, Hisashi ( author )
-
Published in:Algorithms and Computation , 3 ; 61-73Lecture Notes in Computer Science ; 2223, 3 ; 61-73
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2001-01-01
-
Size:13 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal LinkagesWhitesides, Sue et al. | 2001
- 14
-
Application of M-Convex Submodular Flow Problem to Mathematical EconomicsMurota, Kazuo / Tamura, Akihisa et al. | 2001
- 26
-
A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch SchedulingDeng, Xiaotie / Feng, Haodi / Zhang, Pixing / Zhu, Hong et al. | 2001
- 36
-
A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling TimesKaruno, Yoshiyuki / Nagamochi, Hiroshi et al. | 2001
- 48
-
Semi-normal Schedulings: Improvement on Goemans’ AlgorithmChen, Jianer / Huang, Jingui et al. | 2001
- 61
-
Balanced Scheduling toward Loss-Free Packet Queuing and Delay FairnessKoga, Hisashi et al. | 2001
- 74
-
Broadcasting with Universal Lists Revisited: Using Competitive AnalysisKim, Jae-Hoon / Chwa, Kyung-Yong et al. | 2001
- 86
-
On Adaptive Fault Diagnosis for Multiprocessor SystemsNomura, Kumiko / Yamada, Toshinori / Ueno, Shuichi et al. | 2001
- 99
-
On-Line Multicasting in All-Optical NetworksHashimoto, Kenta / Yamada, Toshinori / Ueno, Shuichi et al. | 2001
- 107
-
Enumerating Floorplans with n RoomsNakano, Shin-ichi et al. | 2001
- 116
-
On Min-Max Cycle BasesGalbiati, Giulia et al. | 2001
- 124
-
On the Minimum Local-Vertex-Connectivity Augmentation in GraphsNagamochi, Hiroshi / Ishii, Toshimasa et al. | 2001
- 136
-
Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique NumberNagoya, Takayuki et al. | 2001
- 148
-
Quantum Algorithms for Intersection and Proximity ProblemsSadakane, Kunihiko / Sugawara, Norito / Tokuyama, Takeshi et al. | 2001
- 160
-
BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean SpacesSun, Zheng / Reif, John et al. | 2001
- 172
-
Approximation of Minimum Triangulation for Polyhedron with Bounded DegreesChin, Francis Y. L. / Fung, Stanley P. Y. et al. | 2001
- 185
-
Tree-Approximations for the Weighted Cost-Distance ProblemSchindelhauer, Christian / Weber, Birgitta et al. | 2001
- 196
-
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical GroupsMizuki, Takaaki / Nishizeki, Takao et al. | 2001
- 208
-
Generic Algorithms and Key Agreement Protocols Based on Group ActionsYamamura, Akihiro / Kurosawa, Kaoru et al. | 2001
- 219
-
Baire Category and Nowhere Differentiability for Feasible Real FunctionsBreutzmann, Josef M. / Juedes, David W. / Lutz, Jack H. et al. | 2001
- 231
-
Translation among CNFs, Characteristic Models and Ordered Binary Decision DiagramsHoriyama, Takashi / Ibaraki, Toshihide et al. | 2001
- 244
-
On Removing the Pushdown Stack in Reachability ConstructionsIbarra, Oscar H. / Dang, Zhe et al. | 2001
- 257
-
A New Recognition Algorithm for Extended Regular ExpressionsYamamoto, Hiroaki et al. | 2001
- 268
-
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite AutomataKoshiba, Takeshi et al. | 2001
- 279
-
An Index for the Data Size to Extract Decomposable Structures in LADOno, Hirotaka / Yagiura, Mut unori / Ibaraki, Toshihide et al. | 2001
- 291
-
Parameterized Complexity: The Main Ideas and Some Research FrontiersFellows, Michael R. et al. | 2001
- 308
-
Tight Bounds on Maximal and Maximum MatchingsBiedl, Therese / Demaine, Erik D. / Duncan, Christian A. / Fleischer, Rudolf / Kobourov, Stephen G. et al. | 2001
- 320
-
Recognition and Orientation Algorithms for P4-Comparability GraphsNikolopoulos, Stavros D. / Palios, Leonidas et al. | 2001
- 332
-
Efficient Algorithms for k-Terminal Cuts on Planar GraphsChen, Danny Z. / Wu, Xiaodong et al. | 2001
- 345
-
Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian PathsGalluccio, Anna / Proietti, Guido et al. | 2001
- 355
-
Algorithms for Pattern Involvement in PermutationsAlbert, Michael H. / Aldred, Robert E. L. / Atkinson, Mike D. / Holton, Derek A. et al. | 2001
- 367
-
A Fast Algorithm for Enumerating Bipartite Perfect MatchingsUno, Takeaki et al. | 2001
- 380
-
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion TimeChen, Bo / Deng, Xiaotie / Zang, Wenan et al. | 2001
- 390
-
On the Complexity of Train Assignment ProblemsErlebach, Thomas / Gantenbein, Martin / Hürlimann, Daniel / Neyer, Gabriele / Pagourtzis, Aris / Penna, Paolo / Schlude, Konrad / Steinhöfel, Kathleen / Taylor, David Scot / Widmayer, Peter et al. | 2001
- 403
-
A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical ModelAspnes, James / Hartling, Julia / Ming-Yang, Kao / Kim, Junhyong / Shah, Gauri et al. | 2001
- 416
-
Complexity of Comparing Hidden Markov ModelsLyngsø, Rune B. / Pedersen, Christian N. S. et al. | 2001
- 429
-
DNA Self-Assembly For Constructing 3D BoxesMing-Yang, Kao / Ramachandran, Vijay et al. | 2001
- 441
-
Exact Solutions for Closest String and Related ProblemsGramm, Jens / Niedermeier, Rolf / Rossmanith, Peter et al. | 2001
- 454
-
Topological Peeling and ImplementationChen, Danny Z. / Luan, Shuang / Xu, Jinhui et al. | 2001
- 467
-
Image Segmentation with Monotonicity and Smoothness ConstraintsChen, Danny Z. / Wang, Jie / Wu, Xiaodong et al. | 2001
- 480
-
Optimization Algorithms for Sweeping a Polygonal Region with Mobile GuardsJae-Ha, Lee / Sang-Min, Park / Kyung-Yong, Chwa et al. | 2001
- 493
-
Approximation of a Geometric Set Covering ProblemKovaleva, Sofia / Spieksma, Frits C. R. et al. | 2001
- 502
-
Shortest Path Algorithms: Engineering AspectsGoldberg, Andrew V. et al. | 2001
- 514
-
Efficient Algorithms for Weighted Colorings of Series-Parallel GraphsZhou, Xiao / Nishizeki, Takao et al. | 2001
- 525
-
Go with the Winners Algorithms for Cliques in Random GraphsPeinado, Marcus et al. | 2001
- 537
-
Complexity of Partial Covers of GraphsFiala, Jiří / Kratochvíl, Jan et al. | 2001
- 550
-
On Game-Theoretic Models of NetworksBodlaender, Hans L. / Dinneen, Michael J. / Khoussainov, Bakhadyr et al. | 2001
- 562
-
The Complexity of Some Basic Problems for Dynamic Process GraphsJakoby, Andreas / Liśkiewicz, Maciej et al. | 2001
- 575
-
Delay Optimizations in Quorum ConsensusLin, Xuemin et al. | 2001
- 587
-
Randomized Shared Queues Applied to Distributed Optimization AlgorithmsLee, Hyunyoung / Welch, Jennifer L. et al. | 2001
- 599
-
Multiprocess Time QueueBrodnik, Andrej / Karlsson, Johan et al. | 2001
- 610
-
Labeling Points with WeightsPoon, Sheung-Hung / Shin, Chan-Su / Strijk, Tycho / Wolff, Alexander et al. | 2001
- 623
-
Small Convex Quadrangulations of Point SetsBremner, David / Hurtado, Ferran / Ramaswami, Suneeta / Sacristán, Vera et al. | 2001
- 636
-
How to Color a Checkerboard with a Given Distribution — Matrix Rounding Achieving Low 2 × 2-DiscrepancyAsano, Tetsuo / Tokuyama, Takeshi et al. | 2001
- 649
-
Labeling Subway LinesGarrido, Mari Ángeles / Iturriaga, Claudia / Márquez, Alberto / Portillo, José Ramón / Reyes, Pedro / Wolff, Alexander et al. | 2001
- 660
-
Complexity Study on Two Clustering ProblemsZhang, Louxin / Zhu, Song et al. | 2001
- 670
-
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2Fujito, Toshihiro / Okumura, Tsuyoshi et al. | 2001
- 682
-
A Unified Framework for Approximating Multiway Partition ProblemsZhao, Liang / Nagamochi, Hiroshi / Ibaraki, Toshihide et al. | 2001
- 695
-
On-Line Algorithms for Cardinality Constrained Bin Packing ProblemsBabel, Luitpold / Chen, Bo / Kellerer, Hans / Kotov, Vladimir et al. | 2001
- 707
-
Suffix Vector: A Space-Efficient Suffix Tree RepresentationMonostori, Krisztián / Zaslavsky, Arkady / Vajk, István et al. | 2001
- 719
-
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary WorksHori, Hideaki / Shimozono, Shinichi / Takeda, Masayuki / Shinohara, Ayumi et al. | 2001
- 731
-
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)Brodal, Gerth Stølting / Fagerberg, Rolf / Pedersen, Christian N. S. et al. | 2001
- 743
-
The Cent-dian Path Problem on Tree NetworksBecker, Ronald I. / Chiang, Yen-I / Lari, Isabella / Scozzari, Andrea et al. | 2001
- 756
-
Approximate Hotlink AssignmentKranakis, Evangelos / Krizanc, Danny / Shende, Sunil et al. | 2001
- 768
-
Efficient Algorithms for Two Generalized 2-Median Problems on TreesKu, Shan-Chyun / Lu, Chi-Jen / Wang, Biing-Feng / Lin, Tzu-Chin et al. | 2001